Cited in
(12)- Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains
- Model checking procedural programs
- Faster algorithms for weighted recursive state machines
- Abstraction refinement with Craig interpolation and symbolic pushdown systems
- scientific article; zbMATH DE number 1948384 (Why is no real title available?)
- Rewriting Models of Boolean Programs
- MOPED
- Moped
- WALi
- Reducing concurrent analysis under a context bound to sequential analysis
- Modeling and verification of infinite systems with resources
- Faster pushdown reachability analysis with applications in network verification
This page was built for software: jMoped
