518 search results - page 55 / 104 » Automating Proofs in Category Theory |
103
click to vote
ACL2
2006
ACM
15 years 5 months ago
2006
ACM
We describe a new procedure for verifying ACL2 properties about finite state machines (FSMs) using satisfiability (SAT) solving. We present an algorithm for converting ACL2 conj...
CCS
2008
ACM
15 years 1 months ago
2008
ACM
A recent development in formal security protocol analysis is the Protocol Composition Logic (PCL). We identify a number of problems with this logic as well as with extensions of t...
CORR
2004
Springer
14 years 11 months ago
2004
Springer
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
DAC
2009
ACM
16 years 25 days ago
2009
ACM
Speculation is a well-known technique for increasing parallelism of the microprocessor pipelines and hence their performance. While implementing speculation in modern design pract...
107
click to vote
ATAL
2007
Springer
15 years 6 months ago
2007
Springer
We present a novel approach to knowledge-based automated oneshot multi-issue bilateral negotiation handling, in a homogeneous setting, both numerical features and non-numerical on...