797 search results - page 69 / 160 » Eliminating Proofs from Programs |
ESOP
2007
Springer
15 years 6 months ago
2007
Springer
There is a growing concern on anonymity and privacy on the Internet, resulting in lots of work on formalization and verification of anonymity. Especially, importance of probabilis...
92
Voted
ESOP
2010
Springer
15 years 4 months ago
2010
Springer
Parsing is an important problem in computer science and yet surprisingly little attention has been devoted to its formal verification. In this paper, we present TRX: a parser inter...
121
click to vote
ESOP
2008
Springer
15 years 2 months ago
2008
Springer
A data structure is said to be persistent when any update operation returns a new structure without altering the old version. This paper introduces a new notion of persistence, cal...
SIAMCOMP
2000
15 years 13 days ago
2000
We present a linear programming-based method for nding \gadgets", i.e., combinatorial structures reducing constraints of one optimization problem to constraints of another. A...
COCO
2003
Springer
15 years 5 months ago
2003
Springer
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...