Sciweavers

5499 search results - page 364 / 1100
» Generalized Rewrite Theories
Sort
View
ENTCS
2002
152views more  ENTCS 2002»
15 years 7 months ago
Contract-based mutation testing in the refinement calculus
This article discusses mutation testing strategies in the context of refinement. Here, a novel generalization of mutation testing techniques is presented to be applied to contract...
Bernhard K. Aichernig
177
Voted
ENTCS
2002
69views more  ENTCS 2002»
15 years 7 months ago
The Uniformity Principle on Traced Monoidal Categories
The uniformity principle for traced monoidal categories has been introduced as a natural generalization of the uniformity principle (Plotkin's principle) for fixpoint operato...
Masahito Hasegawa
206
Voted
ENTCS
2002
129views more  ENTCS 2002»
15 years 7 months ago
Eliminating Proofs from Programs
This paper presents a step in the development of an operational approach to program extraction in type theory. In order to get a program from a lambda term, the logical parts need...
Femke van Raamsdonk, Paula Severi
194
Voted
JACM
2000
119views more  JACM 2000»
15 years 7 months ago
A minimum spanning tree algorithm with Inverse-Ackermann type complexity
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...
Bernard Chazelle
MOC
2000
137views more  MOC 2000»
15 years 7 months ago
The apolar bilinear form in geometric modeling
Some recent methods of Computer Aided Geometric Design are related to the apolar bilinear form, an inner product on the space of homogeneous multivariate polynomials of a fixed deg...
Gert Vegter