Sciweavers

153 search results - page 15 / 31
» entcs 2002
Sort
View
92
Voted
ENTCS
2002
69views more  ENTCS 2002»
15 years 2 days 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
ENTCS
2002
207views more  ENTCS 2002»
15 years 2 days ago
Efficient Algorithms for the Maximum Subarray Problem by Distance Matrix Multiplication
We design an efficient algorithm that maximizes the sum of array elements of a subarray of a two-dimensional array. The solution can be used to find the most promising array porti...
Tadao Takaoka
ENTCS
2002
152views more  ENTCS 2002»
15 years 2 days 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
85
Voted
ENTCS
2002
109views more  ENTCS 2002»
15 years 2 days ago
Induction, Coinduction, and Adjoints
We investigate the reasons for which the existence of certain right adjoints implies the existence of some final coalgebras, and vice-versa. In particular we prove and discuss the...
J. Robin B. Cockett, Luigi Santocanale
94
Voted
ENTCS
2002
99views more  ENTCS 2002»
15 years 2 days ago
Greatest Bisimulations for Binary Methods
In previous work [14] I introduced a generalised notion of coalgebra that is capable of modelling binary methods as they occur in object-oriented programming. An important problem...
Hendrik Tews