Empirically efficient verification for a class of infinite-state systems
From MaRDI portal
Recommendations
Cited in
(9)- Formally verified algorithms for upper-bounding state space diameters
- Parameterized verification of monotone information systems
- Finite verification of the characteristic specification of discrete systems
- Verifying of interface assertions for infinite state Mealy machines
- Formal Verification of Infinite-State BIP Models
- Multi-parameterised compositional verification of safety properties
- Generalization strategies for the verification of infinite state systems
- A local search approach to protocol verification
- Lost in abstraction: monotonicity in multi-threaded programs
This page was built for publication: Empirically efficient verification for a class of infinite-state systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5703797)