Recent Submissions

  • Faster Dynamic Controllability Checking in Temporal Networks with Integer Bounds 

    Bhargava, Nikhil; Williams, Brian C. (International Joint Conference in Artificial Intelligence, 2019-08)
    Simple Temporal Networks with Uncertainty (STNUs) provide a useful formalism with which to reason about events and the temporal constraints that apply to them. STNUs are in particular notable because they facilitate reasoning ...
  • Automatic Exploitation of Fully Randomized Executables 

    Gadient, Austin; Ortiz, Baltazar; Barrato, Ricardo; Davis, Eli; Perkins, Jeff; e.a. (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. ...
  • Gen: A General-Purpose Probabilistic Programming System with Programmable Inference 

    Cusumano-Towner, Marco F.; Saad, Feras A.; Lew, Alexander; Mansinghka, Vikash K. (2018-11-26)
    Probabilistic modeling and inference are central to many fields. A key challenge for wider adoption of probabilistic programming languages is designing systems that are both flexible and performant. This paper introduces ...

View more