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...
Main Authors: | Dixon, A, Lazic, R, Murawski, AS, Walukiewicz, I |
---|---|
פורמט: | Conference item |
שפה: | English |
יצא לאור: |
Springer
2021
|
פריטים דומים
-
Verifying higher-order concurrency with data automata
מאת: Dixon, A, et al.
יצא לאור: (2021) -
Third-order Idealized Algol with iteration is decidable
מאת: Murawski, A, et al.
יצא לאור: (2008) -
Saturating automata for game semantics
מאת: Dixon, A, et al.
יצא לאור: (2023) -
Weak Alternating Timed Automata
מאת: Pawel Parys, et al.
יצא לאור: (2012-09-01) -
Unfolding of Finite Concurrent Automata
מאת: Alexandre Mansard
יצא לאור: (2018-10-01)