On bounded specifications

DOI10.1007/3-540-45653-8_2MaRDI QIDQ2996151zbMATH OpenOpenAlexFDO

Authors Orna Kupferman, Moshe Y. Vardi

Publication date 6 May 2011

Published in Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-45653-8_2

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Bounded model checking for all regular properties
• Bounded model checking for timed automata
• Bounded model checking of infinite state systems
• Linear completeness thresholds for bounded model checking
• Bounded Synthesis

Cited in

(10)

• Certifying inexpressibility
• Spanning the spectrum from safety to liveness
• An automata-theoretic approach to infinite-state systems
• Bounded Synthesis
• Antichains and compositional algorithms for LTL synthesis
• Temporal logic and fair discrete systems
• Checking Temporal Properties of Discrete, Timed and Continuous Behaviors
• GSTE is partitioned model checking
• Bounded semantics
• How much lookahead is needed to win infinite games?

This page was built for publication: On bounded specifications

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