Sciweavers

18 search results - page 1 / 4
» A Term Rewriting Approach to the Automated Termination Analy...
Sort
View
CADE
2009
Springer
14 years 5 months ago
A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs
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 ...
Stephan Falke, Deepak Kapur
RTA
2010
Springer
13 years 8 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...
IANDC
2008
131views more  IANDC 2008»
13 years 5 months ago
Termination of just/fair computations in term rewriting
The main goal of this paper is to apply rewriting termination technology --enjoying a quite mature set of termination results and tools-- to the problem of proving automatically t...
Salvador Lucas, José Meseguer
AAECC
2005
Springer
128views Algorithms» more  AAECC 2005»
13 years 4 months ago
The size-change principle and dependency pairs for termination of term rewriting
Abstract In [24], a new size-change principle was proposed to verify termination of functional programs automatically. We extend this principle in order to prove termination and in...
René Thiemann, Jürgen Giesl
PEPM
2010
ACM
13 years 6 months ago
A3PAT, an approach for certified automated termination proofs
Software engineering, automated reasoning, rule-based programming or specifications often use rewriting systems for which termination, among other properties, may have to be ensur...
Evelyne Contejean, Andrey Paskevich, Xavier Urbain...