• Home
  • Search
  • Precondition Calculation for Loops Iterating over Data Structures
  • Cite Icon1
  • https://doi.org/10.1109/qrs.2016.25Copy DOI Icon

Precondition Calculation for Loops Iterating over Data Structures

  • Aug 1, 2016
  • Juan Zhai +4 more
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

Precondition calculation is a fundamental program verification technique. Many previous works tried to solve this problem, but ended with limited capability due to loop statements. We conducted a survey on loops manipulating commonly-used data structures occurring in several real-world open-source programs, and found that about 80% of such loops iterate over elements of a data structure, indicating that automatic calculation of preconditions with respect to post-conditions of these loops would cover a great number of real-world programs and greatly ease code verification tasks. In this paper, we specify the execution effect of a program statement using the memories modified by the statement and the new values stored in these memories after executing the statement. Thus, conditional statements and loop statements can be uniformly reduced to a sequence of assignments. Also we present an approach to calculate preconditions with respect to given post-conditions of various program statements including loops that iterate over elements of commonly-used data structures (e.g., acyclic singly-linked lists) based on execution effects of these statements. With execution effects, post-conditions and loop invariants can also be generated. Our approach handles various types of data including numeric, boolean, arrays and user-defined structures. We have implemented the approach and integrated it into the code verification tool, Accumulator. We also evaluated the approach with a variety of programs, and the results show that our approach is able to calculate preconditions for different kinds of post-conditions, including linear ones and universally quantified ones. Preconditions generated with our approach can ease the verification task by reducing the burden of providing loop invariants and preconditions of loop statements manually, which improves the automatic level and efficiency, and makes the verification less error-prone.

Similar Papers
  • PDF
  • Research Article
  • Citations1

Applying High-Level Function Loop Invariants for Machine Code Deductive Verification

  • Jan 01, 2019
  • Proceedings of the Institute for System Programming of the RAS
  • P.A Putro
  • PDF
  • Research Article
  • Citations11

Incorporating Code Structure and Quality in Deep Code Search

  • Feb 16, 2022
  • Applied Sciences
  • Hao Yu +3
  • PDF
  • Research Article
  • Citations8

Basic block coverage for search-based unit testing and crash reproduction

  • Oct 06, 2022
  • Empirical Software Engineering
  • Pouria Derakhshanfar +2
  • Research Article
  • Citations17

GreenC5: An adaptive, energy-aware collection for green software development

  • Nov 24, 2016
  • Sustainable Computing: Informatics and Systems
  • Junya Michanan +2
  • Research Article
  • Citations8

Finding reusable data structures

  • Oct 19, 2012
  • ACM SIGPLAN Notices
  • Guoqing Xu
  • Conference Article

Toward Formal Verification of a Map Copy Method

  • Mar 03, 2021
  • Sarah Blankenship
  • PDF
  • Research Article
  • Citations1

Development of a Water Quality Event Detection and Diagnosis Framework in Drinking Water Distribution Systems with Structured and Unstructured Data Integration

  • Dec 08, 2022
  • Energies
  • Taewook Kim +5
  • PDF
  • Book Chapter
  • Citations5

Optimizing Self-organizing Lists-on-Lists Using Enhanced Object Partitioning

  • Jan 01, 2019
  • O Ekaba Bisong +1
  • Single Report
  • Citations1

Verification of RESRAD-build computer code, version 3.1.

  • Jun 02, 2003
  • Not Given Author
  • Research Article

Universal Java code execution tracer

  • Apr 30, 2026
  • World Journal of Advanced Research and Reviews
  • Rajesh R +3
  • Research Article
  • Citations5

An empirical study of iteration in applications software

  • Sep 01, 1993
  • The Journal of Systems & Software
  • Allan M Stavely
  • Research Article
  • Citations1

Data structures for finite element modelling

  • Jan 01, 1986
  • Engineering Computations
  • D Servranckx +1
  • Research Article
  • Citations9

Functional verification of task partitioning for multiprocessor embedded systems

  • Sep 01, 2007
  • ACM Transactions on Design Automation of Electronic Systems
  • Dipankar Das +2
  • Book Chapter
  • Citations6

Versioned-PROV: A PROV Extension to Support Mutable Data Entities

  • Jan 01, 2018
  • João Felipe N Pimentel +3
  • Research Article

Abstract 4147664: Retrieval-Augmented Generation for Extracting CHADS-VASc and HAS-BLED Risk Factors from Unstructured Clinical Notes in Patients with Atrial Fibrillation

  • Nov 12, 2024
  • Circulation
  • Philip Adejumo +3
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.