632 search results - page 32 / 127 » Proving Invariants of Functional Programs |
97
Voted
MOR
2010
14 years 11 months ago
2010
We explicitly solve the optimal switching problem for one-dimensional diffusions by directly employing the dynamic programming principle and the excessive characterization of the ...
87
Voted
ICFP
2007
ACM
16 years 15 days ago
2007
ACM
Filinski showed that callcc and a single mutable reference cell are sufficient to express the delimited control operators shift and reset. However, this implementation interacts p...
105
Voted
CORR
2010
Springer
15 years 19 days ago
2010
Springer
The classical technique for proving termination of a generic sequential computer program involves the synthesis of a ranking function for each loop of the program. Linear ranking ...
124
Voted
ECOOP
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. Generic types in C behave invariantly with respect to subtyping. We propose a system of type-safe variance for C that supports the declaration of covariant and contravari...
99
Voted
SCP
2008
15 years 14 days ago
2008
An unpublished algorithm of Haldar and Vidyasankar implements an atomic variable of an arbitrary type T for one writer and one reader by means of 4 unsafe variables of type T , th...