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...
Autors principals: | Dixon, A, Lazic, R, Murawski, AS, Walukiewicz, I |
---|---|
Format: | Conference item |
Idioma: | English |
Publicat: |
Springer
2021
|
Ítems similars
-
Verifying higher-order concurrency with data automata
per: Dixon, A, et al.
Publicat: (2021) -
Third-order Idealized Algol with iteration is decidable
per: Murawski, A, et al.
Publicat: (2008) -
Saturating automata for game semantics
per: Dixon, A, et al.
Publicat: (2023) -
Weak Alternating Timed Automata
per: Pawel Parys, et al.
Publicat: (2012-09-01) -
Unfolding of Finite Concurrent Automata
per: Alexandre Mansard
Publicat: (2018-10-01)