Pages that link to "Item:Q1346649"
From MaRDI portal
The following pages link to Property preserving abstractions for the verification of concurrent systems (Q1346649):
Displaying 42 items.
- Inverse-limit and topological aspects of abstract interpretation (Q418811) (← links)
- Competent predicate abstraction in model checking (Q543199) (← links)
- Towards the hierarchical verification of reactive systems (Q596025) (← links)
- Reduced models for efficient CCS verification (Q816205) (← links)
- Algebraic simulations (Q844884) (← links)
- \(\text{DELFIN}^+\): an efficient deadlock detection tool for CCS processes (Q856423) (← links)
- On using data abstractions for model checking refinements (Q878378) (← links)
- Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols (Q880981) (← links)
- A framework for the verification of infinite-state graph transformation systems (Q937301) (← links)
- An efficient simulation algorithm based on abstract interpretation (Q1049401) (← links)
- Simple proof techniques for property preservation via simulation (Q1350106) (← links)
- Abstract model repair for probabilistic systems (Q1706149) (← links)
- Compositional minimisation of finite state systems using interface specifications (Q1816922) (← links)
- Algorithmic analysis of programs with well quasi-ordered domains. (Q1854355) (← links)
- Verification by augmented finitary abstraction (Q1854391) (← links)
- Combining static analysis and case-based search space partitioning for reducing peak memory in model checking (Q1884313) (← links)
- Applicability of fair simulation (Q1886036) (← links)
- Temporal-logic property preservation under Z refinement (Q1941860) (← links)
- Generating models of infinite-state communication protocols using regular inference with abstraction (Q2018056) (← links)
- Partial predicate abstraction and counter-example guided refinement (Q2291815) (← links)
- On the universal and existential fragments of the \(\mu\)-calculus (Q2368950) (← links)
- Counterexample-guided predicate abstraction of hybrid systems (Q2368954) (← links)
- Combining search space partition and abstraction for LTL model checking (Q2465733) (← links)
- Using heuristic search for finding deadlocks in concurrent systems (Q2573636) (← links)
- A semantic framework for the abstract model checking of tccp programs (Q2576949) (← links)
- Refinement preserving approximations for the design and verification of heterogeneous systems (Q2642667) (← links)
- When not losing is better than winning: abstraction and refinement for the full \(\mu\)-calculus (Q2643076) (← links)
- Narrowing and Rewriting Logic: from Foundations to Applications (Q2873786) (← links)
- Consistent Consequence for Boolean Equation Systems (Q2891375) (← links)
- Complete Abstractions and Subclassical Modal Logics (Q2961561) (← links)
- Abstraction and Abstraction Refinement (Q3176371) (← links)
- Unfolding Graph Transformation Systems: Theory and Applications to Verification (Q3507354) (← links)
- Approximating Behaviors in Embedded System Design (Q3507398) (← links)
- Correcting a Space-Efficient Simulation Algorithm (Q3512514) (← links)
- Design and Verification of Fault-Tolerant Components (Q3623817) (← links)
- Combining Predicate Abstraction with Fixpoint Approximations (Q4571129) (← links)
- Networks of Processes with Parameterized State Space (Q4921504) (← links)
- Feedback in Synchronous Relational Interfaces (Q5170752) (← links)
- Smaller Abstractions for ∀CTL* without Next (Q5187833) (← links)
- Extracting Program Logics From Abstract Interpretations Defined by Logical Relations (Q5262946) (← links)
- Abstraction for non-ground answer set programs (Q5919127) (← links)
- Verification by augmented abstraction: The automata-theoretic view (Q5946060) (← links)
