Formal Methods in Computer-Aided Design

DOI10.1007/b102264zbMath1117.68432OpenAlexW4229585471MaRDI QIDQ5492980

Armin Biere, Keijo Heljanko, Timo Latvala, Tommi Junttila

Publication date: 20 October 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b102264

zbMATH Keywords

bounded model checkingLTLNuSMVlinear translation

Mathematics Subject Classification ID

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

Related Items (6)

SAT-Based Model Checking ⋮ Bounded model checking of ETL cooperating with finite and looping automata connectives ⋮ Limitations of Restricted Branching in Clause Learning ⋮ Limitations of restricted branching in clause learning ⋮ Counterexample-preserving reduction for symbolic model checking ⋮ A Compact Linear Translation for Bounded Model Checking

This page was built for publication: Formal Methods in Computer-Aided Design