Abstract-- This paper describes a symbolic algorithm for overapproximating reachability in Boolean programs with unbounded thread creation. The fix-point is detected by projecting ...
We present our experiences with the formal verification of an automotive chip used to control the safety features in a car. We used a BDD based model checker in our work. We descr...
Jae-Young Jang, Shaz Qadeer, Matt Kaufmann, Carl P...
This document formalizes and discusses the implementation of a new, more efficient probabilistic plan recognition algorithm called Yet Another Probabilistic Plan Recognizer, (Yapp...
Christopher W. Geib, John Maraist, Robert P. Goldm...
This study observed the challenges of taking an existing facility's inpatient volumes and procedures and projecting them into a replacement facility with differently sized un...
Marshall Ashby, David M. Ferrin, Martin J. Miller,...
A simulation was commissioned to understand the interactions that constrain the capacity of a steel plant. The aim was for this to become a reusable tool that could evaluate the e...