407 search results - page 21 / 82 » Automatic Correctness Proofs for Logic Program Transformatio... |
CIE
2005
Springer
14 years 1 months ago
2005
Springer
L APPROACH TO ABSTRACT ALGEBRA THIERRY COQUAND AND HENRI LOMBARDI Recent work in constructive mathematics show that Hilbert’s program works rge part of abstract algebra. Using in...
RTA
2011
Springer
12 years 10 months ago
2011
Springer
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...
IJFCS
2008
13 years 7 months ago
2008
Abstract. We present an approach to verification of parameterized systems, which is based on program transformation technique known as supercompilation. In this approach the statem...
CONCUR
2004
Springer
14 years 1 months ago
2004
Springer
We present a trace semantics for a language of parallel programs which share access to mutable data. We introduce a resource-sensitive logic for partial correctness, based on a re...
SCP
2008
13 years 7 months ago
2008
This paper shows that program algebra (PGA) [8] offers a mathematical and systematic framework for reasoning about correctness and equivalence of algorithms and transformation rul...