Weakest Precondition Inference for Non-Deterministic Linear Array Programs

Sumanth Prabhu, S and DâSouza, D and Chakraborty, S and Venkatesh, R and Fedyukovich, G (2024) Weakest Precondition Inference for Non-Deterministic Linear Array Programs. In: 30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2024, 6 April 2024 - 11 April 2024, Luxembourg City, pp. 175-195.

PDF lec_not_com-sci_2024.pdf. - Published Version Download (13MB)

Abstract

Precondition inference is an important problem with many applications. Existing precondition inference techniques for programs with arrays have limited ability to find and prove the weakest preconditions, especially when programs have non-determinism. In this paper, we propose an approach to overcome the limitation. As the problem is uncomputable in general, our approach targets a special class of programs called linear array programs that are commonly encountered in practical applications and have been studied before. We also focus on a class of quantified formulas for pre- and postconditions that suffice to specify program properties in many applications. Our approach uses two novel techniques called Structural Array Abduction (SAA) and Specialized Maximality Checking (SMC). SAA is an abduction-based technique used to infer quantified preconditions and necessary inductive invariants. SMC proves that an inferred precondition is the weakest by finding an under-approximated program and solving the complement verification problem on it using SAA. When inconclusive, it attempts to weaken the precondition. Our approach can infer (and also prove) the weakest preconditions for a range of benchmarks relatively quickly, and outperforms competing techniques. © The Author(s) 2024.

Item Type:	Conference Paper
Publication:	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Publisher:	Springer Science and Business Media Deutschland GmbH
Additional Information:	The copyright for this article belongs to authors.
Keywords:	Deterministics; Inference techniques; Linear-array; Maximality; Non Determinism; Pre- and postcondition; Program properties; Special class; Structural arrays; Weakest precondition, Application programs
Department/Centre:	Division of Electrical Sciences > Computer Science & Automation
Date Deposited:	30 May 2024 04:36
Last Modified:	30 May 2024 04:36
URI:	https://eprints.iisc.ac.in/id/eprint/85026

Actions (login required)

View Item