Results 1  10
of
49,874
Provably Correct Systems
, 1994
"... The goal of the Provably Correct Systems project (ProCoS) is to develop a mathematical basis for development of embedded, realtime, computer systems. This survey paper introduces the specification languages and verification techniques for four levels of development: Requirements definition and contr ..."
Abstract

Cited by 11 (3 self)
 Add to MetaCart
The goal of the Provably Correct Systems project (ProCoS) is to develop a mathematical basis for development of embedded, realtime, computer systems. This survey paper introduces the specification languages and verification techniques for four levels of development: Requirements definition
DEVELOPING PROVABLY CORRECT SYSTEMS WITH OBSERV
"... The OBSERV methodology for software development is based on rapid construction of an executable speci cation, or prototype, of a system. The speci cation may be examined and modi ed repeatedly to achieve the desired functionality. The objectives of OBSERV also include facilitating a smooth transitio ..."
Abstract
 Add to MetaCart
transition to a target system, and providing means for reusing speci cation, design, and coding of systems and subsystems. This article describes OBSERV, and demonstrates how the methods used in our approach can be used to develop provably correct realtime reactive systems. Correctness is checked by means
KIV 3.0 for Provably Correct Systems
 IN CURRENT TRENDS IN APPLIED FORMAL METHODS. SPRINGER LNCS 1641
, 1999
"... ..."
Provably Correct Systems  FTRTFT'94 Tutorial
, 1994
"... ProCoS aims to improve dependability, reduce timescales and cut development costs of construction for embedded systems, particularly in realtime and safetycritical applications. It uses and develops the results of basic research into fundamental properties of interactive systems. It aims to provid ..."
Abstract
 Add to MetaCart
to provide a scientific basis for future standards of practice in the development of embedded systems, ensuring correctness of all stages in the development, from elicitation and analysis of requirements through design and implementation of programs down to compilation and execution on verified hardware.
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
Kademlia: A Peertopeer Information System Based on the XOR Metric
, 2002
"... We describe a peertopeer system which has provable consistency and performance in a faultprone environment. Our system routes queries and locates nodes using a novel XORbased metric topology that simplifies the algorithm and facilitates our proof. The topology has the property that every message ..."
Abstract

Cited by 834 (3 self)
 Add to MetaCart
We describe a peertopeer system which has provable consistency and performance in a faultprone environment. Our system routes queries and locates nodes using a novel XORbased metric topology that simplifies the algorithm and facilitates our proof. The topology has the property that every
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
The Vocabulary Problem in HumanSystem Communication
 COMMUNICATIONS OF THE ACM
, 1987
"... In almost all computer applications, users must enter correct words for the desired objects or actions. For success without extensive training, or in firsttries for new targets, the system must recognize terms that will be chosen spontaneously. We studied spontaneous word choice for objects in five ..."
Abstract

Cited by 562 (8 self)
 Add to MetaCart
In almost all computer applications, users must enter correct words for the desired objects or actions. For success without extensive training, or in firsttries for new targets, the system must recognize terms that will be chosen spontaneously. We studied spontaneous word choice for objects
A Transformation System for Developing Recursive Programs
, 1977
"... A system of rules for transforming programs is described, with the programs in the form of recursion equations An initially very simple, lucid. and hopefully correct program IS transformed into a more efficient one by altering the recursion structure Illustrative examples of program transformations ..."
Abstract

Cited by 649 (3 self)
 Add to MetaCart
A system of rules for transforming programs is described, with the programs in the form of recursion equations An initially very simple, lucid. and hopefully correct program IS transformed into a more efficient one by altering the recursion structure Illustrative examples of program transformations
Results 1  10
of
49,874