Abstraction and abstraction refinement
From MaRDI portal
Recommendations
Cites work
- 3-valued abstraction: More precision at less cost
- 3-Valued Circuit SAT for STE with Automatic Refinement
- A framework for compositional verification of multi-valued systems via abstraction-refinement
- A game-based framework for CTL counterexamples and 3-valued abstraction-refinement
- Abstraction and Refinement in Model Checking
- Abstraction for branching time properties.
- Abstractions from proofs
- Algebraic laws for nondeterminism and concurrency
- Array Abstractions from Proofs
- Automata, Languages and Programming
- Automated Assume-Guarantee Reasoning by Abstraction Refinement
- Automated Technology for Verification and Analysis
- Automatic Refinement and Vacuity Detection for Symbolic Trajectory Evaluation
- BDD-based symbolic model checking
- Characterizing finite Kripke structures in propositional temporal logic
- Compositional Verification and 3-Valued Abstractions Join Forces
- Computer Aided Verification
- Configurable Software Verification: Concretizing the Convergence of Model Checking and Program Analysis
- Counterexample-guided abstraction refinement for symbolic model checking
- Data structures for symbolic multi-valued model-checking
- Efficient Automatic STE Refinement Using Responsibility
- Expressiveness and completeness in abstraction
- Extensional equivalences for transition systems
- Formal Methods in Computer-Aided Design
- scientific article; zbMATH DE number 1617333 (Why is no real title available?)
- scientific article; zbMATH DE number 1670555 (Why is no real title available?)
- scientific article; zbMATH DE number 1693039 (Why is no real title available?)
- scientific article; zbMATH DE number 1701764 (Why is no real title available?)
- scientific article; zbMATH DE number 3716792 (Why is no real title available?)
- scientific article; zbMATH DE number 177515 (Why is no real title available?)
- scientific article; zbMATH DE number 1306878 (Why is no real title available?)
- scientific article; zbMATH DE number 1956569 (Why is no real title available?)
- scientific article; zbMATH DE number 1979542 (Why is no real title available?)
- scientific article; zbMATH DE number 1759610 (Why is no real title available?)
- scientific article; zbMATH DE number 1798184 (Why is no real title available?)
- scientific article; zbMATH DE number 3799616 (Why is no real title available?)
- scientific article; zbMATH DE number 1903350 (Why is no real title available?)
- scientific article; zbMATH DE number 1903358 (Why is no real title available?)
- scientific article; zbMATH DE number 1905114 (Why is no real title available?)
- scientific article; zbMATH DE number 2102712 (Why is no real title available?)
- scientific article; zbMATH DE number 2102725 (Why is no real title available?)
- Lazy abstraction
- Lazy Abstraction with Interpolants
- Modeling for Verification
- Optimized L*-Based Assume-Guarantee Reasoning
- Predicate abstraction for program verification
- Predicate abstraction of ANSI-C programs using SAT
- Predicate Abstraction via Symbolic Decision Procedures
- Property preserving abstractions for the verification of concurrent systems
- SAT-Based Model Checking
- Simulation-based minimization
- Static Analysis
- Temporal abstract interpretation
- Temporal logic and fair discrete systems
- The mu-calculus and Model Checking
- Three logics for branching bisimulation
- Tools and Algorithms for the Construction and Analysis of Systems
- Tools and Algorithms for the Construction and Analysis of Systems
- Tools and Algorithms for the Construction and Analysis of Systems
- Verification by augmented finitary abstraction
- Verification, Model Checking, and Abstract Interpretation
- When not losing is better than winning: abstraction and refinement for the full \(\mu\)-calculus
Cited in
(63)- The inevitability of inconsistent abstract spaces
- Property preserving abstractions for the verification of concurrent systems
- Control and data abstraction: The cornerstones of practical formal verification
- Skeleton abstraction for universal temporal properties
- An abstraction-refinement framework for trigger querying
- When does abstraction help?
- An automatic method for the dynamic construction of abstractions of states of a formal model
- Abstractions of data types
- scientific article; zbMATH DE number 1617333 (Why is no real title available?)
- scientific article; zbMATH DE number 1670560 (Why is no real title available?)
- Computing property-preserving behaviour abstractions from trace reductions, abstraction-based verification of linear-time properties under fairness
- Comparing abstraction refinement algorithms
- PVS strategies for proving abstraction properties of automata
- Modal abstractions of concurrent behavior
- Making abstraction-refinement efficient in model checking
- Explicit-state model checking
- Compositional reasoning
- Interpolation and model checking
- Predicate abstraction for program verification
- Combining Model Checking and Deduction
- Process algebra and model checking
- Slicing Abstractions
- Modal Abstractions of Concurrent Behaviour
- Compositional Abstraction in Real-Time Model Checking
- Which Abstraction Principles are Acceptable? Some Limitative Results
- scientific article; zbMATH DE number 1104443 (Why is no real title available?)
- scientific article; zbMATH DE number 1948410 (Why is no real title available?)
- scientific article; zbMATH DE number 1953030 (Why is no real title available?)
- scientific article; zbMATH DE number 1953281 (Why is no real title available?)
- scientific article; zbMATH DE number 1956497 (Why is no real title available?)
- scientific article; zbMATH DE number 1979540 (Why is no real title available?)
- scientific article; zbMATH DE number 2079998 (Why is no real title available?)
- scientific article; zbMATH DE number 1759712 (Why is no real title available?)
- A logic for complex computing systems: properties preservation along integration and abstraction
- scientific article; zbMATH DE number 1836353 (Why is no real title available?)
- Abstraction and composition: a verification method for co-operating systems
- scientific article; zbMATH DE number 2090155 (Why is no real title available?)
- scientific article; zbMATH DE number 2102725 (Why is no real title available?)
- scientific article; zbMATH DE number 2110619 (Why is no real title available?)
- scientific article; zbMATH DE number 2111735 (Why is no real title available?)
- scientific article; zbMATH DE number 898449 (Why is no real title available?)
- Expressiveness and completeness in abstraction
- Successive Refinement of Abstract Sources
- Abstraction as the key for invariant verification
- Model Checking Software
- Structural Counter Abstraction
- Automated Technology for Verification and Analysis
- Successive Abstractions of Hybrid Automata for Monotonic CTL Model Checking
- More Precise Partition Abstractions
- Model Checking for Action Abstraction
- Correct Hardware Design and Verification Methods
- Computer Aided Verification
- Static Analysis
- Verification, Model Checking, and Abstract Interpretation
- Abstraction for branching time properties.
- Simulation relations and applications in formal methods
- The role of abstraction in model checking
- Abstraction Modulo Stability for Reverse Engineering
- First order Büchi automata and their application to verification of LTL specifications
- Title not available (Why is no real title available?)
- Title not available (Why is no real title available?)
- On using data abstractions for model checking refinements
- Equational abstractions
This page was built for publication: Abstraction and abstraction refinement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3176371)
