456 search results - page 43 / 92 » A Proof System for Abstract Non-interference |
ARGMAS
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. This paper presents an argumentation mechanism for reconciling conflicts between planning agents related to plan proposals, which are caused by inconsistencies between b...
CADE
2000
Springer
14 years 1 months ago
2000
Springer
Abstract. aRa is an automatic theorem prover for various kinds of relation algebras. It is based on Gordeev’s Reduction Predicate Calculi for n-variable logic (RPCn) which allow ...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
Abstract. Relay attacks are a major concern for RFID systems: during an authentication process an adversary transparently relays messages between a verifier and a remote legitimate...
LICS
1994
IEEE
14 years 23 days ago
1994
IEEE
The theory of cut-free sequent proofs has been used to motivate and justify the design of a number of logic programming languages. Two such languages, Prolog and its linear logic ...
SP
2008
IEEE
13 years 7 months ago
2008
IEEE
e an abstraction of zero-knowledge protocols that is le to a fully mechanized analysis. The abstraction is formalized within the applied pi-calculus using a novel equational theor...