118
click to vote
ESOP
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...
118
click to vote
ESOP
15 years 2 months ago
2008 Springer 
Abstract. We survey recent developments in an approach to the verification of higher-order computation based on game semantics. Higherorder recursion schemes are in essence (progra...
118
Voted
ESOP
15 years 2 months ago
2008 Springer
This paper defines the cover of a formula with respect to a set of variables V in theory T to be the strongest quantifier-free formula that is implied by V : in theory T. Cover e...
103
click to vote
ESOP
15 years 2 months ago
2008 Springer
In an optimistic approach to security, one can often simplify protocol design by relying on audit logs, which can be analyzed a posteriori. Such auditing is widely used in practice...
113
Voted
ESOP
15 years 2 months ago
2008 Springer
Abstract. The concurrent constraint pi-calculus (cc-pi-calculus) has been introduced as a model for concluding Service Level Agreements. The cc-pi calculus combines the synchronous...
|
Programming Languages