Decidability of parameterized verification
From MaRDI portal
Recommendations
Cited in
(53)- Decidability and complexity analysis by basic paramodulation
- Parameterized model checking of rendezvous systems
- \(\text{Para}^2\): parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms
- A methodology to take credit for high-level verification during RTL verification
- Parameterized verification of monotone information systems
- Parameterized model checking of networks of timed automata with Boolean guards
- Checking deadlock-freedom of parametric component-based systems
- The complexity of verifying population protocols
- Decision problems in a logic for reasoning about reconfigurable distributed systems
- Computing parameterized invariants of parameterized Petri nets
- A counter abstraction technique for verifying properties of probabilistic swarm systems
- Emptiness problems for distributed automata
- The polynomial complexity of vector addition systems with states
- Finding cut-offs in leaderless rendez-vous protocols is easy
- Book review of: E. M. Clarke (ed.) et al., Handbook of model checking
- Advances in parameterized verification of population protocols
- Liveness in broadcast networks
- Verification of component-based systems with recursive architectures
- scientific article; zbMATH DE number 1614699 (Why is no real title available?)
- Model checking parameterised multi-token systems via the composition method
- Structural place invariants for analyzing the behavioral properties of nested Petri nets
- Model checking parameterized systems
- What you always wanted to know about model checking of fault-tolerant distributed algorithms
- Synthesis of distributed algorithms with parameterized threshold guards
- Synthesis of large dynamic concurrent programs from dynamic specifications
- scientific article; zbMATH DE number 777294 (Why is no real title available?)
- Declarative parameterized verification of distributed protocols via the Cubicle model checker
- Reachability in parameterized systems: all flavors of threshold automata
- Structural Invariants for the Verification of Systems with Parameterized Architectures
- Computing Parameterized Invariants of Parameterized Petri Nets
- Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States
- Data tracking in parameterized systems
- Long-Run Average Behavior of Vector Addition Systems with States
- Reconfiguration and message losses in parameterized broadcast networks
- A case study on parametric verification of failure detectors
- Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker
- Deductive verification in decidable fragments with Ivy
- Modelling Uncertainty in Architectures of Parametric Component-Based Systems
- Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy
- Verification of SMT systems with quantifiers
- Parameterized verification under TSO with data types
- Synthesis of distributed agreement-based systems with efficiently-decidable verification
- On the satisfiability of local first-order logics with data
- Invariant checking for SMT-based systems with quantifiers
- Reachability in distributed memory automata
- Synthesizing safe coalition strategies
- Parameterized complexity of safety of threshold automata
- Verification of population protocols with unordered data
- Automatic WSTS-based repair and deadlock detection of parameterized systems
- Parameterized model-checking of discrete-timed networks and symmetric-broadcast systems
- Model-checking parametric lock-sharing systems against regular constraints
- Model and program repair via group actions and structure unwinding
- On the completeness of bounded model checking for threshold-based distributed algorithms: reachability
This page was built for publication: Decidability of parameterized verification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4568312)
