25 search results - page 4 / 5 » Transformations of Logic Programs on Infinite Lists |
186
click to vote
POPL
2008
ACM
15 years 12 months ago
2008
ACM
Translation validation consists of transforming a program and a posteriori validating it in order to detect a modification of its semantics. This approach can be used in a verifie...
IJFCS
2006
14 years 11 months ago
2006
The outcome of verifying software is often a `counterexample', i.e., a listing of the actions and states of a behavior not satisfying the specification. In order to understan...
137
click to vote
CSCLP
2008
Springer
15 years 1 months ago
2008
Springer
In this paper, we present a rule-based modelling language for constraint programming, called Rules2CP. Unlike other modelling languages, Rules2CP adopts a single knowledge represen...
131
click to vote
ESOP
2000
Springer
15 years 3 months ago
2000
Springer
We exhibit a technique for automatically verifying the safety of simple C programs working on tree-shaped data structures. We do not consider the complete behavior of programs, but...
LOPSTR
2001
Springer
15 years 4 months ago
2001
Springer
Abstract. Deforestation is a well-known program transformation technique which eliminates intermediate data structures that are passed between functions. One of its weaknesses is t...