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

Wolfgang Thomas (Ed.): 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. Lecture Notes in Computer Science 1578 Springer 1999, ISBN 3-540-65719-3 BibTeX

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