scientific article; zbMATH DE number 1953038
From MaRDI portal
Publication:4414397
zbMath1022.68579MaRDI QIDQ4414397
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: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (max. 100)
Verification of SpecC using predicate abstraction ⋮ SAT-Based Model Checking ⋮ Formally verified algorithms for upper-bounding state space diameters ⋮ Verified Over-Approximation of the Diameter of Propositionally Factored Transition Systems ⋮ Incremental bounded model checking for embedded software ⋮ \(\text{Para}^2\): parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms ⋮ Constraint LTL satisfiability checking without automata ⋮ Bounded semantics ⋮ On the completeness of bounded model checking for threshold-based distributed algorithms: reachability ⋮ Proving Safety with Trace Automata and Bounded Model Checking ⋮ Automated formal synthesis of provably safe digital controllers for continuous plants ⋮ Automatic analysis of DMA races using model checking and \(k\)-induction ⋮ Compressing BMC Encodings with QBF
This page was built for publication:
