Combinations of abstract domains for logic programming

Cortesi, Agostino; Charlier, Baudouin Le; Hentenryck, Pascal Van

doi:10.1145/174675.177880

Cited by 41 publications

(28 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Therefore the assignment may affect both instances. A correct approximation of the result in this case is D 7 .…”

Section: Abstract Assignmentsmentioning

confidence: 84%

“…Thus, to get a particular correct analysis it is sufficient to provide an adequate abstract domain and to prove a few safety conditions for this domain. This approach has proven remarkably effective for the analysis of Prolog (see, e.g., [7,8,15,19,28]). The same approach is now applied for Java.…”

Section: Abstract Interpretation Of Logic Programsmentioning

confidence: 99%

“…4. Our domains are generic, making it possible to combine them with other approaches in the spirit of [7]. For instance, we could combine the approaches of [6,14,25] with ours by using shape graphs as the 'abstract type information' when it becomes impossible to keep a (precise) homomorphic image of the concrete store.…”

Section: Pointer and Sharing Analysismentioning

confidence: 99%

“…Our next step will be to implement a generic analyzer similar to GAIA [7,8,15,19,28] based on the abstract semantics and the domains. Then we will experiment with the system to evaluate the practical value of the domain and to tune the algorithms.…”

Section: Future Workmentioning

confidence: 99%

“…2. To get more powerful results, it is convenient to combine the two abstract domains of this paper into a single one by means of reduced product [10] or open product [7] operations. This will be investigated.…”

Section: Future Workmentioning

confidence: 99%

See 4 more Smart Citations

Distinctness and Sharing Domains for Static Analysis of Java Programs

Pollet

Charlier

Cortesi

2001

ECOOP 2001 — Object-Oriented Programming

Self Cite

View full text Add to dashboard Cite

Abstract. The application field of static analysis techniques for objectoriented programming is getting broader, ranging from compiler optimizations to security issues. This leads to the need of methodologies that support reusability not only at the code level but also at higher (semantic) levels, in order to minimize the effort of proving correctness of the analyses. Abstract interpretation may be the most appropriate approach in that respect. This paper is a contribution towards the design of a general framework for abstract interpretation of Java programs. We introduce two generic abstract domains that express type, structural, and sharing information about dynamically created objects. These generic domains can be instantiated to get specific analyses either for optimization or verification issues. The semantics of the domains are precisely defined by means of concretization functions based on mappings between concrete and abstract locations. The main abstract operations, i.e., upper bound and assignment, are discussed. An application of the domains to source-to-source program specialization is sketched to illustrate the effectiveness of the analysis.

show abstract

“…Therefore the assignment may affect both instances. A correct approximation of the result in this case is D 7 .…”

Section: Abstract Assignmentsmentioning

confidence: 84%

Section: Abstract Interpretation Of Logic Programsmentioning

confidence: 99%

Section: Pointer and Sharing Analysismentioning

confidence: 99%

Section: Future Workmentioning

confidence: 99%

Section: Future Workmentioning

confidence: 99%

See 3 more Smart Citations

Distinctness and Sharing Domains for Static Analysis of Java Programs

Pollet

Charlier

Cortesi

2001

ECOOP 2001 — Object-Oriented Programming

Self Cite

View full text Add to dashboard Cite

show abstract

Uniform Closures: Order-Theoretically Reconstructing Logic Program Semantics and Abstract Domain Refinements

Giacobazzi

Ranzato

1998

Information and Computation

View full text Add to dashboard Cite

The notion of uniform closure operator is introduced, and it is shown how this concept surfaces in two di erent areas of application of abstract interpretation, notably in semantics design for logic programs and in the theory of abstract domain re nements. In logic programming, uniform closures permit to generalize, from an order-theoretic perspective, the standard hierarchy of declarative semantics. In particular, we show how to reconstruct the modeltheoretic characterization of the well-known s-semantics using pure order-theoretic concepts only. As far as the systematic re nement operators on abstract domains are concerned, we show that uniform closures capture precisely the property of a re nement of being invertible, namely of admitting a related operator that simpli es as much as possible a given abstract domain of input for that re nement. Exploiting the same argument used to reconstruct the ssemantics of logic programming, we yield a precise relationship between re nements and their inverse operators: we demonstrate that they form an adjunction with respect to a conveniently modi ed complete order among abstract domains.

show abstract

Abstract Interpretation-Based Verification of Non-functional Requirements

Cortesi

Logozzo

2005

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. The paper investigates a formal approach to the verification of non functional software requirements, e.g. portability, time and space efficiency, dependability/robustness. The key-idea is the notion of observable, i.e., an abstraction of the concrete semantics when focusing on a behavioral property of interest. By applying an abstract interpretationbased static analysis of the source program, and by a suitable choice of abstract domains, it is possible to design formal and effective tools for non-functional requirements validation.

show abstract

Combinations of abstract domains for logic programming

Cited by 41 publications

References 20 publications

Distinctness and Sharing Domains for Static Analysis of Java Programs

Distinctness and Sharing Domains for Static Analysis of Java Programs

Uniform Closures: Order-Theoretically Reconstructing Logic Program Semantics and Abstract Domain Refinements

Abstract Interpretation-Based Verification of Non-functional Requirements

Contact Info

Product

Resources

About