2000 search results - page 106 / 400 » Program Transformation and Proof Transformation |
142
click to vote
SIGADA
2007
Springer
15 years 9 months ago
2007
Springer
Teaching beginners predicate transformer semantics for imperative languages is not a trivial task. For Computer Science majors, the teaching of the theoretical material must be su...
138
click to vote
LOPSTR
2009
Springer
15 years 10 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...
161
click to vote
PDS
1996
15 years 4 months ago
1996
We have developed a theory of sharing which captures the behaviour of programs with respect to shared data into the framework of process algebra. The core theory can describe prog...
131
Voted
UTP
2010
15 years 1 months ago
2010
In this paper, we present various extensions of Isabelle/HOL by theories that are essential for several formal methods. First, we explain how we have developed an Isabelle/HOL theo...
125
click to vote
LISP
2008
15 years 3 months ago
2008
For functional programs, unboxing aggregate data structures such as tuples removes memory indirections and frees dead components of the decoupled structures. To explore the consequ...