6274 search results - page 246 / 1255 » Proofs, Programs, Processes |
201
click to vote
ESOP
2006
Springer
15 years 10 months ago
2006
Springer
We present a sound and complete proof technique, based on syntactic logical relations, for showing contextual equivalence of expressions in a -calculus with recursive types and imp...
179
click to vote
CCS
2008
ACM
15 years 8 months ago
2008
ACM
A recent development in formal security protocol analysis is the Protocol Composition Logic (PCL). We identify a number of problems with this logic as well as with extensions of t...
253
click to vote
IFM
2010
Springer
15 years 4 months ago
2010
Springer
Safe is a first-order eager functional language with facilities for programmer controlled destruction and copying of data structures. It provides also regions, i.e. disjoint parts...
254
click to vote
JMLR
2012
13 years 9 months ago
2012
This paper presents new and effective algorithms for learning kernels. In particular, as shown by our empirical results, these algorithms consistently outperform the so-called uni...
190
click to vote
EUROPAR
2005
Springer
16 years 1 days ago
2005
Springer
Abstract. Understanding and controlling program behavior is a challenging objective for the design of advanced compilers and critical system development. In this paper, we propose ...