Sciweavers

1415 search results - page 241 / 283
» Verified systems by composition from verified components
Sort
View
SP
2008
IEEE
132views Security Privacy» more  SP 2008»
13 years 6 months ago
Zero-Knowledge in the Applied Pi-calculus and Automated Verification of the Direct Anonymous Attestation Protocol
e an abstraction of zero-knowledge protocols that is le to a fully mechanized analysis. The abstraction is formalized within the applied pi-calculus using a novel equational theor...
Michael Backes, Matteo Maffei, Dominique Unruh
TCS
2010
13 years 6 months ago
Error-repair parsing schemata
Robustness, the ability to analyze any input regardless of its grammaticality, is a desirable property for any system dealing with unrestricted natural language text. Error-repair...
Carlos Gómez-Rodríguez, Miguel A. Al...
ACL
2010
13 years 5 months ago
Bitext Dependency Parsing with Bilingual Subtree Constraints
This paper proposes a dependency parsing method that uses bilingual constraints to improve the accuracy of parsing bilingual texts (bitexts). In our method, a targetside tree frag...
Wenliang Chen, Jun'ichi Kazama, Kentaro Torisawa
ACIVS
2009
Springer
13 years 5 months ago
Concealed Object Perception and Recognition Using a Photometric Stereo Strategy
Abstract. Following a review of current hidden objects detection techniques in a range of security applications, a strategy based on an innovative, low-cost photometric stereo tech...
Jiuai Sun, Melvyn L. Smith, Abdul R. Farooq, Lyndo...
COMPSAC
2009
IEEE
13 years 5 months ago
Towards Call for Testing: An Application to User Acceptance Testing of Web Applications
1 The paper proposes a new test model, Call-For-Testing (CFT), and applies it to User Acceptance Testing (UAT) of Web Applications. Different from traditional approaches, UAT in th...
Lian Yu, Wei Zhao, Xiaofeng Di, Changzhu Kong, Wen...