Sciweavers

718 search results - page 75 / 144
» Extraction of Structured Programs from Specification Proofs
Sort
View
ERSHOV
2003
Springer
15 years 11 months ago
On the Possibility of Provably Secure Obfuscating Programs
By obfuscation we mean any efficient semantic-preserving transformation of computer programs aimed at bringing a program into such a form, which impedes the understanding of its al...
Nikolay P. Varnovsky, Vladimir A. Zakharov
DAC
2009
ACM
16 years 7 months ago
Context-sensitive timing analysis of Esterel programs
Traditionally, synchronous languages, such as Esterel, have been compiled into hardware, where timing analysis is relatively easy. When compiled into software ? e.g., into sequent...
Lei Ju, Bach Khoa Huynh, Samarjit Chakraborty, Abh...
ACSE
1996
ACM
15 years 10 months ago
Literate programming as an aid to marking student assignments
In a university climate that sees rising student-sta ratios and increasing workloads for academics, any mechanism that reduces the student marking and assessment process must be w...
A. J. Hurst
FMCAD
2000
Springer
15 years 9 months ago
Automated Refinement Checking for Asynchronous Processes
Abstract. We consider the problem of refinement checking for asynchronous processes where refinement corresponds to stutter-closed language inclusion. Since an efficient algorithmi...
Rajeev Alur, Radu Grosu, Bow-Yaw Wang
FOCS
2010
IEEE
15 years 4 months ago
The Limits of Two-Party Differential Privacy
We study differential privacy in a distributed setting where two parties would like to perform analysis of their joint data while preserving privacy for both datasets. Our results ...
Andrew McGregor, Ilya Mironov, Toniann Pitassi, Om...