Results 1  10
of
10,693
A Compiler Correctness Proof for the Static Link Technique by means of Evolving Algebras
"... The wellknown static link technique is used for stackbased implementations of imperative programming languages which admit nested recursive procedure declarations. Its basic idea is to access nonlocal variables by tracing a static link chain to lower stack elements. Evolving algebras are a new m ..."
Abstract
 Add to MetaCart
method for defining operational semantics of abstract machines. Based on an appropriate stack machine, defined as an evolving algebra, and a functional description of a compiler for a sample language, we give a complete proof of correctness for this technique using the method of refinement. Introduction
A Little Goes a Long Way: A Simple Tool to Support Denotational CompilerCorrectness Proofs
, 1994
"... In a series of papers in the early 80's we proposed a paradigm for semanticsbased compiler correctness. In this paradigm, the source and target languages are given denotational semantics in the same λtheory, so correctness proofs can be carried out within this theory. In many cases ..."
Abstract
 Add to MetaCart
In a series of papers in the early 80's we proposed a paradigm for semanticsbased compiler correctness. In this paradigm, the source and target languages are given denotational semantics in the same λtheory, so correctness proofs can be carried out within this theory. In many
Stationery Office. The DeCCo project papers V: Compiler Correctness Proofs i Contents
, 2003
"... c ○ Crown Copyright 2003 PERMITTED USES. This material may be accessed as downloaded onto electronic, magnetic, optical or similar storage media provided that such activities are for private research, study or inhouse use only. RESTRICTED USES. This material must not be copied, distributed, publish ..."
Abstract
 Add to MetaCart
c ○ Crown Copyright 2003 PERMITTED USES. This material may be accessed as downloaded onto electronic, magnetic, optical or similar storage media provided that such activities are for private research, study or inhouse use only. RESTRICTED USES. This material must not be copied, distributed, published or sold without the permission of the Controller of Her Britannic Majesty’s
The knowledge complexity of interactive proof systems

, 1989
"... Usually, a proof of a theorem contains more knowledge than the mere fact that the theorem is true. For instance, to prove that a graph is Hamiltonian it suffices to exhibit a Hamiltonian tour in it; however, this seems to contain more knowledge than the single bit Hamiltonian/nonHamiltonian. In th ..."
Abstract

Cited by 1246 (39 self)
 Add to MetaCart
/nonHamiltonian. In this paper a computational complexity theory of the "knowledge " contained in a proof is developed. Zeroknowledge proofs are defined as those proofs that convey no additional knowledge other than the correctness of the proposition in question. Examples of zeroknowledge proof systems are given
Hierarchical correctness proofs for distributed algorithms
, 1987
"... We introduce the inputoutput automaton, a simple but powerful model of computation in asynchronous distributed networks. With this model we are able to construct modular, hierarchical correctness proofs for distributed algorithms. We define this model, and give an interesting example of how it can ..."
Abstract

Cited by 418 (51 self)
 Add to MetaCart
We introduce the inputoutput automaton, a simple but powerful model of computation in asynchronous distributed networks. With this model we are able to construct modular, hierarchical correctness proofs for distributed algorithms. We define this model, and give an interesting example of how it can
The Spec# Programming System: An Overview
, 2004
"... Spec# is the latest in a long line of work on programming languages and systems aimed at improving the development of correct software. This paper describes the goals and architecture of the Spec# programming system, consisting of the objectoriented Spec# programming language, the Spec# compiler ..."
Abstract

Cited by 542 (50 self)
 Add to MetaCart
Spec# is the latest in a long line of work on programming languages and systems aimed at improving the development of correct software. This paper describes the goals and architecture of the Spec# programming system, consisting of the objectoriented Spec# programming language, the Spec
Random Oracles are Practical: A Paradigm for Designing Efficient Protocols
, 1995
"... We argue that the random oracle model  where all parties have access to a public random oracle  provides a bridge between cryptographic theory and cryptographic practice. In the paradigm we suggest, a practical protocol P is produced by first devising and proving correct a protocol P R for the ..."
Abstract

Cited by 1646 (70 self)
 Add to MetaCart
We argue that the random oracle model  where all parties have access to a public random oracle  provides a bridge between cryptographic theory and cryptographic practice. In the paradigm we suggest, a practical protocol P is produced by first devising and proving correct a protocol P R
Synchronous data flow
, 1987
"... Data flow is a natural paradigm for describing DSP applications for concurrent implementation on parallel hardware. Data flow programs for signal processing are directed graphs where each node represents a function and each arc represents a signal path. Synchronous data flow (SDF) is a special case ..."
Abstract

Cited by 622 (45 self)
 Add to MetaCart
of data flow (either atomic or large grain) in which the number of data samples produced or consumed by each node on each invocation is specified a priori. Nodes can be scheduled statically (at compile time) onto single or parallel programmable processors so the runtime overhead usually associated
Compiling with Proofs
, 1998
"... One of the major challenges of building software systems is to ensure that the various components fit together in a welldefined manner. This problem is exacerbated by the recent advent of software components whose origin is unknown or inherently untrusted, such as mobile code or user extensions ..."
Abstract

Cited by 150 (9 self)
 Add to MetaCart
and security problems with techniques from mathematical logic and programminglanguage semantics. I propose a framework, called proofcarrying code, in which the extension provider sends along with the extension code a representation of a formal proof that the code meets certain safety and correctness
Results 1  10
of
10,693