Sciweavers

203 search results - page 1 / 41
» Datatype-Generic Termination Proofs
Sort
View
MST
2008
121views more  MST 2008»
13 years 4 months ago
Datatype-Generic Termination Proofs
Abstract. Datatype-generic programs are programs that are parameterised by a datatype. We review the allegorical foundations of a methodology of designing datatype-generic programs...
Roland Carl Backhouse, Henk Doornbos
CIE
2006
Springer
13 years 8 months ago
Datatype-Generic Reasoning
Abstract. Datatype-generic programs are programs that are parameterised by a datatype. Designing datatype-generic programs brings new challenges and new opportunities. We review th...
Roland Carl Backhouse
CORR
2012
Springer
232views Education» more  CORR 2012»
12 years 11 days ago
A Formal Comparison of Approaches to Datatype-Generic Programming
-generic programming increases program abstraction and reuse by making functions operate uniformly across different types. Many approaches to generic programming have been proposed...
José Pedro Magalhães, Andres Lö...
RTA
2011
Springer
12 years 7 months ago
Modular Termination Proofs of Recursive Java Bytecode Programs by Term Rewriting
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...
Marc Brockschmidt, Carsten Otto, Jürgen Giesl
CAV
2012
Springer
270views Hardware» more  CAV 2012»
11 years 7 months ago
Automated Termination Proofs for Java Programs with Cyclic Data
Abstract. In earlier work, we developed a technique to prove termination of Java programs automatically: first, Java programs are automatically transformed to term rewrite systems...
Marc Brockschmidt, Richard Musiol, Carsten Otto, J...