Cited in
(59)- Model checking concurrent programs
- Automated compositional abstraction refinement for concurrent C programs: a two-level approach
- Automated deadlock detection in synchronized reentrant multithreaded call-graphs
- Program Analysis Using Weighted Pushdown Systems
- Lost in abstraction: monotonicity in multi-threaded programs
- Bounded communication reachability analysis of process rewrite systems with ordered parallelism
- Simulation for lattice-valued doubly labeled transition systems
- A model checking-based approach for security policy verification of mobile systems
- Interprocedural Analysis of Concurrent Programs Under a Context Bound
- SAT-solving in CSP trace refinement
- Partial order reduction for state/event LTL with application to component-interaction automata
- On the Reachability Analysis of Acyclic Networks of Pushdown Systems
- Static Analysis of Multithreaded Recursive Programs Communicating via Rendez-Vous
- Model checking dynamic pushdown networks
- A rewriting-based model checker for the linear temporal logic of rewriting
- Partial Order Reduction for State/Event LTL
- Unbounded model-checking with interpolation for regular language constraints
- Integrated Formal Methods
- Finding Concurrency-Related Bugs Using Random Isolation
- Concurrent software verification with states, events, and deadlocks
- Unboundedness problems for languages of vector addition systems
- CLPS-B
- D-Finder
- GeneSyst
- jMoped
- SLMC
- COWS
- Orc
- ComFoRT
- Tools and Algorithms for the Construction and Analysis of Systems
- Bandera
- SymmExtractor
- Bebop
- SymmPa
- Threader
- Banshee
- TLPVS
- The Linear Temporal Logic of Rewriting Maude Model Checker
- A formal model for service-oriented interactions
- Aglets
- monabs
- DDVerify
- Moped
- Magiclock
- Program-Conflict-Analysis
- On the analysis of interacting pushdown systems
- Efficient verification of concurrent systems using local-analysis-based approximations and SAT solving
- Revisiting underapproximate reachability for multipushdown systems
- Parallel assignments in software model checking
- Verifying Parallel Programs with Dynamic Communication Structures
- Reducing concurrent analysis under a context bound to sequential analysis
- Verifying parallel programs with dynamic communication structures
- Verification of Boolean programs with unbounded thread creation
- Efficient verification of sequential and concurrent C programs
- The Temporal Logic of Rewriting: A Gentle Introduction
- A complete refinement procedure for regular separability of context-free languages
- Counterexample-guided abstraction refinement for symmetric concurrent programs
- Verifying multithreaded recursive programs with integer variables
- State/Event Software Verification for Branching-Time Specifications
This page was built for software: MAGIC
