scientific article; zbMATH DE number 898449

MaRDI QIDQ4884237zbMATH OpenFDO

Authors Dennis Dams

Publication date 8 July 1996

zbMATH Keywords

model checkingformal methodsprogram verificationstate space reduction techniques

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• scientific article; zbMATH DE number 2110619
• Abstraction and abstraction refinement
• Refining and compressing abstract model checking
• scientific article; zbMATH DE number 1948410
• Abstraction and Refinement in Model Checking

Cited in

(28)

• scientific article; zbMATH DE number 1796131 (Why is no real title available?)
• Inferring Synchronization under Limited Observability
• Deriving escape analysis by abstract interpretation
• Refining and compressing abstract model checking
• Combining search space partition and abstraction for LTL model checking
• Generalizing the Paige-Tarjan algorithm by abstract interpretation
• Consistency and refinement for interval Markov chains
• On finite-state approximants for probabilistic computation tree logic
• Predicate abstraction for dense real-time systems
• Comparing disjunctive modal transition systems with an one-selecting variant
• Complexity of Decision Problems for Mixed and Modal Specifications
• Partitioned PLTL model-checking for refined transition systems
• On the complexity of semantic self-minimization
• Abstraction and abstraction refinement
• Abstraction in fixpoint logic
• Extracting program logics from abstract interpretations defined by logical relations
• On model checking multiple hybrid views
• GSTE is partitioned model checking
• Falsifying safety properties through games on over-approximating models
• An abstract interpretation toolkit for CRL
• Playing with abstraction and representation
• Smaller Abstractions for ∀CTL* without Next
• EXPTIME-complete decision problems for modal and mixed specifications
• Abstractions of data types
• More Precise Partition Abstractions
• scientific article; zbMATH DE number 2110619 (Why is no real title available?)
• Tools and Algorithms for the Construction and Analysis of Systems
• Bounded model checking for timed automata

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 Q4884237)