Encoding Queues in Satisfiability Modulo Theories Based Bounded Model Checking

DOI10.1007/978-3-540-89439-1_21zbMath1182.68122OpenAlexW1505526588MaRDI QIDQ5505561

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)

Related Items (1)

Exploiting step semantics for efficient bounded model checking of asynchronous systems

Uses Software

• NuSMV

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