Results 1 - 10 of 2,508

A Case Study in Formal Verification using Multiple Explicit Heaps

by Wojciech Mostowski
"... Abstract. In the context of the KeY program verifier and the associated Dynamic Logic for Java we discuss the first instance of applying a generalised approach to the treatment of memory heaps in verification. Namely, we allow verified programs to simultaneously modify several different, but possibl ..."
Abstract - Cited by 2 (2 self) - Add to MetaCart
heaps, and we used that framework to implement the formalisation of Java Card atomic transactions. Commonly, a formal specification language, such as JML, hides the notion of the heap from the user. In our approach the heap becomes a first class parameter (yet transparent in the default verification

A theory of timed automata

by Rajeev Alur , 1999
"... Model checking is emerging as a practical tool for automated debugging of complex reactive systems such as embedded controllers and network protocols (see [23] for a survey). Traditional techniques for model checking do not admit an explicit modeling of time, and are thus, unsuitable for analysis of ..."
Abstract - Cited by 2651 (32 self) - Add to MetaCart
using finitely many real-valued clock variables. Automated analysis of timed automata relies on the construction of a finite quotient of the infinite space of clock valuations. Over the years, the formalism has been extensively studied leading to many results establishing connections to circuits

Scalable statistical bug isolation

by Ben Liblit, Alex Aiken, Mayur Naik, Alice X. Zheng - In Proceedings of the ACM SIGPLAN 2005 Conference on Programming Language Design and Implementation , 2005
"... We present a statistical debugging algorithm that isolates bugs in programs containing multiple undiagnosed bugs. Earlier statistical algorithms that focus solely on identifying predictors that correlate with program failure perform poorly when there are multiple bugs. Our new technique separates th ..."
Abstract - Cited by 304 (14 self) - Add to MetaCart
studies, including examples in which the algorithm identified previously unknown, significant crashing bugs in widely used systems. Categories and Subject Descriptors D.2.4 [Software Engineering]: Software/Program Verification—statistical methods; D.2.5

Formal Verification of Standards for Distance Vector Routing Protocols

by Karthikeyan Bhargavan, Davor Obradovic, Carl A. Gunter , 2000
"... We show how to use an interactive theorem prover, HOL, together with a model checker, SPIN, to prove key properties of distance vector routing protocols. We do three case studies: correctness of the RIP standard, a sharp realtime bound on RIP stability, and preservation of loop-freedom in AODV, a di ..."
Abstract - Cited by 86 (5 self) - Add to MetaCart
We show how to use an interactive theorem prover, HOL, together with a model checker, SPIN, to prove key properties of distance vector routing protocols. We do three case studies: correctness of the RIP standard, a sharp realtime bound on RIP stability, and preservation of loop-freedom in AODV, a

Formal Verification of the AAMP5 Microprocessor - A Case Study in the . . .

by Steven P. Miller , 1995
"... This paper describes the experiences of Collins Commercial Avionics and SRI International in formally specifying and verifying the microcode for the AAMP5 microprocessor with the PVS verification system. This project was conducted to determine if an industrial microprocessor designed for use in real ..."
Abstract - Cited by 66 (1 self) - Add to MetaCart
This paper describes the experiences of Collins Commercial Avionics and SRI International in formally specifying and verifying the microcode for the AAMP5 microprocessor with the PVS verification system. This project was conducted to determine if an industrial microprocessor designed for use

General Multi-Level Linear Modelling for Group Analysis in FMRI

by Christian F. Beckmann, Mark Jenkinson, Stephen M. Smith - NeuroImage , 2003
"... This paper discusses general modelling of multi-subject and/or multi-session FMRI data. In particular, we show that a two-level mixed-effects model (where parameters of interest at the group level are estimated from parameter and variance estimates from the single-session level) can be made equivale ..."
Abstract - Cited by 209 (8 self) - Add to MetaCart
in FMRI. The simple and generalised framework allows for different pre-whitening and different first-level regressors to be used for each subject. The framework incorporates multiple levels and cases such as repeated measures, paired or unpaired t-tests and F -tests at the group level; explicit examples

Formal Methods for Verification and Validation of partial specifications: A Case Study

by Steve Easterbrook, John Callahan , 1997
"... This paper describes our work exploring the suitability of formal specification methods for independent verification and validation (IV&V) of software specifications for large, safety critical systems. An IV&V contractor often has to perform rapid analysis on incomplete specifications, with ..."
Abstract - Cited by 34 (2 self) - Add to MetaCart
, with no control over how those specifications are represented. Lightweight formal methods show significant promise in this context, as they offer a way of uncovering major errors, without the burden of full proofs of correctness. We describe a case study of the use of partial formal models for V

Using the SimOS Machine Simulator to Study Complex Computer Systems

by Mendel Rosenblum , Edouard Bugnion, Scott Devine, Stephen A. Herrod - ACM TRANSACTIONS ON MODELING AND COMPUTER SIMULATION , 1997
"... ... This paper identifies two challenges that machine simulators such as SimOS must overcome in order to effectively analyze large complex workloads: handling long workload execution times and collecting data effectively. To study long-running workloads, SimOS includes multiple interchangeable simul ..."
Abstract - Cited by 172 (7 self) - Add to MetaCart
flexible annotation and event classification mechanisms that map the data back to concepts meaningful to the user. SimOS has been extensively used to study new computer hardware designs, to analyze application performance, and to study operating systems. We include two case studies that demonstrate how a

Exploiting Refactoring in Formal Verification

by Xiang Yin, John Knight, Westley Weimer
"... In previous work, we introduced Echo, a new approach to the formal verification of the functional correctness of software. Part of what makes Echo practical is a technique called verification refactoring. The program to be verified is mechanically refactored specifically to facilitate verification. ..."
Abstract - Cited by 11 (7 self) - Add to MetaCart
implies the program’s original specification constitute the verification argument. In this paper, we discuss verification refactoring and illustrate it with a case study of the verification of an optimized implementation of the Advanced Encryption Standard (AES) against its official specification. We

Formal Verification of Translation Validators -- A Case Study on Instruction Scheduling Optimizations

by Jean-baptiste Tristan, Xavier Leroy , 2008
"... Translation validation consists of transforming a program and a posteriori validating it in order to detect a modification of its semantics. This approach can be used in a verified compiler, provided that validation is formally proved to be correct. We present two such validators and their Coq proof ..."
Abstract - Cited by 40 (6 self) - Add to MetaCart
Translation validation consists of transforming a program and a posteriori validating it in order to detect a modification of its semantics. This approach can be used in a verified compiler, provided that validation is formally proved to be correct. We present two such validators and their Coq
Results 1 - 10 of 2,508