On synthesis of specifications with arithmetic

DOI10.1007/978-3-030-38919-2_14MaRDI QIDQ3297765zbMATH OpenOpenAlexFDO

Authors Rachel Faran, Orna Kupferman

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

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

Recommendations

• Synthesis of Reactive(1) designs
• Extension of the automaton specification logical language and the synthesis problem
• Verification and synthesis of reactive programs
• Better Quality in Synthesis through Quantitative Objectives
• scientific article; zbMATH DE number 4124989

Cites work

• An automata-theoretic approach to reasoning about parameterized systems and specifications
• Automatic verification of recursive procedures with one integer parameter.
• Bounded synthesis of register transducers
• Finite-state unification automata and relational languages
• Graph Games and Reactive Synthesis
• scientific article; zbMATH DE number 4124989 (Why is no real title available?)
• scientific article; zbMATH DE number 1136080 (Why is no real title available?)
• scientific article; zbMATH DE number 1834677 (Why is no real title available?)
• scientific article; zbMATH DE number 3189696 (Why is no real title available?)
• LTL with arithmetic and its applications in reasoning about hierarchical systems
• Parameterized verification of broadcast networks of register automata
• Register-bounded synthesis
• Relating word and tree automata
• Solving Games Without Determinization
• Synthesis of Data Word Transducers
• Synthesis with Identifiers
• Two-variable logic on data trees and XML reasoning

Cited in

(6)

• scientific article; zbMATH DE number 1617302 (Why is no real title available?)
• Church synthesis on register automata over linearly ordered data domains
• Decision procedures for sequence theories
• Realizability modulo theories
• Reasoning on data words over numeric domains
• Church synthesis on register automata over linearly ordered data domains

This page was built for publication: On synthesis of specifications with arithmetic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3297765)