scientific article; zbMATH DE number 898449
From MaRDI portal
Publication:4884237
zbMath0848.68060MaRDI QIDQ4884237
Publication date: 8 July 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Specification and verification (program logics, model checking, etc.) (68Q60) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items (19)
Abstraction in Fixpoint Logic ⋮ Deriving escape analysis by abstract interpretation ⋮ An abstract interpretation toolkit for \(\mu\)CRL ⋮ Consistency and refinement for interval Markov chains ⋮ Generalizing the Paige-Tarjan algorithm by abstract interpretation ⋮ On model checking multiple hybrid views ⋮ Comparing disjunctive modal transition systems with an one-selecting variant ⋮ Unnamed Item ⋮ EXPTIME-complete Decision Problems for Modal and Mixed Specifications ⋮ Abstractions of data types ⋮ Smaller Abstractions for ∀CTL* without Next ⋮ More Precise Partition Abstractions ⋮ Inferring Synchronization under Limited Observability ⋮ Complexity of Decision Problems for Mixed and Modal Specifications ⋮ On the Complexity of Semantic Self-minimization ⋮ 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. ⋮ Falsifying Safety Properties Through Games on Over-approximating Models ⋮ On finite-state approximants for probabilistic computation tree logic ⋮ Extracting Program Logics From Abstract Interpretations Defined by Logical Relations
This page was built for publication:
