Weak Arithmetic Completeness of Object-Oriented First-Order Assertion Networks
Paper in proceedings, 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.

Author

S. De Gouw

Leiden University

Centrum voor Wiskunde en Informatica

F. De Boer

Leiden University

Centrum voor Wiskunde en Informatica

Wolfgang Ahrendt

Chalmers, Computer Science and Engineering (Chalmers), Software Technology (Chalmers)

Richard Bubel

Technische Universität Darmstadt

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

03029743 (ISSN) 16113349 (eISSN)

7741 207-219

Areas of Advance

Information and Communication Technology

Subject Categories

Computer Science

DOI

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

ISBN

9783642358425

More information

Latest update

2/28/2018