Sciweavers

68 search results - page 2 / 14
» Impossibility Results for the Equational Theory of Timed CCS
Sort
View
CGF
2007
121views more  CGF 2007»
13 years 5 months ago
Real-Time Simulation of Thin Shells
This paper proposes a real-time simulation technique for thin shells undergoing large deformation. Shells are thin objects such as leaves and papers that can be abstracted as 2D s...
Min Gyu Choi, Seung Yong Woo, Hyeong-Seok Ko
ICALP
2004
Springer
13 years 10 months ago
Deciding Knowledge in Security Protocols Under Equational Theories
The analysis of security protocols requires precise formulations of the knowledge of protocol participants and attackers. In formal approaches, this knowledge is often treated in t...
Martín Abadi, Véronique Cortier
CCS
2005
ACM
13 years 10 months ago
Deciding security of protocols against off-line guessing attacks
We provide an effective procedure for deciding the existence of off-line guessing attacks on security protocols, for a bounded number of sessions. The procedure consists of a co...
Mathieu Baudet
CCS
2008
ACM
13 years 7 months ago
Secure neighbor discovery in wireless networks: formal investigation of possibility
Wireless communication enables a broad spectrum of applications, ranging from commodity to tactical systems. Neighbor discovery (ND), that is, determining which devices are within...
Marcin Poturalski, Panos Papadimitratos, Jean-Pier...
TACS
2001
Springer
13 years 9 months ago
Non-structural Subtype Entailment in Automata Theory
Decidability of non-structural subtype entailment is a long standing open problem in programming language theory. In this paper, we apply automata theoretic methods to characterize...
Joachim Niehren, Tim Priesnitz