Sciweavers

749 search results - page 85 / 150
» Combinatory Models and Symbolic Computation
Sort
View
CONCUR
1997
Springer
14 years 2 months ago
Reachability Analysis of Pushdown Automata: Application to Model-Checking
We apply the symbolic analysis principle to pushdown systems. We represent (possibly in nite) sets of con gurations of such systems by means of nite-state automata. In order to re...
Ahmed Bouajjani, Javier Esparza, Oded Maler
DAC
2006
ACM
14 years 11 months ago
MARS-C: modeling and reduction of soft errors in combinational circuits
Due to the shrinking of feature size and reduction in supply voltages, nanoscale circuits have become more susceptible to radiation induced transient faults. In this paper, we pre...
Natasa Miskov-Zivanov, Diana Marculescu
GI
2001
Springer
14 years 2 months ago
Towards a Novel Architecture to Support Universal Location Awareness
—The rapid advances in a wide range of wireless access technologies along with an industry-wide IP-convergence have set up the stage for context-aware computing. The “locationâ...
Amiya Bhattacharya, Abhishek Roy, Sajal K. Das
ICSOC
2007
Springer
14 years 4 months ago
Verifying Temporal and Epistemic Properties of Web Service Compositions
Model checking Web service behaviour has remained limited to checking safety and liveness properties. However when viewed as a multi agent system, the system composition can be ana...
Alessio Lomuscio, Hongyang Qu, Marek J. Sergot, Mo...
CPAIOR
2008
Springer
13 years 11 months ago
The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
Daniel H. Leventhal, Meinolf Sellmann