437 search results - page 70 / 88 » Proving Termination by Divergence |
JLP
2006
13 years 7 months ago
2006
We introduce CoCasl as a light-weight but expressive coalgebraic extension of the algebraic specification language Casl. CoCasl allows the nested combination of algebraic datatype...
SIAMSC
2010
13 years 6 months ago
2010
For the finite volume discretization of a second-order elliptic model problem, we derive a posteriori error estimates which take into account an inexact solution of the associated...
FPL
2010
Springer
13 years 5 months ago
2010
Springer
We demonstrate how Field Programmable Gate Arrays (FPGAs) may be used to address the computing challenges associated with assembling genome sequences from recent ultra-high-through...
POPL
2005
ACM
14 years 8 months ago
2005
ACM
We present Rhodium, a new language for writing compiler optimizations that can be automatically proved sound. Unlike our previous work on Cobalt, Rhodium expresses optimizations u...
CADE
2008
Springer
14 years 8 months ago
2008
Springer
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...