ing Cryptographic Protocols with Tree Automata David Monniaux http://www.di.ens.fr/%7Fmonniaux, Laboratoire d’Informatique, ´Ecole Normale Sup´erieure, 45 rue d’Ulm , 75230 P...
d abstract) Dominique Unruh 1 Institut f¨ur Algorithmen und Kognitive Systeme, Universit¨at Karlsruhe Am Fasanengarten 5, 76131 Karlsruhe, Germany We show how to model the seman...
Models of Memory Management Greg Morrisett Matthias Felleisen Robert Harper January 1995 CMU{CS{95{110 School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 Al...
J. Gregory Morrisett, Matthias Felleisen, Robert H...
We propose and study extensions of logic programming with constraints represented as generalized atoms of the form C(X), where X is a finite set of atoms and C is act constraint (...
Abstract. Intel is applying formal verification to various pieces of mathematical software used in Merced, the first implementation of the new IA-64 architecture. This paper discus...