On the non-termination of MDG-based abstract state enumeration
From MaRDI portal
Publication:1399962
DOI10.1016/S0304-3975(01)00345-0zbMath1028.68102OpenAlexW1977833242MaRDI QIDQ1399962
Xiaoyu Song, Eduard Cerny, Otmane Ait Mohamed
Publication date: 30 July 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(01)00345-0
Related Items
NuMDG: a new tool for multiway decision graphs construction, Automatic verification of reduction techniques in higher order logic, LCF-style Platform based on Multiway Decision Graphs, A New Approach for the Construction of Multiway Decision Graphs
Cites Work
- Schematization of infinite sets of rewrite rules generated by divergent completion processes
- Recurrence domains: Their unification and application to logic programming
- Graph-Based Algorithms for Boolean Function Manipulation
- Completion of rewrite systems with membership constraints
- On finite representations of infinite sequences of terms
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item