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)