• Home
  • Search
  • Applying High-Level Function Loop Invariants for Machine Code Deductive Verification
  • Cite Icon1
  • https://doi.org/10.15514/ispras-2019-31(3)-10Copy DOI Icon

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

  • Abstract
  • Highlights & Summary
  • PDF
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

The existing tools of deductive verification allow us to successfully prove the correctness of functions written in high-level languages such as C or Java. However, this may not be enough for critical software because even fully verified code cannot guarantee the correct generation of machine code by the compiler. At the moment, developers of such systems have to accept the compiler correctness assumption, which, however, is extremely undesirable, but inevitable due to the lack of full-fledged systems of formal verification of machine code. It is also worth noting that the verification of machine code by a person directly is an extremely time-consuming task due to the high complexity and large amounts of machine code. One of the approaches to simplify the verification of machine code is automatic deductive verification reusing the formal specification of the high-level language function. The formal specification of the function consists of the specification of the pre- and postcondition, as well as loop invariants, which specify conditions that are satified at each iteration of the loop. When compiling a program into machine code, pre- and postconditions are preserved, which, however, cannot be said about loop invariants. This fact is one of the main problems of automatic verification of machine code with loops. Another important problem is that high-level function variables often have ‘projections' to both registers and memory at the machine code level, and the verification procedure requires that invariants be described for each variable, and therefore the missing invariants must be generated. This paper presents an approach to solving these problems, based on the analysis of the control flow graph, and intelligent search of the locations of variables.

Loading PDF

Similar Papers
  • Conference Article
  • Citations2

Robust Practical Binary Optimization at Run-time using LLVM

  • Nov 01, 2020
  • Alexis Engelke +1
  • Research Article
  • Citations3

Towards deductive verification of C programs with shared data

  • Sep 01, 2016
  • Programming and Computer Software
  • M U Mandrykin +1
  • Conference Article

Toward Formal Verification of a Map Copy Method

  • Mar 03, 2021
  • Sarah Blankenship
  • Conference Article
  • Citations1

Precondition Calculation for Loops Iterating over Data Structures

  • Aug 01, 2016
  • Juan Zhai +4
  • Book Chapter
  • Citations9

Multi-level Virtual Machine Debugging Using the Java Platform Debugger Architecture

  • Jan 01, 2010
  • Thomas Würthinger +2
  • Conference Article
  • Citations10

A Temporal Requirements Language for Deductive Verification of Process-Oriented Programs

  • Jun 30, 2022
  • Ivan Chernenko +3
  • Conference Article

Fluent Interfaces to a Java-based Internal Domain-Specific Languages for Graph Generation and Analysis

  • Jan 01, 2013
  • Ken A Hawick
  • Book Chapter

Compilers and Interpreters

  • Jan 01, 1982
  • Graham Lee
  • Book Chapter

RISC

  • Jan 01, 1989
  • Computer Jargon Explained
  • Nicholas Enticknap
  • Research Article
  • Citations35

Verification of safety properties for concurrent assembly code

  • Sep 19, 2004
  • ACM SIGPLAN Notices
  • Dachuan Yu +1
  • Conference Article

VeriOover: A Verifier for Detecting Integer Overflow by Loop Abstraction

  • Jan 01, 2023
  • Jian Fang +1
  • Research Article
  • Citations3

Pascal is a 'natural' [for microprocessor software programs

  • Mar 01, 1979
  • IEEE Spectrum
  • Kenneth Wickham
  • Conference Article
  • Citations30

Polymorphic type inference for machine code

  • Jun 02, 2016
  • Matt Noonan +2
  • Research Article
  • Citations10

Polymorphic type inference for machine code

  • Jun 02, 2016
  • ACM SIGPLAN Notices
  • Matt Noonan +2
  • Supplementary Content
  • Citations13

A manifestation of model-code duality: facilitating the representation of state machines in the umple model-oriented programming language

  • Jan 01, 2012
  • uO Research (University of Ottawa)
  • Timothy C Lethbridge +1
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.