The Experts below are selected from a list of 7536 Experts worldwide ranked by ideXlab platform
V. Prevosto - One of the best experts on this subject based on the ideXlab platform.
-
TAP@STAF - Static and Dynamic Verification of Relational Properties on Self-composed C Code
Tests and Proofs, 2018Co-Authors: Lionel Blatter, N. Kosmatov, P. Le Gall, V. Prevosto, Guillaume PetiotAbstract:Function contracts are a well-established way of formally specifying the intended behavior of a function. However, they usually only describe what should happen during a single call. Relational properties, on the other hand, link several function calls. They include such properties as non-interference, continuity and monotonicity. Other examples relate sequences of function calls, for instance, to show that decrypting an encrypted message with the appropriate key gives back the original message. Such properties cannot be expressed directly in the traditional setting of modular deductive verification, but are amenable to verification through self-composition. This paper presents a verification technique dedicated to Relational properties in C programs and its implementation in the form of a FRAMA-C plugin called RPP and based on self-composition. It supports functions with side effects and recursive functions. The proposed approach makes it possible to prove a Relational Property, to check it at runtime, to generate a counterexample using testing and to use it as a hypothesis in the subsequent verification. Our initial experiments on existing benchmarks confirm that the proposed technique is helpful for static and dynamic analysis of Relational properties.
-
Static and Dynamic Verification of Relational Properties on Self-Composed C Code
arXiv: Software Engineering, 2018Co-Authors: Lionel Blatter, N. Kosmatov, P. Le Gall, V. Prevosto, Guillaume PetiotAbstract:Function contracts are a well-established way of formally specifying the intended behavior of a function. However, they usually only describe what should happen during a single call. Relational properties, on the other hand, link several function calls. They include such properties as non-interference, continuity and monotonicity. Other examples relate sequences of function calls, for instance, to show that decrypting an encrypted message with the appropriate key gives back the original message. Such properties cannot be expressed directly in the traditional setting of modular deductive verification, but are amenable to verification through self-composition. This paper presents a verification technique dedicated to Relational properties in C programs and its implementation in the form of a FRAMA-C plugin called RPP and based on self-composition. It supports functions with side effects and recursive functions. The proposed approach makes it possible to prove a Relational Property, to check it at runtime, to generate a counterexample using testing and to use it as a hypothesis in the subsequent verification. Our initial experiments on existing benchmarks confirm that the proposed technique is helpful for static and dynamic analysis of Relational properties.
-
RPP: Automatic proof of Relational properties by self-composition
2017Co-Authors: L. Blatter, N. Kosmatov, P. Le Gall, V. PrevostoAbstract:Self-composition provides a powerful theoretical approach to prove Relational properties, i.e. properties relating several program executions, that has been applied to compare two runs of one or similar programs (in secure dataflow properties, code transformations, etc.). This tool demo paper presents RPP, an original implementation of self-composition for specification and verification of Relational properties in C programs in the Frama-C platform. We consider a very general notion of Relational properties invoking any finite number of function calls of possibly dissimilar functions with possible nested calls. The new tool allows the user to specify a Relational Property, to prove it in a completely automatic way using classic deductive verification, and to use it as a hypothesis in the proof of other properties that may rely on it.
-
TACAS (1) - RPP: Automatic Proof of Relational Properties by Self-composition
Tools and Algorithms for the Construction and Analysis of Systems, 2017Co-Authors: Lionel Blatter, N. Kosmatov, P. Le Gall, V. PrevostoAbstract:Self-composition provides a powerful theoretical approach to prove Relational properties, i.e. properties relating several program executions, that has been applied to compare two runs of one or similar programs (in secure dataflow properties, code transformations, etc.). This tool demo paper presents RPP, an original implementation of self-composition for specification and verification of Relational properties in C programs in the Frama-C platform. We consider a very general notion of Relational properties invoking any finite number of function calls of possibly dissimilar functions with possible nested calls. The new tool allows the user to specify a Relational Property, to prove it in a completely automatic way using classic deductive verification, and to use it as a hypothesis in the proof of other properties that may rely on it.
John Van Der Kamp - One of the best experts on this subject based on the ideXlab platform.
-
Towards a new ecological conception of perceptual information: Lessons from a developmental systems perspective
Human Movement Science, 2010Co-Authors: Rob Withagen, John Van Der KampAbstract:Over the last two decades or so, empirical studies of perception, action, learning, and development have revealed that participants vary in what variable they detect and use and often rely on nonspecifying variables. This casts doubt on the Gibsonian conception of information as specification. It is argued that a recent ecological conception of information has solved important problems, but falls short in explaining what determines the object of perception. Drawing on recent work on developmental systems, we sketch the outlines of an alternative conception of perceptual information. It is argued that perceptual information does not reside in the ambient arrays; rather, perceptual information is a Relational Property of patterns in the array and perceptual processes. What a pattern in the ambient flow informs about depends on the perceiver who uses it. Here, we explore the implications of this alternative conception of information for the ecological approach to perception and action.
Rob Withagen - One of the best experts on this subject based on the ideXlab platform.
-
Towards a new ecological conception of perceptual information: Lessons from a developmental systems perspective
Human Movement Science, 2010Co-Authors: Rob Withagen, John Van Der KampAbstract:Over the last two decades or so, empirical studies of perception, action, learning, and development have revealed that participants vary in what variable they detect and use and often rely on nonspecifying variables. This casts doubt on the Gibsonian conception of information as specification. It is argued that a recent ecological conception of information has solved important problems, but falls short in explaining what determines the object of perception. Drawing on recent work on developmental systems, we sketch the outlines of an alternative conception of perceptual information. It is argued that perceptual information does not reside in the ambient arrays; rather, perceptual information is a Relational Property of patterns in the array and perceptual processes. What a pattern in the ambient flow informs about depends on the perceiver who uses it. Here, we explore the implications of this alternative conception of information for the ecological approach to perception and action.
-
towards a new ecological conception of perceptual information lessons from a developmental systems perspective
Human Movement Science, 2010Co-Authors: Rob Withagen, John Van Der KampAbstract:Over the last decades or so, empirical studies of perception, action, learning, and development have revealed that participants vary in what variable they detect and often rely on nonspecifying variables. This casts doubt on the Gibsonian conception of information as specification. It is argued that a recent ecological conception of information has solved important problems, but insufficiently explains what determines the object of perception. Drawing on recent work on developmental systems, we sketch the outlines of an alternative conception of perceptual information. It is argued that perceptual information does not reside in the ambient arrays; rather, perceptual information is a Relational Property of patterns in the array and perceptual processes. What a pattern in the ambient flow informs about depends on the perceiver who uses it. We explore the implications of this alternative conception of information for the ecological approach to perception and action.
Lionel Blatter - One of the best experts on this subject based on the ideXlab platform.
-
Relational properties for specification and verification of C programs in Frama-C
2019Co-Authors: Lionel BlatterAbstract:Deductive verification techniques provide powerful methods for formal verification of properties expressed in Hoare Logic. In this formalization, also known as axiomatic semantics, a program is seen as a predicate transformer, where each program c executed on a state verifying a Property P leads to a state verifying another Property Q. Relational properties, on the other hand, link n program to two properties. More precisely, a Relational Property is a Property about n programs c1; :::; cn stating that if each program ci starts in a state si and ends in a state s0 i such that P(s1; :::; sn) holds, then Q(s0 1; :::; s0 n) holds. Thus, Relational properties invoke any finite number of executions of possibly dissimilar programs. Such properties cannot be expressed directly in the traditional setting of modular deductive verification, as axiomatic semantics cannot refer to two distinct executions of a program c, or different programs c1 and c2. This thesis brings two solutions to the deductive verification of Relational properties. Both of them make it possible to prove a Relational Property and to use it as a hypothesis in the subsequent verifications. We model our solutions using a small imperative language containing procedure calls. Both solutions are implemented in the context of the C programming language, the FRAMA-C platform, the ACSL specification language and the deductive verification plugin WP. The new tool, called RPP, allows one to specify a Relational Property, to prove it using classic deductive verification, and to use it as hypothesis in the proof of other properties. The tool is evaluated over a set of illustrative examples. Experiments have also been made on runtime checking of Relational properties and counterexample generation when a Property cannot be proved.
-
TAP@STAF - Static and Dynamic Verification of Relational Properties on Self-composed C Code
Tests and Proofs, 2018Co-Authors: Lionel Blatter, N. Kosmatov, P. Le Gall, V. Prevosto, Guillaume PetiotAbstract:Function contracts are a well-established way of formally specifying the intended behavior of a function. However, they usually only describe what should happen during a single call. Relational properties, on the other hand, link several function calls. They include such properties as non-interference, continuity and monotonicity. Other examples relate sequences of function calls, for instance, to show that decrypting an encrypted message with the appropriate key gives back the original message. Such properties cannot be expressed directly in the traditional setting of modular deductive verification, but are amenable to verification through self-composition. This paper presents a verification technique dedicated to Relational properties in C programs and its implementation in the form of a FRAMA-C plugin called RPP and based on self-composition. It supports functions with side effects and recursive functions. The proposed approach makes it possible to prove a Relational Property, to check it at runtime, to generate a counterexample using testing and to use it as a hypothesis in the subsequent verification. Our initial experiments on existing benchmarks confirm that the proposed technique is helpful for static and dynamic analysis of Relational properties.
-
Static and Dynamic Verification of Relational Properties on Self-Composed C Code
arXiv: Software Engineering, 2018Co-Authors: Lionel Blatter, N. Kosmatov, P. Le Gall, V. Prevosto, Guillaume PetiotAbstract:Function contracts are a well-established way of formally specifying the intended behavior of a function. However, they usually only describe what should happen during a single call. Relational properties, on the other hand, link several function calls. They include such properties as non-interference, continuity and monotonicity. Other examples relate sequences of function calls, for instance, to show that decrypting an encrypted message with the appropriate key gives back the original message. Such properties cannot be expressed directly in the traditional setting of modular deductive verification, but are amenable to verification through self-composition. This paper presents a verification technique dedicated to Relational properties in C programs and its implementation in the form of a FRAMA-C plugin called RPP and based on self-composition. It supports functions with side effects and recursive functions. The proposed approach makes it possible to prove a Relational Property, to check it at runtime, to generate a counterexample using testing and to use it as a hypothesis in the subsequent verification. Our initial experiments on existing benchmarks confirm that the proposed technique is helpful for static and dynamic analysis of Relational properties.
-
TACAS (1) - RPP: Automatic Proof of Relational Properties by Self-composition
Tools and Algorithms for the Construction and Analysis of Systems, 2017Co-Authors: Lionel Blatter, N. Kosmatov, P. Le Gall, V. PrevostoAbstract:Self-composition provides a powerful theoretical approach to prove Relational properties, i.e. properties relating several program executions, that has been applied to compare two runs of one or similar programs (in secure dataflow properties, code transformations, etc.). This tool demo paper presents RPP, an original implementation of self-composition for specification and verification of Relational properties in C programs in the Frama-C platform. We consider a very general notion of Relational properties invoking any finite number of function calls of possibly dissimilar functions with possible nested calls. The new tool allows the user to specify a Relational Property, to prove it in a completely automatic way using classic deductive verification, and to use it as a hypothesis in the proof of other properties that may rely on it.
P. Le Gall - One of the best experts on this subject based on the ideXlab platform.
-
TAP@STAF - Static and Dynamic Verification of Relational Properties on Self-composed C Code
Tests and Proofs, 2018Co-Authors: Lionel Blatter, N. Kosmatov, P. Le Gall, V. Prevosto, Guillaume PetiotAbstract:Function contracts are a well-established way of formally specifying the intended behavior of a function. However, they usually only describe what should happen during a single call. Relational properties, on the other hand, link several function calls. They include such properties as non-interference, continuity and monotonicity. Other examples relate sequences of function calls, for instance, to show that decrypting an encrypted message with the appropriate key gives back the original message. Such properties cannot be expressed directly in the traditional setting of modular deductive verification, but are amenable to verification through self-composition. This paper presents a verification technique dedicated to Relational properties in C programs and its implementation in the form of a FRAMA-C plugin called RPP and based on self-composition. It supports functions with side effects and recursive functions. The proposed approach makes it possible to prove a Relational Property, to check it at runtime, to generate a counterexample using testing and to use it as a hypothesis in the subsequent verification. Our initial experiments on existing benchmarks confirm that the proposed technique is helpful for static and dynamic analysis of Relational properties.
-
Static and Dynamic Verification of Relational Properties on Self-Composed C Code
arXiv: Software Engineering, 2018Co-Authors: Lionel Blatter, N. Kosmatov, P. Le Gall, V. Prevosto, Guillaume PetiotAbstract:Function contracts are a well-established way of formally specifying the intended behavior of a function. However, they usually only describe what should happen during a single call. Relational properties, on the other hand, link several function calls. They include such properties as non-interference, continuity and monotonicity. Other examples relate sequences of function calls, for instance, to show that decrypting an encrypted message with the appropriate key gives back the original message. Such properties cannot be expressed directly in the traditional setting of modular deductive verification, but are amenable to verification through self-composition. This paper presents a verification technique dedicated to Relational properties in C programs and its implementation in the form of a FRAMA-C plugin called RPP and based on self-composition. It supports functions with side effects and recursive functions. The proposed approach makes it possible to prove a Relational Property, to check it at runtime, to generate a counterexample using testing and to use it as a hypothesis in the subsequent verification. Our initial experiments on existing benchmarks confirm that the proposed technique is helpful for static and dynamic analysis of Relational properties.
-
RPP: Automatic proof of Relational properties by self-composition
2017Co-Authors: L. Blatter, N. Kosmatov, P. Le Gall, V. PrevostoAbstract:Self-composition provides a powerful theoretical approach to prove Relational properties, i.e. properties relating several program executions, that has been applied to compare two runs of one or similar programs (in secure dataflow properties, code transformations, etc.). This tool demo paper presents RPP, an original implementation of self-composition for specification and verification of Relational properties in C programs in the Frama-C platform. We consider a very general notion of Relational properties invoking any finite number of function calls of possibly dissimilar functions with possible nested calls. The new tool allows the user to specify a Relational Property, to prove it in a completely automatic way using classic deductive verification, and to use it as a hypothesis in the proof of other properties that may rely on it.
-
TACAS (1) - RPP: Automatic Proof of Relational Properties by Self-composition
Tools and Algorithms for the Construction and Analysis of Systems, 2017Co-Authors: Lionel Blatter, N. Kosmatov, P. Le Gall, V. PrevostoAbstract:Self-composition provides a powerful theoretical approach to prove Relational properties, i.e. properties relating several program executions, that has been applied to compare two runs of one or similar programs (in secure dataflow properties, code transformations, etc.). This tool demo paper presents RPP, an original implementation of self-composition for specification and verification of Relational properties in C programs in the Frama-C platform. We consider a very general notion of Relational properties invoking any finite number of function calls of possibly dissimilar functions with possible nested calls. The new tool allows the user to specify a Relational Property, to prove it in a completely automatic way using classic deductive verification, and to use it as a hypothesis in the proof of other properties that may rely on it.
