Electronic Notes in Theoretical Computer Science, Volume 265
Volume 265, September 2010
- Samson Abramsky: Robin Milner's Work on Concurrency. 5-10
- Deepak Garg, Jason Franklin, Dilsun Kirli Kaynar, Anupam Datta: Compositional System Security with Interface-Confined Adversaries. 49-71
- Dusko Pavlovic, Catherine Meadows: Bayesian Authentication: Quantifying Security of the Hancke-Kuhn Protocol. 97-122
- Eric Mjolsness: Towards Measurable Types for Dynamical Process Modeling Languages. 123-144
- Luca Aceto, Matteo Cimini, Anna Ingólfsdóttir, Mohammad Reza Mousavi, Michel A. Reniers: On Rule Formats for Zero and Unit Elements. 145-160
- Michele Basaldella, Alexis Saurin, Kazushige Terui: From Focalization of Logic to the Logic of Focalization. 161-176
- Stephen Brookes: Fairness, Resources, and Separation. 177-195
- James Brotherston: A Unified Display Proof Theory for Bunched Logic. 197-211
- Antonio Bucciarelli, Thomas Ehrhard, Giulio Manzonetto: Categorical Models for Simply Typed Resource Calculi. 213-230
- Venanzio Capretta: Bisimulations Generated from Corecursive Equations. 245-258
- Ranald Clouston: Binding in Nominal Equational Logic. 259-276
- Dan R. Ghica, Alex Smith: Geometry of Synthesis II: From Games to Delay-Insensitive Circuits. 301-324
- Eric Goubault, Emmanuel Haucourt, Sanjeevi Krishnan: Future Path-components in Directed Topology. 325-335
- Masahito Hasegawa: Bialgebras in Rel. 337-350
- Dominique Larchey-Wendling: An Alternative Direct Simulation of Minsky Machines into Classical Bunched Logics via Group Semantics. 369-387
- Rasmus Ejlers Møgelberg: A Nominal Relational Model for Local Store. 403-421
- Andrzej S. Murawski: Full Abstraction Without Synchronization Primitives. 423-436
- Rick Statman: Cartesian Monoids. 437-451
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-17T202759 by the dblp team