Process Realizability (2000)

Cached

Download Links

by Samson Abramsky
Venue:In Foundations of Secure Computation
Citations:9 - 1 self

Active Bibliography

21 Specification Structures and Propositions-as-Types for Concurrency – Samson Abramsky, Simon Gay, Rajagopal Nagarajan - 1995
3 A specification structure for deadlock-freedom of synchronous processes – S. Abramsky, S. J. Gay, R. Nagarajan - 1999
14 Controlling State Explosion in Reachability Analysis – Wei Jen Yeh - 1993
2 On the Operational Semantics of Nondeterminism and Divergence – Hakan Erdogmus, Robert Johnston, Michael Ferguson - 1995
103 Priorities in process algebra – Rance Cleaveland, Gerald Lüttgen, V. Natarajan - 1999
123 Interaction Categories and the Foundations of Typed Concurrent Programming – Samson Abramsky, Simon Gay, Rajagopal Nagarajan - 1995
10 Topology, Domain Theory and Theoretical Computer Science – Michael W. Mislove - 1997
2 Categorical and Graphical Models of Programming Languages – Ralf Schweimeier - 2001
5 A Logical Process Calculus – Rance Cleaveland, Gerald Lüttgen - 2002
2 Quiescence, Fairness, Testing, and the Notion of Implementation (Extended abstract) – Roberto Segala - 1993
5 Description and Verification of Mobile Processes with Graph Rewriting Techniques – Barbara König
1 Relating Reasoning Methodologies in Linear Logic and Process Algebra – Yuxin Deng, Robert J. Simmons, Iliano Cervesato - 2011
1 Formal Verification Based on Relation Checking in SPIN: A Case Study – Hakan Erdogmus, Hakan Erdogmus, Robert Johnston, Robert Johnston, Charles Cleary, Charles Cleary - 1995
90 Classification of Security Properties (Part I: Information Flow) – Riccardo Focardi, Roberto Gorrieri - 2001
58 Fair testing – Arend Rensink, Walter Vogler - 1995
19 Combining Specification Techniques for Processes, Data and Time – Jochen Hoenicke, Ernst-Rüdiger Olderog - 2002
6 Categorical Models for Concurrency: Independence, Fairness and Dataflow – Thomas Troels Hildebrandt - 2000
4 Full abstraction for polymorphic pi-calculus. Online edition with proofs – Alan Jeffrey, Julian Rathke - 2005
2 Characterizing Termination in LOTOS via Testing – David De Frutos, Manuel Nunez, Juan Quemada - 1995