Sciweavers

7 search results - page 1 / 2
» An analysis of errors in interactive proof attempts
Sort
View
IWC
2000
106views more  IWC 2000»
13 years 5 months ago
An analysis of errors in interactive proof attempts
The practical utility of interactive, user-guided, theorem proving depends on the design of good interaction environments, the study of which should be grounded in methods of rese...
J. Stuart Aitken, Thomas F. Melham

Lecture Notes
592views
15 years 5 months ago
Stochastic Differential Equations
These lecture notes have been developed over several semesters with the assistance of students in the course. For many (most) results, only incomplete proofs are given. Gaps in the...
Thomas G. Kurtz
STOC
1995
ACM
108views Algorithms» more  STOC 1995»
13 years 9 months ago
A parallel repetition theorem
We show that a parallel repetition of any two-prover one-round proof system (MIP(2, 1)) decreases the probability of error at an exponential rate. No constructive bound was previou...
Ran Raz
CCS
2008
ACM
13 years 7 months ago
Efficiently tracking application interactions using lightweight virtualization
In this paper, we propose a general-purpose framework that harnesses the power of lightweight virtualization to track applications interactions in a scalable an efficient manner. ...
Yih Huang, Angelos Stavrou, Anup K. Ghosh, Sushil ...
KBSE
2000
IEEE
13 years 9 months ago
Model Checking Programs
The majority of work carried out in the formal methods community throughout the last three decades has (for good reasons) been devoted to special languages designed to make it eas...
Willem Visser, Klaus Havelund, Guillaume P. Brat, ...