NDLI: Discovering properties about arrays in simple programs

Content Provider	ACM Digital Library
Author	Péron, Mathias Halbwachs, Nicolas
Abstract	Array bound checking and array dependency analysis (for parallelization) have been widely studied. However, there are much less results about analyzing properties of array contents. In this paper, we propose a way of using abstract interpretation for discovering properties about array contents in some restricted cases: one-dimensional arrays, traversed by simple "for" loops. The basic idea, borrowed from [GRS05], consists in partitioning arrays into symbolic intervals (e.g., [1,i -- 1], [i,i], [i + 1,n]), and in associating with each such interval I and each array A an abstract variable $A_{I};$ the new idea is to consider relational abstract properties $ψ(A_{I},$ $B_{I},$ .) about these abstract variables, and to interpret such a property pointwise on the interval I: ∀l ∈ I, ψ(A[l], B[l],.). The abstract semantics of our simple programs according to these abstract properties has been defined and implemented in a prototype tool. The method is able, for instance, to discover that the result of an insertion sort is a sorted array, or that, in an array traversal guarded by a "sentinel", the index stays within the bounds.
Starting Page	339
Ending Page	348
Page Count	10
File Format	PDF
ISSN	03621340 15581160
DOI	10.1145/1379022.1375623
Journal	ACM SIGPLAN Notices (SIGP)
Volume Number	43
Issue Number	6
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	1983-05-01
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Invariant synthesis Abstract interpretation "sentinel" Arrays Program verification Sorting algorithms
Content Type	Text
Resource Type	Article
Subject	Computer Graphics and Computer-Aided Design Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Discovering properties about arrays in simple programs

Discovering properties about arrays in simple programs

Discovering properties about arrays in simple programs

Bridging boolean and quantitative synthesis using smoothed proof search

Verifying safety properties using separation and heterogeneous abstractions

Verification of Erlang programs using abstract interpretation and model checking

From program verification to program synthesis

MapReduce program synthesis

Invariant properties of algorithms

Discovering properties about arrays in simple programs

Similar Documents

Discovering properties about arrays in simple programs

Discovering properties about arrays in simple programs

Discovering properties about arrays in simple programs

Bridging boolean and quantitative synthesis using smoothed proof search

Verifying safety properties using separation and heterogeneous abstractions

Verification of Erlang programs using abstract interpretation and model checking

From program verification to program synthesis

MapReduce program synthesis

Invariant properties of algorithms

Discovering properties about arrays in simple programs