1894 search results - page 131 / 379 » A TLA Proof System |
139
Voted
CORR
2008
Springer
15 years 2 months ago
2008
Springer
In deduction modulo, a theory is not represented by a set of axioms but by a congruence on propositions modulo which the inference rules of standard deductive systems--such as for ...
132
Voted
JLP
2010
14 years 10 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...
161
click to vote
ICFP
2004
ACM
16 years 3 months ago
2004
ACM
Concurrency, as a useful feature of many modern programming languages and systems, is generally hard to reason about. Although existing work has explored the verification of concu...
144
Voted
ECAI
2004
Springer
15 years 7 months ago
2004
Springer
We describe a flexible approach to automated reasoning, where non-theorems can be automatically altered to produce proved results which are related to the original. This is achieve...
125
click to vote
DSN
2009
IEEE
15 years 10 months ago
2009
IEEE
Remote attestation of system integrity is an essential part of trusted computing. However, current remote attestation techniques only provide integrity proofs of static properties...