Conferences in DBLP

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

1. Gian Luigi Ferrari, Ugo Montanari, Emilio Tuosto
   Model Checking for Nominal Calculi. [Citation Graph (0, 0)][DBLP]
   FoSSaCS, 2005, pp:1-24 [Conf]
   
2. Marcelo P. Fiore
   Mathematical Models of Computational and Combinatorial Structures. [Citation Graph (0, 0)][DBLP]
   FoSSaCS, 2005, pp:25-46 [Conf]
   
3. Mohammad Reza Mousavi, Michel A. Reniers
   Congruence for Structural Congruences. [Citation Graph (0, 0)][DBLP]
   FoSSaCS, 2005, pp:47-62 [Conf]
   
4. Ruggero Lanotte, Simone Tini
   Probabilistic Congruence for Semistochastic Generative Processes. [Citation Graph (0, 0)][DBLP]
   FoSSaCS, 2005, pp:63-78 [Conf]
   
5. Gerald Lüttgen, Walter Vogler
   Bisimulation on Speed: A Unified Approach. [Citation Graph (0, 0)][DBLP]
   FoSSaCS, 2005, pp:79-94 [Conf]
   
6. Samy Abbes, Albert Benveniste
   Branching Cells as Local States for Event Structures and Nets: Probabilistic Applications. [Citation Graph (0, 0)][DBLP]
   FoSSaCS, 2005, pp:95-109 [Conf]
   
7. Yuxin Deng, Catuscia Palamidessi
   Axiomatizations for Probabilistic Finite-State Behaviors. [Citation Graph (0, 0)][DBLP]
   FoSSaCS, 2005, pp:110-124 [Conf]
   
8. Stefano Cattani, Roberto Segala, Marta Z. Kwiatkowska, Gethin Norman
   Stochastic Transition Systems for Continuous State Spaces and Non-determinism. [Citation Graph (0, 0)][DBLP]
   FoSSaCS, 2005, pp:125-139 [Conf]
   
9. François Laroussinie, Jeremy Sproston
   Model Checking Durational Probabilistic Systems. [Citation Graph (0, 0)][DBLP]
   FoSSaCS, 2005, pp:140-154 [Conf]
   
10. Ian Stark
    Free-Algebra Models for the pi-Calculus. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2005, pp:155-169 [Conf]
    
11. Marino Miculan, Kidane Yemane
    A Unifying Model of Variables and Names. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2005, pp:170-186 [Conf]
    
12. Ulrich Fahrenberg
    A Category of Higher-Dimensional Automata. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2005, pp:187-201 [Conf]
    
13. Andrzej S. Murawski, Igor Walukiewicz
    Third-Order Idealized Algol with Iteration Is Decidable. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2005, pp:202-218 [Conf]
    
14. Patricia Bouyer, Fabrice Chevalier, Deepak D'Souza
    Fault Diagnosis Using Timed Automata. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2005, pp:219-233 [Conf]
    
15. Kim Guldstrand Larsen, Jacob Illum Rasmussen
    Optimal Conditional Reachability for Multi-priced Timed Automata. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2005, pp:234-249 [Conf]
    
16. Slawomir Lasota, Igor Walukiewicz
    Alternating Timed Automata. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2005, pp:250-265 [Conf]
    
17. Alan Jeffrey, Julian Rathke
    Full Abstraction for Polymorphic Pi-Calculus. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2005, pp:266-281 [Conf]
    
18. Cosimo Laneve, Gianluigi Zavattaro
    Foundations of Web Transactions. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2005, pp:282-298 [Conf]
    
19. Riccardo Focardi, Sabina Rossi, Andrei Sabelfeld
    Bridging Language-Based and Process Calculi Security. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2005, pp:299-315 [Conf]
    
20. Massimo Bartoletti, Pierpaolo Degano, Gian Luigi Ferrari
    History-Based Access Control with Local Policies. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2005, pp:316-332 [Conf]
    
21. Sibylle B. Fröschle
    Composition and Decomposition in True-Concurrency. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2005, pp:333-347 [Conf]
    
22. Mark Schäfer, Walter Vogler
    Component Refinement and CSC Solving for STG Decomposition. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2005, pp:348-363 [Conf]
    
23. Yves Bontemps, Pierre-Yves Schobbens
    The Complexity of Live Sequence Charts. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2005, pp:364-378 [Conf]
    
24. James Cheney
    A Simpler Proof Theory for Nominal Logic. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2005, pp:379-394 [Conf]
    
25. Cristiano Calcagno, Philippa Gardner, Matthew Hague
    From Separation Logic to First-Order Logic. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2005, pp:395-409 [Conf]
    
26. Healfdene Goguen
    Justifying Algorithms for beta-eta-Conversion. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2005, pp:410-424 [Conf]
    
27. Marius Bozga, Radu Iosif
    On Decidability Within the Arithmetic of Addition and Divisibility. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2005, pp:425-439 [Conf]
    
28. Lutz Schröder
    Expressivity of Coalgebraic Modal Logic: The Limits and Beyond. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2005, pp:440-454 [Conf]
    
29. Marcello M. Bonsangue, Alexander Kurz
    Duality for Logics of Transition Systems. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2005, pp:455-469 [Conf]
    
30. Lukasz Kaiser
    Confluence of Right Ground Term Rewriting Systems Is Decidable. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2005, pp:470-489 [Conf]
    
31. Klaus Aehlig, Jolie G. de Miranda, C.-H. Luke Ong
    Safety Is not a Restriction at Level 2 for String Languages. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2005, pp:490-504 [Conf]
    
32. Abbas Edalat, André Lieutier, Dirk Pattinson
    A Computational Model for Multi-variable Differential Calculus. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2005, pp:505-519 [Conf]