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...
Κύριοι συγγραφείς: | Dixon, A, Lazic, R, Murawski, AS, Walukiewicz, I |
---|---|
Μορφή: | Conference item |
Γλώσσα: | English |
Έκδοση: |
Springer
2021
|
Παρόμοια τεκμήρια
Παρόμοια τεκμήρια
-
Verifying higher-order concurrency with data automata
ανά: Dixon, A, κ.ά.
Έκδοση: (2021) -
Third-order Idealized Algol with iteration is decidable
ανά: Murawski, A, κ.ά.
Έκδοση: (2008) -
Saturating automata for game semantics
ανά: Dixon, A, κ.ά.
Έκδοση: (2023) -
Weak Alternating Timed Automata
ανά: Pawel Parys, κ.ά.
Έκδοση: (2012-09-01) -
Unfolding of Finite Concurrent Automata
ανά: Alexandre Mansard
Έκδοση: (2018-10-01)