Search: id:"swepub:oai:research.chalmers.se:b966e953-52c4-49b9-805b-19ee6eb9d321" >
Weak Arithmetic Com...
Weak Arithmetic Completeness of Object-Oriented First-Order Assertion Networks
-
- De Gouw, S. (author)
- Stichting Centrum voor Wiskunde & Informatica (CWI),Universiteit Leiden (UL),Leiden University (UL)
-
- De Boer, F. (author)
- Stichting Centrum voor Wiskunde & Informatica (CWI),Universiteit Leiden (UL),Leiden University (UL)
-
- Ahrendt, Wolfgang, 1967 (author)
- Chalmers tekniska högskola,Chalmers University of Technology
-
show more...
-
- Bubel, Richard, 1976 (author)
- Technische Universität Darmstadt
-
show less...
-
(creator_code:org_t)
- ISBN 9783642358425
- Berlin, Heidelberg : Springer Berlin Heidelberg, 2013
- 2013
- English.
-
In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). - Berlin, Heidelberg : Springer Berlin Heidelberg. - 1611-3349 .- 0302-9743. - 9783642358425 ; 7741 LNCS:7741, s. 207-219
- Related links:
-
https://ir.cwi.nl/pu...
-
show more...
-
https://research.cha...
-
https://doi.org/10.1...
-
show less...
Table of contents
Abstract
Subject headings
Close
No table of content available
- We present a completeness proof of the inductive assertion method for object-oriented programs extended with auxiliary variables. The class of programs considered are assumed to compute over structures which include the standard interpretation of Presburger arithmetic. Further, the assertion language is first-order, i.e., quantification only ranges over basic types like that of the natural numbers, Boolean and Object.
Subject headings
- NATURVETENSKAP -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Computer Sciences (hsv//eng)
Publication and Content Type
- kon (subject category)
- ref (subject category)
Find in a library
To the university's database