Conferences in DBLP

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

1. Bruno Courcelle
   Semantical Evaluations as Monadic Second-Order Compatible Structure Transformations. [Citation Graph (0, 0)][DBLP]
   FoSSaCS, 2002, pp:1-4 [Conf]
   
2. Erika Ábrahám-Mumm, Frank S. de Boer, Willem P. de Roever, Martin Steffen
   Verification for Java's Reentrant Multithreading Concept. [Citation Graph (0, 0)][DBLP]
   FoSSaCS, 2002, pp:5-20 [Conf]
   
3. Michel Bidoit, Rolf Hennicker
   On the Integration of Observability and Reachability Concepts. [Citation Graph (0, 0)][DBLP]
   FoSSaCS, 2002, pp:21-36 [Conf]
   
4. Frank S. de Boer, Maurizio Gabbrielli, Maria Chiara Meo
   Proving Correctness of Timed Concurrent Constraint Programs. [Citation Graph (0, 0)][DBLP]
   FoSSaCS, 2002, pp:37-51 [Conf]
   
5. Benedikt Bollig, Martin Leucker, Thomas Noll
   Generalised Regular MSC Languages. [Citation Graph (0, 0)][DBLP]
   FoSSaCS, 2002, pp:52-66 [Conf]
   
6. Michele Boreale, Daniele Gorla
   On Compositional Reasoning in the Spi-calculus. [Citation Graph (0, 0)][DBLP]
   FoSSaCS, 2002, pp:67-81 [Conf]
   
7. Corina Cîrstea
   On Specification Logics for Algebra-Coalgebra Structures: Reconciling Reachability and Observability. [Citation Graph (0, 0)][DBLP]
   FoSSaCS, 2002, pp:82-97 [Conf]
   
8. Olivier Danvy, Lasse R. Nielsen
   A First-Order One-Pass CPS Transformation. [Citation Graph (0, 0)][DBLP]
   FoSSaCS, 2002, pp:98-113 [Conf]
   
9. Ernst-Erich Doberkat
   The Demonic Product of Probabilistic Relations. [Citation Graph (0, 0)][DBLP]
   FoSSaCS, 2002, pp:114-128 [Conf]
   
10. Gian Luigi Ferrari, Ugo Montanari, Marco Pistore
    Minimizing Transition Systems for Name Passing Calculi: A Co-algebraic Formulation. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2002, pp:129-158 [Conf]
    
11. Carsten Führmann
    Varieties of Effects. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2002, pp:144-158 [Conf]
    
12. Emmanuel Godard, Yves Métivier
    A Characterization of Families of Graphs in Which Election Is Possible. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2002, pp:159-172 [Conf]
    
13. Petr Jancar, Antonín Kucera, Faron Moller, Zdenek Sawa
    Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2002, pp:172-186 [Conf]
    
14. Somesh Jha, Jens Palsberg, Tian Zhao
    Efficient Type Matching. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2002, pp:187-204 [Conf]
    
15. Teodor Knapik, Damian Niwinski, Pawel Urzyczyn
    Higher-Order Pushdown Trees Are Easy. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2002, pp:205-222 [Conf]
    
16. Manuel Koch, Luigi V. Mancini, Francesco Parisi-Presicce
    Conflict Detection and Resolution in Access Control Policy Specifications. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2002, pp:223-237 [Conf]
    
17. Alexander Kurz
    Logics Admitting Final Semantics. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2002, pp:238-249 [Conf]
    
18. Martin Lange, Colin Stirling
    Model Checking Fixed Point Logic with Chop. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2002, pp:250-263 [Conf]
    
19. François Laroussinie, Nicolas Markey, Ph. Schnoebelen
    On Model Checking Durational Kripke Structures. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2002, pp:264-279 [Conf]
    
20. Christof Löding
    Model-Checking Infinite Systems Generated by Ground Tree Rewriting. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2002, pp:280-294 [Conf]
    
21. Markus Lohrey, Anca Muscholl
    Bounded MSC Communication. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2002, pp:295-309 [Conf]
    
22. Keye Martin
    The Informatic Derivative at a Compact Element. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2002, pp:310-325 [Conf]
    
23. Till Mossakowski
    Heterogeneous Development Graphs and Heterogeneous Borrowing. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2002, pp:326-341 [Conf]
    
24. Gordon D. Plotkin, John Power
    Notions of Computation Determine Monads. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2002, pp:342-356 [Conf]
    
25. Luigi Santocanale
    A Calculus of Circular Proofs and Its Categorical Semantics. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2002, pp:357-371 [Conf]
    
26. Ulrich Schöpp, Alex K. Simpson
    Verifying Temporal Properties Using Explicit Approximants: Completeness for Context-free Processes. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2002, pp:372-386 [Conf]
    
27. Jirí Srba
    Note on the Tableau Technique for Commutative Transition Systems. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2002, pp:387-401 [Conf]
    
28. Hongseok Yang, Peter W. O'Hearn
    A Semantic Basis for Local Reasoning. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2002, pp:402-416 [Conf]
    
29. Nobuko Yoshida, Kohei Honda, Martin Berger
    Linearity and Bisimulation. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2002, pp:417-434 [Conf]