Sciweavers

MST
2008
150views more  MST 2008»
13 years 10 months ago
Coinduction for Exact Real Number Computation
This paper studies coinductive representations of real numbers by signed digit streams and fast Cauchy sequences. It is shown how the associated coinductive principle can be used ...
Ulrich Berger, Tie Hou
MST
2008
118views more  MST 2008»
13 years 10 months ago
Risk Assessment for One-Counter Threads
Abstract Threads as contained in a thread algebra are used for the modeling of sequential program behavior. A thread that may use a counter to control its execution is called a `on...
Alban Ponse, Mark van der Zwaag
MST
2008
121views more  MST 2008»
13 years 10 months ago
Datatype-Generic Termination Proofs
Abstract. Datatype-generic programs are programs that are parameterised by a datatype. We review the allegorical foundations of a methodology of designing datatype-generic programs...
Roland Carl Backhouse, Henk Doornbos
MST
2008
141views more  MST 2008»
13 years 10 months ago
From a Zoo to a Zoology: Towards a General Theory of Graph Polynomials
Abstract. We outline a general theory of graph polynomials which covers all the examples we found in the vast literature, in particular, the chromatic polynomial, various generaliz...
Johann A. Makowsky
MST
2008
120views more  MST 2008»
13 years 10 months ago
Bounds on Sizes of Finite Bisimulations of Pfaffian Dynamical Systems
We study finite bisimulations of dynamical systems in Rn defined by Pfaffian maps. The pure existence of finite bisimulations for a more general class of o-minimal systems was show...
Margarita V. Korovina, Nicolai Vorobjov
MST
2008
101views more  MST 2008»
13 years 10 months ago
Realizability interpretation of proofs in constructive analysis
We prove constructively (in the style of Bishop) that every monotone continuous function with a uniform modulus of increase has a continuous inverse. The proof is formalized, and a...
Helmut Schwichtenberg
MST
2008
83views more  MST 2008»
13 years 10 months ago
On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction
Leonid Khachiyan, Endre Boros, Konrad Borys, Khale...
MST
2008
155views more  MST 2008»
13 years 10 months ago
On Aperiodic and Star-Free Formal Power Series in Partially Commuting Variables
Formal power series over non-commuting variables have been investigated as representations of the behavior of automata with multiplicities. Here we introduce and investigate the co...
Manfred Droste, Paul Gastin
MST
2008
157views more  MST 2008»
13 years 10 months ago
Optimal On-Line Algorithms to Minimize Makespan on Two Machines with Resource Augmentation
We study the problem of on-line scheduling on two uniformly related machines where the on-line algorithm has resources different from those of the off-line algorithm. We consider ...
Leah Epstein, Arik Ganot