Verifying Data Independent Programs Using Game Semantics

Abstract : We address the problem of verification of program terms parameterized by a data type X, such that the only operations involving X a program can perform are to input, output, and assign values of type X, as well as to test for equality such values. Such terms are said to be data independent with respect to X. Logical relations for game semantics of terms are defined, and it is shown that the Basic Lemma holds for them. This proves that terms are predicatively parametrically polymorphic, and it provides threshold collections, i.e. sufficiently large finite interpretations of X, for the problem of verification of observational-equivalence, approximation, and safety of parameterized terms for all interpretations of X. In this way we can verify terms with data independent infinite integer types. The practicality of the approach is evaluated on several examples.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/hal-01492794
Contributor : Hal Ifip <>
Submitted on : Monday, March 20, 2017 - 3:40:13 PM
Last modification on : Tuesday, January 16, 2018 - 3:43:54 PM
Long-term archiving on : Wednesday, June 21, 2017 - 1:24:13 PM

File

978-3-642-39614-4_9_Chapter.pd...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Aleksandar Dimovski. Verifying Data Independent Programs Using Game Semantics. 12th International Conference on Software Composition (SC), Jun 2013, Budapest, Hungary. pp.128-143, ⟨10.1007/978-3-642-39614-4_9⟩. ⟨hal-01492794⟩

Share

Metrics

Record views

383

Files downloads

113