Sciweavers

4340 search results - page 432 / 868
» Formal Methods and Cryptography
Sort
View
WWW
2003
ACM
16 years 7 months ago
A system for principled matchmaking in an electronic marketplace
More and more resources are becoming available on the Web, and there is a growing need for infrastructures that, based on advertised descriptions, are able to semantically match d...
Tommaso Di Noia, Eugenio Di Sciascio, Francesco M....
CAV
2009
Springer
157views Hardware» more  CAV 2009»
16 years 7 months ago
Explaining Counterexamples Using Causality
Abstract. When a model does not satisfy a given specification, a counterexample is produced by the model checker to demonstrate the failure. A user must then examine the counterexa...
Ilan Beer, Shoham Ben-David, Hana Chockler, Avigai...
VLSID
2001
IEEE
129views VLSI» more  VLSID 2001»
16 years 7 months ago
Design Of Provably Correct Storage Arrays
In this paper we describe a hardware design method for memory and register arrays that allows the application of formal equivalence checking for comparing a high-level register tr...
Rajiv V. Joshi, Wei Hwang, Andreas Kuehlmann
POPL
2004
ACM
16 years 7 months ago
A logic you can count on
We prove the decidability of the quantifier-free, static fragment of ambient logic, with composition adjunct and iteration, which corresponds to a kind of regular expression langu...
Silvano Dal-Zilio, Denis Lugiez, Charles Meyssonni...
176
Voted
IUI
2010
ACM
16 years 3 months ago
A natural language interface of thorough coverage by concordance with knowledge bases
One of the critical problems in natural language interfaces is the discordance between the expressions covered by the interface and those by the knowledge base. In the graph-based...
Yong-Jin Han, Tae-Gil Noh, Seong-Bae Park, Se-Youn...