The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Hubert Comon-Lundh
    Intruder Theories (Ongoing Work). [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2004, pp:1-4 [Conf]
  2. Robin Milner
    Theories for the Global Ubiquitous Computer. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2004, pp:5-11 [Conf]
  3. Martín Abadi, Georges Gonthier, Benjamin Werner
    Choice in Dynamic Linking. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2004, pp:12-26 [Conf]
  4. Patrick Baillot, Virgile Mogbil
    Soft lambda-Calculus: A Language for Polynomial Time Computation. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2004, pp:27-41 [Conf]
  5. Liana Bozga, Cristian Ene, Yassine Lakhnech
    On the Existence of an Effective and Complete Inference System for Cryptographic Protocols. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2004, pp:42-57 [Conf]
  6. Antonio Bucciarelli, Benjamin Leperchey
    Hypergraphs and Degrees of Parallelism: A Completeness Result. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2004, pp:58-71 [Conf]
  7. Luís Caires
    Behavioral and Spatial Observations in a Logic for the pi-Calculus. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2004, pp:72-89 [Conf]
  8. Jérémie Chalopin, Yves Métivier
    Election and Local Computations on Edges. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2004, pp:90-104 [Conf]
  9. Giovanni Conforti, Giorgio Ghelli
    Decidability of Freshness, Undecidability of Revelation. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2004, pp:105-120 [Conf]
  10. Stéphane Demri
    LTL over Integer Periodicity Constraints: (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2004, pp:121-135 [Conf]
  11. Pietro Di Gianantonio, Marino Miculan
    Unifying Recursive and Co-recursive Definitions in Sheaf Categories. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2004, pp:136-150 [Conf]
  12. Hartmut Ehrig, Barbara König
    Deriving Bisimulation Congruences in the DPO Approach to Graph Rewriting. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2004, pp:151-166 [Conf]
  13. Andrzej Filinski, Henning Korsholm Rohde
    A Denotational Account of Untyped Normalization by Evaluation. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2004, pp:167-181 [Conf]
  14. Wan Fokkink, Sumit Nain
    On Finite Alphabets and Infinite Bases: From Ready Pairs to Possible Worlds. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2004, pp:182-194 [Conf]
  15. Blaise Genest, Marius Minea, Anca Muscholl, Doron Peled
    Specifying and Verifying Partial Order Properties Using Template MSCs. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2004, pp:195-210 [Conf]
  16. Dan R. Ghica, Andrzej S. Murawski
    Angelic Semantics of Fine-Grained Concurrency. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2004, pp:211-225 [Conf]
  17. Pablo Giambiagi, Gerardo Schneider, Frank D. Valencia
    On the Expressiveness of Infinite Behavior and Name Scoping in Process Calculi. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2004, pp:226-240 [Conf]
  18. Matthew Hennessy, Julian Rathke, Nobuko Yoshida
    safeDpi: A Language for Controlling Mobile Code. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2004, pp:241-256 [Conf]
  19. Daniel Kirsten
    Distance Desert Automata and the Star Height One Problem. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2004, pp:257-272 [Conf]
  20. Stephen Lack, Pawel Sobocinski
    Adhesive Categories. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2004, pp:273-288 [Conf]
  21. James Laird
    A Game Semantics of Local Names and Good Variables. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2004, pp:289-303 [Conf]
  22. Daniel Leivant
    Partial Correctness Assertions Provable in Dynamic Logics. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2004, pp:304-317 [Conf]
  23. Salvador Lucas
    Polynomials for Proving Termination of Context-Sensitive Rewriting. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2004, pp:318-332 [Conf]
  24. Gerald Lüttgen, Walter Vogler
    Bisimulation on Speed: Lower Time Bounds. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2004, pp:333-347 [Conf]
  25. Oded Maler, Amir Pnueli
    On Recognizable Timed Languages. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2004, pp:348-362 [Conf]
  26. Sebastian Maneth, Giorgio Busatto
    Tree Transducers and Tree Compressions. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2004, pp:363-377 [Conf]
  27. Antoine Meyer
    On Term Rewriting Systems Having a Rational Derivation. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2004, pp:378-392 [Conf]
  28. Michael W. Mislove, Joël Ouaknine, Dusko Pavlovic, James Worrell
    Duality for Labelled Markov Processes. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2004, pp:393-407 [Conf]
  29. Iain Phillips, Maria Grazia Vigliotti
    Electoral Systems in Ambient Calculi. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2004, pp:408-422 [Conf]
  30. Emmanuel Polonovski
    Strong Normalization of lambda-mu-mu/tilde-Calculus with Explicit Substitutions. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2004, pp:423-437 [Conf]
  31. John Power
    Canonical Models for Computational Effects. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2004, pp:438-452 [Conf]
  32. Riccardo Pucella, Vicky Weissman
    Reasoning about Dynamic Policies. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2004, pp:453-467 [Conf]
  33. Ajith Ramanathan, John C. Mitchell, Andre Scedrov, Vanessa Teague
    Probabilistic Bisimulation and Equivalence for Security Analysis of Network Protocols. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2004, pp:468-483 [Conf]
  34. Lucian Wischik, Philippa Gardner
    Strong Bisimulation for the Explicit Fusion Calculus. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2004, pp:484-498 [Conf]
  35. Wieslaw Zielonka
    Perfect-Information Stochastic Parity Games. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2004, pp:499-513 [Conf]
  36. Roberto Zunino, Pierpaolo Degano
    A Note on the Perfect Encryption Assumption in a Process Calculus. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2004, pp:514-528 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002