Results 1  10
of
655,385
Hierarchical correctness proofs for distributed algorithms
, 1987
"... Abstract: 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 de ne this model, and give aninteresting example of how ..."
Abstract

Cited by 439 (66 self)
 Add to MetaCart
Abstract: 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 de ne this model, and give aninteresting example
Correctness proofs
, 2003
"... A correctness proof is a formal mathematical argument that an algorithm meets its specification, which means that it always produces the correct output for any permitted input. Detailed correctness proofs of even moderately complex algorithms can be surprisingly long, so algorithms researchers (and ..."
Abstract
 Add to MetaCart
A correctness proof is a formal mathematical argument that an algorithm meets its specification, which means that it always produces the correct output for any permitted input. Detailed correctness proofs of even moderately complex algorithms can be surprisingly long, so algorithms researchers
Correctness Proofs of Transformation Schemas
 Bilkent University, Department of Computer Science
, 1997
"... Schemabased logic program transformation has proven to be an eective technique for the optimization of programs. Some transformation schemas were given in [3]; they precompile some widely used transformation techniques from an input program schema that abstracts a particular family of programs in ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
into an output program schema that abstracts another family of programs. This report presents the correctness proofs of these transformation schemas, based on a correctness de nition of transformation schemas. A transformation schema is correct i the templates of its input and output program schemas
Correctness proof for the WAM with types
 Computer Science Logic, volume 626 of LNCS
, 1992
"... : We provide a mathematical specification of an extension of Warren's Abstract Machine for executing Prolog to typeconstraint logic programming and prove its correctness. In this paper, we keep the notion of types and dynamic type constraints rather abstract to allow applications to different ..."
Abstract

Cited by 14 (7 self)
 Add to MetaCart
of the typeconstraint WAM extension is given by a sequence of evolving algebras, each representing a refinement level. For each refinement step a correctness proof is given. Thus, we obtain the theorem that for every such abstract typeconstraint logic programming system L and for every compiler satisfying
Compiler Support for Correctness Proofs
 In Automated Theorem Proving in Software Engineering (CADE14 workshop
, 1997
"... . The development of correct software is an important task which should not be carried out with the help of tools following different approaches. We propose that full support for correctness proofs should be integrated into the compiler. We outline in this paper how a compiler for a functional l ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
. The development of correct software is an important task which should not be carried out with the help of tools following different approaches. We propose that full support for correctness proofs should be integrated into the compiler. We outline in this paper how a compiler for a functional
Correctness Proofs for Two Protocols
, 1996
"... A methodology for proving the correctness of protocols is presented through two examples. (1) The Bloom twowriter register. (2) The Consumer/Producer buffer implementation. Each proof is divided into two levels: The programs are mentioned only at the lower level, and the specifications obtained ..."
Abstract
 Add to MetaCart
A methodology for proving the correctness of protocols is presented through two examples. (1) The Bloom twowriter register. (2) The Consumer/Producer buffer implementation. Each proof is divided into two levels: The programs are mentioned only at the lower level, and the specifications
Modular Correctness Proofs of Behavioural Implementations
, 1995
"... . We introduce a concept of behavioural implementation for algebraic specifications which is based on an indistinguishability relation (called behavioural equality). The central objective of this work is the investigation of proof rules that first allow us to establish the correctness of behavioural ..."
Abstract

Cited by 29 (13 self)
 Add to MetaCart
. We introduce a concept of behavioural implementation for algebraic specifications which is based on an indistinguishability relation (called behavioural equality). The central objective of this work is the investigation of proof rules that first allow us to establish the correctness
Correctness proof of the bakery protocol in CRL
 Algebra of Communicating Processes '94, Workshops in Computing
, 1995
"... A speci cation of the bakery protocol is given in CRL. We provide a simple correctness criterion for the protocol. Then the protocol is proven correct using a proof system that has been developed for CRL. The proof primarily consists of algebraic manipulations based on speci cations of abstract data ..."
Abstract

Cited by 14 (6 self)
 Add to MetaCart
A speci cation of the bakery protocol is given in CRL. We provide a simple correctness criterion for the protocol. Then the protocol is proven correct using a proof system that has been developed for CRL. The proof primarily consists of algebraic manipulations based on speci cations of abstract
Functional correctness proofs of encryption algorithms
 In Proceedings of 12th Conference on Logic for Programming Artificial Intelligence and Reasoning (LPAR 2005), number 3835 in LNAI
, 2005
"... Abstract. We discuss a collection of mechanized formal proofs of symmetric key block encryption algorithms (AES, MARS, Twofish, RC6, Serpent, IDEA, and TEA), performed in an implementation of higher order logic. For each algorithm, functional correctness, namely that decryption inverts encryption, i ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
Abstract. We discuss a collection of mechanized formal proofs of symmetric key block encryption algorithms (AES, MARS, Twofish, RC6, Serpent, IDEA, and TEA), performed in an implementation of higher order logic. For each algorithm, functional correctness, namely that decryption inverts encryption
Results 1  10
of
655,385