| 總結: | <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. Unfortunately, the problems are undecidable for the whole language, and only very rudimentary decidable sub-languages are known.</p>
<p>We propose leafy automata as a dedicated automata-theoretic formalism for representing the game semantics of 𝖥𝖨𝖢𝖠 . The automata use an infinite alphabet with a tree structure. We show that the game semantics of any 𝖥𝖨𝖢𝖠 term can be represented by traces of a leafy automaton. Conversely, the traces of any leafy automaton can be represented by a 𝖥𝖨𝖢𝖠 term. Because of the close match with 𝖥𝖨𝖢𝖠 , we view leafy automata as a promising starting point for finding decidable subclasses of the language and, more generally, to provide a new perspective on models of higher-order concurrent computation.</p>
<p>Moreover, we identify a fragment of 𝖥𝖨𝖢𝖠 that is amenable to verification by translation into a particular class of leafy automata. Using a locality property of the latter class, where communication between levels is restricted and every other level is bounded, we show that their emptiness problem is decidable by reduction to Petri net reachability.</p>
|
|---|