Sciweavers

762 search results - page 18 / 153
» How to realize
Sort
View
TCC
2009
Springer
177views Cryptology» more  TCC 2009»
14 years 8 months ago
Composability and On-Line Deniability of Authentication
Abstract. Protocols for deniable authentication achieve seemingly paradoxical guarantees: upon completion of the protocol the receiver is convinced that the sender authenticated th...
Yevgeniy Dodis, Jonathan Katz, Adam Smith, Shabsi ...
ENTCS
2008
89views more  ENTCS 2008»
13 years 7 months ago
Dataflow Architectures for GALS
In Kahn process network (KPN), the processes (nodes) communicate by unbounded unidirectional FIFO channels (arcs), with the property of non-blocking writes and blocking reads on t...
Syed Suhaib, Deepak Mathaikutty, Sandeep K. Shukla
FASE
2009
Springer
14 years 2 months ago
Controller Synthesis from LSC Requirements
Live Sequence Charts (LSCs) is a visual requirements language for specifying reactive system behavior. When modeling and designing open reactive systems, it is often essential to h...
Hillel Kugler, Cory Plock, Amir Pnueli
COLING
2002
13 years 7 months ago
Towards Automatic Generation of Natural Language Generation Systems
Systems that interact with the user via natural language are in their infancy. As these systems mature and become more complex, it would be desirable for a system developer if the...
John Chen, Srinivas Bangalore, Owen Rambow, Marily...
AUSAI
2004
Springer
14 years 24 days ago
A Formal Method Toward Reasoning About Continuous Change
This paper presents a formal method based on the high-level semantics of processes to reason about continuous change. With a case study we show how the semantics of processes can b...
Chunping Li