Results 1 - 10 of 93

Formal verification in Coq of program properties involving the global state effect

by Jean-guillaume Dumas, Dominique Duval, Burak Ekici, Damien Pous , 2013
"... The syntax of an imperative language does not mention explicitly the state, while its denotational semantics has to mention it. In this paper we present a framework for the verification in Coq of properties of programs manipulating the global state effect. These properties are expressed in a proof s ..."
Abstract - Cited by 2 (2 self) - Add to MetaCart
The syntax of an imperative language does not mention explicitly the state, while its denotational semantics has to mention it. In this paper we present a framework for the verification in Coq of properties of programs manipulating the global state effect. These properties are expressed in a proof

Parameterized Specification and Verification of PLC Systems in Coq

by Hai Wan, Xiaoyu Song, Ming Gu , 2010
"... Abstract—Programmable logic controllers (PLCs) represent a typical class of embedded software systems. They are widely used in safety-critical industrial applications, such as railways, automotive applications, etc. The paper presents a novel method to specify and verify PLC software systems with th ..."
Abstract - Add to MetaCart
with the theorem proving system Coq. Dependent inductive data types are harnessed to represent the component specifications. Modular and parameterized specification and verification are proposed. An illustrative example demonstrates the effectiveness of the method. I.

Algebraic Effects and Effect Handlers for Idioms and Arrows

by Sam Lindley
"... Plotkin and Power’s algebraic effects combined with Plotkin and Pretnar’s effect handlers provide a foundation for modular pro-gramming with effects. We present a generalisation of algebraic effects and effect handlers to support other kinds of effectful com-putations corresponding to McBride and Pa ..."
Abstract - Add to MetaCart
Plotkin and Power’s algebraic effects combined with Plotkin and Pretnar’s effect handlers provide a foundation for modular pro-gramming with effects. We present a generalisation of algebraic effects and effect handlers to support other kinds of effectful com-putations corresponding to Mc

Modular Verification of Software Units

by Corina S. Pasareanu, Matthew B. Dwyer, Michael Huth , 1999
"... . A variety of assume-guarantee model checking approaches have been proposed in the literature. In this paper, we adapt those approaches to checking guarantees (written in LTL and 8CTL) of software units in isolation. We propose to synthesize program fragments that implement the behavior specified b ..."
Abstract - Add to MetaCart
. A variety of assume-guarantee model checking approaches have been proposed in the literature. In this paper, we adapt those approaches to checking guarantees (written in LTL and 8CTL) of software units in isolation. We propose to synthesize program fragments that implement the behavior specified

Modular verification of a non-blocking stack

by Matthew Parkinson, Richard Bornat, Peter O’Hearn - PRINCIPLES OF PROGRAMMING LANGUAGES (POPL) , 2007
"... This paper contributes to the development of techniques for the modular proof of programs that include concurrent algorithms. We present a proof of a non-blocking concurrent algorithm, which provides a shared stack. The inter-thread interference, which is essential to the algorithm, is confined in t ..."
Abstract - Cited by 31 (5 self) - Add to MetaCart
in the proof and the specification to the modular operations, which perform push and pop on the stack. This is achieved by the mechanisms of separation logic. The effect is that inter-thread interference does not pollute specification or verification of clients of the stack.

Extending Coq with Imperative Features and its Application to SAT Verification

by Arnaud Spiwack, Inria Sophia Antipolis Méditerranée
"... Abstract. Coq has within its logic a programming language that can be used effectively to replace many deduction steps into a single compu-tation, this is the so-called reflection. In this paper, we present a major improvement of the evaluation mechanism that preserves its correctness and makes it p ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Abstract. Coq has within its logic a programming language that can be used effectively to replace many deduction steps into a single compu-tation, this is the so-called reflection. In this paper, we present a major improvement of the evaluation mechanism that preserves its correctness and makes

Modular Verification for Aspect-Oriented Interfaces

by Mehdi Bagherzadeh, Hridesh Rajan, Gary T. Leavens, Sean Mooney, Mehdi Bagherzadeh, Hridesh Rajan, Gary T. Leavens, Sean Mooney, Mehdi Bagherzadeh Θ , 2010
"... As aspect-oriented programming techniques become more widely used, their use in critical systems, including safety-critical systems such as aircraft and mission-critical systems such as telephone networks, will become more widespread. However, careful reasoning about aspect-oriented code seems diffi ..."
Abstract - Add to MetaCart
we give a simple and understandable specification technique, which we call translucid contracts, that not only allows programmers to write modular specifications for advice and advised code, but also allows them to reason about the code’s control effects. We show that translucid contracts support

Extending JML for modular specification and verification of multi-threaded programs

by Edwin Rodríguez, Matthew Dwyer, Cormac Flanagan, John Hatcliff, Gary T. Leavens - In ECOOP, LNCS 3586 , 2005
"... Abstract. The Java Modeling Language (JML) is a formal specification language for Java that allows developers to specify rich software contracts for interfaces and classes, using pre- and postconditions and invariants. Although JML has been widely studied and has robust tool support based on a varie ..."
Abstract - Cited by 25 (5 self) - Add to MetaCart
variety of automated verification technologies, it shares a problem with many similar object-oriented specification languages—it currently only deals with sequential programs. In this paper, we extend JML to allow for effective specification of multi-threaded Java programs. The new constructs rely

Verification of Non-Functional Programs using Interpretations in Type Theory

by Jean-Christophe Filliâtre
"... We study the problem of certifying programs combining imperative and functional features within the general framework of type theory. Type theory constitutes a powerful specification language, which is naturally suited for the proof of purely functional programs. To deal with imperative programs, we ..."
Abstract - Cited by 64 (4 self) - Add to MetaCart
, we propose a logical interpretation of an annotated program as a partial proof of its specification. The construction of the corresponding partial proof term is based on a static analysis of the effects of the program, and on the use of monads. The usual notion of monads is refined in order

A.: Modular aspect verification for safer aspectbased evolution

by Nathan Weston, Francois Taiani, Awais Rashid - In: RAM-SE Workshop, with ECOOP , 2005
"... Abstract. A long-term research goal for Aspect-Oriented Programming is the modular verification of aspects such that safe evolution and reuse is facilitated. However, one of the fundamental problems with verifying aspect-oriented programs is the inability to determine the effect of the weaving proce ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
Abstract. A long-term research goal for Aspect-Oriented Programming is the modular verification of aspects such that safe evolution and reuse is facilitated. However, one of the fundamental problems with verifying aspect-oriented programs is the inability to determine the effect of the weaving
Results 1 - 10 of 93