11345 search results - page 1707 / 2269 » Foundations of Computer Science |
145
click to vote
LICS
2003
IEEE
15 years 11 months ago
2003
IEEE
We provide a method for deciding the insecurity of cryptographic protocols in presence of the standard Dolev-Yao intruder (with a finite number of sessions) extended with so-call...
157
click to vote
LICS
2003
IEEE
15 years 11 months ago
2003
IEEE
We consider instantiation-based theorem proving whereby instances of clauses are generated by certain inferences, and where inconsistency is detected by propositional tests. We gi...
162
click to vote
LICS
2003
IEEE
15 years 11 months ago
2003
IEEE
We consider several questions related to the use of digitization techniques for timed automata. These very successful techniques reduce dense-time language inclusion problems to d...
176
click to vote
LICS
2003
IEEE
15 years 11 months ago
2003
IEEE
We define the class of micro-macro stack graphs, a new class of graphs modeling infinite-state sequential systems with a decidable model-checking problem. Micro-macro stack grap...
162
click to vote
ITICSE
2003
ACM
15 years 11 months ago
2003
ACM
There is now a substantial body of evidence in support of the use of pair programming in the classroom[3, 4, 10, 11, 13, 14]. Some of the data is anecdotal and some is the result ...