We consider the problem of checking the differential privacy of online
r...
Runtime assurance (RTA) addresses the problem of keeping an autonomous s...
Deadlocks are one of the most notorious concurrency bugs, and significan...
A hyperproperty relates executions of a program and is used to formalize...
Dynamic techniques are a scalable and effective way to analyze concurren...
Proof Blocks is a software tool which enables students to write proofs b...
We introduce an automata model for describing interesting classes of
dif...
Differential privacy is a mathematical framework for developing statisti...
Concurrent programs are notoriously hard to write correctly, as scheduli...
Writing concurrent programs is notoriously hard due to scheduling
non-de...
Probabilistic Computation Tree Logic (PCTL) is frequently used to formal...
Multi-threaded programs are challenging to write. Developers often need ...
We consider the decidability of the verification problem of programs
mod...
We identify a decidable synthesis problem for a class of programs of
unb...
Metric Interval Temporal Logic (MITL) is a well studied real-time, tempo...
Differential privacy is a de facto standard for statistical computations...
Memory safety is the problem of determining if a heap manipulating progr...
verifying uninterpreted programs---programs that work over arbitrary da...
Dynamic race detection is the problem of determining if an observed prog...
We consider the problem of detecting data races in program traces that h...
We propose a fragment of many-sorted second order logic ESMT and show th...