On an algorithmic algebra over simple-named complex-valued nominative data

DOI10.2478/FORMA-2018-0012zbMath1422.68034OpenAlexW2907024978WikidataQ128650998 ScholiaQ128650998MaRDI QIDQ2311522

Mykola Nikitchenko, Artur Korniłowicz, Ievgen Ivanov

Publication date: 10 July 2019

Published in: Formalized Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2478/forma-2018-0012

zbMATH Keywords

nominative dataGlushkov algorithmic algebra

Mathematics Subject Classification ID

Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Mechanization of proofs and logical operations (03B35) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) General topics in the theory of algorithms (68W01) General topics in the theory of data (68P01)

Related Items (3)

Partial correctness of a factorial algorithm ⋮ Partial correctness of a power algorithm ⋮ Partial correctness of a Fibonacci algorithm

Uses Software

• Mizar

Cites Work

• Event-based proof of the mutual exclusion property of Peterson's algorithm
• Four decades of {\textsc{Mizar}}. Foreword
• Proving properties of programs on hierarchical nominative data
• Implementation of the composition-nominative approach to program formalization in Mizar
• The role of the Mizar mathematical library for interactive proof development in Mizar
• Simple-named complex-valued nominative data -- definition and basic operations
• Kleene algebra of partial predicates
• On Representations of Abstract Systems with Partial Inputs and Outputs
• On Local Characterization of Global Timed Bisimulation for Abstract Continuous-Time Systems

This page was built for publication: On an algorithmic algebra over simple-named complex-valued nominative data