Tree Data Decision Diagrams

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.

Content

Author and article information

Contributors

Jean-Michel COUVREUR

Conference

Publication date: July 2008

Publication date (Print): July 2008

Pages: 1-11

Affiliations

[0001]LIFO (Laboratoire d’Informatique Fondamentale d’Orléans)

University of Orleans

Léonard de Vinci street B.P. 6759, F-45067 ORLEANS Cedex 2

http://www.univ-orleans.fr/lifo/

Article

DOI: 10.14236/ewic/VECOS2008.3

SO-VID: 283d3ed0-e097-4b17-a978-ddd4aaa94073

License:

This work is licensed under a Creative Commons Attribution 4.0 Unported License. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/

Conference name: Second International Workshop on Verification and Evaluation of Computer and Communication Systems (VECoS 2008)

Conference acronym: VECoS

Conference number:

Conference location: Leeds, UK

Conference date: 2 - 3 July 2008

Conference sponsor: Electronic Workshops in Computing (eWiC)

Conference theme: Verification and Evaluation of Computer and Communication Systems

History

Product

1477-9358 BCS Learning & Development

Self URI (article page): https://www.scienceopen.com/hosted-document?doi=10.14236/ewic/VECOS2008.3

Self URI (journal page): https://ewic.bcs.org/

Celebrating 65 years of The Computer Journal - free-to-read perspectives - bcs.org/tcj65

Tree Data Decision Diagrams

Abstract