632 search results - page 64 / 127 » Proving Invariants of Functional Programs |
110
click to vote
ESOP
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. General refinement types allow types to be refined by predicates written in a general-purpose programming language, and can express function pre- and postconditions and d...
108
click to vote
LPAR
1999
Springer
15 years 4 months ago
1999
Springer
Abstract. Walther’s estimation calculus was designed to prove the termination of functional programs, and can also be used to solve the similar problem of proving the well-founde...
124
Voted
FCT
2005
Springer
15 years 6 months ago
2005
Springer
We prove optimal lower bounds for multilinear circuits and for monotone circuits with bounded depth. These lower bounds state that, in order to compute certain functions, these cir...
206
Voted
ICFP
2009
ACM
16 years 1 months ago
2009
ACM
Purely functional programs should run well on parallel hardware because of the absence of side effects, but it has proved hard to realise this potential in practice. Plenty of pap...
203
Voted
POPL
2008
ACM
16 years 27 days ago
2008
ACM
We propose a novel approach to proving the termination of heapmanipulating programs, which combines separation logic with cyclic proof within a Hoare-style proof system. Judgement...