The weakest prespecification
From MaRDI portal
Publication:1091121
DOI10.1016/0020-0190(87)90106-2zbMath0622.68025OpenAlexW2163008980MaRDI QIDQ1091121
Publication date: 1987
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(87)90106-2
Specification and verification (program logics, model checking, etc.) (68Q60) Data structures (68P05)
Related Items
Peirce algebras, A relational division operator: The conjugate kernel, Towards automating duality, Angelic nondeterminism in the unifying theories of programming, Quantales, observational logic and process semantics, The logic of Peirce algebras, Relations and non-commutative linear logic, Autonomous posets and quantales, A Relation-Algebraic Approach to Multirelations and Predicate Transformers, An elementary and unified approach to program correctness, Towards reasoning about Hoare relations, A relation-algebraic approach to the ``Hoare logic of functional dependencies, Jifeng He at Oxford and beyond: an appreciation, Formally verified animation for RoboChart using interaction trees, Automated reasoning for probabilistic sequential programs with theorem proving, Process simulation and refinement, Representation theorems for \(Q\)-algebras, Embedding a demonic semilattice in a relation algebra, Inductive data types for predicate transformers, A representation theorem for quantales, Prespecification in data refinement, Relational Decomposition, Semantic distance between specifications, Gentzen-type calculi for involutive quantales, Free quantaloids, Normal form approach to compiler design
Cites Work
