scientific article; zbMATH DE number 1798181

zbMath0996.68105MaRDI QIDQ4553254

Kedar S. Namjoshi

Publication date: 4 November 2002

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

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

Related Items (21)

Automated Verification of Parallel Nested DFS ⋮ Farkas Certificates and Minimal Witnesses for Probabilistic Reachability Constraints ⋮ Verified Certification of Reachability Checking for Timed Automata ⋮ Integrating Topological Proofs with Model Checking to Instrument Iterative Design ⋮ Progress in certifying hardware model checking results ⋮ Implementing Spi Calculus Using Nominal Techniques ⋮ On probability-raising causality in Markov decision processes ⋮ Foundations of probability-raising causality in Markov decision processes ⋮ Towards a notion of unsatisfiable and unrealizable cores for LTL ⋮ Bounded semantics ⋮ A self-certifying compilation framework for WebAssembly ⋮ Certifying emptiness of timed Büchi automata ⋮ A compositional approach to CTL\(^*\) verification ⋮ Vacuity in practice: temporal antecedent failure ⋮ Proving the Refuted: Symbolic Model Checkers as Proof Generators ⋮ Automatic Synthesis of Assumptions for Compositional Model Checking ⋮ Making \(\mathsf{IP}=\mathsf{PSPACE}\) practical: efficient interactive protocols for BDD algorithms ⋮ A resolution-based interactive proof system for UNSAT ⋮ Certifying proofs for SAT-based model checking ⋮ TOrPEDO : witnessing model correctness with topological proofs ⋮ From complementation to certification

This page was built for publication: