More Precise Partition Abstractions

DOI10.1007/978-3-540-69738-1_12zbMATH Open1132.68469OpenAlexW1522480582MaRDI QIDQ5452605FDOQ5452605

Authors: Michael Huth, Harald Fecher 

Publication date: 4 April 2008

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

Full work available at URL: https://doi.org/10.1007/978-3-540-69738-1_12

Recommendations

• Modal stochastic games. Abstraction-refinement of probabilistic automata
• Abstraction and abstraction refinement
• 3-valued abstraction: More precision at less cost
• Generalized Strong Preservation by Abstract Interpretation
• scientific article; zbMATH DE number 1948410

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modal logic (including the logic of norms) (03B45) Specification and verification (program logics, model checking, etc.) (68Q60) Logic in computer science (03B70)

Cites Work

• Results on the propositional \(\mu\)-calculus
• Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
• SPECIFICATION AND VERIFICATION OF CONURRENT SYSTEMS IN CESAR
• Alternating tree automata, parity games, and modal \(\mu\)-calculus
• Title not available (Why is that?)
• Title not available (Why is that?)
• Tools and Algorithms for the Construction and Analysis of Systems
• Verification, Model Checking, and Abstract Interpretation
• Ranked Predicate Abstraction for Branching Time: Complete, Incremental, and Precise

Cited In (4)

• Property-Driven Partitioning for Abstraction Refinement
• Better Under-Approximation of Programs by Hiding Variables
• Comparing disjunctive modal transition systems with an one-selecting variant
• Title not available (Why is that?)

This page was built for publication: More Precise Partition Abstractions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5452605)