Results 1  10
of
966,580
On the Bisimulation Proof Method
 JOURNAL OF MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE
, 1994
"... The most popular method for establishing bisimilarities among processes is to exhibit bisimulation relations. By definition, R is a bisimulation relation if R progresses to R itself, i.e., pairs of processes in R can match each other's actions and their derivatives are again in R. We study gen ..."
Abstract

Cited by 103 (6 self)
 Add to MetaCart
generalisations of the method aimed at reducing the size of the relations to exhibit and hence relieving the proof work needed to establish bisimilarity results. We allow a relation R to progress to a different relation F(R), where F is a function on relations. Functions which can be safely used in this way (i
Proof Methods for Corecursive Programs
 Fundamenta Informaticae Special Issue on Program Transformation
, 1999
"... This article is a tutorial on four methods for proving properties of corecursive programs: fixpoint induction, the approximation lemma, coinduction, and fusion. ..."
Abstract

Cited by 27 (8 self)
 Add to MetaCart
This article is a tutorial on four methods for proving properties of corecursive programs: fixpoint induction, the approximation lemma, coinduction, and fusion.
StrategyProofness and Arrow’s Conditions: Existence and Correspondence Theorems for Voting Procedures and Social Welfare Functions
 J. Econ. Theory
, 1975
"... Consider a committee which must select one alternative from a set of three or more alternatives. Committee members each cast a ballot which the voting procedure counts. The voting procedure is strategyproof if it always induces every committee member to cast a ballot revealing his preference. I pro ..."
Abstract

Cited by 542 (0 self)
 Add to MetaCart
Consider a committee which must select one alternative from a set of three or more alternatives. Committee members each cast a ballot which the voting procedure counts. The voting procedure is strategyproof if it always induces every committee member to cast a ballot revealing his preference. I
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
The Adaptation of Proof Methods by Reformulation
"... Introduction A mathematician possesses a repertoire of problem solving methods that he/she has been acquiring and extending during his/her career. Confronted with a problem he/she tries to apply a known method either directly or after adaptation to the problem. The process of adaptation in addition ..."
Abstract
 Add to MetaCart
in addition to other learning processes extends his/her repertoire with new problem solving methods. In the mathematical assistant system\Omega MKRP [HKK + 94] we want to imitate this human problem solving behavior. In order to achieve that we need a suitable framework for representing proof techniques
The Hungarian method for the assignment problem
 Naval Res. Logist. Quart
, 1955
"... Assuming that numerical scores are available for the performance of each of n persons on each of n jobs, the "assignment problem" is the quest for an assignment of persons to jobs so that the sum of the n scores so obtained is as large as possible. It is shown that ideas latent in the work ..."
Abstract

Cited by 1238 (0 self)
 Add to MetaCart
in the work of two Hungarian mathematicians may be exploited to yield a new method of solving this problem. 1.
The information bottleneck method
 University of Illinois
, 1999
"... We define the relevant information in a signal x ∈ X as being the information that this signal provides about another signal y ∈ Y. Examples include the information that face images provide about the names of the people portrayed, or the information that speech sounds provide about the words spoken. ..."
Abstract

Cited by 545 (38 self)
 Add to MetaCart
consistent equations for the coding rules X → ˜ X and ˜ X → Y. Solutions to these equations can be found by a convergent re–estimation method that generalizes the Blahut–Arimoto algorithm. Our variational principle provides a surprisingly rich framework for discussing a variety of problems in signal
Logic and Proof Method of Recursion
"... ltrekursiven, sowie der Behandlung von Hoares Problem der zwei whileSchleifen vorgestellt. Daran schließen sich zwei umfangreichere Beispiele an: die Entwicklung eines Ubersetzers f ur eine Sprache mit Rekursion und die Entwicklung einer operationellen Semantik aus einer denotationellen. Danksagung ..."
Abstract
 Add to MetaCart
atz danke ich herzlich f ur Diskussionen bzw. das sorgf altige Lesen einer Vorversion. viii Contents 0 Introduction 1 1 What makes a useful calculus? 7 1.0 The role of proofs and calculi in program development : 9 1.1 Choice of the proof environment : : : : : : : : : : : : : : 14 1.2 Criteria
Results 1  10
of
966,580