Verification, Model Checking, and Abstract Interpretation

DOI10.1007/b105073zbMath1112.68088OpenAlexW2611288859MaRDI QIDQ5711491

Kedar S. Namjoshi, Dennis Dams

Publication date: 6 December 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b105073

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

Related Items (11)

Abstraction in Fixpoint Logic ⋮ Donut Domains: Efficient Non-convex Domains for Abstract Interpretation ⋮ Abstraction and Abstraction Refinement ⋮ When not losing is better than winning: abstraction and refinement for the full \(\mu\)-calculus ⋮ On the consistency, expressiveness, and precision of partial modeling formalisms ⋮ Compositional verification of sequential programs with procedures ⋮ On model checking multiple hybrid views ⋮ Comparing disjunctive modal transition systems with an one-selecting variant ⋮ More Precise Partition Abstractions ⋮ Refinement Sensitive Formal Semantics of State Machines With Persistent Choice ⋮ Process Algebra Having Inherent Choice: Revised Semantics for Concurrent Systems

This page was built for publication: Verification, Model Checking, and Abstract Interpretation