2000 search results - page 50 / 400 » Program Transformation and Proof Transformation |
POPL
2010
ACM
14 years 10 months ago
2010
ACM
In this paper, we explore the potential of the theory of nested words for partial correctness proofs of recursive programs. Our conceptual contribution is a simple framework that ...
128
click to vote
OOPSLA
2009
Springer
15 years 4 months ago
2009
Springer
Model evolution is often supported by writing model transformation rules in specialized languages. This presents challenges to those who are unfamiliar with model transformation l...
IANDC
2008
14 years 10 months ago
2008
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...
GG
2004
Springer
15 years 3 months ago
2004
Springer
We propose a faithful encoding of Java programs (written in a suitable fragment of the language) to Graph Transformation Systems. Every program is translated to a set of rules incl...
VMCAI
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. This paper is concerned with one of the basic problems in abstract interpretation, namely, for a given abstraction and a given set of concrete transformers (that express ...