The SCEAS System
Navigation Menu

Conferences in DBLP

Logic in Computer Science (LICS) (lics)
2009 (conf/lics/2009)

  1. My 27-year Quest to Overcome the State Explosion Problem. [Citation Graph (, )][DBLP]

  2. The General Vector Addition System Reachability Problem by Presburger Inductive Invariants. [Citation Graph (, )][DBLP]

  3. Applications of Game Semantics: From Program Analysis to Hardware Synthesis. [Citation Graph (, )][DBLP]

  4. Boundedness vs. Unboundedness of Lock Chains: Characterizing Decidability of Pairwise CFL-Reachability for Threads Communicating via Locks. [Citation Graph (, )][DBLP]

  5. Psi-calculi: Mobile Processes, Nominal Data, and Logic. [Citation Graph (, )][DBLP]

  6. An Algebra for Kripke Polynomial Coalgebras. [Citation Graph (, )][DBLP]

  7. Trace Semantics is Fully Abstract. [Citation Graph (, )][DBLP]

  8. Logical Step-Indexed Logical Relations. [Citation Graph (, )][DBLP]

  9. Fully Abstract Logical Bisimilarity for a Polymorphic Object Calculus. [Citation Graph (, )][DBLP]

  10. Reflexive Scott Domains are Not Complete for the Extensional Lambda Calculus. [Citation Graph (, )][DBLP]

  11. Substructural Operational Semantics as Ordered Logic Programming. [Citation Graph (, )][DBLP]

  12. Logics with Rank Operators. [Citation Graph (, )][DBLP]

  13. On Finite Satisfiability of Two-Variable First-Order Logic with Equivalence Relations. [Citation Graph (, )][DBLP]

  14. Pointer Programs and Undirected Reachability. [Citation Graph (, )][DBLP]

  15. An Exponential Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know it. [Citation Graph (, )][DBLP]

  16. Graph Reachability and Pebble Automata over Infinite Alphabets. [Citation Graph (, )][DBLP]

  17. An Improved Lower Bound for the Complementation of Rabin Automata. [Citation Graph (, )][DBLP]

  18. A Type System Equivalent to the Modal Mu-Calculus Model Checking of Higher-Order Recursion Schemes. [Citation Graph (, )][DBLP]

  19. Clipping: A Semantics-Directed Syntactic Approximation. [Citation Graph (, )][DBLP]

  20. Expressiveness and Closure Properties for Quantitative Languages. [Citation Graph (, )][DBLP]

  21. Computation and the Periodic Table. [Citation Graph (, )][DBLP]

  22. The Structure of First-Order Causality. [Citation Graph (, )][DBLP]

  23. The Inverse Taylor Expansion Problem in Linear Logic. [Citation Graph (, )][DBLP]

  24. On the Computational Complexity of Verifying One-Counter Processes. [Citation Graph (, )][DBLP]

  25. Co-ing Büchi Made Tight and Useful. [Citation Graph (, )][DBLP]

  26. Wreath Products of Forest Algebras, with Applications to Tree Logics. [Citation Graph (, )][DBLP]

  27. Dinatural Terms in System F. [Citation Graph (, )][DBLP]

  28. Indexed Containers. [Citation Graph (, )][DBLP]

  29. Functional Reachability. [Citation Graph (, )][DBLP]

  30. Statistic Analysis for Probabilistic Processes. [Citation Graph (, )][DBLP]

  31. Quantitative Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications. [Citation Graph (, )][DBLP]

  32. Qualitative Determinacy and Decidability of Stochastic Games with Signals. [Citation Graph (, )][DBLP]

  33. Combining Ehrenfeucht-Fraïssé Games. [Citation Graph (, )][DBLP]

  34. Winning Concurrent Reachability Games Requires Doubly-Exponential Patience. [Citation Graph (, )][DBLP]

  35. Graded Computation Tree Logic. [Citation Graph (, )][DBLP]

  36. A Unified Sequent Calculus for Focused Proofs. [Citation Graph (, )][DBLP]

  37. Non-linear Rewrite Closure and Weak Normalization. [Citation Graph (, )][DBLP]

  38. Ludics with Repetitions (Exponentials, Interactive Types and Completeness). [Citation Graph (, )][DBLP]

  39. Trichotomy in the Complexity of Minimal Inference. [Citation Graph (, )][DBLP]

  40. A Logic for PTIME and a Parameterized Halting Problem. [Citation Graph (, )][DBLP]

  41. A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics. [Citation Graph (, )][DBLP]

  42. The Complexity of Global Cardinality Constraints. [Citation Graph (, )][DBLP]

  43. The Complexity of Positive First-order Logic without Equality. [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