632 search results - page 85 / 127 » Proving Invariants of Functional Programs |
90
Voted
ICFP
2010
ACM
15 years 1 months ago
2010
ACM
We want assurances that sensitive information will not be disclosed when aggregate data derived from a database is published. Differential privacy offers a strong statistical guar...
141
click to vote
HASKELL
2009
ACM
15 years 7 months ago
2009
ACM
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
103
Voted
TACAS
2009
Springer
15 years 7 months ago
2009
Springer
We introduce the All-Termination(T) problem: given a termination solver, T, and a program (a set of functions), find every set of formal arguments whose consideration is sufficie...
138
click to vote
FOSSACS
2006
Springer
15 years 4 months ago
2006
Springer
Chaitin proved that register allocation is equivalent to graph coloring and hence NP-complete. Recently, Bouchez, Brisk, and Hack have proved independently that the interference gr...
109
click to vote
IJCAI
2007
15 years 1 months ago
2007
We explore an application to the game of Go of a reinforcement learning approach based on a linear evaluation function and large numbers of binary features. This strategy has prov...