On the non-termination of MDG-based abstract state enumeration
From MaRDI portal
Publication:1399962
Recommendations
Cites work
- scientific article; zbMATH DE number 67477 (Why is no real title available?)
- scientific article; zbMATH DE number 177271 (Why is no real title available?)
- scientific article; zbMATH DE number 1300970 (Why is no real title available?)
- scientific article; zbMATH DE number 1324446 (Why is no real title available?)
- Completion of rewrite systems with membership constraints
- Graph-Based Algorithms for Boolean Function Manipulation
- On finite representations of infinite sequences of terms
- Recurrence domains: Their unification and application to logic programming
- Schematization of infinite sets of rewrite rules generated by divergent completion processes
Cited in
(5)- LCF-style Platform based on Multiway Decision Graphs
- Automatic verification of reduction techniques in higher order logic
- scientific article; zbMATH DE number 1324665 (Why is no real title available?)
- A New Approach for the Construction of Multiway Decision Graphs
- NuMDG: a new tool for multiway decision graphs construction
This page was built for publication: On the non-termination of MDG-based abstract state enumeration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1399962)