Infinitary relations and their representation

Authors:
Laurent Mauborgne
Affiliations:
DI, École Normale Supérieure, 45 rue d'Ulm, 75230 Paris cedex 05, France
Venue:
Science of Computer Programming - Special issue on static analysis (SAS'99)
Year:
2003

Citing 11
Cited 0

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
Symbolic Boolean manipulation with ordered binary-decision diagrams

ACM Computing Surveys (CSUR)
Groundness analysis for Prolog: implementation and evaluation of domain prop

PEPM '93 Proceedings of the 1993 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Abstract interpretation using typed decision graphs

Science of Computer Programming
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The Complementation Problem for Büchi Automata with Applications to Temporal Logic (Extended Abstract)

Proceedings of the 12th Colloquium on Automata, Languages and Programming
A Reactive Implementation of Pos Using ROBDDs

PLILP '96 Proceedings of the 8th International Symposium on Programming Languages: Implementations, Logics, and Programs
Tree Schemata and Fair Termination

SAS '00 Proceedings of the 7th International Symposium on Static Analysis
Parametric Circuit Representation Using Inductive Boolean Functions

CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
The anchored version of the temporal framework

Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
An incremental unique representation for regular trees

Nordic Journal of Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This papers presents extensions of Binary Decision Diagrams (BDDs) to represent some infinitary relations (coded as infinite boolean functions). Four classes of infinitary relations are presented, and their representations are discussed. The widest class is closed under all boolean operations. The three others give rise to a canonical representation, which, when restricted to finite relations, are the classical BDDs. The paper also gives new insights in to the notion of variables and the possibility of sharing variables that can be of interest in the case of finite relations.