Model checking parameterized systems
From MaRDI portal
Recommendations
- Model checking and abstraction to the aid of parameterized systems (a survey)
- Decidability of parameterized verification
- Model-checking and abstraction to the aid of parameterized systems
- An approach to the verification of symmetric parameterized distributed systems
- Tools and Algorithms for the Construction and Analysis of Systems
Cites work
- A new solution of Dijkstra's concurrent programming problem
- A survey of regular model checking
- A unifying model checking approach for safety properties of parameterized systems
- Abstract regular model checking
- Abstract regular tree model checking
- All for the price of few (parameterized verification through view abstraction)
- Automated inductive verification of parameterized protocols
- Automatic deductive verification with invisible invariants
- Automatic verification of parameterized cache coherence protocols
- Automatic verification of parameterized networks of processes
- Decidability of parameterized verification
- Exact and efficient verification of parameterized cache coherence protocols
- Experience with predicate abstraction
- Extrapolating tree transformations
- Formal Methods in Computer-Aided Design
- Indexed predicate discovery for unbounded system verification
- Iterating transducers in the large (extended abstract)
- Model Checking Software
- Model-checking and abstraction to the aid of parameterized systems
- Ordering by Divisibility in Abstract Algebras
- Parallel program schemata
- Parameterized verification of a cache coherence protocol: Safety and liveness
- Parameterized verification of ad hoc networks
- Parameterized verification of linear networks using automata as invariants
- Parameterized verification of the FLASH cache coherence protocol by compositional model checking
- Parameterized verification with automatically computed inductive assertions
- Proofs of Networks of Processes
- Proving properties of a ring of finite-state machines
- Rapid parameterized model checking of snoopy cache coherence protocols
- Reasoning about networks with many identical finite state processes
- Reasoning about systems with many processes
- Reducing model checking of the many to the few
- Regular model checking for LTL(MSO)
- Regular model checking made simple and efficient
- Regular model checking using widening techniques
- Regular Model Checking Without Transducers (On Efficient Verification of Parameterized Systems)
- Symbolic model checking with rich assertional languages
- Tools and Algorithms for the Construction and Analysis of Systems
- Verification of finite state systems by compositional model checking
- Verification, Model Checking, and Abstract Interpretation
- Well-structured transition systems everywhere!
Cited in
(29)- Model checking action system refinements
- Model checking and abstraction to the aid of parameterized systems (a survey)
- The complexity of verifying population protocols
- Computing parameterized invariants of parameterized Petri nets
- An approach to the verification of symmetric parameterized distributed systems
- Liveness in broadcast networks
- A type reduction theory for systems with replicated components
- Parameterized Model Checking of Token-Passing Systems
- Keeping a crowd safe: on the complexity of parameterized verification (invited talk)
- scientific article; zbMATH DE number 6720711 (Why is no real title available?)
- Combining Model Checking and Deduction
- Parameterized verification and model checking for distributed broadcast protocols
- Model-checking and abstraction to the aid of parameterized systems
- Model checking large-scale and parameterized resource allocation systems
- A unifying model checking approach for safety properties of parameterized systems
- Decidability of parameterized verification
- Computing Parameterized Invariants of Parameterized Petri Nets
- Model Checking Kernel P Systems
- Formal Modeling and Analysis of Timed Systems
- Tools and Algorithms for the Construction and Analysis of Systems
- Population-induced phase transitions and the verification of chemical reaction networks
- Parameterized verification under TSO with data types
- Abduction of trap invariants in parameterized systems
- Computing inductive invariants of regular abstraction frameworks
- Parameterized model-checking of discrete-timed networks and symmetric-broadcast systems
- Model-checking parametric lock-sharing systems against regular constraints
- Regular model checking for systems with effectively regular reachability relation
- Parameterized verification of timed networks with clock invariants
- Parametric disjunctive timed networks
This page was built for publication: Model checking parameterized systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3176379)