Conferences in DBLP

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

1. Gordon D. Plotkin, John Power
   Adequacy for Algebraic Effects. [Citation Graph (0, 0)][DBLP]
   FoSSaCS, 2001, pp:1-24 [Conf]
   
2. Martín Abadi, Bruno Blanchet
   Secrecy Types for Asymmetric Communication. [Citation Graph (0, 0)][DBLP]
   FoSSaCS, 2001, pp:25-41 [Conf]
   
3. Luca Aceto, Zoltán Ésik, Anna Ingólfsdóttir
   Axiomatizing Tropical Semirings. [Citation Graph (0, 0)][DBLP]
   FoSSaCS, 2001, pp:42-56 [Conf]
   
4. Gilles Barthe, Olivier Pons
   Type Isomorphisms and Proof Reuse in Dependent Type Theory. [Citation Graph (0, 0)][DBLP]
   FoSSaCS, 2001, pp:57-71 [Conf]
   
5. Michel Bidoit, Rolf Hennicker, Alexander Kurz
   On the Duality between Observability and Reachability. [Citation Graph (0, 0)][DBLP]
   FoSSaCS, 2001, pp:72-87 [Conf]
   
6. Mikolaj Bojanczyk
   The Finite Graph Problem for Two-Way Alternating Automata. [Citation Graph (0, 0)][DBLP]
   FoSSaCS, 2001, pp:88-103 [Conf]
   
7. Maria Grazia Buscemi, Vladimiro Sassone
   High-Level Petri Nets as Type Theories in the Join Calculus. [Citation Graph (0, 0)][DBLP]
   FoSSaCS, 2001, pp:104-120 [Conf]
   
8. Nadia Busi, Roberto Gorrieri, Gianluigi Zavattaro
   Temporary Data in Shared Dataspace Coordination Languages. [Citation Graph (0, 0)][DBLP]
   FoSSaCS, 2001, pp:121-136 [Conf]
   
9. Cristiano Calcagno, Peter W. O'Hearn
   On Garbage and Program Logic. [Citation Graph (0, 0)][DBLP]
   FoSSaCS, 2001, pp:137-151 [Conf]
   
10. Witold Charatonik, Silvano Dal-Zilio, Andrew D. Gordon, Supratik Mukhopadhyay, Jean-Marc Talbot
    The Complexity of Model Checking Mobile Ambients. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2001, pp:152-167 [Conf]
    
11. Horatiu Cirstea, Claude Kirchner, Luigi Liquori
    The Rho Cube. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2001, pp:168-183 [Conf]
    
12. Mario Coppo
    Type Inference with Recursive Type Equations. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2001, pp:184-198 [Conf]
    
13. Irène Durand, Aart Middeldorp
    On the Modularity of Deciding Call-by-Need. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2001, pp:199-213 [Conf]
    
14. Valérie Gouranton, Pierre Réty, Helmut Seidl
    Synchronized Tree Languages Revisited and New Applications. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2001, pp:214-229 [Conf]
    
15. Annegret Habel, Detlef Plump
    Computational Completeness of Programming Languages Based on Graph Transformation. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2001, pp:230-245 [Conf]
    
16. Masahito Hasegawa, Yoshihiko Kakutani
    Axioms for Recursion in Call-by-Value. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2001, pp:246-260 [Conf]
    
17. Thomas P. Jensen, Fausto Spoto
    Class Analysis of Object-Oriented Programs through Abstract Interpretation. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2001, pp:261-275 [Conf]
    
18. Valerie King, Orna Kupferman, Moshe Y. Vardi
    On the Complexity of Parity Word Automata. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2001, pp:276-286 [Conf]
    
19. Manuel Koch, Luigi V. Mancini, Francesco Parisi-Presicce
    Foundations for a Graph-Based Approach to the Specification of Access Control Policies. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2001, pp:287-302 [Conf]
    
20. Sava Krstic, John Launchbury, Dusko Pavlovic
    Categories of Processes Enriched in Final Coalgebras. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2001, pp:303-317 [Conf]
    
21. François Laroussinie, Nicolas Markey, Ph. Schnoebelen
    Model Checking CTL⁺ and FCTL is Hard. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2001, pp:318-331 [Conf]
    
22. Rémi Morin
    On Regular Message Sequence Chart Languages and Relationships to Mazurkiewicz Trace Theory. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2001, pp:332-346 [Conf]
    
23. Tobias Nipkow
    Verified Bytecode Verifiers. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2001, pp:347-363 [Conf]
    
24. Christine Röckl, Daniel Hirschkoff, Stefan Berghofer
    Higher-Order Abstract Syntax with Induction in Isabelle/HOL: Formalizing the pi-Calculus and Mechanizing the Theory of Contexts. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2001, pp:364-378 [Conf]
    
25. Colin Stirling
    Decidability of Weak Bisimilarity for a Subset of Basic Parallel Processes. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2001, pp:379-393 [Conf]
    
26. Simone Tini
    An Axiomatic Semantics for the Synchronous Language Gentzen. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2001, pp:394-409 [Conf]
    
27. Dominique Ambroise, Patrick Augé, Kamel Bouchefra, Brigitte Rozoy
    MARRELLA and the Verification of an Embedded System. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2001, pp:409-412 [Conf]