Sciweavers

1073 search results - page 107 / 215
» Formal Program Development with Approximations
Sort
View
ITCC
2005
IEEE
14 years 2 months ago
Formalisation and implementation of Access control models
Access control software must be based on a security policy model. Flaws in them may come from a lack of precision or some incoherences in the policy model or from inconsistencies ...
Mathieu Jaume, Charles Morisset
APLAS
2006
ACM
14 years 3 months ago
XML Validation for Context-Free Grammars
String expression analysis conservatively approximates the possible string values generated by a program. We consider the validation of a context-free grammar obtained by the analy...
Yasuhiko Minamide, Akihiko Tozawa
IPCO
2008
114views Optimization» more  IPCO 2008»
13 years 10 months ago
The Stochastic Machine Replenishment Problem
We study the stochastic machine replenishment problem, which is a canonical special case of closed multiclass queuing systems in Markov decision theory. The problem models the sche...
Kamesh Munagala, Peng Shi
KBSE
2005
IEEE
14 years 2 months ago
On dynamic feature location
Feature location aims at locating pieces of code that implement a given set of features (requirements). It is a necessary first step in every program comprehension and maintenanc...
Rainer Koschke, Jochen Quante
HEURISTICS
2008
136views more  HEURISTICS 2008»
13 years 7 months ago
Enhancing set constraint solvers with lexicographic bounds
Since their beginning in constraint programming, set solvers have been applied to a wide range of combinatorial search problems, such as bin-packing, set partitioning, circuit desi...
Andrew Sadler, Carmen Gervet