2013
DOI: 10.1007/978-3-642-35843-2_19
| View full text |Cite
|
Sign up to set email alerts
|

Abstract: Abstract. 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.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2014
2014
2022
2022

Publication Types

Select...
2
1

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 16 publications
0
1
0
Order By: Relevance
“…It is not difficult though tedious to show that using auxiliary array variables we can express in our firstorder language strongest post-conditions for our programming language. In fact, in [23], we prove that the strongest post-condition of a formula in the language of Presburger arithmetic and a program instrumented with auxiliary variables in a suitable manner is definable in Presburger arithmetic itself. This is surprising, since the standard approach to show that the strongest post-condition is definable is based on the usual Gödel encoding of partial recursive functions, which relies on the presence of multiplication in the assertion language, and multiplication is not available in Presburger arithmetic.…”
Section: Expressivenessmentioning
confidence: 99%
“…It is not difficult though tedious to show that using auxiliary array variables we can express in our firstorder language strongest post-conditions for our programming language. In fact, in [23], we prove that the strongest post-condition of a formula in the language of Presburger arithmetic and a program instrumented with auxiliary variables in a suitable manner is definable in Presburger arithmetic itself. This is surprising, since the standard approach to show that the strongest post-condition is definable is based on the usual Gödel encoding of partial recursive functions, which relies on the presence of multiplication in the assertion language, and multiplication is not available in Presburger arithmetic.…”
Section: Expressivenessmentioning
confidence: 99%