Results 1 
4 of
4
A few graphbased relational numerical abstract domains
 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 nonrelational 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 20 (1 self)
 Add to MetaCart
Abstract. This article presents the systematic design of a class of relational numerical abstract domains from nonrelational 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 shortestpath closure algorithms in exoticlike algebras. Example constructions are given in order to retrieve wellknown 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
Binary Decision Graphs
 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.
Ecient HashConsing of Recursive Types
, 2000
"... Ecient storage of types within a compiler is necessary to avoid large blowups in space during compilation. ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Ecient storage of types within a compiler is necessary to avoid large blowups in space during compilation.
Analysis of communicating infinite state machines using lattice automata
"... Communication protocols can be formally described by the Communicating FiniteState 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 FiniteState 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.