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

DOI10.1515/FORMA-2017-0020MaRDI QIDQ1688748zbMATH OpenOpenAlexFDO

Authors Ievgen Ivanov, M. S. Nikitchenko, Andrii Kryvolap, Artur Korniłowicz

Publication date 11 January 2018

Published in Formalized Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported

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

zbMATH Keywords

nominative dataprogram semanticssoftware verification

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• On an algorithmic algebra over simple-named complex-valued nominative data
• Properties of semistructed data with multivalued naming and their use
• Classes of nominative data with fast access to components
• scientific article; zbMATH DE number 5946196
• scientific article; zbMATH DE number 6123101
• The expressive power of complex values in object-based data models
• A data model and algebra for probabilistic complex values
• scientific article; zbMATH DE number 2012402
• Towards nominal computation
• scientific article; zbMATH DE number 4185889

Cites work

• An axiomatic basis for computer programming
• Composition-nominative aspects of address programming
• Conway's games and some of their basic properties
• Event-based proof of the mutual exclusion property of Peterson's algorithm
• scientific article; zbMATH DE number 2084366 (Why is no real title available?)
• scientific article; zbMATH DE number 3302923 (Why is no real title available?)
• On Local Characterization of Global Timed Bisimulation for Abstract Continuous-Time Systems
• On representations of abstract systems with partial inputs and outputs
• Proving properties of programs on hierarchical nominative data
• Simple-named complex-valued nominative data -- definition and basic operations

Cited in

(20)

• Set-theoretic analysis of nominative data
• Proving properties of programs on hierarchical nominative data
• Nominative data with ordered set of names
• Simple-named complex-valued nominative data -- definition and basic operations
• Kleene algebra of partial predicates
• Partial correctness of a Fibonacci algorithm
• 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
• Basics of intensionalized data: presets, sets, and nominats
• Computability of functions over metanominative data
• Properties of semistructed data with multivalued naming and their use
• Classes of nominative data with fast access to components
• scientific article; zbMATH DE number 2169228 (Why is no real title available?)
• Composition aspects of programmology. II
• General theory and tools for proving algorithms in nominative data systems
• Partial correctness of an algorithm computing Lucas sequences

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1688748)