Tree data decision diagrams

Authors:
Jean-Michel COUVREUR;Duy-Tung NGUYEN
Affiliations:
Laboratoire d'Informatique Fondamentale d'Orl éans, University of Orleans, Orleans;Laboratoire d'Informatique Fondamentale d'Orl éans, University of Orleans, Orleans
Venue:
VECoS'08 Proceedings of the Second international conference on Verification and Evaluation of Computer and Communication Systems
Year:
2008

Citing 8
Cited 1

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
Three partition refinement algorithms

SIAM Journal on Computing
Data Decision Diagrams for Petri Net Analysis

ICATPN '02 Proceedings of the 23rd International Conference on Applications and Theory of Petri Nets
Termination of String Rewriting Proved Automatically

Journal of Automated Reasoning
Formal methods for embedded distributed systems: how to master the complexity

Formal methods for embedded distributed systems: how to master the complexity
Bisimulation minimization of tree automata

CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
Hierarchical decision diagrams to exploit model structure

FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Termination Of Term Rewriting By Semantic Labelling

Fundamenta Informaticae

Functional term rewriting systems towards symbolic model-checking

International Journal of Critical Computer-Based Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present Tree Data Decision Diagrams, a compact data structure of symbolic verification based on term rewriting systems. By this way, we can benefit termination researches in term rewriting systems to improve the model-checking quality. Our experimental implementation uses tree automata technique that provides the capability to maintain the internal representation of data in canonical form.