Stratified least fixpoint logic
dc.contributor.author | Compton, Kevin J. | en_US |
dc.date.accessioned | 2006-04-10T17:57:10Z | |
dc.date.available | 2006-04-10T17:57:10Z | |
dc.date.issued | 1994-08-29 | en_US |
dc.identifier.citation | Compton, Kevin J. (1994/08/29)."Stratified least fixpoint logic." Theoretical Computer Science 131(1): 95-120. <http://hdl.handle.net/2027.42/31383> | en_US |
dc.identifier.uri | http://www.sciencedirect.com/science/article/B6V1G-45DHXJN-1J/2/71d6d52c59d266b7d1b7f4b2eb49565e | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/31383 | |
dc.description.abstract | Stratified least fixpoint logic, or SLFP, characterizes the expressibility of stratified logic programs and, in a different formulation, has been used as a logic of imperative programs. These two formulations of SLFP are proved to be equivalent. A complete sequent calculus with one infinitary rule is given for SLFP. It is argued that SLFP is the most appropriate assertion language for program verification. In particular, it is shown that traditional approaches using first-order logic as an assertion language only restrict to interpretations where first-order logic has the same expressibility as SLFP. | en_US |
dc.format.extent | 1919395 bytes | |
dc.format.extent | 3118 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.language.iso | en_US | |
dc.publisher | Elsevier | en_US |
dc.title | Stratified least fixpoint logic | en_US |
dc.type | Article | en_US |
dc.rights.robots | IndexNoFollow | en_US |
dc.subject.hlbsecondlevel | Mathematics | en_US |
dc.subject.hlbtoplevel | Science | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | EECS Department, University of Michigan, Ann Arbor, MI 48109-2122, USA | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/31383/1/0000296.pdf | en_US |
dc.identifier.doi | http://dx.doi.org/10.1016/0304-3975(94)90091-4 | en_US |
dc.identifier.source | Theoretical Computer Science | en_US |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.