Titlebook: Relational and Algebraic Methods in Computer Science; 18th International C Uli Fahrenberg,Peter Jipsen,Michael Winter Conference proceeding

商店街

带来

Bisimilarity of Diagrams, spaces. We prove that checking bisimilarity and satisfiability of a positive formula by a diagram are both decidable by reducing to a problem of existence of invertible matrices with linear conditions, which in turn reduces to the existential theory of the reals.

非秘密

GENRE

,Preorders, Partial Semigroups, and Quantales,ak preorders (including the class of ordinary preorders), four classes of partial semigroups, and four classes of quantales. As a corollary of the correspondence, we can understand the relational embedding map as a natural transformation between functors onto certain category of quantales.

打包

Counting and Computing Join-Endomorphisms in Lattices, problem can be solved with worst-case time complexity in . for powerset lattices, . for lattices of sets, and . for arbitrary lattices. The complexity is expressed in terms of the basic binary lattice operations performed by the algorithm.

companion

似少年

Generating Posets Beyond , systems, can be generated, but not all posets. Generating posets is also important for constructing free algebras for concurrent semirings and Kleene algebras that allow compositional reasoning about such systems.

arbovirus

Automated Algebraic Reasoning for Collections and Local Variables with Lenses,ariable scopes. From this basis, we provide an enriched program model in Isabelle/UTP for collection variables and variable blocks. For the latter, we adopt an approach first used by Back and von Wright, and derive weakest precondition and Hoare calculi. We demonstrate several examples, including verification of insertion sort.

十字架

Omniscient