Conferences in DBLP
My 27-year Quest to Overcome the State Explosion Problem. [Citation Graph (, )][DBLP ] The General Vector Addition System Reachability Problem by Presburger Inductive Invariants. [Citation Graph (, )][DBLP ] Applications of Game Semantics: From Program Analysis to Hardware Synthesis. [Citation Graph (, )][DBLP ] Boundedness vs. Unboundedness of Lock Chains: Characterizing Decidability of Pairwise CFL-Reachability for Threads Communicating via Locks. [Citation Graph (, )][DBLP ] Psi-calculi: Mobile Processes, Nominal Data, and Logic. [Citation Graph (, )][DBLP ] An Algebra for Kripke Polynomial Coalgebras. [Citation Graph (, )][DBLP ] Trace Semantics is Fully Abstract. [Citation Graph (, )][DBLP ] Logical Step-Indexed Logical Relations. [Citation Graph (, )][DBLP ] Fully Abstract Logical Bisimilarity for a Polymorphic Object Calculus. [Citation Graph (, )][DBLP ] Reflexive Scott Domains are Not Complete for the Extensional Lambda Calculus. [Citation Graph (, )][DBLP ] Substructural Operational Semantics as Ordered Logic Programming. [Citation Graph (, )][DBLP ] Logics with Rank Operators. [Citation Graph (, )][DBLP ] On Finite Satisfiability of Two-Variable First-Order Logic with Equivalence Relations. [Citation Graph (, )][DBLP ] Pointer Programs and Undirected Reachability. [Citation Graph (, )][DBLP ] An Exponential Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know it. [Citation Graph (, )][DBLP ] Graph Reachability and Pebble Automata over Infinite Alphabets. [Citation Graph (, )][DBLP ] An Improved Lower Bound for the Complementation of Rabin Automata. [Citation Graph (, )][DBLP ] A Type System Equivalent to the Modal Mu-Calculus Model Checking of Higher-Order Recursion Schemes. [Citation Graph (, )][DBLP ] Clipping: A Semantics-Directed Syntactic Approximation. [Citation Graph (, )][DBLP ] Expressiveness and Closure Properties for Quantitative Languages. [Citation Graph (, )][DBLP ] Computation and the Periodic Table. [Citation Graph (, )][DBLP ] The Structure of First-Order Causality. [Citation Graph (, )][DBLP ] The Inverse Taylor Expansion Problem in Linear Logic. [Citation Graph (, )][DBLP ] On the Computational Complexity of Verifying One-Counter Processes. [Citation Graph (, )][DBLP ] Co-ing Büchi Made Tight and Useful. [Citation Graph (, )][DBLP ] Wreath Products of Forest Algebras, with Applications to Tree Logics. [Citation Graph (, )][DBLP ] Dinatural Terms in System F. [Citation Graph (, )][DBLP ] Indexed Containers. [Citation Graph (, )][DBLP ] Functional Reachability. [Citation Graph (, )][DBLP ] Statistic Analysis for Probabilistic Processes. [Citation Graph (, )][DBLP ] Quantitative Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications. [Citation Graph (, )][DBLP ] Qualitative Determinacy and Decidability of Stochastic Games with Signals. [Citation Graph (, )][DBLP ] Combining Ehrenfeucht-Fraïssé Games. [Citation Graph (, )][DBLP ] Winning Concurrent Reachability Games Requires Doubly-Exponential Patience. [Citation Graph (, )][DBLP ] Graded Computation Tree Logic. [Citation Graph (, )][DBLP ] A Unified Sequent Calculus for Focused Proofs. [Citation Graph (, )][DBLP ] Non-linear Rewrite Closure and Weak Normalization. [Citation Graph (, )][DBLP ] Ludics with Repetitions (Exponentials, Interactive Types and Completeness). [Citation Graph (, )][DBLP ] Trichotomy in the Complexity of Minimal Inference. [Citation Graph (, )][DBLP ] A Logic for PTIME and a Parameterized Halting Problem. [Citation Graph (, )][DBLP ] A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics. [Citation Graph (, )][DBLP ] The Complexity of Global Cardinality Constraints. [Citation Graph (, )][DBLP ] The Complexity of Positive First-order Logic without Equality. [Citation Graph (, )][DBLP ]