Results 1  10
of
14,280
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 106 (7 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 28 (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.
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
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
Discriminative Training Methods for Hidden Markov Models: Theory and Experiments with Perceptron Algorithms
, 2002
"... We describe new algorithms for training tagging models, as an alternative to maximumentropy models or conditional random fields (CRFs). The algorithms rely on Viterbi decoding of training examples, combined with simple additive updates. We describe theory justifying the algorithms through a modific ..."
Abstract

Cited by 660 (13 self)
 Add to MetaCart
modification of the proof of convergence of the perceptron algorithm for classification problems. We give experimental results on partofspeech tagging and base noun phrase chunking, in both cases showing improvements over results for a maximumentropy tagger.
Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
 SIAM Journal on Optimization
, 1993
"... We study the semidefinite programming problem (SDP), i.e the problem of optimization of a linear function of a symmetric matrix subject to linear equality constraints and the additional condition that the matrix be positive semidefinite. First we review the classical cone duality as specialized to S ..."
Abstract

Cited by 547 (12 self)
 Add to MetaCart
to SDP. Next we present an interior point algorithm which converges to the optimal solution in polynomial time. The approach is a direct extension of Ye's projective method for linear programming. We also argue that most known interior point methods for linear programs can be transformed in a
Featherweight Java: A Minimal Core Calculus for Java and GJ
 ACM Transactions on Programming Languages and Systems
, 1999
"... Several recent studies have introduced lightweight versions of Java: reduced languages in which complex features like threads and reflection are dropped to enable rigorous arguments about key properties such as type safety. We carry this process a step further, omitting almost all features of the fu ..."
Abstract

Cited by 659 (23 self)
 Add to MetaCart
computational “feel, ” providing classes, methods, fields, inheritance, and dynamic typecasts with a semantics closely following Java’s. A proof of type safety for Featherweight Java thus illustrates many of the interesting features of a safety proof for the full language, while remaining pleasingly compact
The irreducibility of the space of curves of given genus
 Publ. Math. IHES
, 1969
"... Fix an algebraically closed field k. Let Mg be the moduli space of curves of genus g over k. The main result of this note is that Mg is irreducible for every k. Of course, whether or not M s is irreducible depends only on the characteristic of k. When the characteristic s o, we can assume that k ~ ..."
Abstract

Cited by 506 (2 self)
 Add to MetaCart
~ (1, and then the result is classical. A simple proof appears in EnriquesChisini [E, vol. 3, chap. 3], based on analyzing the totality of coverings of p1 of degree n, with a fixed number d of ordinary branch points. This method has been extended to char. p by William Fulton [F], using specializations
Two Proof Methods For The Grafcet Language
"... : In this paper, we present two different methods to make proofs on the GRAFCET language. The first one is based on Transition Systems and the second one uses Polynomial Dynamical Systems. Theoretical and pratical aspects are presented. Key Words: Proof methods, GRAFCET, Transition Systems, Polyn ..."
Abstract
 Add to MetaCart
: In this paper, we present two different methods to make proofs on the GRAFCET language. The first one is based on Transition Systems and the second one uses Polynomial Dynamical Systems. Theoretical and pratical aspects are presented. Key Words: Proof methods, GRAFCET, Transition Systems
Results 1  10
of
14,280