Kleene algebra of partial predicates
From MaRDI portal
Publication:1796766
DOI10.2478/forma-2018-0002zbMath1401.03106OpenAlexW2887573833WikidataQ129426036 ScholiaQ129426036MaRDI QIDQ1796766
Mykola Nikitchenko, Artur Korniłowicz, Ievgen Ivanov
Publication date: 17 October 2018
Published in: Formalized Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2478/forma-2018-0002
Related Items (8)
Implementation of the composition-nominative approach to program formalization in Mizar ⋮ On algebras of algorithms and specifications over uninterpreted data ⋮ On an algorithmic algebra over simple-named complex-valued nominative data ⋮ An inference system of an extension of Floyd-Hoare logic for partial predicates ⋮ Partial correctness of GCD algorithm ⋮ Partial correctness of a factorial algorithm ⋮ Partial correctness of a power algorithm ⋮ Partial correctness of a Fibonacci algorithm
Uses Software
Cites Work
- Event-based proof of the mutual exclusion property of Peterson's algorithm
- An algebraic approach to non-classical logics
- Semantic properties of \(T\)-consequence relation in logics of quasiary predicates
- Proving properties of programs on hierarchical nominative data
- Implementation of the composition-nominative approach to program formalization in Mizar
- Simple-named complex-valued nominative data -- definition and basic operations
- Injective de Morgan and Kleene Algebras
- On Representations of Abstract Systems with Partial Inputs and Outputs
- Caracterisation des algèbres de Nelson par des egalités, I
- An axiomatic basis for computer programming
- Lattices With Involution
- On Local Characterization of Global Timed Bisimulation for Abstract Continuous-Time Systems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Kleene algebra of partial predicates