Search
Now showing items 241-250 of 295
Typesafety for Explicitly-Coded Probabilistic Inference Procedures
(2017-11-09)
Researchers have recently proposed several systems that ease the process of developing Bayesian probabilistic inference algorithms. These include systems for automatic inference algorithm synthesis as well as stronger ...
Precise and Comprehensive Provenance Tracking for Android Devices
(2019-11-19)
Detailed information about the paths that data take through a system is invaluable for understanding sources and behaviors of complex exfiltration malware. We present a new system, ClearScope, that tracks, at the level of ...
Automatic Exploitation of Fully Randomized Executables
(2019-06-11)
We present Marten, a new end to end system for automatically discovering, exploiting, and combining information leakage and buffer overflow vulnerabilities to derandomize and exploit remote, fully randomized processes. ...
Risk-minimizing program execution in robotic domains
(2012-02-02)
In this thesis, we argue that autonomous robots operating in hostile and uncertain environments can improve robustness by computing and reasoning explicitly about risk. Autonomous robots with a keen sensitivity to risk can ...
Robust, Goal-directed Plan Execution with Bounded Risk
(2012-02-02)
There is an increasing need for robust optimal plan execution for multi-agent systems in uncertain environments, while guaranteeing an acceptable probability of success. For ex- ample, a fleet of unmanned aerial vehicles ...
continuous Relaxation to Over-constrained Temporal Plans
(2013-01-25)
When humans fail to understand the capabilities of an autonomous system or its environmental limitations, they can jeopardize their objectives and the system by asking for unrealistic goals. The objective of this thesis ...
Scalable Information-Sharing Network Management
(2011-06-07)
This thesis analyzes scalable information-sharing network management. It looks into one of the large problems in network management today: finding information across different network domains. Information-sharing network ...
What is Decidable about Strings?
(2011-02-01)
We prove several decidability and undecidability results for the satisfiability/validity problem of formulas over a language of finite-length strings and integers (interpreted as lengths of strings). The atomic formulas ...
SEEC: A Framework for Self-aware Management of Multicore Resources
(2011-03-24)
This paper presents SEEC, a self-aware programming model, designed to reduce programming effort in modern multicore systems. In the SEEC model, application programmers specify application goals and progress, while systems ...
Probabilistic and Statistical Analysis of Perforated Patterns
(2011-01-19)
We present a new foundation for the analysis and transformation of computer programs.Standard approaches involve the use of logical reasoning to prove that the applied transformation does not change the observable semantics ...