Johan Agat (2000):
Transforming out timing leaks.
In: Proceedings of POPL'00.
ACM,
pp. 40–53,
doi:10.1145/325694.325702.
Adi Ben-Israel & Thomas Nall Eden Greville (2003):
Gereralized Inverses – Theory and Applications,
second edition,
CMS Books in Mathematics.
Springer Verlag,
New York.
Rastislav Bodik & Barabara Jobstmann (2013):
Algorithmic Program Synthesis: Introduction.
Int. J. Softw. Tools Technol. Transfer 15,
pp. 397–411,
doi:10.1007/s10009-013-0287-9.
Swarat Chaudhuri, Martin Clochard & Armando Solar-Lezama (2014):
Bridging Boolean and Quantitative Synthesis Using Smoothed Proof Search.
In: Proceedings of POPL '14.
ACM,
pp. 207–220,
doi:10.1145/2535838.2535859.
Patrick Cousot & Radhia Cousot (1977):
Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints.
In: Proceedings of POPL'77,
pp. 238–252,
doi:10.1145/512950.512973.
Patrick Cousot & Radhia Cousot (1979):
Systematic Design of Program Analysis Frameworks.
In: Proceedings of POPL'79,
pp. 269–282,
doi:10.1145/567752.567778.
Patrick Cousot & Michaël Monerau (2012):
Probabilistic Abstract Interpretation.
In: H. Seidel: Proceedings of ESOP12,
Lecture Notes in Computer Science 7211.
Springer Verlag,
pp. 166–190,
doi:10.1007/978-3-642-28869-2_9.
Alessandra Di Pierro, Chris Hankin & Herbert Wiklicky (2005):
Measuring the Confinement of Probabilistic Systems.
Theoretical Computer Science 340(1),
pp. 3–56,
doi:10.1016/j.tcs.2005.03.002.
Alessandra Di Pierro, Chris Hankin & Herbert Wiklicky (2007):
A Systematic Approach to Probabilistic Pointer Analysis.
In: Proceedings of APLAS'07,
Lecture Notes in Computer Science 4807.
Springer Verlag,
pp. 335–350,
doi:10.1007/978-3-540-76637-7_23.
Alessandra Di Pierro, Chris Hankin & Herbert Wiklicky (2008):
Quantifying Timing Leaks and Cost Optimisation.
In: Proceedings of ICICS'08,
Lecture Notes in Computer Science 5308.
Springer Verlag,
pp. 81–96,
doi:10.1007/978-3-540-88625-9_6.
Alessandra Di Pierro, Chris Hankin & Herbert Wiklicky (2010):
Probabilistic Semantics and Analysis.
In: Formal Methods for Quantitative Aspects of Programming Languages,
Lecture Notes in Computer Science 6155.
Springer Verlag,
pp. 1–42,
doi:10.1007/978-3-642-13678-8_1.
Alessandra Di Pierro, Chris Hankin & Herbert Wiklicky (2011):
Probabilistic timing covert channels: to close or not to close?.
International Journal of Information Security 10(2),
pp. 83–106,
doi:10.1007/s10207-010-0107-0.
Alessandra Di Pierro, Pascal Sotin & Herbert Wiklicky (2008):
Relational Analysis and Precision via Probabilistic Abstract Interpretation.
In: Proceedings of QAPL'08,
ENTCS 220(3).
Elsevier,
pp. 23–42,
doi:10.1016/j.entcs.2008.11.017.
Alessandra Di Pierro & Herbert Wiklicky (2000):
Concurrent Constraint Programming: Towards Probabilistic Abstract Interpretation.
In: Proceedings of PPDP'00.
ACM,
pp. 127–138,
doi:10.1145/351268.351284.
Alessandra Di Pierro & Herbert Wiklicky (2001):
Measuring the Precision of Abstract Interpretations.
In: Proceedings of LOPSTR'00,
Lecture Notes in Computer Science 2042.
Springer Verlag,
Berlin – New York,
pp. 147–164,
doi:10.1007/3-540-44651-6.
Alessandra Di Pierro & Herbert Wiklicky (2013):
Semantics of Probabilistic Programs: A Weak Limit Approach.
In: Chung chieh Shan: Proceedings of APLAS13 – 11th Asian Symposium on Programming Languages and Systems,
Lecture Notes in Computer Science 8301.
Springer Verlag,
pp. 241–256,
doi:10.1007/978-3-319-03542-0_18.
Alessandra Di Pierro & Herbert Wiklicky (2014):
Probabilistic Analysis of Programs: A Weak Limit Approach.
In: FOPARA'13,
Lecture Notes in Computer Science.
Springer Verlag,
pp. (to appear).
John W. Eaton, David Bateman & Soren Hauberg (2007):
GNU Octave – A high-level interactive language for numerical computations,
3rd edition.
Paul C. Kocher (1996):
Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems.
Lecture Notes in Computer Science 1109,
pp. 104–113,
doi:10.1007/3-540-68697-5_9.
Dexter Kozen (1981):
Semantics of Probabilistic Programs.
J. Comput. Syst. Sci. 22(3),
pp. 328–350,
doi:10.1016/0022-0000(81)90036-2.
David Monniaux (2000):
Abstract Interpretation of Probabilistic Semantics.
In: SAS'00,
Lecture Notes in Computer Science 1824.
Springer Verlag,
pp. 322–339,
doi:10.1007/978-3-540-45099-3_17.
Steven Roman (2005):
Advanced Linear Algebra,
2nd edition.
Springer Verlag.
Armando Solar Lezama (2008):
Program Synthesis By Sketching.
University of California, Berkeley.
Armando Solar-Lezama (2013):
Program Sketching.
Int. J. Softw. Tools Technol. Transfer 15,
pp. 475–495,
doi:10.1007/s10009-012-0249-7.
David Stirzaker (1999):
Probability and Random Variables – A Beginners Guide.
Cambridge University Press,
doi:10.1017/CBO9780511813627.
Martin Vechev, Eran Yahav & Greta Yorsh (2010):
Abstraction-guided Synthesis of Synchronization.
In: Proceedings of POPL '10.
ACM,
pp. 327–338,
doi:10.1145/1706299.1706338.