Sciweavers

1382 search results - page 149 / 277
» Formal Analysis of Online Algorithms
Sort
View
ATAL
2005
Springer
15 years 12 months ago
Simulating data dissemination techniques for local reputation systems
In distributed scenarios the robustness of a reputation mechanism depends on the data available for computation. Especially in ad-hoc networks the amount of available data is rest...
Andreas Schlosser, Marco Voss
KBSE
2000
IEEE
15 years 10 months ago
Exploring the Design of an Intentional Naming Scheme with an Automatic Constraint Analyzer
Lightweight formal modeling and automatic analysis were used to explore the design of the Intentional Naming System (INS), a new scheme for resource discovery in a dynamic network...
Sarfraz Khurshid, Daniel Jackson
EICS
2010
ACM
15 years 10 months ago
User interface model discovery: towards a generic approach
UI model discovery is a lightweight formal method in which a model of an interactive system is automatically discovered by exploring the system’s state space, simulating the act...
Andy Gimblett, Harold W. Thimbleby
FMCAD
2004
Springer
15 years 10 months ago
A Partitioning Methodology for BDD-Based Verification
The main challenge in BDD-based verification is dealing with the memory explosion problem during reachability analysis. In this paper we advocate a methodology to handle this probl...
Debashis Sahoo, Subramanian K. Iyer, Jawahar Jain,...
FMICS
2006
Springer
15 years 10 months ago
Verified Design of an Automated Parking Garage
Parking garages that stow and retrieve cars automatically are becoming viable solutions for parking shortages. However, these are complex systems and a number of severe incidents i...
Aad Mathijssen, A. Johannes Pretorius