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

Universiteit Leiden

Centrum voor Wiskunde en Informatica

F. De Boer

Universiteit Leiden

Centrum voor Wiskunde en Informatica

Wolfgang Ahrendt

Chalmers, Data- och informationsteknik, Programvaruteknik

Richard Bubel

Technische Universität Darmstadt

Lecture Notes in Computer Science

0302-9743 (ISSN)

207-219

Styrkeområden

Informations- och kommunikationsteknik

Ämneskategorier

Datavetenskap (datalogi)

DOI

10.1007/978-3-642-35843-2_19

ISBN

9783642358425