407 search results - page 36 / 82 » Malleable Proof Systems and Applications |
OSDI
1996
ACM
13 years 9 months ago
1996
ACM
This paper describes a mechanism by which an operating system kernel can determine with certainty that it is safe to execute a binary supplied by an untrusted source. The kernel r...
IEEEARES
2009
IEEE
14 years 2 months ago
2009
IEEE
—In this paper we show that it is possible to implement a perfect failure detector P (one that detects all faulty processes if and only if those processes failed) in a non-synchr...
ENTCS
2007
13 years 7 months ago
2007
Formal sequentialization is introduced as a rewriting process for the reduction of parallelism and internal communication statements of distributed imperative programs. It constru...
IJCAI
2003
13 years 9 months ago
2003
We overview the development of first-order automated reasoning systems starting from their early years. Based on the analysis of current and potential applications of such systems...
JFP
2000
13 years 7 months ago
2000
In this paper we present two type inference systems for detecting useless-code in higher-order typed functional programs. Type inference can be performed in an efficient and compl...