Sciweavers

325 search results - page 11 / 65
» Rewriting Strategies in Java
Sort
View
89
Voted
BIRTHDAY
2010
Springer
14 years 7 months ago
Termination Graphs for Java Bytecode
To prove termination of Java Bytecode (JBC) automatically, we transform JBC to finite termination graphs which represent all possible runs of the program. Afterwards, the graph can...
Marc Brockschmidt, Carsten Otto, Christian von Ess...
ENTCS
2000
123views more  ENTCS 2000»
14 years 9 months ago
Defining Standard Prolog in Rewriting Logic
The coincidence between the model-theoretic and the procedural semantics of SLDresolution does not carry over to a Prolog system that also implements non-logical features like cut...
Marija Kulas, Christoph Beierle
AGTIVE
2003
Springer
15 years 2 months ago
Integrating Graph Rewriting and Standard Software Tools
OptimixJ is a graph rewrite tool that can be embedded easily into the standard software process. Applications and models can be developed in Java or UML and extended by graph rewri...
Uwe Aßmann, Johan Lövdahl
IASTEDSEA
2004
14 years 11 months ago
Higher-order strategic programming: A road to software assurance
Program transformation through the repeated application of simple rewrite rules is conducive to formal verification. In practice, program transformation oftentimes requires data t...
Victor L. Winter, Steve Roach, Fares Fraij
RTA
2007
Springer
15 years 3 months ago
Rewriting Approximations for Fast Prototyping of Static Analyzers
This paper shows how to construct static analyzers using tree automata and rewriting techniques. Starting from a term rewriting system representing the operational semantics of the...
Yohan Boichut, Thomas Genet, Thomas P. Jensen, Luk...