Sciweavers

154 search results - page 17 / 31
» A Theory of Runtime Enforcement, with Results
Sort
View
BPSC
2009
190views Business» more  BPSC 2009»
13 years 9 months ago
Detective Information Flow Analysis for Business Processes
Abstract: We report on ongoing work towards a posteriori detection of illegal information flows for business processes, focusing on the challenges involved in doing so. Resembling ...
Rafael Accorsi, Claus Wonnemann
IJON
2006
161views more  IJON 2006»
13 years 8 months ago
Evolving hybrid ensembles of learning machines for better generalisation
Ensembles of learning machines have been formally and empirically shown to outperform (generalise better than) single predictors in many cases. Evidence suggests that ensembles ge...
Arjun Chandra, Xin Yao
ICCD
2011
IEEE
296views Hardware» more  ICCD 2011»
12 years 8 months ago
DPPC: Dynamic power partitioning and capping in chip multiprocessors
—A key challenge in chip multiprocessor (CMP) design is to optimize the performance within a power budget limited by the CMP’s cooling, packaging, and power supply capacities. ...
Kai Ma, Xiaorui Wang, Yefu Wang
ECOOP
2005
Springer
14 years 1 months ago
Interprocedural Analysis for Privileged Code Placement and Tainted Variable Detection
In Java 2 and Microsoft .NET Common Language Runtime (CLR), trusted code has often been programmed to perform accessrestricted operations not explicitly requested by its untrusted ...
Marco Pistoia, Robert J. Flynn, Larry Koved, Vugra...
ASPDAC
2005
ACM
101views Hardware» more  ASPDAC 2005»
14 years 2 months ago
Lower bounds for dynamic BDD reordering
— In this paper we present new lower bounds on BDD size. These lower bounds are derived from more general lower bounds that recently were given in the context of exact BDD minimi...
Rüdiger Ebendt, Rolf Drechsler