132 search results - page 2 / 27 » A Rewriting Logic Semantics Approach to Modular Program Anal... |
CADE
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. An approach based on term rewriting techniques for the automated termination analysis of imperative programs operating on integers is presented. An imperative program is ...
PPDP
2007
Springer
13 years 10 months ago
2007
Springer
Non-confluent and non-terminating rewrite systems are interesting from the point of view of programming. In particular, existing functional logic languages use such kind of rewri...
ESORICS
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. Security policies, in particular access control, are fundamental elements of computer security. We address the problem of authoring and analyzing policies in a modular wa...
LOPSTR
2009
Springer
13 years 11 months ago
2009
Springer
We show how to combine the two most powerful approaches for automated termination analysis of logic programs (LPs): the direct approach which operates directly on LPs and the trans...
RTA
2011
Springer
12 years 7 months ago
2011
Springer
In [5, 15] we presented an approach to prove termination of non-recursive Java Bytecode (JBC) programs automatically. Here, JBC programs are first transformed to finite terminat...