Checking Observational Purity of Procedures

by   Himanshu Arora, et al.

Verifying whether a procedure is observationally pure is useful in many software engineering scenarios. An observationally pure procedure always returns the same value for the same argument, and thus mimics a mathematical function. The problem is challenging when procedures use private mutable global variables, e.g., for memoization of frequently returned answers, and when they involve recursion. We present a novel verification approach for this problem. Our approach involves encoding the procedure's code as a formula that is a disjunction of path constraints, with the recursive calls being replaced in the formula with references to a mathematical function symbol. Then, a theorem prover is invoked to check whether the formula that has been constructed agrees with the function symbol referred to above in terms of input-output behavior for all arguments. We evaluate our approach on a set of realistic examples, using the Boogie intermediate language and theorem prover. Our evaluation shows that the invariants are easy to construct manually, and that our approach is effective at verifying observationally pure procedures.



page 1

page 2

page 3

page 4


Abduction of trap invariants in parameterized systems

In a previous paper we have presented a CEGAR approach for the verificat...

When Regression Verification Meets CEGAR

Software systems evolve throughout their life cycles. Many revisions are...

The Gamma Function via Interpolation

The Lanczos formula for the Gamma function is used in many software libr...

A Completeness Proof for A Regular Predicate Logic with Undefined Truth Value

We provide a sound and complete proof system for an extension of Kleene'...

A Flexible Approach for Checking Timed Automata on Continuous Time Semantics

Timed Automata (TA) are used to represent systems when the interest is t...

A Study of Continuous Vector Representationsfor Theorem Proving

Applying machine learning to mathematical terms and formulas requires a ...

On Transforming Functions Accessing Global Variables into Logically Constrained Term Rewriting Systems

In this paper, we show a new approach to transformations of an imperativ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.