Cs-Lo
Simulating reachability using first-order logic with applications to verification of linked data structures
Bounded Underapproximations
Focusing and Polarization in Intuitionistic Logic
Functional Dependence of Secrets in a Collaboration Network
Abstract Answer Set Solvers with Learning
A Minimal Propositional Type Theory
Formalizing cCSP Synchronous Semantics in PVS
Graphical Presentations of Symmetric Monoidal Closed Theories
Symmetry Breaking for Answer Set Programming
States and exceptions considered as dual effects
Named Models in Coalgebraic Hybrid Logic
Extending the Real-Time Maude Semantics of Ptolemy to Hierarchical DE Models
Least and greatest fixpoints in game semantics
Strategies in PRholog
Fundamental Results on Fluid Approximations of Stochastic Process Algebra Models
Handling software upgradeability problems with MILP solvers
Tree Languages Defined in First-Order Logic with One Quantifier Alternation
Randomness extraction and asymptotic Hamming distance
An Integrated Design and Verification Methodology for Reconfigurable Multimedia Systems
On Decidability Properties of One-Dimensional Cellular Automata
Almost 2-SAT is Fixed-Parameter Tractable
A definable number which cannot be approximated algorithmically
