scientific article; zbMATH DE number 1759610

zbMath0999.68524MaRDI QIDQ4536601

Glenn Bruns, Patrice Godefroid

Publication date: 28 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) Temporal logic (03B44)

Related Items (28)

Integrating Topological Proofs with Model Checking to Instrument Iterative Design ⋮ Abstraction and Abstraction Refinement ⋮ Model Checking Value-Passing Modal Specifications ⋮ Data structures for symbolic multi-valued model-checking ⋮ On the consistency, expressiveness, and precision of partial modeling formalisms ⋮ Compositional Specification in Rewriting Logic ⋮ Three-valued temporal logic \(Q_t\) and future contingents ⋮ Modal transition systems with weight intervals ⋮ Computation tree logic model checking based on multi-valued possibility measures ⋮ On model checking multiple hybrid views ⋮ Comparing disjunctive modal transition systems with an one-selecting variant ⋮ 3-valued abstraction: More precision at less cost ⋮ Model-Checking View-Based Partial Specifications ⋮ EXPTIME-complete Decision Problems for Modal and Mixed Specifications ⋮ A local approach for temporal model checking of Java bytecode ⋮ Multi-robot LTL planning under uncertainty ⋮ Model checking of linear-time properties in multi-valued systems ⋮ Modelling and analysing variability in product families: model checking of modal transition systems with variability constraints ⋮ More Precise Partition Abstractions ⋮ Better Under-Approximation of Programs by Hiding Variables ⋮ Model Checking for Action Abstraction ⋮ Complexity of Decision Problems for Mixed and Modal Specifications ⋮ On the Complexity of Semantic Self-minimization ⋮ Falsifying Safety Properties Through Games on Over-approximating Models ⋮ TOrPEDO : witnessing model correctness with topological proofs ⋮ Bounded Model Checking for Partial Kripke Structures ⋮ A semantic framework for the abstract model checking of tccp programs ⋮ On finite-state approximants for probabilistic computation tree logic

This page was built for publication: