Termination and Confluence of Higher-Order Rewrite Systems

Termination in a Pi-calculus with Subtyping

Termination of lambda-calculus with the extra Call-By-Value rule known as assoc

Termination of Linear Programs with Nonlinear Constraints

Termination of Nondeterministic Quantum Programs

Termination of rewriting strategies: a generic approach

Termination of Rewriting with and Automated Synthesis of Forbidden Patterns

Termination of Rewriting with Right-Flat Rules Modulo Permutative Theories

Termination Proofs for Logic Programs with Tabling

Termination Proofs in the Dependency Pair Framework May Induce Multiple Recursive Derivational Complexity

Testing Probabilistic Processes: Can Random Choices Be Unobservable?

Testing Reactive Probabilistic Processes

The Abella Interactive Theorem Prover (System Description)

The Alma Project, or How First-Order Logic Can Help Us in Imperative Programming

The Arithmetical Complexity of Dimension and Randomness

The Bedwyr system for model checking over syntactic expressions

The Bisimulation Problem for equational graphs of finite out-degree

The Branching Time Spectrum for Continuous-time MDPs

The Calculus of Algebraic Constructions

The Cardinality of an Oracle in Blum-Shub-Smale Computation