Sciweavers

208 search results - page 25 / 42
» Realization using the model existence theorem
Sort
View
NFM
2011
252views Formal Methods» more  NFM 2011»
14 years 5 months ago
Call Invariants
Program verifiers based on first-order theorem provers model the program heap as a collection of mutable maps. In such verifiers, preserving unmodified facts about the heap acr...
Shuvendu K. Lahiri, Shaz Qadeer
WISE
2005
Springer
15 years 4 months ago
Asynchronous Web Services Communication Patterns in Business Protocols
Asynchronous interactions are becoming more and more important in the realization of complex B2B Web applications, and Web services are at the moment the most innovative and well-e...
Marco Brambilla, Giuseppe Guglielmetti, Christina ...
EWCBR
2004
Springer
15 years 4 months ago
Explanation Service for Complex CBR Applications
Case-based Reasoning (CBR) is a mature technology for building knowledge-based systems that are capable to produce useful results even if no answer matches the query exactly. Often...
Rainer Maximini, Andrea Freßmann, Martin Sch...
UCS
2004
Springer
15 years 4 months ago
Inexpensive and Automatic Calibration for Acceleration Sensors
Abstract— In this paper, we present two methods for calibration of acceleration sensors that are inexpensive, in-situ, require minimum user interaction and are targeted to a broa...
Albert Krohn, Michael Beigl, Christian Decker, Uwe...
FOCS
1999
IEEE
15 years 2 months ago
Non-Malleable Non-Interactive Zero Knowledge and Adaptive Chosen-Ciphertext Security
We introduce the notion of non-malleable noninteractive zero-knowledge (NIZK) proof systems. We show how to transform any ordinary NIZK proof system into one that has strong non-m...
Amit Sahai