BEEM
From MaRDI portal
Software:21794
swMATH9815MaRDI QIDQ21794FDOQ21794
Author name not available (Why is that?)
Cited In (20)
- Comparison of algorithms for checking emptiness on Büchi automata
- Comparison of LTL to Deterministic Rabin Automata Translators
- LTL to self-loop alternating automata with generic acceptance and back
- Exploring the scope for partial order reduction
- Refinement to imperative HOL
- Revisiting Resistance Speeds Up I/O-Efficient LTL Model Checking
- Strength-based decomposition of the property Büchi automaton for faster model checking
- Exploiting step semantics for efficient bounded model checking of asynchronous systems
- Advanced Ramsey-based Büchi automata inclusion testing
- The ComBack method revisited: caching strategies and extension with delayed duplicate detection
- Flash memory efficient LTL model checking
- Refinement to Imperative/HOL
- Checking bounded reachability in asynchronous systems by symbolic event tracing
- Index appearance record with preorders
- Limit-deterministic Büchi automata for linear temporal logic
- Parallel nested depth-first searches for LTL model checking
- Reducing concurrent analysis under a context bound to sequential analysis
- On-the-fly parallel model checking algorithm that is optimal for verification of weak LTL properties
- From LTL to deterministic automata. A safraless compositional approach
- Rabinizer: small deterministic automata for \({\mathrm{LTL}(\mathrm{F},\mathrm{G})}\)
This page was built for software: BEEM
