Backward Reachability of Array-based Systems by SMT solving: Termination and Invariant Synthesis

Barriers in Concurrent Separation Logic: Now With Tool Support!

Basic completion strategies as another application of the Maude strategy language

Beating the Productivity Checker Using Embedded Languages

Begin, After, and Later: a Maximal Decidable Interval Temporal Logic

Better abstractions for timed automata

Better Quality in Synthesis through Quantitative Objectives

Better Quasi-Ordered Transition Systems

Beyond Quantifier-Free Interpolation in Extensions of Presburger Arithmetic (Extended Technical Report)

Bifinite Chu Spaces

Binary Sequent Calculi for Truth-invariance Entailment of Finite Many-valued Logics

Binding bigraphs as symmetric monoidal closed theories

Bisimilarity and Behaviour-Preserving Reconfigurations of Open Petri Nets

Bisimulation Relations Between Automata, Stochastic Differential Equations and Petri Nets

Bisimulations for Nondeterministic Labeled Markov Processes

Bisimulations Meet PCTL Equivalences for Probabilistic Automata

Bisimulations of enrichments

Bit-Blasting ACL2 Theorems

Blending margins

Blind graph rewriting systems