scientific article; zbMATH DE number 1953038
From MaRDI portal
Publication:4414397
zbMATH Open1022.68579MaRDI QIDQ4414397FDOQ4414397
Authors: Daniel Kroening, Ofer Strichman 
Publication date: 25 July 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2575/25750298.htm
Title of this publication is not available (Why is that?)
Recommendations
- Verified over-approximation of the diameter of propositionally factored transition systems
- Accelerating bounded model checking of safety properties
- On the magnitude of completeness thresholds in bounded model checking
- Verification, Model Checking, and Abstract Interpretation
- Theory and Applications of Models of Computation
Cited In (15)
- Verified over-approximation of the diameter of propositionally factored transition systems
- Constraint LTL satisfiability checking without automata
- Proving safety with trace automata and bounded model checking
- On the completeness of bounded model checking for threshold-based distributed algorithms: reachability
- Formally verified algorithms for upper-bounding state space diameters
- Automated formal synthesis of provably safe digital controllers for continuous plants
- SAT-Based Model Checking
- Automatic analysis of DMA races using model checking and \(k\)-induction
- Bounded semantics
- Partially Bounded Context-Aware Verification
- Incremental bounded model checking for embedded software
- Compressing BMC encodings with QBF
- \(\text{Para}^2\): parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms
- Verification of SpecC using predicate abstraction
- Efficient counting of degree sequences
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4414397)
