On Synthesis of Specifications with Arithmetic

DOI10.1007/978-3-030-38919-2_14zbMath1440.68171OpenAlexW2999769907MaRDI QIDQ3297765

Orna Kupferman, Rachel Faran

Publication date: 20 July 2020

Published in: SOFSEM 2020: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-38919-2_14

Mathematics Subject Classification ID

Applications of game theory (91A80) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (1)

Church synthesis on register automata over linearly ordered data domains

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finite-state unification automata and relational languages
• Automatic verification of recursive procedures with one integer parameter.
• Relating word and tree automata
• Synthesis with Identifiers
• Graph Games and Reactive Synthesis
• Two-variable logic on data trees and XML reasoning
• Solving Games Without Determinization
• An Automata-Theoretic Approach to Reasoning about Parameterized Systems and Specifications
• Parameterized Verification of Broadcast Networks of Register Automata
• LTL with Arithmetic and its Applications in Reasoning about Hierarchical Systems
• Synthesis of Data Word Transducers
• Bounded synthesis of register transducers

This page was built for publication: On Synthesis of Specifications with Arithmetic