Search

• < Previous
• 1
• Next >

---

B\"uchi Complementation and Size-Change Termination

Seth Fogarty ; Moshe Y. Vardi.

We compare tools for complementing nondeterministic B\"uchi automata with a recent termination-analysis algorithm. Complementation of B\"uchi automata is a key step in program verification. Early constructions using a Ramsey-based argument have been supplanted by rank-based constructions with&nbsp;[&hellip;]

---

Reasoning about Strategies: on the Satisfiability Problem

Fabio Mogavero ; Aniello Murano ; Giuseppe Perelli ; Moshe Y. Vardi.

Strategy Logic (SL, for short) has been introduced by Mogavero, Murano, and Vardi as a useful formalism for reasoning explicitly about strategies, as first-order objects, in multi-agent concurrent games. This logic turns out to be very powerful, subsuming all major previously studied modal logics&nbsp;[&hellip;]

---

Sequential Relational Decomposition

Dror Fried ; Axel Legay ; Joël Ouaknine ; Moshe Y. Vardi.

The concept of decomposition in computer science and engineering is considered a fundamental component of computational thinking and is prevalent in design of algorithms, software construction, hardware design, and more. We propose a simple and natural formalization of sequential decomposition, in&nbsp;[&hellip;]

---

Comparator automata in quantitative verification

Suguman Bansal ; Swarat Chaudhuri ; Moshe Y. Vardi.

The notion of comparison between system runs is fundamental in formal verification. This concept is implicitly present in the verification of qualitative systems, and is more pronounced in the verification of quantitative systems. In this work, we identify a novel mode of comparison in quantitative&nbsp;[&hellip;]

---