Formal Methods in Computer-Aided Design

DOI10.1007/B102264MaRDI QIDQ5492979zbMATH OpenOpenAlexFDO

Authors E. Zarpas

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

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1670796
• Theory and Applications of Models of Computation
• Accelerating bounded model checking of safety properties
• Towards better heuristics for solving bounded model checking problems
• SAT-Based Model Checking

Cited in

(10)

• Simplification in a satisfiability checker for VLSI applications
• Planning as satisfiability: parallel plans and algorithms for plan search
• Improving saturation-based bounded model checking
• SAT-Based Model Checking without Unrolling
• Planning as satisfiability: heuristics
• Benchmarking a model checker for algorithmic improvements and tuning for performance
• Improving SAT-based Bounded Model Checking for Existential CTL through Path Reuse
• Theory and Applications of Satisfiability Testing
• Theory and Applications of Models of Computation
• Towards better heuristics for solving bounded model checking problems

Describes a project that uses

Uses Software

• MiniSat
• BerkMin

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

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