Sciweavers

92 search results - page 9 / 19
» Constraint generation for separation of duty
Sort
View
ISSTA
2009
ACM
14 years 2 months ago
HAMPI: a solver for string constraints
Many automatic testing, analysis, and verification techniques for programs can be effectively reduced to a constraint-generation phase followed by a constraint-solving phase. Th...
Adam Kiezun, Vijay Ganesh, Philip J. Guo, Pieter H...
DESRIST
2009
Springer
125views Education» more  DESRIST 2009»
14 years 7 days ago
An empirical evaluation of information security awareness levels in designing secure business processes
Information Systems Security (ISS) is critical to ensuring the integrity and credibility of digitally exchanged information in business processes. Information systems development ...
Fergle D'Aubeterre, Lakshmi S. Iyer, Rahul Singh
GD
2005
Springer
14 years 1 months ago
Fast Node Overlap Removal
Most graph layout algorithms treat nodes as points. The problem of node overlap removal is to adjust the layout generated by such methods so that nodes of non-zero width and height...
Tim Dwyer, Kim Marriott, Peter J. Stuckey
SCP
2000
119views more  SCP 2000»
13 years 7 months ago
Automated compositional Markov chain generation for a plain-old telephone system
Obtaining performance models, like Markov chains and queueing networks, for systems of significant complexity and magnitude is a difficult task that is usually tackled using human...
Holger Hermanns, Joost-Pieter Katoen
CORR
2010
Springer
159views Education» more  CORR 2010»
13 years 5 months ago
On optimizing over lift-and-project closures
The lift-and-project closure is the relaxation obtained by computing all lift-and-project cuts from the initial formulation of a mixed integer linear program or equivalently by co...
Pierre Bonami