Small Bisimulations for Reasoning About Higher-Order Imperative Programs Vasileios Koutavas Mitchell Wand

First Page		Document Content
Date: 2005-11-11 12:39:28 Applied mathematics Programming language semantics Models of computation Formal methods Denotational semantics Operational semantics Bisimulation Semantics of programming languages Lambda calculus Theoretical computer science Logic in computer science Logic		Small Bisimulations for Reasoning About Higher-Order Imperative Programs Vasileios Koutavas Mitchell Wand Add to Reading List Source URL: www.ccs.neu.edu Download Document from Source Website File Size: 163,08 KB Share Document on Facebook

	Bisimulation Congruences in the Calculus of Looping Sequences Roberto Barbuti, Andrea Maggiolo-Schettini, Paolo Milazzo, and Angelo Troina Dipartimento di Informatica, Universit` a di Pisa DocID: 1xTZy - View Document
	Bisimulation for demonic schedulers? Konstantinos Chatzikokolakis1 , Gethin Norman2 , and David Parker2 1 Eindhoven University of Technology 2 DocID: 1xTBZ - View Document
	Differential Bisimulation for a Markovian Process Algebra ? Giulio Iacobelli1 , Mirco Tribastone2 , and Andrea Vandin3 1 Computing and Systems Engineering, Federal University of Rio de Janeiro, Brazil DocID: 1tB0a - View Document
	Globally Governed Session Semantics Dimitrios Kouzapas and Nobuko Yoshida Imperial College London Abstract. This paper proposes a new bisimulation theory based on multiparty session types where a choreography specificati DocID: 1t8dF - View Document
	On Context Bisimulation for Parameterized Higher-order Processes Xian Xu East China University of Science and Technology June, 2013 DocID: 1t7rD - View Document