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...
Hlavní autoři: | Dixon, A, Lazic, R, Murawski, AS, Walukiewicz, I |
---|---|
Médium: | Conference item |
Jazyk: | English |
Vydáno: |
Springer
2021
|
Podobné jednotky
-
Verifying higher-order concurrency with data automata
Autor: Dixon, A, a další
Vydáno: (2021) -
Third-order Idealized Algol with iteration is decidable
Autor: Murawski, A, a další
Vydáno: (2008) -
Saturating automata for game semantics
Autor: Dixon, A, a další
Vydáno: (2023) -
Weak Alternating Timed Automata
Autor: Pawel Parys, a další
Vydáno: (2012-09-01) -
Unfolding of Finite Concurrent Automata
Autor: Alexandre Mansard
Vydáno: (2018-10-01)