Sciweavers

5158 search results - page 294 / 1032
» Generalization of the Dempster-Shafer Theory
Sort
View
JACIII
2007
79views more  JACIII 2007»
15 years 6 months ago
State-Transition Computation Models and Program Correctness Thereon
Abstract— A common framework for formalization of statetransition computation models is presented based on a general theory for studying the interrelationships between specifica...
Kiyoshi Akama, Ekawit Nantajeewarawat
ACTAC
2002
75views more  ACTAC 2002»
15 years 6 months ago
Framework for Studying Substitution
This paper describes a framework for handling bound variable renaming and substitution mathematically rigorously with the aim at the same time to stay as close as possible to huma...
Härmel Nestra
COMBINATORICS
2004
100views more  COMBINATORICS 2004»
15 years 6 months ago
Lattice Structures from Planar Graphs
The set of all orientations of a planar graph with prescribed outdegrees carries the structure of a distributive lattice. This general theorem is proven in the first part of the p...
Stefan Felsner
INFORMATICALT
2000
126views more  INFORMATICALT 2000»
15 years 6 months ago
Commutation in Global Supermonoid of Free Monoids
This work is an attempt of generalization of the simple statement about the requirements of commutation of words for the case of languages. In the paper, the necessary condition fo...
Anna Brosalina, Boris Melnikov
ENTCS
2002
152views more  ENTCS 2002»
15 years 6 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