Efficient Model Checking for LTL with Partial Order Snapshots
No abstract available.
Related papers
- Automata-Driven Partial Order Reduction and Guided Search for LTL Model Checking VMCAI 2022
- Dynamic Partial Order Reduction for Checking Correctness against Transaction Isolation Levels PLDI 2023
- Partial Orders for Efficient Bounded Model Checking of Concurrent Software CAV 2013
- Revisiting Resistance Speeds Up I/O-Efficient LTL Model Checking TACAS 2008
- Simple Is Better: Efficient Bounded Model Checking for Past LTL VMCAI 2005
- Heap-Snapshot Matching and Ordering using CAHPs: A Context-Augmented Heap-Path Representation for Exact and Partial Path Matching using Prefix Trees OOPSLA 2025
- Action-Based Model Checking: Logic, Automata, and Reduction CAV 2020
- More Scalable LTL Model Checking via Discovering Design-Space Dependencies ( D^3 D 3 ) TACAS 2018