BEEM
From MaRDI portal
Cited in
(47)- Reducing concurrent analysis under a context bound to sequential analysis
- Seminator 2
- jMoped
- StEAM
- SPIN
- POEM
- libDDD
- DiVinE
- Helena
- Refinement to imperative HOL
- STXXL
- On-the-fly parallel model checking algorithm that is optimal for verification of weak LTL properties
- Ibis
- FORCE
- SPOT
- LTL to self-loop alternating automata with generic acceptance and back
- LTL2BA
- From LTL to deterministic automata. A safraless compositional approach
- GPU Quicksort
- PGSolver
- Index appearance record with preorders
- MLton
- Comparison of LTL to Deterministic Rabin Automata Translators
- Comparison of algorithms for checking emptiness on Büchi automata
- Refinement to Imperative/HOL
- Advanced Ramsey-based Büchi automata inclusion testing
- Parallel nested depth-first searches for LTL model checking
- Moped
- ltl2dstar
- Rabinizer
- Murphi
- Exploring the scope for partial order reduction
- The ComBack method revisited: caching strategies and extension with delayed duplicate detection
- Checking bounded reachability in asynchronous systems by symbolic event tracing
- Separation Logic
- Dijkstra Shortest Path
- Algorithm 360
- Exploiting step semantics for efficient bounded model checking of asynchronous systems
- Limit-deterministic Büchi automata for linear temporal logic
- Rabinizer: small deterministic automata for \({\mathrm{LTL}(\mathrm{F},\mathrm{G})}\)
- ltl3tela
- Strength-based decomposition of the property Büchi automaton for faster model checking
- Revisiting Resistance Speeds Up I/O-Efficient LTL Model Checking
- MoChiBA
- Owl
- Delag
- Flash memory efficient LTL model checking
This page was built for software: BEEM
