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...
Váldodahkkit: | Dixon, A, Lazic, R, Murawski, AS, Walukiewicz, I |
---|---|
Materiálatiipa: | Conference item |
Giella: | English |
Almmustuhtton: |
Springer
2021
|
Geahča maid
-
Verifying higher-order concurrency with data automata
Dahkki: Dixon, A, et al.
Almmustuhtton: (2021) -
Third-order Idealized Algol with iteration is decidable
Dahkki: Murawski, A, et al.
Almmustuhtton: (2008) -
Saturating automata for game semantics
Dahkki: Dixon, A, et al.
Almmustuhtton: (2023) -
Weak Alternating Timed Automata
Dahkki: Pawel Parys, et al.
Almmustuhtton: (2012-09-01) -
Unfolding of Finite Concurrent Automata
Dahkki: Alexandre Mansard
Almmustuhtton: (2018-10-01)