7988 search results - page 146 / 1598 » A Useful Undecidable Theory |
CSFW
2005
IEEE
14 years 3 months ago
2005
IEEE
In the analysis of security protocols, the knowledge of attackers is often described in terms of message deducibility and indistinguishability relations. In this paper, we pursue ...
SIGCSE
2004
ACM
14 years 3 months ago
2004
ACM
We describe the instructional software JFLAP 4.0 and how it can be used to provide a hands-on formal languages and automata theory course. JFLAP 4.0 doubles the number of chapters...
IBERAMIA
2004
Springer
14 years 3 months ago
2004
Springer
Many approaches of the agent paradigm emphasize the social and intentional features of their systems, what are called social properties. The study of these aspects demands their ow...
MFCS
2001
Springer
14 years 2 months ago
2001
Springer
Combinatorial games lead to several interesting, clean problems in algorithms and complexity theory, many of which remain open. The purpose of this paper is to provide an overview...
SIGSOFT
1994
ACM
14 years 2 months ago
1994
ACM
Testing is potentially the best grounded part of software engineering, since it deals with the well defined situation of a fixed program and a test (a finite collection of input v...