Sciweavers

797 search results - page 40 / 160
» Eliminating Proofs from Programs
Sort
View
106
Voted
ICFP
2010
ACM
15 years 1 months ago
Logical types for untyped languages
Programmers reason about their programs using a wide variety of formal and informal methods. Programmers in untyped languages such as Scheme or Erlang are able to use any such met...
Sam Tobin-Hochstadt, Matthias Felleisen
ECOOP
2009
Springer
16 years 1 months ago
Failboxes: Provably Safe Exception Handling
The primary goal of exception mechanisms is to help ensure that when an operation fails, code that depends on the operation's successful completion is not executed (a property...
Bart Jacobs 0002, Frank Piessens
168
Voted
POPL
2001
ACM
16 years 1 months ago
Oracle-based checking of untrusted software
We present a variant of Proof-Carrying Code (PCC) in which the trusted inference rules are represented as a higher-order logic program, the proof checker is replaced by a nondeter...
George C. Necula, Shree Prakash Rahul
ESOP
2006
Springer
15 years 4 months ago
ILC: A Foundation for Automated Reasoning About Pointer Programs
This paper presents a new program logic designed for facilitating automated reasoning about pointer programs. The program logic is directly inspired by previous work by O'Hea...
Limin Jia, David Walker
PARA
2000
Springer
15 years 4 months ago
Experiments in Separating Computational Algorithm from Program Distribution and Communication
Our proposal has the following key features: 1) The separation of a distributed program into a pure algorithm (PurAl) and a distribution/communication declaration (DUAL). This yie...
Raphael B. Yehezkael, Yair Wiseman, H. G. Mendelba...