Sciweavers

3378 search results - page 159 / 676
» A universe of binding and computation
Sort
View
CSL
1999
Springer
15 years 2 months ago
A Road-Map on Complexity for Hybrid Logics
Hybrid languages are extended modal languages which can refer to (or even quantify over) states. Such languages are better behaved proof theoretically than ordinary modal languages...
Carlos Areces, Patrick Blackburn, Maarten Marx
HOTNETS
2010
14 years 4 months ago
A case for information-bound referencing
Links and content references form the foundation of the way that users interact today. Unfortunately, the links used today (URLs) are fragile since they tightly specify a protocol...
Ashok Anand, Aditya Akella, Vyas Sekar, Srinivasan...
VL
2006
IEEE
15 years 4 months ago
Sketching with Conceptual Metaphors to Explain Computational Processes
To explore how people conceptualize a complex system, 232 university students were asked to sketch how a search engine works. While the sketches reveal a diverse range of visual a...
David G. Hendry
SIGCSE
2005
ACM
108views Education» more  SIGCSE 2005»
15 years 3 months ago
Teaching and learning ethics in computer science: walking the walk
The author shares techniques used in a successful "Ethics and Professionalism" class at California State University, San Bernardino. The author describes active learning...
Richard J. Botting
CCS
2005
ACM
15 years 3 months ago
Towards computationally sound symbolic analysis of key exchange protocols
d abstract) Prateek Gupta and Vitaly Shmatikov The University of Texas at Austin We present a cryptographically sound formal method for proving correctness of key exchange protoco...
Prateek Gupta, Vitaly Shmatikov