Abstract
Specifications of programs frequently involve operators and functions that are not defined over all of their (syntactic) domains. Proofs about specifications -and those to discharge proof obligations that arise in justifying steps of design- must be based on formal rules. Since classical logic deals only with defined values, some extra thought is required. There are several ways of handling terms that can fail to denote a value - this paper provides a semantically based comparison of three of the best known approaches. In addition, some pointers are given to further alternatives. © 2012 Springer-Verlag.
Cite
CITATION STYLE
Jones, C. B., Lovert, M. J., & Steggles, L. J. (2012). A semantic analysis of logics that cope with partial terms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7316 LNCS, pp. 252–265). https://doi.org/10.1007/978-3-642-30885-7_18
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
