We address the verification problem of finite-state concurrent programs running under weak memory models. These models capture the reordering of program (read and write) operation...
Ahmed Bouajjani, Madanlal Musuvathi, Mohamed Faouz...
Abstract. We propose a flexible method for verifying the security of ML programs that use cryptography and recursive data structures. Our main applications are X.509 certificate ch...
We investigate the interactions of subtyping and recursive types, in a simply typed λ-calculus. The two fundamental questions here are whether two (recursive) types are in the su...
We present a new approach to the grid technology that is based on federated databases and updatable views. Views are used in two ways: (1) as wrappers of local servers that adopt l...
Hanna Kozankiewicz, Krzysztof Stencel, Kazimierz S...
onnectivity and Full Abstraction for a Concurrent Calculus of Classes⋆ nded Abstract — Erika ´Abrah´am2 , Marcello M. Bonsangue3 , Frank S. de Boer4 , and Martin Steffen1 1 ...