Results 1 - 10 of 307

Verifying SimpleGT Transformations Using an Intermediate Verification Language

by Zheng Cheng , Rosemary Monahan , James F Power
"... Abstract. Previously, we have developed the VerMTLr framework that allows rapid verifier construction for relational model transformation languages. VerMTLr draws on the Boogie intermediate verification language to systematically design a modular and reusable verifier. It also includes a modular fo ..."
Abstract - Add to MetaCart
formalisation of EMFTVM bytecode to ensure verifier soundness. In this work, we will illustrate how to adapt VerMTLr to design a verifier for the SimpleGT graph transformation language, which allows us to soundly prove the correctness of graph transformations. An experiment with the Pacman game demonstrates

Bandera: Extracting Finite-state Models from Java Source Code

by James C. Corbett, Matthew B. Dwyer, John Hatcliff, Shawn Laubach, Corina S. Pasareanu, Hongjun Zheng - IN PROCEEDINGS OF THE 22ND INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING , 2000
"... Finite-state verification techniques, such as model checking, have shown promise as a cost-effective means for finding defects in hardware designs. To date, the application of these techniques to software has been hindered by several obstacles. Chief among these is the problem of constructing a fini ..."
Abstract - Cited by 654 (33 self) - Add to MetaCart
program source code. Bandera takes as input Java source code and generates a program model in the input language of one of several existing verification tools; Bandera also maps verifier outputs back to the original source code. We discuss the major components of Bandera and give an overview of how it can

Analysis of Interacting BPEL Web Services

by Xiang Fu, Tevfik Bultan, Jianwen Su , 2004
"... This paper presents a set of tools and techniques for analyzing interactions of composite web services which are specified in BPEL and communicate through asynchronous XML messages. We model the interactions of composite web services as conversations, the global sequence of messages exchanged by the ..."
Abstract - Cited by 235 (13 self) - Add to MetaCart
to an intermediate representation, followed by the translation of the intermediate representation to a verification language. As an intermediate representation we use guarded automata augmented with unbounded queues for incoming messages, where the guards are expressed as XPath expressions. As the target

A formally verified compiler backend

by Xavier Leroy , 2008
"... This article describes the development and formal verification (proof of semantic preservation) of a compiler back-end from Cminor (a simple imperative intermediate language) to PowerPC assembly code, using the Coq proof assistant both for programming the compiler and for proving its correctness. Su ..."
Abstract - Cited by 104 (14 self) - Add to MetaCart
This article describes the development and formal verification (proof of semantic preservation) of a compiler back-end from Cminor (a simple imperative intermediate language) to PowerPC assembly code, using the Coq proof assistant both for programming the compiler and for proving its correctness

Verifying SystemC using an Intermediate Verification Language and Symbolic Simulation∗

by Hoang M. Le, Daniel Große, Vladimir Herdt, Rolf Drechsler
"... Formal verification of SystemC is challenging. Before deal-ing with symbolic inputs and the concurrency semantics, a front-end is required to translate the design to a formal model. The lack of such front-ends has hampered the devel-opment of efficient back-ends so far. In this paper, we propose an ..."
Abstract - Cited by 4 (1 self) - Add to MetaCart
an isolated approach by using an Intermediate Verification Language (IVL). This enables a SystemC-to-IVL translator (frond-end) and an IVL veri-fier (back-end) to be developed independently. We present a compact but general IVL that together with an extensive benchmark set will facilitate future research

Specifying and Verifying Program Transformations with PTRANS

by William Ernest Mansky , 2014
"... Software developers, compiler designers, and formal methods researchers all stand to benefit from improved tools for compiler design and verification. Program correctness for compiled languages depends fundamen-tally on compiler correctness, and compiler optimizations are usually not formally verifi ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Framework for Optimizations and Program Trans-formations, designed to facilitate stating and reasoning about compiler optimizations and transformations on parallel programs. Most verified compilation projects focus on a single intermediate language and a small number of input and output languages, later

A type system for Java bytecode subroutines

by Raymie Stata, Martín Abadi - In Proceedings of the 25th ACM POPL , 1998
"... Java is typically compiled into an intermediate language, JVML, that is interpreted by the Java Virtual Machine. Because mobile JVML code is not always trusted, a bytecode verifier enforces static constraints that prevent various dynamic errors. Given the importance of the bytecode verifier for secu ..."
Abstract - Cited by 186 (0 self) - Add to MetaCart
their correctness. Our type system constitutes a sound basis for bytecode verification and a rational reconstruction of a delicate part of Sun’s bytecode verifier. 1 Bytecode verification and typing rules The Java language is typically compiled into an intermediate language that is interpreted by the Java Virtual

Towards Verified Model Transformations

by Holger Giese, Sabine Glesner, Johannes Leitner, Wilhelm Schäfer, Robert Wagner - IN PROCEEDINGS OF MODEVA WORKSHOP ASSOCIATED TO MODELS'06 , 2006
"... Model-driven software development (MDD) is seen as a promising approach to improve software quality and reduce production costs significantly. However, one of the problems in using MDD especially in the area of safety-critical systems is the lack of verified transformations. The verification of cruc ..."
Abstract - Cited by 21 (2 self) - Add to MetaCart
Model-driven software development (MDD) is seen as a promising approach to improve software quality and reduce production costs significantly. However, one of the problems in using MDD especially in the area of safety-critical systems is the lack of verified transformations. The verification

Specifying and Verifying a Transformer . . .

by Hervé Marchand, Eric Rutten, Mazen Samaan , 1995
"... We present the specification and verification of the automatic circuit-breaking behavior of an electric power transformer station using the synchronous approach to reactive real-time systems, and particularly the Signal language. The synchronous languages have a mathematical model supporting the var ..."
Abstract - Add to MetaCart
We present the specification and verification of the automatic circuit-breaking behavior of an electric power transformer station using the synchronous approach to reactive real-time systems, and particularly the Signal language. The synchronous languages have a mathematical model supporting

A Polymorphic Intermediate Verification Language: Design and Logical Encoding

by K. Rustan M. Leino, Philipp Rümmer
"... Intermediate languages are a paradigm to separate concerns in software verification systems when bridging the gap between programming languages and the logics understood by theorem provers. While such intermediate languages traditionally only offer rather simple type systems, this paper argues that ..."
Abstract - Cited by 38 (4 self) - Add to MetaCart
that it is both advantageous and feasible to integrate richer type systems with features like (higher-ranked) polymorphism and quantification over types. As a concrete solution, the paper presents the type system of Boogie 2, an intermediate verification language that is used in several program verifiers
Results 1 - 10 of 307