846 search results - page 108 / 170 » On the Computational Complexity of Spatio-Temporal Logics |
159
click to vote
SIGCSE
2006
ACM
16 years 3 days ago
2006
ACM
We present a hands-on approach to problem solving in the formal languages and automata theory course. Using the tool JFLAP, students can solve a wide range of problems that are te...
138
click to vote
ICCSA
2005
Springer
15 years 11 months ago
2005
Springer
Recently, Nenadi´c et al. (2004) proposed the RSA-CEGD protocol for certified delivery of e-goods. This is a relatively complex scheme based on verifiable and recoverable encryp...
147
click to vote
TCC
2005
Springer
15 years 11 months ago
2005
Springer
Several compositional forms of simulation-based security have been proposed in the literature, including universal composability, black-box simulatability, and variants thereof. Th...
179
click to vote
DALT
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. We propose an extension of action theories to intention theories in the framework of situation calculus. Moreover the method for implementing action theories is adapted t...
179
click to vote
CIE
2009
Springer
15 years 10 months ago
2009
Springer
An arithmetic circuit is a labelled, directed, acyclic graph specifying a cascade of arithmetic and logical operations to be performed on sets of non-negative integers. In this pap...