Results 1 - 8 of 8

A few graph-based relational numerical abstract domains

by Antoine Miné - Static Analysis: Proceedings of the 9th International Symposium , 2002
"... Abstract. This article presents the systematic design of a class of relational numerical abstract domains from non-relational ones. Constructed domains represent sets of invariants of the form (vj − vi ∈ C), where vj and vi are two variables, and C lives in an abstraction of P(Z), P(Q), or P(R). We ..."
Abstract - Cited by 25 (1 self) - Add to MetaCart
Abstract. This article presents the systematic design of a class of relational numerical abstract domains from non-relational ones. Constructed domains represent sets of invariants of the form (vj − vi ∈ C), where vj and vi are two variables, and C lives in an abstraction of P(Z), P(Q), or P(R). We will call this family of domains weakly relational domains. The underlying concept allowing this construction is an extension of potential graphs and shortest-path closure algorithms in exotic-like algebras. Example constructions are given in order to retrieve well-known domains Interpretation framework in order to design various static analyses. A major benefit of this construction is its modularity, allowing to quickly implement new abstract domains from existing ones. 1
(Show Context)

Binary Decision Graphs

by Laurent Mauborgne - Static Analyis Symposium SAS’99, LNCS 1694 , 1999
"... Binary Decision Graphs are an extension of Binary Decision Diagrams that can represent some infinite boolean functions. Three refinements of BDGs corresponding to classes of infinite functions of increasing complexity are presented. The first one is closed by intersection and union, the second o ..."
Abstract - Cited by 6 (3 self) - Add to MetaCart
Binary Decision Graphs are an extension of Binary Decision Diagrams that can represent some infinite boolean functions. Three refinements of BDGs corresponding to classes of infinite functions of increasing complexity are presented. The first one is closed by intersection and union, the second one by intersection, and the last one by all boolean operations. The first two classes give rise to a canonical representation, which, when restricted to finite functions, are the classical BDDs. The paper also gives new insights in to the notion of variable names and the possibility of sharing variable names that can be of interest in the case of finite functions.
(Show Context)

Efficient Hash-Consing of Recursive Types

by Jeffrey Considine , 2000
"... Efficient storage of types within a compiler is necessary to avoid large blowups in space during compilation. Recursive ..."
Abstract - Cited by 6 (1 self) - Add to MetaCart
Efficient storage of types within a compiler is necessary to avoid large blowups in space during compilation. Recursive

Incremental algorithms and a minimal graph representation for regular trees. Available from http://www.ps.uni-sb.de/~horbach/fopra.html

by Matthias Horbach, Sven Woop , 2002
"... In this paper we present an ecient way of representing regular trees, which allows operations such as subtree checking and equality tests to be computed eciently. To do so, we represent regular trees as minimal graphs which are constructed incrementally. Our work is primarily based on the paper An i ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
In this paper we present an ecient way of representing regular trees, which allows operations such as subtree checking and equality tests to be computed eciently. To do so, we represent regular trees as minimal graphs which are constructed incrementally. Our work is primarily based on the paper An incremental unique Rep-resentation for Regular Trees [1] by Laurent Mauborgne, where he studies an algorithm that incrementally nds a unique, minimized representation for regular trees in time O(n2). We rene some of his algorithms to gain better complexity, and give a proof of correctness. Furthermore we give our work a theoretical base that allows us to develop useful properties of the trees and graphs we work on, as well as the possibility to use hashing techniques on regular trees.

Analysis of communicating infinite state machines using lattice automata

by Tristan Le Gall, Bertrand Jeannet
"... Communication protocols can be formally described by the Communicating Finite-State Machines (CFSM) model. This model is expressive, but not expressive enough to deal with complex protocols that involve structured messages encapsulating integers or lists of integers. This is the reason why we propos ..."
Abstract - Cited by 3 (1 self) - Add to MetaCart
Communication protocols can be formally described by the Communicating Finite-State Machines (CFSM) model. This model is expressive, but not expressive enough to deal with complex protocols that involve structured messages encapsulating integers or lists of integers. This is the reason why we propose an extension of this model: the Symbolic Communicating Machines (SCM). We also propose an approximate reachability analysis method, based on lattice automata. Lattice automata are finite automata, the transitions of which are labeled with elements of an atomic lattice. We tackle the problem of the determinization as well as the definition of a widening operator for these automata. We also show that lattice automata are useful for the interprocedural analysis.
(Show Context)

Infinitary Relations and Their Representation DI, Abstract

by Laurent Mauborgne
"... This papers presents extensions of Binary Decision Diagrams 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 ot ..."
Abstract - Add to MetaCart
This papers presents extensions of Binary Decision Diagrams 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.
(Show Context)

Nordic Journal of Computing An Incremental Unique Representation for Regular Trees

by Laurent Mauborgne, École Normale Supérieure
"... Abstract. In order to deal with infinite regular trees (or other pointed graph structures) efficiently, we give new algorithms to store such structures. The trees are stored in such a way that their representation is unique and shares substructures as much as possible. This maximal sharing allows su ..."
Abstract - Add to MetaCart
Abstract. In order to deal with infinite regular trees (or other pointed graph structures) efficiently, we give new algorithms to store such structures. The trees are stored in such a way that their representation is unique and shares substructures as much as possible. This maximal sharing allows substantial memory gain and speed up over previous techniques. For example, equality testing becomes constant time (instead of O(n log(n))). The algorithms are incremental, and as such allow good reactive behavior. These new algorithms are then applied in a representation of sets of trees. The expressive power of this new representation is exactly what is needed by the original set-based analyses of Heintze and Jaffar [1990], or Heintze [1994]. CR Classification: See Computing Revues

IT

by Tristan Le Gall, Hal Id Inria , 2007
"... HAL is a multi-disciplinary open access archive for the deposit and dissemination of sci-entific research documents, whether they are pub-lished or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte p ..."
Abstract - Add to MetaCart
HAL is a multi-disciplinary open access archive for the deposit and dissemination of sci-entific research documents, whether they are pub-lished or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et a ̀ la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés. I R
(Show Context)