797 search results - page 76 / 160 » Eliminating Proofs from Programs |
133
click to vote
ICALP
1997
Springer
15 years 7 months ago
1997
Springer
In this paper we develop a new elementary algorithm for model-checking infinite sequential processes, including context-free processes, pushdown processes, and regular graphs, tha...
135
click to vote
CADE
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. Proof-carrying code and other applications in computer security require machine-checkable proofs of properties of machine-language programs. These in turn require axioms ...
107
Voted
PLDI
2000
ACM
15 years 7 months ago
2000
ACM
We show how to determine statically whether it is safe for untrusted machine code to be loaded into a trusted host system. Our safety-checking technique operates directly on the u...
128
click to vote
TLDI
2009
ACM
16 years 9 days ago
2009
ACM
Type-and-effect systems are a natural approach for statically reasoning about a program’s execution. They have been used to track a variety of computational effects, for example...
116
click to vote
ESOP
2007
Springer
15 years 9 months ago
2007
Springer
Abstract We present the semantics and proof system for an objectoriented language with active objects, asynchronous method calls, and futures. The language, based on Creol, disting...