Cs-Lo
Optimal Tableau Decision Procedures for PDL
From Nondeterministic B"uchi and Streett Automata to Deterministic Parity Automata
Deciding Regularity of the Set of Instances of a Set of Terms with Regular Constraints is EXPTIME-Complete
Algorithmic metatheorems for decidable LTL model checking over infinite systems
Termination Prediction for General Logic Programs
Modelling Cell Cycle using Different Levels of Representation
Inductive Definition and Domain Theoretic Properties of Fully Abstract
Complexity of Non-Monotonic Logics
Aspects of multiscale modelling in a process algebra for biological systems
Formal study of plane Delaunay triangulation
Symbolic Reachability Analysis of Higher-Order Context-Free Processes
Complexity of Propositional Proofs under a Promise
Contraction-free proofs and finitary games for Linear Logic
O-Minimal Hybrid Reachability Games
On tractability and congruence distributivity
Toggling operators in computability logic
Edit and verify
The Complexity of Proving the Discrete Jordan Curve Theorem
Runtime Analysis of Probabilistic Programs with Unbounded Recursion
Theory of processes
Self-Recovering Sensor-Actor Networks
Complete Context Calculus Design and Implementation in GIPSY
