2. FoSSaCS 1999: Amsterdam, The Netherlands (Part of ETAPS 1999)

@proceedings{DBLP:conf/fossacs/1999,
  editor    = {Wolfgang Thomas},
  title     = {Foundations of Software Science and Computation Structure, Second
               International Conference, FoSSaCS'99, Held as Part of the European
               Joint Conferences on the Theory and Practice of Software, ETAPS'99,
               Amsterdam, The Netherlands, March 22-28, 1999, Proceedings},
  booktitle = {FoSSaCS},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {1578},
  year      = {1999},
  isbn      = {3-540-65719-3},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

• Martín Abadi:
  Security Protocols and Specifications. 1-13
  
• Javier Esparza, Jens Knoop:
  An Automata-Theoretic Approach to Interprocedural Data-Flow Analysis. 14-30
  
• Davide Sangiorgi:
  Reasoning About Concurrent Systems Using Types. 31-40
  
• Luca Aceto, Anna Ingólfsdóttir:
  Testing Hennessy-Milner Logic with Recursion. 41-55
  
• R. Arruabarrena, Paqui Lucio, Marisa Navarro:
  A Strong Logic Programming View for Static Embedded Implications. 56-72
  
• Paolo Baldan, Andrea Corradini, Ugo Montanari:
  Unfolding and Event Structure Semantics for Graph Grammars. 73-89
  
• Gilles Barthe:
  Expanding the Cube. 90-103
  
• Marcin Benke:
  An Algebraic Characterization of Typability in ML with Subtyping. 104-119
  
• Chiara Bodei, Pierpaolo Degano, Flemming Nielson, Hanne Riis Nielson:
  Static Analysis of Processes for No and Read-Up nad No Write-Down. 120-134
  
• Frank S. de Boer:
  A WP-calculus for OO. 135-149
  
• Bruno Bogaert, Franck Seynhaeve, Sophie Tison:
  The Recognizability Problem for Tree Automata with Comparisons between Brothers. 150-164
  
• Michele Boreale, Rocco De Nicola, Rosario Pugliese:
  A Theory of "May" Testing for Asynchronous Languages. 165-179
  
• Evgeny Dantsin, Andrei Voronkov:
  A Nondeterministic Polynomial-Time Unification Algorithm for Bags, Sets and Trees. 180-196
  
• Neil Ghani, Valeria de Paiva, Eike Ritter:
  Categorical Models of Explicit Substitutions. 197-211
  
• Andrew D. Gordon, Luca Cardelli:
  Equational Properties of Mobile Ambients. 212-226
  
• Michaela Huhn, Peter Niebert, Frank Wallner:
  Model Checking Logics for Communicating Sequential Agents. 227-242
  
• Marina Lenisa:
  A Complete Coinductive Logical System for Bisimulation Equivalence on Circular Objects. 243-257
  
• Sebastian Maneth:
  String Languages Generated by Total Deterministic Macro Tree Transducers. 258-272
  
• Anca Muscholl:
  Matching Specifications for Message Sequence Charts. 273-287
  
• Murali Narasimha, Rance Cleaveland, S. Purushothaman Iyer:
  Probabilistic Temporal Logics via the Modal Mu-Calculus. 288-305
  
• Christine Röckl, Davide Sangiorgi:
  A pi-calculus Process Semantics of Concurrent Idealised ALGOL. 306-321
  

Last update Fri May 25 08:14:19 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page