Bounded model checking with SNF, alternating automata, and Büchi automata

zbMATH Open1272.68276MaRDI QIDQ2849598FDOQ2849598

Authors: Daniel Sheridan 

Publication date: 20 September 2013

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571066105000927

Recommendations

• Bounded Model Checking for Weak Alternating Büchi Automata
• Bounded model checking using satisfiability solving
• Bounded model checking for timed automata
• scientific article; zbMATH DE number 1796122
• Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
• An Automata-Theoretic Dynamic Completeness Criterion for Bounded Model-Checking
• Theory and Applications of Satisfiability Testing
• Bounded LTL model checking with stable models
• scientific article; zbMATH DE number 1903359

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Cited In (3)

• Bounded Model Checking for Weak Alternating Büchi Automata
• Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
• Formal Methods in Computer-Aided Design

This page was built for publication: Bounded model checking with SNF, alternating automata, and Büchi automata

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