1894 search results - page 171 / 379 » A TLA Proof System |
121
click to vote
FLAIRS
2003
15 years 5 months ago
2003
Automated Theorem Proving (ATP) problems may contain unnecessary axioms, either because some of the axiomatization of the theory is irrelevant to the particular theorem, or becaus...
141
click to vote
CORR
2008
Springer
15 years 4 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...
139
click to vote
JANCL
2006
15 years 4 months ago
2006
We describe KAT-ML, an implementation of an interactive theorem prover for Kleene algebra with tests (KAT). The system is designed to reflect the natural style of reasoning with K...
122
click to vote
JSYML
2007
15 years 4 months ago
2007
We give an exponential lower bound on number of proof-lines in the proof system K of modal logic, i.e., we give an example of K-tautologies 1, 2, . . . s.t. every K-proof of i must...
130
click to vote
ENTCS
2002
15 years 3 months ago
2002
Two co-initial reductions in a term rewriting system are said to be equivalent if they perform the same steps, albeit maybe in a different order. We present four characterisations...