Handling Parameterized Systems with Non-atomic Global Conditions
From MaRDI portal
Recommendations
Cites work
- A closed-form evaluation for Datalog queries with integer (gap)-order constraints
- Algorithmic analysis of programs with well quasi-ordered domains.
- Automatic verification of parameterized cache coherence protocols
- Computer Aided Verification
- Iterating transducers in the large (extended abstract)
- Parameterized Verification of Infinite-State Processes with Global Conditions
- Parameterized verification with automatically computed inductive assertions
- Regular model checking made simple and efficient
- Regular Model Checking Without Transducers (On Efficient Verification of Parameterized Systems)
- Serializability preserving extensions of concurrency control protocols
- Symbolic model checking with rich assertional languages
- Time, clocks, and the ordering of events in a distributed system
- Using partial orders for the efficient verification of deadlock freedom and safety properties
- Verification, Model Checking, and Abstract Interpretation
Cited in
(12)- Approximated parameterized verification of infinite-state processes with global conditions
- Parameterized verification of systems with global synchronization and guards
- Automatic Verification of Directory-Based Consistency Protocols
- Handling global conditions in parameterized system verification
- Monotonic abstraction in parameterized verification
- View abstraction -- a tutorial (invited paper)
- Parameterized Verification of Infinite-State Processes with Global Conditions
- Verifying Parameterized taDOM+ Lock Managers
- Monotonic Abstraction in Action
- Regular model checking: evolution and perspectives
- Abduction of trap invariants in parameterized systems
- Just verification of mutual exclusion algorithms
This page was built for publication: Handling Parameterized Systems with Non-atomic Global Conditions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5452704)
