The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Facets of Synthesis: Revisiting Church's Problem. [Citation Graph (, )][DBLP]

  2. Temporal Reasoning about Program Executions. [Citation Graph (, )][DBLP]

  3. Least and Greatest Fixpoints in Game Semantics. [Citation Graph (, )][DBLP]

  4. Full Abstraction for Reduced ML. [Citation Graph (, )][DBLP]

  5. Logics and Bisimulation Games for Concurrency, Causality and Conflict. [Citation Graph (, )][DBLP]

  6. Separating Graph Logic from MSO. [Citation Graph (, )][DBLP]

  7. On the Completeness of Dynamic Logic. [Citation Graph (, )][DBLP]

  8. Dependency Tree Automata. [Citation Graph (, )][DBLP]

  9. On Global Model Checking Trees Generated by Higher-Order Recursion Schemes. [Citation Graph (, )][DBLP]

  10. A Kleene Theorem for Polynomial Coalgebras. [Citation Graph (, )][DBLP]

  11. Coalgebraic Hybrid Logic. [Citation Graph (, )][DBLP]

  12. A Description of Iterative Reflections of Monads (Extended Abstract). [Citation Graph (, )][DBLP]

  13. Tighter Bounds for the Determinisation of Büchi Automata. [Citation Graph (, )][DBLP]

  14. Lower Bounds on Witnesses for Nonemptiness of Universal Co-Büchi Automata. [Citation Graph (, )][DBLP]

  15. Interrupt Timed Automata. [Citation Graph (, )][DBLP]

  16. Parameter Reduction in Grammar-Compressed Trees. [Citation Graph (, )][DBLP]

  17. The Calculus of Handshake Configurations. [Citation Graph (, )][DBLP]

  18. On the Expressive Power of Restriction and Priorities in CCS with Replication. [Citation Graph (, )][DBLP]

  19. Normal Bisimulations in Calculi with Passivation. [Citation Graph (, )][DBLP]

  20. Reactive Systems, Barbed Semantics, and the Mobile Ambients. [Citation Graph (, )][DBLP]

  21. On the Foundations of Quantitative Information Flow. [Citation Graph (, )][DBLP]

  22. Cryptographic Protocol Composition via the Authentication Tests. [Citation Graph (, )][DBLP]

  23. Bisimulation for Demonic Schedulers. [Citation Graph (, )][DBLP]

  24. On Omega-Languages Defined by Mean-Payoff Conditions. [Citation Graph (, )][DBLP]

  25. Minimal Cost Reachability/Coverability in Priced Timed Petri Nets. [Citation Graph (, )][DBLP]

  26. Delayed Nondeterminism in Continuous-Time Markov Decision Processes. [Citation Graph (, )][DBLP]

  27. Concurrency, sigma-Algebras, and Probabilistic Fairness. [Citation Graph (, )][DBLP]

  28. Synthesis from Component Libraries. [Citation Graph (, )][DBLP]

  29. Realizability of Concurrent Recursive Programs. [Citation Graph (, )][DBLP]

  30. Beyond Shapes: Lists with Ordered Data. [Citation Graph (, )][DBLP]

  31. Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains. [Citation Graph (, )][DBLP]

  32. Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types. [Citation Graph (, )][DBLP]

System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
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 [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002