55 search results - page 5 / 11 » Formal Analysis of Java Programs in JavaFAN |
105
click to vote
SAS
2007
Springer
15 years 8 months ago
2007
Springer
Denotational static analysis of Java bytecode has a nice and clean compositional definition and an efficient implementation with binary decision diagrams. But it models only the f...
169
click to vote
PLDI
2012
ACM
13 years 4 months ago
2012
ACM
Concurrent, object-oriented programs often use thread-safe library classes. Existing techniques for testing a thread-safe class either rely on tests using the class, on formal spe...
136
click to vote
CADE
2004
Springer
16 years 2 months ago
2004
Springer
Formal semantic definitions of concurrent languages, when specified in a well-suited semantic framework and supported by generic and efficient formal tools, can be the basis of pow...
109
click to vote
FMCO
2007
Springer
15 years 8 months ago
2007
Springer
This paper describes the architecture of costa, an abstract interpretation based cost and termination analyzer for Java bytecode. The system receives as input a bytecode program, (...
111
click to vote
SAS
2009
Springer
16 years 2 months ago
2009
Springer
Abstract. While the tightest proven worst-case complexity for Andersen's points-to analysis is nearly cubic, the analysis seems to scale better on real-world codes. We examine...