Cs-Lo
Modules over relative monads for syntax and semantics
Computing Distances between Probabilistic Automata
The PITA System: Tabling and Answer Subsumption for Reasoning under Uncertainty
Propositional equality, identity types, and direct computational paths
Answering Non-Monotonic Queries in Relational Data Exchange
Soft Session Types (Long Version)
The countable versus uncountable branching recurrences in computability logic
Logical Concurrency Control from Sequential Proofs
Complex Optimization in Answer Set Programming
On counting untyped lambda terms
Towards a Coalgebraic Interpretation of Propositional Dynamic Logic
Aligning component upgrades
Outlier detection in default logics: the tractability/intractability frontier
From X to Pi; Representing the Classical Sequent Calculus in the Pi-calculus
Dependencies in Formal Mathematics: Applications and Extraction for Coq and Mizar
The First-Order Theory of Ground Tree Rewrite Graphs
Gaming security by obscurity
Innocent strategies as presheaves and interactive equivalences for CCS (expanded version)
Modular Abstractions of Reactive Nodes using Disjunctive Invariants
A Study of the PDGF Signaling Pathway with PRISM
A Domain-Specific Language for Incremental and Modular Design of Large-Scale Verifiably-Safe Flow Networks (Preliminary Report)
Shared Memory Concurrent System Verification using Kronecker Algebra
