2 papers
cs.LO2025
Decidability Problems for Micro-Stipula
Giorgio Delzanno, Cosimo Laneve, Arnaud Sangnier +1
Micro-Stipula is a stateful calculus in which clauses can be activated either through interactions with the external environment or by the evaluation of time expressions. Despite t…
cs.FL2025
Counting Abstraction for the Verification of Structured Parameterized Networks
Marius Bozga, Radu Iosif, Arnaud Sangnier +1
We consider the verification of parameterized networks of replicated processes whose architecture is described by hyperedge-replacement graph grammars. Due to the undecidability of…