Encoding Queues in Satisfiability Modulo Theories Based Bounded Model Checking

DOI10.1007/978-3-540-89439-1_21MaRDI QIDQ5505561zbMATH OpenOpenAlexFDO

Authors Tommi Junttila, Jori Dubrovin

Publication date 27 January 2009

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

Full work available at URL https://doi.org/10.1007/978-3-540-89439-1_21

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Model Checking Software
• Satisfiability modulo theories
• scientific article; zbMATH DE number 2084774
• A Tutorial on Satisfiability Modulo Theories
• Theory and Applications of Satisfiability Testing

Cited in

(2)

• A Uniformization-Based Algorithm for Model Checking the CSL Until Operator on Labeled Queueing Networks
• Exploiting step semantics for efficient bounded model checking of asynchronous systems

Describes a project that uses

Uses Software

• NuSMV

This page was built for publication: Encoding Queues in Satisfiability Modulo Theories Based Bounded Model Checking

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