Parameterized verification with automatically computed inductive assertions
From MaRDI portal
Recommendations
Cited in
(33)- Approximated parameterized verification of infinite-state processes with global conditions
- Verifying programs in the calculus of inductive constructions
- Automatic generation of invariants and intermediate assertions
- Model checking and abstraction to the aid of parameterized systems (a survey)
- Efficient verification of imperative programs using auto2
- Formal verification of mobile robot protocols
- Compositional analysis for verification of parameterized systems
- Parameterised verification for multi-agent systems
- Automatic deductive verification with invisible invariants
- Formalizing Single-Assignment Program Verification: An Adaptation-Complete Approach
- Local symmetry and compositional verification
- Model checking parameterized systems
- Synthesis of large dynamic concurrent programs from dynamic specifications
- Verification Constraint Problems with Strengthening
- Liveness by Invisible Invariants
- Automatic Verification of Directory-Based Consistency Protocols
- Verification of multi-linked heaps
- Automated inductive verification of parameterized protocols
- Verification of parametrized systems by dynamic induction on diagrams
- Parametrized invariance for infinite state processes
- Parametric systems: verification and synthesis
- View abstraction -- a tutorial (invited paper)
- Tools and Algorithms for the Construction and Analysis of Systems
- Handling Parameterized Systems with Non-atomic Global Conditions
- Proving Ptolemy Right: The Environment Abstraction Framework for Model Checking Concurrent Systems
- Monotonic Abstraction in Action
- Computer Aided Verification
- Tools and Algorithms for the Construction and Analysis of Systems
- Parameterized recursive refinement types for automated program verification
- Thread-modular counter abstraction: automated safety and termination proofs of parameterized software by reduction to sequential program verification
- Lost in abstraction: monotonicity in multi-threaded programs
- Sound verification procedures for temporal properties of infinite-state systems
- Application of the trace assertion method to the specification, design, and verification of automaton programs
This page was built for publication: Parameterized verification with automatically computed inductive assertions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4551152)