88 search results - page 10 / 18 » Proving the Correctness of the STG Machine |
102
Voted
FMSD
2000
15 years 1 months ago
2000
The study of asynchronous circuit behaviors in the presence of component and wire delays has received a great deal of attention. In this paper, we consider asynchronous circuits wh...
133
click to vote
ICML
2008
IEEE
16 years 2 months ago
2008
IEEE
In this paper we investigate two aspects of ranking problems on large graphs. First, we augment the deterministic pruning algorithm in Sarkar and Moore (2007) with sampling techni...
110
click to vote
FOCS
2006
IEEE
15 years 8 months ago
2006
IEEE
Learning an unknown halfspace (also called a perceptron) from labeled examples is one of the classic problems in machine learning. In the noise-free case, when a halfspace consist...
113
click to vote
WDAG
1993
Springer
15 years 6 months ago
1993
Springer
Fairness is an important concept in design and implementation of distributed systems. At the specification level, fairness usually serves as an assumption for proving liveness. At ...
121
Voted
CHARME
2003
Springer
15 years 7 months ago
2003
Springer
This paper shows how classic inductive assertions can be used in conjunction with an operational semantics to prove partial correctness properties of programs. The method imposes o...