Conferences in DBLP

Foundations of Software Science and Computation Structure (FoSSaCS) (fossacs)
1999 (conf/fossacs/1999)

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