Granularity of constraint-based analysis for Java
Citations

WEB OF SCIENCE

0
Citations

SCOPUS

1

초록

This paper proposes a transformation-based approach to design constraint-based analyses for Java at a coarser granularity. In this approach, we design a less or equally precise but more efficient version of an original analysis by transforming the original construction rules into new ones. As applications of this rule transformation, we provide two instances of analysis design by rule-transformation. The first one designs a sparse version of class analysis for Java and the second one deals with a sparse exception analysis for Java. Both are designed based on method-level, and the sparse exception analysis is shown to give the same information for every method as the original analysis.

키워드

Constraint-based analysisConstruction rulesPartition functionSet constraintsConstraint theoryData reductionLogic programmingSet theorySyntacticsSet constraintsJava programming language
제목
Granularity of constraint-based analysis for Java
저자
Chang B.-M.Jo J.
DOI
10.1145/773184.773195
발행일
2001-09
유형
Conference Paper
저널명
Proceedings of the 3rd International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming
페이지
94 ~ 102