407 search results - page 7 / 82 » Automatic Correctness Proofs for Logic Program Transformatio... |
SAS
2010
Springer
13 years 6 months ago
2010
Springer
Recent innovations in automatic parallelizing compilers are showing impressive speedups on multicore processors using shared memory with asynchronous channels. We have formulated a...
LPAR
2010
Springer
13 years 5 months ago
2010
Springer
Traditionally, the full verification of a program's functional correctness has been obtained with pen and paper or with interactive proof assistants, whereas only reduced ver...
POPL
1995
ACM
13 years 11 months ago
1995
ACM
The goal of program transformation is to improve efficiency while preserving meaning. One of the best known transformation techniques is Burstall and Darlington’s unfold-fold me...
JFP
2000
13 years 7 months ago
2000
In this paper we present two type inference systems for detecting useless-code in higher-order typed functional programs. Type inference can be performed in an efficient and compl...
LOPSTR
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We present a method based on logic program transformation, for verifying Computation Tree Logic (CTL∗ ) properties of finite state reactive systems. The finite state ...