Encodings of Bounded LTL Model Checking in Effectively Propositional Logic

DOI10.1007/978-3-540-73595-3_24MaRDI QIDQ3608783zbMATH OpenOpenAlexFDO

Authors Andrei Voronkov, Juan Antonio Pérez

Publication date 6 March 2009

Published in Automated Deduction – CADE-21 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73595-3_24

Mathematics Subject Classification ID

Temporal logic (03B44) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• scientific article; zbMATH DE number 2086516
• Linear Encodings of Bounded LTL Model Checking
• scientific article; zbMATH DE number 1979554
• A compact linear translation for bounded model checking
• Formal Methods in Computer-Aided Design

Cited in

(13)

• Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates
• A SAT-based encoding of the one-pass and tree-shaped tableau system for LTL
• Symbolic backward reachability with effectively propositional logic. Application to security policy analysis
• scientific article; zbMATH DE number 1705165 (Why is no real title available?)
• A compact linear translation for bounded model checking
• EPR-based bounded model checking at word level
• Deciding Effectively Propositional Logic Using DPLL and Substitution Sets
• scientific article; zbMATH DE number 1979554 (Why is no real title available?)
• Inst-Gen -- a modular approach to instantiation-based automated reasoning
• Planning with effectively propositional logic
• Linear Encodings of Bounded LTL Model Checking
• Formal Methods in Computer-Aided Design
• Deciding effectively propositional logic using DPLL and substitution sets

Describes a project that uses

Uses Software

• NuSMV
• TPTP

This page was built for publication: Encodings of Bounded LTL Model Checking in Effectively Propositional Logic

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