Verifying Safety Properties With the TLA+ Proof System

Verifying Safety-Critical Timing and Memory-Usage Properties of Embedded Software by Abstract Interpretation

Verifying Temporal Regular Properties of Abstractions of Term Rewriting Systems

Verifying Termination and Error-Freedom of Logic Programs with block Declarations

Verifying the Unification Algorithm in LCF

Visibly Tree Automata with Memory and Constraints

Wadge Degrees of Infinitary Rational Relations

Warranted Derivations of Preferred Answer

Wave Equation Numerical Resolution: Mathematics and Program

Weak Affine Light Typing is complete with respect to Safe Recursion on Notation

Weak Affine Light Typing: Polytime intensional expressivity, soundness and completeness

Weak Kleene Algebra is Sound and (Possibly) Complete for Simulation

Weak length induction and slow growing depth boolean circuits

Weak Typed Boehm Theorem on IMLL

Weighted Logics for Nested Words and Algebraic Formal Power Series

Well structured program equivalence is highly undecidable

Well-definedness of Streams by Transformation and Termination

Well-founded and Stable Semantics of Logic Programs with Aggregates

Well-Founded Argumentation Semantics for Extended Logic Programming

Well-Typed Logic Programs Are not Wrong