Modular Class Analysis with DATALOG

Besson, Frédéric; Jensen, Thomas

doi:10.1007/3-540-44898-5_2

Cited by 11 publications

(10 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Modular analysis has received considerable attention in different programming paradigms, ranging from, e.g., logic programming [14,11,8] to object-oriented programming [22,6,19]. A general theoretical framework for modular abstract interpretation analysis was defined in [13], but most of the existing works regarding modular analysis have focused on specific analyses with particular properties and using more or less ad-hoc techniques.…”

Section: Discussionmentioning

confidence: 99%

Modular Termination Analysis of Java Bytecode and Its Application to phoneME Core Libraries

Ramírez-Deantes

Fernández

Puebla

2012

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Termination analysis has received considerable attention, traditionally in the context of declarative programming and, recently, also for imperative and Object Oriented (OO) languages. In fact, there exist termination analyzers for OO which are capable of proving termination of medium size applications by means of global analysis, in the sense that all the code used by such applications has to be proved terminating. However, global analysis has important weaknesses, such as its high memory requirements and its lack of efficiency, since often some parts of the code have to be analyzed over and over again, libraries being a paramount example of this. In this work we present how to extend the termination analysis in the COSTA system in order to make it modular by allowing separate analysis of individual methods. The proposed approach has been implemented. We report on its application to the termination analysis of the core libraries of the phoneME project, a well-known open source implementation of Java Micro Edition (JavaME), a realistic but reduced version of Java to be run on mobile phones and PDAs. We argue that such experiments are relevant, since handling libraries is known to be one of the most relevant open problems in analysis and verification of real-life applications. Our experimental results show that our proposal dramatically reduces the amount of code which needs to be handled in each analysis and that this allows proving termination of a good number of methods for which global analysis is unfeasible.

show abstract

Section: Discussionmentioning

confidence: 99%

Modular Termination Analysis of Java Bytecode and Its Application to phoneME Core Libraries

Ramírez-Deantes

Fernández

Puebla

2012

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…BDDs have recently been used in a number of program analyses such as predicate abstraction [5], shape analysis [36,59], class analyses of object-oriented programs [8] and, in particular, points-to analysis [7,60,61]. These analyses use BDD libraries directly, without additional abstraction to ease implementation.…”

Section: Related Workmentioning

confidence: 99%

Context-sensitive program analysis as database queries

Lam

Whaley

Livshits

et al. 2005

Proceedings of the Twenty-Fourth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems

141

100

View full text Add to dashboard Cite

Program analysis has been increasingly used in software engineering tasks such as auditing programs for security vulnerabilities and finding errors in general. Such tools often require analyses much more sophisticated than those traditionally used in compiler optimizations. In particular, context-sensitive pointer alias information is a prerequisite for any sound and precise analysis that reasons about uses of heap objects in a program. Context-sensitive analysis is challenging because there are over 10 14 contexts in a typical large program, even after recursive cycles are collapsed. Moreover, pointers cannot be resolved in general without analyzing the entire program.This paper presents a new framework, based on the concept of deductive databases, for context-sensitive program analysis. In this framework, all program information is stored as relations; data access and analyses are written as Datalog queries. To handle the large number of contexts in a program, the database represents relations with binary decision diagrams (BDDs). The system we have developed, called bddbddb, automatically translates database queries into highly optimized BDD programs.Our preliminary experiences suggest that a large class of analyses involving heap objects can be described succinctly in Datalog and implemented efficiently with BDDs. To make developing application-specific analyses easy for programmers, we have also created a language called PQL that makes a subset of Datalog queries more intuitive to define. We have used the language to find many security holes in Web applications.

show abstract

“…4 in Line 6) is a generated unique identifier for a method; after that, the declaring class is specified, followed by the method's name, its visibility (default), an encoding of the method's modifiers using boolean values (omitted for brevity), the return type, the parameter types along with parameter annotations and the list of declared exceptions. 3 The analysis is specified as the visitor(Class) query in Listing 1.3 Line 10. The query identifies visitor classes that do not implement a visit method for every subtype of the annotation parameter, but which are marked with the @Visitor(Type) annotation.…”

Section: Data Model and Prolog Based Analysesmentioning

confidence: 99%

“…Many classical program analysis problems can be readily encoded into deductive frameworks [13] and various practical implementations have been stemmed based on such encodings. E.g., Besson and Jensen [3] discuss the implementation of a class analysis using Datalog.…”

Section: Related Workmentioning

confidence: 99%

Automatic Incrementalization of Prolog Based Static Analyses

Eichberg

Kahl

Saha

et al. 2006

Practical Aspects of Declarative Languages

View full text Add to dashboard Cite

Abstract. Modern development environments integrate various static analyses into the build process. Analyses that analyze the whole project whenever the project changes are impractical in this context. We present an approach to automatic incrementalization of analyses that are specified as tabled logic programs and evaluated using incremental tabled evaluation, a technique for efficiently updating memo tables in response to changes in facts and rules. The approach has been implemented and integrated into the Eclipse IDE. Our measurements show that this technique is effective for automatically incrementalizing a broad range of static analyses.

show abstract

Modular Class Analysis with DATALOG

Cited by 11 publications

References 24 publications

Modular Termination Analysis of Java Bytecode and Its Application to phoneME Core Libraries

Modular Termination Analysis of Java Bytecode and Its Application to phoneME Core Libraries

Context-sensitive program analysis as database queries

Automatic Incrementalization of Prolog Based Static Analyses

Contact Info

Product

Resources

About