Sciweavers

70 search results - page 3 / 14
» cats 2007
Sort
View
CATS
2007
13 years 11 months ago
Computing a Minimum-Dilation Spanning Tree is NP-hard
Given a set S of n points in the plane, a minimumdilation spanning tree of S is a tree with vertex set S of smallest possible dilation. We show that given a set S of n points and ...
Otfried Cheong, Herman J. Haverkort, Mira Lee
CATS
2006
13 years 11 months ago
Formalising the L4 microkernel API
This paper gives an overview of a pilot project on the specification and verification of the L4 highperformance microkernel. Of the three aspects examined in the project, we descr...
Rafal Kolanski, Gerwin Klein
CATS
2006
13 years 11 months ago
Mechanically Verifying Correctness of CPS Compilation
In this paper, we study the formalization of one-pass call-by-value CPS compilation using higher-order abstract syntax. In particular, we verify mechanically that the source progr...
Ye Henry Tian
CATS
2007
13 years 11 months ago
Effective Prediction and its Computational Complexity
A model for the problem of predicting the outputs of a process, based only on knowledge of previous outputs, is proposed in terms of a decision problem. The strength of this parti...
Richard Taylor
CATS
2006
13 years 11 months ago
A Polynomial Algorithm for Codes Based on Directed Graphs
A complete description and proof of correctness are given for a new polynomial time algorithm for a class of codes based on directed graphs and involving construction well known i...
A. V. Kelarev