Results 1 - 10 of 654

Invariant Assertions for Program Proofs

by Mark Ardis, Curtis Clifton , 2010
"... There are a few different methods for formally proving that a program agrees with its specifica-tion. The first method we will examine is the invariant assertion method. The method was first proposed for flowcharts by Robert Floyd [3] and then adapted for program code by Tony Hoare [5]. Edsger Dijks ..."
Abstract - Add to MetaCart
There are a few different methods for formally proving that a program agrees with its specifica-tion. The first method we will examine is the invariant assertion method. The method was first proposed for flowcharts by Robert Floyd [3] and then adapted for program code by Tony Hoare [5]. Edsger

Invariant Assertions, Invariant Relations, and Invariant Functions

by Olfa Mraihi, Asma Louhichi, Lamia Labed Jilani, Jules Desharnais, Ali Mili , 2012
"... Invariant assertions play an important role in the analysis and documentation of while loops of imperative programs. Invariant functions and invariant relations are alternative analysis tools that are distinct from invariant assertions but are related to them. In this paper we discuss these three co ..."
Abstract - Add to MetaCart
Invariant assertions play an important role in the analysis and documentation of while loops of imperative programs. Invariant functions and invariant relations are alternative analysis tools that are distinct from invariant assertions but are related to them. In this paper we discuss these three

A Comparative Study of Invariant Assertions, Invariant Relations, and Invariant Functions

by Asma Louhichi, Olfa Mraihi, Lamia Labed Jilani, Ali Mili
"... Invariant assertions play an important role in the analysis and documentation of while loops of imperative programs. Invariant functions and invariant relations are alternative analysis tools that are distinct from invariant assertions but are related to them. In this paper we discuss these three co ..."
Abstract - Add to MetaCart
Invariant assertions play an important role in the analysis and documentation of while loops of imperative programs. Invariant functions and invariant relations are alternative analysis tools that are distinct from invariant assertions but are related to them. In this paper we discuss these three

AUTOMATIC SYNTHESlS OF OPTIMAL INVARIANT ASSERTIONS: MATHEMATICAL FOUNDATIONS

by Patrick Cousot, Radhia Cousot
"... The problem of discovering invariant assertions of programs is explored in light of the fixpoint approach in the static analysis of programs, Cousot [1977a], Cousot[1977b]. ..."
Abstract - Add to MetaCart
The problem of discovering invariant assertions of programs is explored in light of the fixpoint approach in the static analysis of programs, Cousot [1977a], Cousot[1977b].

Reasoning about Real-Time Programs Using Idle-Invariant Assertions

by Ian Hayes , 2000
"... We develop a set of laws for reasoning about real-time programs using assertions (preconditions and postconditions) in the style of Hoare. In the real-time context assertions may refer to the current time and to the value of external inputs, which are not under the direct control of the program an ..."
Abstract - Add to MetaCart
and hence not guaranteed to be stable with respect to the passage of time (even if the program does not modify any of the variables under its control). Hence in order to reason about real-time programs, we make use of idle-invariant assertions: assertions that are invariant to just the passage of time.

CSSE 373-- Formal Methods in Specification and Design-- Fall 2005 1 Invariant Assertions for Program Proofs

by Mark Ardis , 2005
"... There are a few different methods for formally proving that a program agrees with its specification. The first method we will examine is the Invariant Assertion method. The method was first proposed for flowcharts by Robert Floyd [Floyd 67] and then adapted for program code by Tony Hoare [Hoare 69]. ..."
Abstract - Add to MetaCart
There are a few different methods for formally proving that a program agrees with its specification. The first method we will examine is the Invariant Assertion method. The method was first proposed for flowcharts by Robert Floyd [Floyd 67] and then adapted for program code by Tony Hoare [Hoare 69

The Pointer Assertion Logic Engine

by Anders Møller, Michael I. Schwartzbach - Proc. ACM PLDI , 2001
"... We present a new framework for verifying partial specifications of programs in order to catch type and memory errors and check data structure invariants. Our technique can verify a large class of data structures, namely all those that can be expressed as graph types. Earlier versions were restricted ..."
Abstract - Cited by 156 (3 self) - Add to MetaCart
We present a new framework for verifying partial specifications of programs in order to catch type and memory errors and check data structure invariants. Our technique can verify a large class of data structures, namely all those that can be expressed as graph types. Earlier versions were

The Daikon system for dynamic detection of likely invariants

by Michael D. Ernst, Jeff H. Perkins, Philip J. Guo, Stephen McCamant, Carlos Pacheco, Matthew S. Tschantz, Chen Xiao , 2006
"... Daikon is an implementation of dynamic detection of likely invariants; that is, the Daikon invariant detector reports likely program invariants. An invariant is a property that holds at a certain point or points in a program; these are often used in assert statements, documentation, and formal speci ..."
Abstract - Cited by 243 (10 self) - Add to MetaCart
Daikon is an implementation of dynamic detection of likely invariants; that is, the Daikon invariant detector reports likely program invariants. An invariant is a property that holds at a certain point or points in a program; these are often used in assert statements, documentation, and formal

Automatic Generation of Invariants and Intermediate Assertions

by Nikolaj Bjørner, Anca Browne, Zohar Manna , 1995
"... Verifying temporal specifications of reactive and concurrent systems commonly relies on generating auxiliary assertions and strengthening given properties of the system. Two dual approaches find solutions to these problems: the bottom-up method performs an abstract forward propagation of the system, ..."
Abstract - Cited by 59 (4 self) - Add to MetaCart
the verification. The paper overviews some of the exact and approximate analysis methods to generate and strengthen assertions for the verification of invariance properties. By formulating and analyzing a generic safety verification rule, we extend these methods to the verification of general temporal safety

Parameterized Verification with Automatically Computed Inductive Assertions

by T. Arons, A. Pnueli, S. Ruah, J. Xu, L. Zuck , 2001
"... The paper presents a method, called the method of verification by invisible invariants, for the automatic verification of a large class of parameterized systems. The method is based on the automatic calculation of candidate inductive assertions and checking for their inductiveness, using symbolic mo ..."
Abstract - Cited by 90 (9 self) - Add to MetaCart
The paper presents a method, called the method of verification by invisible invariants, for the automatic verification of a large class of parameterized systems. The method is based on the automatic calculation of candidate inductive assertions and checking for their inductiveness, using symbolic
Results 1 - 10 of 654