Sciweavers

641 search results - page 118 / 129
» Formal Reliability Analysis Using Theorem Proving
Sort
View
FMCAD
2004
Springer
14 years 2 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
HICSS
2003
IEEE
98views Biometrics» more  HICSS 2003»
14 years 2 months ago
On the Limits of Bottom-Up Computer Simulation: Towards a Nonlinear Modeling Culture
1 In the complexity and simulation communities there is growing support for the use of bottom-up computer-based simulation in the analysis of complex systems. The presumption is th...
Kurt A. Richardson
ICDT
1995
ACM
101views Database» more  ICDT 1995»
14 years 10 days ago
Approximation in Databases
Partial information in databases can arise when information from several databases is combined. Even if each database is complete for some \world", the combined databases wil...
Leonid Libkin
POPL
2005
ACM
14 years 9 months ago
Mutatis mutandis: safe and predictable dynamic software updating
Dynamic software updates can be used to fix bugs or add features to a running program without downtime. Essential for some applications and convenient for others, low-level dynami...
Gareth Stoyle, Michael W. Hicks, Gavin M. Bierman,...
PODC
2012
ACM
11 years 11 months ago
The cost of fault tolerance in multi-party communication complexity
Multi-party communication complexity involves distributed computation of a function over inputs held by multiple distributed players. A key focus of distributed computing research...
Binbin Chen, Haifeng Yu, Yuda Zhao, Phillip B. Gib...