A Few Graph-Based Relational Numerical Abstract Domains

Details A Few Graph-Based Relational Numerical Abstract Domains A Few Graph-Based Relational Numerical Abstract Domains

2007-03-15

arxiv.org/abs/cs/0703075v2

Static Analysis Symposium (SAS) (09/2002) 117-132

Computer Science

Programming Languages

(update: reversed author first and last names)

Scientific paper

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 in 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 as well as new ones. Such domains can then be used in the Abstract Interpretation framework in order to design various static analyses. Amajor benfit of this construction is its modularity, allowing to quickly implement new abstract domains from existing ones.

Affiliated with

Also associated with

No associations

Rating

A Few Graph-Based Relational Numerical Abstract Domains does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Few Graph-Based Relational Numerical Abstract Domains, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Few Graph-Based Relational Numerical Abstract Domains will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-363597