1894 search results - page 116 / 379 » A TLA Proof System |
121
Voted
CADE
2003
Springer
16 years 1 months ago
2003
Springer
Foundational certified code systems seek to prove untrusted programs to be safe relative to safety policies given in terms of actual machine architectures, thereby improving the s...
106
Voted
ATAL
2000
Springer
15 years 5 months ago
2000
Springer
In this paper we propose a methodology to help analyse tendencies in MAS to complement those of simple inspection, Monte Carlo and syntactic proof. We suggest an architecture that ...
108
click to vote
PLDI
2010
ACM
15 years 5 months ago
2010
ACM
Verified compilers, such as Leroy's CompCert, are accompanied by a fully checked correctness proof. Both the compiler and proof are often constructed with an interactive proo...
200
Voted
POPL
2006
ACM
16 years 1 months ago
2006
ACM
Embedded code pointers (ECPs) are stored handles of functions and continuations commonly seen in low-level binaries as well as functional or higher-order programs. ECPs are known ...
119
click to vote
AGP
1995
IEEE
15 years 4 months ago
1995
IEEE
In this paper, we describe a Prolog implementation of a new theorem prover for (normal propositional) modal and multi–modal logics. The theorem prover, which is called KEM, arise...