Myla Archer

Followers

Following

Co-authors

Public Views

Interests

Uploads

Papers by Myla Archer

Tools for Simplifying Proofs of Properties of Timed Automata: The TAME Template, Theories, and Strategies

Towards A Formal Verification Of A Secure Distributed System And Its Applications

A HOL Mechanization of The Axiomatic Semantics of a Simple Distributed Programming Language11The research reported here was funded in part by contract DOD-MDA 904-91-C-7053 with the National Security Agency's University Program

Higher Order Logic Theorem Proving and its Applications, 1993

Towards a Formal Verification of a Floating Point Coprocessor and its Composition with a Central Processing Unit11Work sponsored under Boeing Contract NAS1-18586, Task Assignment No. 3, with NASA-Langley Research Center and NSA Agreement DOD-MDA 904-91-C-7053

Higher Order Logic Theorem Proving and its Applications, 1993

Building high assurance human-centric decision systems

Automated Software Engineering, 2014

Linking Other Theorem Provers to HOL Using PM: Proof Manager11This research is supported in part by the Department of Defense under contract grant DOD-MDA 904-91-C-7052

Higher Order Logic Theorem Proving and its Applications, 1993

Download

On Model-Based Software Development

Due to its many advantages, the growing use in software practice of Model-Based Development (MBD)... more Due to its many advantages, the growing use in software practice of Model-Based Development (MBD) is a promising trend. However, major problems in MBD of software remain, for example, the failure to integrate formal system requirements models with current code synthesis methods. This chapter introduces FMBD, a formal MBD process for building software systems which addresses this problem. The goal of FMBD is to produce high assurance software systems which are correct by construction. The chapter describes three types of models built during the FMBD process, provides examples from an avionics system to illustrate the models, and proposes three major challenges in MBD as topics for future research.

Download

Mechanizing a Programming Logic for the Concurrent Programming Language microSR in HOL

Tphols, 1993

This paper presents our current effort to formally derive, using HOL, a sound Hoare logic for the... more This paper presents our current effort to formally derive, using HOL, a sound Hoare logic for the concurrent programming language microSR, a derivative of SR. Our methodology is built on Gordon&amp;amp;#39;s work on mechanizing programming logics for a small sequential programming language. The constructs of microSR include those basic to common sequential programming languages, in addition to an asynchronous send

Establishing High Confidence in Code Implementations of Algorithms using Formal Verification of Pseudocode

Proving Correctness of the Basic TESLA Multicast Stream Authentication Protocol with TAME

Wits, 2002

The TESLA multicast stream authentication protocol is distinguished from other types of cryptogra... more The TESLA multicast stream authentication protocol is distinguished from other types of cryptographic protocols in both its key management s c heme and its use of timing. It takes advantage of the stream being broadcast to periodically commit to and later reveal keys used by a receiver to verify that packets are authentic, and it uses both inductive reasoning and time arithmetic to allow the receiver to determine that an adversary cannot have prior knowledge of a key that has just been revealed. While an informal argument for the correctness of TESLA has been published, no mechanized proof appears to have previously been done for TESLA or any other protocol of the same variety. This paper reports on a mechanized correctness proof of the basic TESLA protocol based on establishing a sequence of invariants for the protocol using the tool TAME, an interface to PVS specialized for proving properties of automata. It discusses the organization and process used in the proof, and the possibilities for reusing these techniques in correctness proofs of similar protocols, starting with more sophisticated versions of TESLA.

Download

An application of template methodology: rapid prototyping of user interface management systems

[1991 Proceedings] The Second International Workshop on Rapid System Prototyping, 1992

Download

Mechanical verification of timed automata: a case study

Proceedings Real-Time Technology and Applications, 1996

