2137 search results - page 11 / 428 » Proving Abstract Non-interference |
TPHOL
1999
IEEE
15 years 2 months ago
1999
IEEE
Combining theorem proving and model checking o ers the tantalizing possibility of e ciently reasoning about large circuits at high levels of abstraction. We have constructed a syst...
110
click to vote
FOSSACS
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. We show how to generate well-founded and stable term orderings based on polynomial interpretations over the real numbers. Monotonicity (another usual requirement in termi...
ASIACRYPT
1999
Springer
15 years 2 months ago
1999
Springer
Abstract. The problem of proving a number is of a given arithmetic format with some prime elements, is raised in RSA undeniable signature, group signature and many other cryptograp...
104
click to vote
CADE
1998
Springer
15 years 2 months ago
1998
Springer
Abstract. The theorem prover Isabelle is used to formalise and reproduce some of the styles of reasoning used by Newton in his Principia. The Principia's reasoning is resolute...
RTA
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. In this paper it is described how a combination of polynomial interpretations, recursive path order, RFC match-bounds, the dependency pair method and semantic labelling c...