Sciweavers

55 search results - page 5 / 11
» Formal Analysis of Java Programs in JavaFAN
Sort
View
SAS
2007
Springer
128views Formal Methods» more  SAS 2007»
14 years 3 months ago
Magic-Sets Transformation for the Analysis of Java Bytecode
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...
Étienne Payet, Fausto Spoto
PLDI
2012
ACM
12 years 7 days ago
Fully automatic and precise detection of thread safety violations
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...
Michael Pradel, Thomas R. Gross
CADE
2004
Springer
14 years 10 months ago
Rewriting Logic Semantics: From Language Specifications to Formal Analysis Tools
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...
José Meseguer, Grigore Rosu
FMCO
2007
Springer
14 years 4 months ago
COSTA: Design and Implementation of a Cost and Termination Analyzer for Java Bytecode
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, (...
Elvira Albert, Puri Arenas, Samir Genaim, German P...
SAS
2009
Springer
147views Formal Methods» more  SAS 2009»
14 years 10 months ago
The Complexity of Andersen's Analysis in Practice
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...
Manu Sridharan, Stephen J. Fink