Axiomatization of if-then-else over possibly non-halting programs and tests

DOI10.1142/S0218196717500138zbMATH Open1365.68165arXiv1609.00132OpenAlexW2963084075MaRDI QIDQ5269894FDOQ5269894

Author name not available (Why is that?)

Publication date: 28 June 2017

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Abstract: In order to study the axiomatization of the if-then-else construct over possibly non-halting programs and tests, this paper introduces the notion of $C$-sets by considering the tests from an abstract $C$-algebra. When the $C$-algebra is an ada, the axiomatization is shown to be complete by obtaining a subdirect representation of $C$-sets. Further, this paper considers the equality test with the if-then-else construct and gives a complete axiomatization through the notion of agreeable $C$-sets.

Full work available at URL: https://arxiv.org/abs/1609.00132

Recommendations

• On the Axiomatization of “If-Then-Else”
• scientific article
• Equality-Test and If-Then-Else Algebras: Axiomatization and Specification
• Halting and equivalence of program schemes in models of arbitrary theories
• Decidability of logic program semantics and applications to testing
• Finite axiom systems for testing preorder and De Simone process languages
• Termination assertions for recursive programs: Completeness and axiomatic definability
• The axiomatic semantics of programs based on Hoare's logic
• A satisfiability tester for non-clausal propositional calculus

zbMATH Keywords

axiomatization\(C\)-algebraif-then-elsenon-halting programs

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites Work

• Title not available (Why is that?)
• On a three-valued logical calculus and its application to the analysis of the paradoxes of the classical extended functional calculus
• Conditional Assertion and Restricted Quantification
• Title not available (Why is that?)
• On notation for ordinal numbers
• A propositional logic with 4 values: true, false, divergent and meaningless
• Actions of Boolean rings on sets
• SEMIGROUPS WITH if–then–else AND HALTING PROGRAMS
• Title not available (Why is that?)
• Title not available (Why is that?)
• The algebra of conditional logic
• Triples and compact sheaf representation
• A transformational characterization of if-then-else
• Comparison semigroups and algebras of transformations.
• Varieties of ”If-Then-Else“
• On the Axiomatization of “If-Then-Else”
• Equational Bases for If–Then–Else
• Adas and the equational theory of if-then-else
• Equality-Test and If-Then-Else Algebras: Axiomatization and Specification
• Sets with \(B\)-action and linear algebra
• Monoids with tests and the algebra of possibly non-halting programs
• Conditional Expressions with Equality Tests

Cited In (5)

• Algebraic properties of if-then-else and commutative three-valued tests
• Monoids of non-halting programs with tests
• A transformational characterization of if-then-else
• On the Axiomatization of “If-Then-Else”
• On the structure of \(C\)-algebras through atomicity and \texttt{if-then-else}

This page was built for publication: Axiomatization of if-then-else over possibly non-halting programs and tests

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