scientific article; zbMATH DE number 1863177
From MaRDI portal
Publication:4791848
zbMath1006.68077MaRDI QIDQ4791848
Radha Jagadeesan, Michael Huth, Patrice Godefroid
Publication date: 3 February 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2154/21540426.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (24)
Abstraction in Fixpoint Logic ⋮ Integrating Topological Proofs with Model Checking to Instrument Iterative Design ⋮ An abstraction-refinement methodology for reasoning about network games ⋮ Combining Model Checking and Testing ⋮ An abstract interpretation toolkit for \(\mu\)CRL ⋮ General quantitative specification theories with modal transition systems ⋮ Abstract model repair for probabilistic systems ⋮ Modal transition systems with weight intervals ⋮ Test generation from event system abstractions to cover their states and transitions ⋮ Model Checking Recursive Programs with Exact Predicate Abstraction ⋮ Program Specialization for Verifying Infinite State Systems: An Experimental Evaluation ⋮ Unbounded procedure summaries from bounded environments ⋮ 3-valued abstraction: More precision at less cost ⋮ Model-Checking View-Based Partial Specifications ⋮ EXPTIME-completeness of thorough refinement on modal transition systems ⋮ Parametric and Quantitative Extensions of Modal Transition Systems ⋮ Automatic Synthesis of Assumptions for Compositional Model Checking ⋮ Falsifying Safety Properties Through Games on Over-approximating Models ⋮ TOrPEDO : witnessing model correctness with topological proofs ⋮ Don’t Know for Multi-valued Systems ⋮ A semantic framework for the abstract model checking of tccp programs ⋮ On finite-state approximants for probabilistic computation tree logic ⋮ Refinement checking on parametric modal transition systems ⋮ A framework for compositional verification of multi-valued systems via abstraction-refinement
Uses Software
This page was built for publication:
