Reverse Bisimulations on Stable Configuration Structures

Revising Type-2 Computation and Degrees of Discontinuity

Rewrite based Verification of XML Updates

Rewriting and Well-Definedness within a Proof System

Rewriting modulo in Deduction modulo

Rewriting Preserving Recognizability of Finite Tree Languages

Rich Counter-Examples for Temporal-Epistemic Logic Model Checking

Robust Vacuity for Branching Temporal Logic

Robustness of a bisimulation-type faster-than preorder

Robustness of Equations Under Operational Extensions

Runtime Analysis of Probabilistic Programs with Unbounded Recursion

S-Program Calculus

Safe Recursion on Notation into a Light Logic by Levels

Safety alternating automata on data words

Safety-Guarantee Controller Synthesis for Cyber-Physical Systems

SAT Solving for Argument Filterings

SAT-Based Complete Don't-Care Computation for Network Optimization

SAT-Based Termination Analysis Using Monotonicity Constraints over the Integers

Satisfiability and computing van der Waerden numbers

Satisfiability for two-variable logic with two successor relations on finite linear orders