Proving properties of programs on hierarchical nominative data
From MaRDI portal
Publication:1650373
zbMath1390.68184MaRDI QIDQ1650373
Mykola Nikitchenko, Ievgen Ivanov, Volodymyr G. Skobelev
Publication date: 3 July 2018
Published in: Computer Science Journal of Moldova (Search for Journal in Brave)
Full work available at URL: http://www.math.md/publications/csjm/issues/v24-n3/12263/
Theory of programming languages (68N15) Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) General topics in the theory of data (68P01)
Related Items (8)
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 ⋮ Partial correctness of GCD algorithm ⋮ Partial correctness of a factorial algorithm ⋮ Partial correctness of a power algorithm ⋮ Partial correctness of a Fibonacci algorithm
This page was built for publication: Proving properties of programs on hierarchical nominative data
