Publication:4884237
From MaRDI portal
zbMath0848.68060MaRDI QIDQ4884237
Publication date: 8 July 1996
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
68Q60: Specification and verification (program logics, model checking, etc.)
68-02: Research exposition (monographs, survey articles) pertaining to computer science
Related Items
Falsifying Safety Properties Through Games on Over-approximating Models, EXPTIME-complete Decision Problems for Modal and Mixed Specifications, Smaller Abstractions for ∀CTL* without Next, Extracting Program Logics From Abstract Interpretations Defined by Logical Relations, Abstraction in Fixpoint Logic, More Precise Partition Abstractions, Complexity of Decision Problems for Mixed and Modal Specifications, Consistency and refinement for interval Markov chains, Deriving escape analysis by abstract interpretation, An abstract interpretation toolkit for \(\mu\)CRL, Generalizing the Paige-Tarjan algorithm by abstract interpretation, On model checking multiple hybrid views, Comparing disjunctive modal transition systems with an one-selecting variant, Predicate Abstraction for Dense Real-Time Systems1 1This research was supported by the National Science Foundation under grants CCR-00-82560 and CCR-00-86096 and by NASA Langley Research Center under contract B09060051 and Cooperative Agreement NCC-1-399 with Honeywell Minneapolis. Most of this research has been conducted while the first author was visiting SRI International, July/August 2001., Abstractions of data types, On finite-state approximants for probabilistic computation tree logic, Unnamed Item, On the Complexity of Semantic Self-minimization, Inferring Synchronization under Limited Observability
