77 search results - page 7 / 16 » Partiality and Nondeterminacy in Program Proofs |
149
click to vote
JUCS
2006
15 years 4 months ago
2006
Abstract: We present a novel approach to the verification of functional-logic programs. For our verification purposes, equational reasoning is not valid due to the presence of non-...
112
click to vote
ICFP
2000
ACM
15 years 8 months ago
2000
ACM
We show that a non-duplicating transformation into Continuation-Passing Style (CPS) has no effect on control-flow analysis, a positive effect on binding-time analysis for tradi...
140
click to vote
LICS
1994
IEEE
15 years 8 months ago
1994
IEEE
In this paper we study the interaction of subtyping and parametricity. We describe a logic for a programming language with parametric polymorphism and subtyping. The logic support...
143
click to vote
POPL
2010
ACM
15 years 4 months ago
2010
ACM
In this paper, we explore the potential of the theory of nested words for partial correctness proofs of recursive programs. Our conceptual contribution is a simple framework that ...
165
click to vote
ICFP
2004
ACM
16 years 4 months ago
2004
ACM
Concurrency, as a useful feature of many modern programming languages and systems, is generally hard to reason about. Although existing work has explored the verification of concu...