The following pages link to (Q2769579):
Displaying 29 items.
- Synthesis of large dynamic concurrent programs from dynamic specifications (Q346790) (← links)
- Parametrized invariance for infinite state processes (Q493122) (← links)
- Sound verification procedures for temporal properties of infinite-state systems (Q832273) (← links)
- Control of parameterized discrete event systems (Q839004) (← links)
- Invariants for parameterised Boolean equation systems (Q960855) (← links)
- Local proofs for global safety properties (Q1039842) (← links)
- Model checking and abstraction to the aid of parameterized systems (a survey) (Q1886449) (← links)
- Checking deadlock-freedom of parametric component-based systems (Q1996857) (← links)
- Universal invariant checking of parametric systems with quantifier-free SMT reasoning (Q2055851) (← links)
- Compositional verification of smart contracts through communication abstraction (Q2145351) (← links)
- Specification and verification of concurrent programs through refinements (Q2351261) (← links)
- Compositional analysis for verification of parameterized systems (Q2368952) (← links)
- Verification of parametric concurrent systems with prioritised FIFO resource management (Q2481584) (← links)
- (Q2754111) (← links)
- Automated formal analysis and verification: an overview (Q2871577) (← links)
- Compositional Reasoning (Q3176370) (← links)
- Model Checking Parameterized Systems (Q3176379) (← links)
- Invariants for Parameterised Boolean Equation Systems (Q3541018) (← links)
- Liveness by Invisible Invariants (Q3613081) (← links)
- Automatic Verification of Directory-Based Consistency Protocols (Q3646250) (← links)
- Abstract Counterexamples for Non-disjunctive Abstractions (Q3646262) (← links)
- Structural Invariants for the Verification of Systems with Parameterized Architectures (Q5039511) (← links)
- View abstraction -- a tutorial (invited paper) (Q5240148) (← links)
- Proving Ptolemy Right: The Environment Abstraction Framework for Model Checking Concurrent Systems (Q5458319) (← links)
- Theoretical Aspects of Computing - ICTAC 2004 (Q5709984) (← links)
- Deductive verification in decidable fragments with Ivy (Q6041167) (← links)
- Verification of SMT systems with quantifiers (Q6160910) (← links)
- Invariant checking for SMT-based systems with quantifiers (Q6636621) (← links)
- Thread-modular counter abstraction: automated safety and termination proofs of parameterized software by reduction to sequential program verification (Q6661749) (← links)
