Browsing Theoretical Computer Science Group by Subject "Satisfiability Modulo Theories"
Now showing items 1-2 of 2
-
Self-composition by Symbolic Execution
(Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, 2013)Self-composition is a logical formulation of non-interference, a high-level security property that guarantees the absence of illicit information leakages through executing programs. In order to capture program executions, ...