632 search results - page 34 / 127 » Proving Invariants of Functional Programs |
LOPSTR
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Termination of binary CLP programs has recently become an important question in the termination analysis community. The reason for this is due to that a number of approac...
119
Voted
CAV
2006
Springer
15 years 4 months ago
2006
Springer
We introduce calling context graphs and various static and theorem proving based analyses that together provide a powerful method for proving termination of programs written in fea...
290
click to vote
ACTA
2011
14 years 7 months ago
2011
A simple mutual exclusion algorithm is presented that only uses nonatomic shared variables of bounded size, and that satisfies bounded overtaking. When the shared variables behave...
JFP
2002
15 years 6 days ago
2002
We systematically develop a functional program that solves the countdown problem, a numbers game in which the aim is to construct arithmetic expressions satisfying certain constra...
228
click to vote
ICFP
2009
ACM
16 years 1 months ago
2009
ACM
GADTs have proven to be an invaluable language extension, a.o. for ensuring data invariants and program correctness. Unfortunately, they pose a tough problem for type inference: w...