218 search results - page 27 / 44 » Verifying Safety Properties with the TLA Proof System |
89
Voted
JLP
2010
14 years 6 months ago
2010
We present a calculus for tracking equality relationships between values through pairs of bytecode programs. The calculus may serve as a certification mechanism for noninterferenc...
104
click to vote
FOSSACS
2008
Springer
15 years 1 months ago
2008
Springer
We introduce Erasure Pure Type Systems, an extension to Pure Type Systems with an erasure semantics centered around a type constructor indicating parametric polymorphism. The eras...
155
click to vote
IFM
2010
Springer
14 years 9 months ago
2010
Springer
Safe is a first-order eager functional language with facilities for programmer controlled destruction and copying of data structures. It provides also regions, i.e. disjoint parts...
111
click to vote
PEPM
1999
ACM
15 years 4 months ago
1999
ACM
A certifying compiler takes a source language program and produces object code, as well as a certi cate" that can be used to verify that the object code satis es desirable pr...
CADE
2001
Springer
16 years 1 days ago
2001
Springer
In this paper, we present a syntax-directed termination and reduction checker for higher-order logic programs. The reduction checker verifies parametric higher-order subterm orderi...