Leafy automata for higher-order concurrency
<p>Finitary Idealized Concurrent Algol ( 𝖥𝖨𝖢𝖠 ) is a prototypical programming language combining functional, imperative, and concurrent computation. There exists a fully abstract game model of 𝖥𝖨𝖢𝖠 , which in principle can be used to prove equivalence and safety of 𝖥𝖨𝖢𝖠 programs. Unfortu...
Huvudupphovsmän: | Dixon, A, Lazic, R, Murawski, AS, Walukiewicz, I |
---|---|
Materialtyp: | Conference item |
Språk: | English |
Publicerad: |
Springer
2021
|
Liknande verk
Liknande verk
-
Verifying higher-order concurrency with data automata
av: Dixon, A, et al.
Publicerad: (2021) -
Third-order Idealized Algol with iteration is decidable
av: Murawski, A, et al.
Publicerad: (2008) -
Saturating automata for game semantics
av: Dixon, A, et al.
Publicerad: (2023) -
Weak Alternating Timed Automata
av: Pawel Parys, et al.
Publicerad: (2012-09-01) -
Unfolding of Finite Concurrent Automata
av: Alexandre Mansard
Publicerad: (2018-10-01)