Output details
11 - Computer Science and Informatics
University College London
Article title
Axiomatizability of representable domain algebras
Type
D - Journal article
Title of journal
The Journal of Logic and Algebraic Programming
Article number
-
Volume number
80
Issue number
2
First page of article
75
ISSN of journal
1567-8326
Year of publication
2011
URL
-
Number of additional authors
1
Additional information
<10> Domain Algebra is a formalism for binary relations that act as suitable algebras for program verification. This paper resolved an open question concerning axiomatisability, by showing that the representable ones (the ones of interest in verification) cannot be characterised by finitely many axioms. This result influenced the quest for new versions of Domain Algebra; in particular, subsequent work of the same authors (Ordered Domain Algebras, Journal Applied Logic'13) identified a more expressive class of algebras which were finitely axiomatisable.
It also influenced further work in papers of of Moller, Ball, Jackson, Jipson and Stokes on domain algebra.
Interdisciplinary
-
Cross-referral requested
-
Research group
None
Citation count
3
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
