Sciweavers

242 search results - page 30 / 49
» Using Abstract State Machines at Microsoft: A Case Study
Sort
View
FOCS
2007
IEEE
14 years 1 months ago
A Primal-Dual Randomized Algorithm for Weighted Paging
In the weighted paging problem there is a weight (cost) for fetching each page into the cache. We design a randomized O(log k)-competitive online algorithm for the weighted paging...
Nikhil Bansal, Niv Buchbinder, Joseph Naor
FORTE
1998
13 years 9 months ago
Fault-oriented Test Generation for Multicast Routing Protocol Design
Abstract: We present a new algorithm for automatic test generation for multicast routing. Our algorithm processes a nite state machine (FSM) model of the protocol and uses a mix of...
Ahmed Helmy, Deborah Estrin, Sandeep K. S. Gupta
SEFM
2005
IEEE
14 years 1 months ago
Description Logics for Shape Analysis
Verification of programs requires reasoning about sets of program states. In case of programs manipulating pointers, program states are pointer graphs. Verification of such prog...
Lilia Georgieva, Patrick Maier
JMS
2010
90views more  JMS 2010»
13 years 6 months ago
Prediction of Clinical Conditions after Coronary Bypass Surgery using Dynamic Data Analysis
This work studies the impact of using dynamic information as features in a machine learning algorithm for the prediction task of classifying critically ill patients in two classes ...
Kristien Van Loon, Fabián Güiza, Geert...
GECCO
2011
Springer
240views Optimization» more  GECCO 2011»
12 years 11 months ago
Collisions are helpful for computing unique input-output sequences
Computing unique input-output sequences (UIOs) from finite state machines (FSMs) is important for conformance testing in software engineering, where evolutionary algorithms (EAs)...
Chao Qian, Yang Yu, Zhi-Hua Zhou