Sciweavers

325 search results - page 3 / 65
» Rewriting Strategies in Java
Sort
View
CORR
2010
Springer
174views Education» more  CORR 2010»
13 years 3 months ago
A Proof Carrying Code Framework for Inlined Reference Monitors in Java Bytecode
We propose a lightweight approach for certification of Java bytecode monitor inlining using proof-carrying code. The main purpose of such a framework is to enable development use ...
Mads Dam, Andreas Lundblad
RTA
2010
Springer
13 years 9 months ago
Automated Termination Analysis of Java Bytecode by Term Rewriting
We present an automated approach to prove termination of Java Bytecode (JBC) programs by automatically transforming them to term rewrite systems (TRSs). In this way, the numerous t...
Carsten Otto, Marc Brockschmidt, Christian von Ess...
RTA
2009
Springer
14 years 10 days ago
Loops under Strategies
Most techniques to automatically disprove termination of term rewrite systems search for a loop. Whereas a loop implies nontermination for full rewriting, this is not necessarily t...
René Thiemann, Christian Sternagel
CPAIOR
2009
Springer
14 years 11 days ago
Modelling Search Strategies in Rules2CP
In this abstract, we present a rule-based modelling language for constraint programming, called Rules2CP [1], and a library PKML for modelling packing problems. Unlike other modell...
François Fages, Julien Martin
COOTS
2001
13 years 7 months ago
Kava - Using Byte code Rewriting to add Behavioural Reflection to Java
Many authors have proposed using byte code rewriting as a way of adapting or extending the behaviour of Java There are toolkits available that simplify this process and raise the ...
Ian Welch, Robert J. Stroud