Sciweavers

174 search results - page 19 / 35
» Monotonicity in Calculational Proofs
Sort
View
RTCSA
2007
IEEE
15 years 3 months ago
Scheduling Algorithms for I/O Blockings with a Multi-frame Task Model
A task that suspends itself to wait for an I/O completion or to wait for an event from another node in distributed environments is called an I/O blocking task. In conventional har...
Shan Ding, Hiroyuki Tomiyama, Hiroaki Takada
SIGCSE
1997
ACM
112views Education» more  SIGCSE 1997»
15 years 1 months ago
Introducing fixed-point iteration early in a compiler course
When teaching a course in compiler design, it is conventional to introduce the iterative calculation of least fixed points quite late in the course, in the guise of iterative dat...
Max Hailperin
TPHOL
2000
IEEE
15 years 2 months ago
Routing Information Protocol in HOL/SPIN
We provide a proof using HOL and SPIN of convergence for the Routing Information Protocol (RIP), an internet protocol based on distance vector routing. We also calculate a sharp re...
Karthikeyan Bhargavan, Carl A. Gunter, Davor Obrad...
90
Voted
ICGI
2010
Springer
14 years 10 months ago
Inferring Regular Trace Languages from Positive and Negative Samples
In this work, we give an algorithm that infers Regular Trace Languages. Trace languages can be seen as regular languages that are closed under a partial commutation relation called...
Antonio Cano Gómez
CAIP
2005
Springer
107views Image Analysis» more  CAIP 2005»
15 years 3 months ago
Minimum-Length Polygons of First-Class Simple Cube-Curves
We consider simple cube-curves in the orthogonal 3D grid. The union of all cells contained in such a curve (also called the tube of this curve) is a polyhedrally bounded set. The c...
Fajie Li, Reinhard Klette