Abstract. We describe a cryptographically sound formal logic for proving protocol security properties without explicitly reasoning about probability, asymptotic complexity, or the ...
Anupam Datta, Ante Derek, John C. Mitchell, Vitaly...
Non-confluent and non-terminating rewrite systems are interesting from the point of view of programming. In particular, existing functional logic languages use such kind of rewri...
In this paper, we incorporate a representation of the non-negative extended real numbers based on the composition of linear fractional transformations with nonnegative integer coe...
We describe a semantic type soundness result, formalized in the Coq proof assistant, for a compiler from a simple imperative language with heap-allocated data into an idealized as...
Abstract Machine Describing Event Structure Composition Claudia Faggian and Mauro Piccolo 1 ,2 ,3 Dipartimento di Matematica Pura e Applicata – PPS Universit´a di Padova – Par...