A compact linear translation for bounded model checking

DOI10.1016/J.ENTCS.2006.12.020MaRDI QIDQ2864381zbMATH OpenOpenAlexFDO

Authors Paul B. Jackson, Daniel Sheridan

Publication date 6 December 2013

Published in Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.entcs.2006.12.020

zbMATH Keywords

bounded model checkingdenotational semanticsfixpointslinear temporal logicSAT

Mathematics Subject Classification ID

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

Recommendations

• Formal Methods in Computer-Aided Design
• Encodings of Bounded LTL Model Checking in Effectively Propositional Logic
• Linear Encodings of Bounded LTL Model Checking
• scientific article; zbMATH DE number 1979554
• scientific article; zbMATH DE number 2086516

Cites work

• Computer Aided Verification
• Formal Methods in Computer-Aided Design
• Formal Methods in Computer-Aided Design
• scientific article; zbMATH DE number 67448 (Why is no real title available?)
• scientific article; zbMATH DE number 1979554 (Why is no real title available?)

Cited in

(5)

• Scaling bounded model checking by transforming programs with arrays
• A Syntactical Proof of the Canonical Reactivity Form for Past Linear Temporal Logic
• Encodings of Bounded LTL Model Checking in Effectively Propositional Logic
• scientific article; zbMATH DE number 1979554 (Why is no real title available?)
• Formal Methods in Computer-Aided Design

This page was built for publication: A compact linear translation for bounded model checking

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