The SCEAS System
Navigation Menu

Conferences in DBLP

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


  1. Introduction to Decidability of Higher-Order Matching. [Citation Graph (, )][DBLP]


  2. A Semantic Foundation for Hidden State. [Citation Graph (, )][DBLP]


  3. Linearly-Used Continuations in the Enriched Effect Calculus. [Citation Graph (, )][DBLP]


  4. Block Structure vs. Scope Extrusion: Between Innocence and Omniscience. [Citation Graph (, )][DBLP]


  5. Completeness for Algebraic Theories of Local State. [Citation Graph (, )][DBLP]


  6. Fair Adversaries and Randomization in Two-Player Games. [Citation Graph (, )][DBLP]


  7. Retaining the Probabilities in Probabilistic Testing Theory. [Citation Graph (, )][DBLP]


  8. Forward Analysis of Depth-Bounded Processes. [Citation Graph (, )][DBLP]


  9. Incremental Pattern-Based Coinduction for Process Algebra and Its Isabelle Formalization. [Citation Graph (, )][DBLP]


  10. Parameterised Multiparty Session Types. [Citation Graph (, )][DBLP]


  11. On the Relationship between Spatial Logics and Behavioral Simulations. [Citation Graph (, )][DBLP]


  12. An Easy Completeness Proof for the Modal µ-Calculus on Finite Trees. [Citation Graph (, )][DBLP]


  13. When Model-Checking Freeze LTL over Counter Machines Becomes Decidable. [Citation Graph (, )][DBLP]


  14. Model Checking Is Static Analysis of Modal Logic. [Citation Graph (, )][DBLP]


  15. Counting CTL. [Citation Graph (, )][DBLP]


  16. Algorithmic Metatheorems for Decidable LTL Model Checking over Infinite Systems. [Citation Graph (, )][DBLP]


  17. Toward a Compositional Theory of Leftist Grammars and Transformations. [Citation Graph (, )][DBLP]


  18. Degrees of Lookahead in Regular Infinite Games. [Citation Graph (, )][DBLP]


  19. Reachability Analysis of Communicating Pushdown Systems. [Citation Graph (, )][DBLP]


  20. The Complexity of Synchronous Notions of Information Flow Security. [Citation Graph (, )][DBLP]


  21. Monads Need Not Be Endofunctors. [Citation Graph (, )][DBLP]


  22. CIA Structures and the Semantics of Recursion. [Citation Graph (, )][DBLP]


  23. Coalgebraic Correspondence Theory. [Citation Graph (, )][DBLP]


  24. Untyped Recursion Schemes and Infinite Intersection Types. [Citation Graph (, )][DBLP]


  25. Solvability in Resource Lambda-Calculus. [Citation Graph (, )][DBLP]


  26. A Hierarchy for Delimited Continuations in Call-by-Name. [Citation Graph (, )][DBLP]

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