Sciweavers

328 search results - page 62 / 66
» Proving Termination of Communicating Programs
Sort
View
TCC
2004
Springer
173views Cryptology» more  TCC 2004»
14 years 1 months ago
Soundness of Formal Encryption in the Presence of Active Adversaries
Abstract. We present a general method to prove security properties of cryptographic protocols against active adversaries, when the messages exchanged by the honest parties are arbi...
Daniele Micciancio, Bogdan Warinschi
ICCAD
2007
IEEE
165views Hardware» more  ICCAD 2007»
13 years 11 months ago
Automated refinement checking of concurrent systems
Stepwise refinement is at the core of many approaches to synthesis and optimization of hardware and software systems. For instance, it can be used to build a synthesis approach for...
Sudipta Kundu, Sorin Lerner, Rajesh Gupta
CHI
1995
ACM
13 years 11 months ago
Integrating multiple cues for spoken language understanding
As spoken language interfaces for real-world systems become a practical possibility, it has become apparent that such interfaces will need to draw on a variety of cues from divers...
Karen Ward, David G. Novick
TCAD
2010
121views more  TCAD 2010»
13 years 2 months ago
Translation Validation of High-Level Synthesis
The growing complexity of systems and their implementation into silicon encourages designers to look for model designs at higher levels of abstraction and then incrementally build ...
Sudipta Kundu, Sorin Lerner, Rajesh K. Gupta
INFOCOM
2006
IEEE
14 years 1 months ago
AnySee: Peer-to-Peer Live Streaming
— Efficient and scalable live-streaming overlay construction has become a hot topic recently. In order to improve the performance metrics, such as startup delay, source-to-end de...
Xiaofei Liao, Hai Jin, Yunhao Liu, Lionel M. Ni, D...