Simple-named complex-valued nominative data -- definition and basic operations

DOI10.1515/forma-2017-0020zbMath1401.68200OpenAlexW2780629006MaRDI QIDQ1688748

Ievgen Ivanov, Artur Korniłowicz, Andrii Kryvolap, Mykola Nikitchenko

Publication date: 11 January 2018

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

Full work available at URL: https://doi.org/10.1515/forma-2017-0020

zbMATH Keywords

software verificationprogram semanticsnominative data

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)

Related Items (9)

Simple-named complex-valued nominative data -- definition and basic operations ⋮ Kleene algebra of partial predicates ⋮ 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

Cites Work

• Event-based proof of the mutual exclusion property of Peterson's algorithm
• Proving properties of programs on hierarchical nominative data
• Simple-named complex-valued nominative data -- definition and basic operations
• Composition-nominative aspects of address programming
• Conway's Games and Some of their Basic Properties
• On Representations of Abstract Systems with Partial Inputs and Outputs
• An axiomatic basis for computer programming
• On Local Characterization of Global Timed Bisimulation for Abstract Continuous-Time Systems
• Unnamed Item
• Unnamed Item

This page was built for publication: Simple-named complex-valued nominative data -- definition and basic operations