Sciweavers

290 search results - page 46 / 58
» Theorem Proving Using Lazy Proof Explication
Sort
View
LPAR
2012
Springer
13 years 5 months ago
The TPTP Typed First-Order Form with Arithmetic
Abstract. The TPTP World is a well established infrastructure supporting research, development, and deployment of Automated Theorem Proving systems. Recently, the TPTP World has be...
Geoff Sutcliffe, Stephan Schulz, Koen Claessen, Pe...
FASE
2009
Springer
15 years 4 months ago
A Formal Connection between Security Automata and JML Annotations
Security automata are a convenient way to describe security policies. Their typical use is to monitor the execution of an application, and to interrupt it as soon as the security p...
Marieke Huisman, Alejandro Tamalet
SAS
1999
Springer
117views Formal Methods» more  SAS 1999»
15 years 1 months ago
Abstracting Cryptographic Protocols with Tree Automata
ing Cryptographic Protocols with Tree Automata David Monniaux http://www.di.ens.fr/%7Fmonniaux, Laboratoire d’Informatique, ´Ecole Normale Sup´erieure, 45 rue d’Ulm , 75230 P...
David Monniaux
AIR
2004
132views more  AIR 2004»
14 years 9 months ago
Sarcasm, Deception, and Stating the Obvious: Planning Dialogue without Speech Acts
This paper presents an alternative to the `speech acts with STRIPS' approach to implementing dialogue: a fully implemented AI planner which generates and analyses the semantic...
Debora Field, Allan Ramsay
ACL2
2006
ACM
15 years 3 months ago
Unique factorization in ACL2: Euclidean domains
ACL2 is used to systematically study domains whose elements can be “uniquely” factored into products of “irreducible” elements. The best known examples of such domains are...
John R. Cowles, Ruben Gamboa