Sciweavers

154 search results - page 26 / 31
» A Theory of Runtime Enforcement, with Results
Sort
View
FCT
2009
Springer
14 years 1 months ago
Alternating Weighted Automata
Weighted automata are finite automata with numerical weights on transitions. Nondeterministic weighted automata define quantitative languages L that assign to each word w a real ...
Krishnendu Chatterjee, Laurent Doyen, Thomas A. He...
NDSS
2007
IEEE
14 years 1 months ago
RICH: Automatically Protecting Against Integer-Based Vulnerabilities
We present the design and implementation of RICH (Run-time Integer CHecking), a tool for efficiently detecting integer-based attacks against C programs at run time. C integer bug...
David Brumley, Dawn Xiaodong Song, Tzi-cker Chiueh...
CG
2004
Springer
13 years 11 months ago
Locally Informed Global Search for Sums of Combinatorial Games
Abstract. There are two complementary approaches to playing sums of combinatorial games. They can be characterized as local analysis and global search. Algorithms from combinatoria...
Martin Müller 0003, Zhichao Li
IEEEPACT
2009
IEEE
14 years 2 months ago
SHIP: Scalable Hierarchical Power Control for Large-Scale Data Centers
In today’s data centers, precisely controlling server power consumption is an essential way to avoid system failures caused by power capacity overload or overheating due to incr...
Xiaorui Wang, Ming Chen, Charles Lefurgy, Tom W. K...
PASTE
2004
ACM
14 years 23 days ago
Resolving and applying constraint queries on context-sensitive analyses
A context-sensitive analysis is an analysis in which program elements are assigned sets of properties that depend upon the context in which they occur. For analyses on imperative ...
James Ezick