This report describes the results of a case study on the feasibility of developing and applying m... more This report describes the results of a case study on the feasibility of developing and applying mechanical methods, based on the proof system PVS, to prove propositions about real-time systems speci ed in the Lynch-Vaandrager timed automata model. In using automated provers to prove propositions about systems described by a speci c mathematical model, both the proofs and the proof process can be simpli ed by exploiting the special properties of the mathematical model. Because both speci cations and methods of reasoning about them tend to be repetitive, the use of a standard template for speci cations, accompanied by standard shared theories and standard proof strategies or tactics, is often feasible. Presented are the PVS speci cation of three theories that underlie the timed automata model, a template for specifying timed automata models in PVS, and an example of its instantiation. Both hand proofs and the corresponding PVS proofs of two propositions are provided to illustrate how these can be made parallel at di erent degrees of granularity. Our experience in applying PVS to specify and reason about real-time systems modeled as timed automata is also discussed. The methods for reasoning about timed automata in PVS developed in the study have evolved into a system called TAME (Timed Automata Modeling Environment). A summary of recent developments regarding TAME is provided. A shorter version of the report was presented at the 1996 Real-Time Applications Symposium 1].

Download

Towards a testbed for malicious code detection

COMPCON Spring '91 Digest of Papers, 1991

Download

Tools for constructing requirements specifications: the SCR Toolset at the age of nine

Computer Systems: Science & Engineering, 2005

Download

The use of model checking and abstraction in analyzing requirements specifications: a formal foundation

Developing strategies for specialized theorem proving about untimed, timed, and hybrid I/O automata

In this paper we discuss how we intend to develop a specialized theorem proving environment for t... more In this paper we discuss how we intend to develop a specialized theorem proving environment for the Hybrid I/O Automata (HIOA) framework 6] over the PVS 10] theorem prover, and some of the issues involved. In particular, we describe approaches to using PVS that allow and encourage the development of useful proof strategies, and note some desired PVS features that would further help us to do so for our HIOA environment.

Download

Proceedings of the 6th international workshop on strategies in automated deduction (STRATEGIES 2006), Seattle, WA, USA, August 16, 2006

Tools for constructing requirements specifications: the SCR Toolset at the age of ten

While human effort is critical to creating requirements specifications and human inspection can d... more While human effort is critical to creating requirements specifications and human inspection can detect many specification errors, software tools find errors inspections miss and also find certain classes of errors more cheaply. This paper describes a set of tools for constructing and analyzing requirements specifications in the SCR (Software Cost Reduction) tabular notation. The tools include a specification editor, a consistency checker, a simulator, and tools for verifying application properties -including a model checker, a verifier, a property checker based on decision procedures, and an invariant generator. The paper also describes the practical systems to which the tools are being applied as well as some new tools recently added to the toolset, e.g. a tool that constructs a sound and complete abstraction from a property and a specification. To illustrate the tools, the paper describes their use in developing a requirements specification for an automobile cruise control system.

Download

Applying TAME to I/O automata: A user's perspective

Mechanical theorem provers have been shown to expose proof errors, some of them serious, that hum... more Mechanical theorem provers have been shown to expose proof errors, some of them serious, that humans miss. Mechanical provers will be applied more widely if they are easier to use. The tool TAME (Timed Automata Modeling Environment) provides an interface to the prover PVS to simplify specifying and proving properties of automata models.

Download

Towards a Property-based Testing Environment with Applications to Security-Critical Software

We consider an approach to testing that combines white-box and black-box techniques. Black-box te... more We consider an approach to testing that combines white-box and black-box techniques. Black-box testing is used for testing a program's effects against its specification. White-box testing is essential if subtle implementation errors are to be identified, e.g., errors due to race conditions. Full white-box testing is a large task. However, for many properties, only a small portion of the program is relevant --- hence property-based testing has the potential to substantially simplify much of the testing work. The portion of a program that relates to a given property can be identified through slicing. We describe the ongoing development of a Tester's Assistant, which in the long term, will include a specification-driven slicer for C programs, a test data generator, a coverage analyzer, and an execution monitor. The slicer and execution monitor are described in this paper, and applications to Unix security are indicated. Security is an important application of property-based tes...

Download

Myla Archer

Uploads

Papers by Myla Archer

Log In