Sciweavers

10568 search results - page 496 / 2114
» Computer Intelligence and Formalization
Sort
View
FM
2009
Springer
123views Formal Methods» more  FM 2009»
15 years 11 months ago
"Carbon Credits" for Resource-Bounded Computations Using Amortised Analysis
Abstract. Bounding resource usage is important for a number of areas, notably real-time embedded systems and safety-critical systems. In this paper, we present a fully automatic st...
Steffen Jost, Hans-Wolfgang Loidl, Kevin Hammond, ...
144
Voted
TCC
2005
Springer
88views Cryptology» more  TCC 2005»
15 years 10 months ago
Relaxing Environmental Security: Monitored Functionalities and Client-Server Computation
Definition of security under the framework of Environmental Security (a.k.a Network-Aware Security or Universally Composable Security) typically requires “extractability” of t...
Manoj Prabhakaran, Amit Sahai
166
Voted
FMCAD
2004
Springer
15 years 10 months ago
Increasing the Robustness of Bounded Model Checking by Computing Lower Bounds on the Reachable States
Most symbolic model checkers are based on either Binary Decision Diagrams (BDDs), which may grow exponentially large, or Satisfiability (SAT) solvers, whose time requirements rapi...
Mohammad Awedh, Fabio Somenzi
GIS
1999
ACM
15 years 9 months ago
A Provably Efficient Computational Model for Approximate Spatiotemporal Retrieval
: The paper is concerned with the effective and efficient processing of spatiotemporal selection queries under varying degrees of approximation. Such queries may employ operators l...
Vasilis Delis, Christos Makris, Spyros Sioutas
173
Voted
PKC
2010
Springer
148views Cryptology» more  PKC 2010»
15 years 9 months ago
On the Feasibility of Consistent Computations
In many practical settings, participants are willing to deviate from the protocol only if they remain undetected. Aumann and Lindell introduced a concept of covert adversaries to f...
Sven Laur, Helger Lipmaa