Relational and Algebraic Methods in Computer Science

Developments in Concurrent Kleene Algebra (Invited Talk).- Endowing Concurrent Kleene Algebra with Communication Actions.- Concurrent Kleene Algebra with Tests.- Algebras for Program Correctness in Isabelle/HOL.- Completeness Theorems for Bi-Kleene Algebras and Series-Parallel Rational Pomset Languages.- A Modified Completeness Theorem of KAT and Decidability of Term Reducibility.- Kleene Algebra with Converse.- Preparing Relational Algebra for “Just Good Enough” Hardware (Invited Talk).- Extended Conscriptions Algebraically.- Abstract Dynamic Frames.- Automated Verification of Relational While-Programs.- On Faults and Faulty Programs.- Parameterised Bisimulations: Some Applications.- A Point-Free Relation-Algebraic Approach to General Topology.- A Mechanised Abstract Formalisation of Concept Lattices.- A Sufficient Condition for Liftable Adjunctions between Eilenberg-Moore Categories.- Higher-Order Arrow Categories.- Type-2 Fuzzy Controllers in Arrow Categories.-Relation Algebra and RelView Applied to Approval Voting.- Relational Lattices.- Towards Finding Maximal Subrelations with Desired Properties.- Complete Solution of a Constrained Tropical Optimization Problem with Application to Location Analysis.- Refinements of the RCC25 Composition Table.- Fuzzifying Modal Algebra.- Tableau Development for a Bi- intuitionistic Tense Logic.- Nominal Sets over Algebraic Atoms.- Fixed-Point Theory in the Varieties Dn.