Pages that link to "Item:Q5902412"
From MaRDI portal
The following pages link to Perspectives of System Informatics (Q5902412):
Displaying 19 items.
- Rewriting modulo SMT and open system analysis (Q347384) (← links)
- Exploiting step semantics for efficient bounded model checking of asynchronous systems (Q436411) (← links)
- A decidability result for the model checking of infinite-state systems (Q438572) (← links)
- Symbolic reachability analysis and maximally permissive entrance control for globally synchronized templates (Q680540) (← links)
- Rebuilding MP on a logical ground (Q1768803) (← links)
- Model completeness, uniform interpolants and superposition calculus. (With applications to verification of data-aware processes) (Q2051565) (← links)
- Generalized rewrite theories, coherence completion, and symbolic methods (Q2291817) (← links)
- Model completeness, covers and superposition (Q2305411) (← links)
- Structural Presburger digit vector automata (Q2378536) (← links)
- Symbolic backward reachability with effectively propositional logic. Application to security policy analysis (Q2441771) (← links)
- Towards a Theory of Reach (Q2814384) (← links)
- Reachability for finite-state process algebras using Horn clauses (Q2842001) (← links)
- Local entailment test in the reachability problem for well-structured transition systems (Q2885198) (← links)
- Reachability for Finite-State Process Algebras Using Static Analysis (Q3172877) (← links)
- When Is Reachability Intrinsically Decidable? (Q3533013) (← links)
- Towards SMT Model Checking of Array-Based Systems (Q3541687) (← links)
- First-order logic with reachability for infinite-state systems (Q4635903) (← links)
- Light-Weight SMT-based Model Checking (Q5178977) (← links)
- Symbolic Reachability for Process Algebras with Recursive Data Types (Q5505595) (← links)
