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...
Päätekijät: | Dixon, A, Lazic, R, Murawski, AS, Walukiewicz, I |
---|---|
Aineistotyyppi: | Conference item |
Kieli: | English |
Julkaistu: |
Springer
2021
|
Samankaltaisia teoksia
-
Verifying higher-order concurrency with data automata
Tekijä: Dixon, A, et al.
Julkaistu: (2021) -
Third-order Idealized Algol with iteration is decidable
Tekijä: Murawski, A, et al.
Julkaistu: (2008) -
Saturating automata for game semantics
Tekijä: Dixon, A, et al.
Julkaistu: (2023) -
Weak Alternating Timed Automata
Tekijä: Pawel Parys, et al.
Julkaistu: (2012-09-01) -
Unfolding of Finite Concurrent Automata
Tekijä: Alexandre Mansard
Julkaistu: (2018-10-01)