Deprecated: The each() function is deprecated. This message will be suppressed on further calls in /home/zhenxiangba/zhenxiangba.com/public_html/phproxy-improved-master/index.php on line 456
PCC 2000
[go: Go Back, main page]

PCC 2000

Workshop on Proof-Carrying Code

( Slides now available! )

Wednesday, June 28, 2000 (afternoon)
Thursday, June 29, 2000 (morning)
University of California, Santa Barbara, USA

Held in conjunction with
LICS 2000 (the IEEE Symposium on Logic in Computer Science)
and
SAS 2000 (the International Static Analysis Symposium)

Proof-carrying code is a technology that enables end users to verify properties of programs obtained from untrusted code producers. It can give end users protection from a wide range of flaws in binary executables, including type errors, memory management errors, and violations of resource bounds, access controls, and other security policies. The essential idea is that the code producer must distribute a proof of the desired properties along with the code, and that the end user must run the proof and code through a mechanical proof checker before execution. The proof might be constructed automatically by the code producer's compiler, semi-automatically using a proof assistant, or even written by hand.

The Workshop on Proof-Carrying Code aimed to foster discussion and collaboration between implementors of proof-carrying code systems and researchers in the foundational areas of logic, static analysis, programming language semantics, compilers, type theory, and theorem proving. It was held on the afternoon of Wednesday, June 28, and the morning of Thursday, June 29, 2000 at the University of Santa Barbara, California, USA, between LICS 2000 (June 26 to June 28) and SAS 2000 (June 29 to July 1). The program consisted of tutorials and reports on work in progress by invited speakers:

The complete program, abstracts, slides of the talks, and a transcript of the panel are now online. Some of the slides refer to a short Bibliography of Proof-Carrying Code that was prepared for the workshop.

Contact Information