Sciweavers

1210 search results - page 27 / 242
» Formal Techniques for Java Programs
Sort
View
PEPM
2007
ACM
15 years 8 months ago
XML graphs in program analysis
XML graphs have shown to be a simple and effective formalism for representing sets of XML documents in program analysis. It has evolved through a six year period with variants tai...
Anders Møller, Michael I. Schwartzbach
ENTCS
2007
168views more  ENTCS 2007»
15 years 1 months ago
Bytecode Rewriting in Tom
In this paper, we present a term rewriting based library for manipulating Java bytecode. We define a mapping from bytecode programs to algebraic terms, and we use Tom, an extensi...
Emilie Balland, Pierre-Etienne Moreau, Antoine Rei...
PLDI
2010
ACM
15 years 7 months ago
An analysis of the dynamic behavior of JavaScript programs
The JavaScript programming language is widely used for web programming and, increasingly, for general purpose computing. As such, improving the correctness, security and performan...
Gregor Richards, Sylvain Lebresne, Brian Burg, Jan...
ENTCS
2007
104views more  ENTCS 2007»
15 years 1 months ago
Algorithmic Debugging of Java Programs
In this paper we propose applying the ideas of declarative debugging to the object-oriented language Java as an alternative to traditional trace debuggers used in imperative langu...
Rafael Caballero, Christian Hermanns, Herbert Kuch...
135
Voted
FIDJI
2003
Springer
15 years 7 months ago
Model Generation for Distributed Java Programs
— We present techniques for analyzing the source code of distributed Java applications, and building finite models of their behaviour. The models are labelled transition systems...
Rabéa Boulifa, Eric Madelaine