Weak Arithmetic Completeness of Object-Oriented First-Order Assertion Networks
Paper i proceeding, 2013
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.
Författare
S. De Gouw
Leiden University
Centrum voor Wiskunde en Informatica
F. De Boer
Centrum voor Wiskunde en Informatica
Leiden University
Wolfgang Ahrendt
Chalmers, Data- och informationsteknik, Programvaruteknik
Richard Bubel
Technische Universitat Darmstadt
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
03029743 (ISSN) 16113349 (eISSN)
7741 207-2199783642358425 (ISBN)
Styrkeområden
Informations- och kommunikationsteknik
Ämneskategorier (SSIF 2011)
Datavetenskap (datalogi)
DOI
10.1007/978-3-642-35843-2_19
ISBN
9783642358425