EPR-Based Bounded Model Checking at Word Level

DOI10.1007/978-3-642-31365-3_18zbMath1358.68190OpenAlexW1540069634MaRDI QIDQ2908493

Konstantin Korovin, Moshe Emmer, Christoph Sticksel, Andrei Voronkov, Zurab Khasidashvili

Publication date: 5 September 2012

Published in: Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31365-3_18

Mathematics Subject Classification ID

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

Related Items (2)

Semantically-guided goal-sensitive reasoning: model representation ⋮ Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates

Uses Software

• TPTP
• ASASP

This page was built for publication: EPR-Based Bounded Model Checking at Word Level