Sciweavers

10870 search results - page 310 / 2174
» Model Checking Programs
Sort
View
CP
2005
Springer
16 years 8 days ago
Solving the Car-Sequencing Problem as a Non-binary CSP
A search algorithm based on non-binary forward checking (nFC) is used to solve the car-sequencing problem. The choice of value ordering heuristics having a dramatic effect on solu...
Mihaela Butaru, Zineb Habbas
FUIN
2007
104views more  FUIN 2007»
15 years 6 months ago
SAT-Based Reachability Checking for Timed Automata with Discrete Data
Reachability analysis for timed automata using SAT-based methods was considered in many papers, occurring to be a very efficient model checking technique. In this paper we show ho...
Andrzej Zbrzezny, Agata Pólrola
CIKM
2005
Springer
16 years 8 days ago
Optimizing candidate check costs for bitmap indices
In this paper, we propose a new strategy for optimizing the placement of bin boundaries to minimize the cost of query evaluation using bitmap indices with binning. For attributes ...
Doron Rotem, Kurt Stockinger, Kesheng Wu
SIGSOFT
2010
ACM
15 years 4 months ago
Software for everyone by everyone
Given the dizzying pace of change in computer science, trying to look too far into the future of software engineering is hard. However, it might be possible to predict the future ...
Tevfik Bultan
KBSE
2010
IEEE
15 years 5 months ago
Solving string constraints lazily
Decision procedures have long been a fixture in program analysis, and reasoning about string constraints is a key element in many program analyses and testing frameworks. Recent ...
Pieter Hooimeijer, Westley Weimer