Abdulbaki Aydin, Lucas Bang & Tevfik Bultan (2015):
Automata-Based Model Counting for String Constraints.
In: Proceedings of the 27th International Conference on Computer Aided Verification (CAV),
doi:10.1007/978-3-540-85114-1_21.
Lucas Bang, Abdulbaki Aydin, Quoc-Sang Phan, Corina S. Pasareanu & Tevfik Bultan (2016):
String Analysis for Side Channels with Segmented Oracles.
In: Proc. of the 24th ACM SIGSOFT International Symp. on the Foundations of Software Engineering,
doi:10.1145/2950290.2950362.
Lucas Bang, Nicolás Rosner & Tevfik Bultan (2018):
Online Synthesis of Adaptive Side-Channel Attacks Based On Noisy Observations.
In: 2018 IEEE European Symposium on Security and Privacy, EuroS&P 2018, London, United Kingdom, April 24-26, 2018.
IEEE,
pp. 307–322.
Alexander I. Barvinok (1994):
A polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed.
Math. Oper. Res. 19(4),
pp. 769–779,
doi:10.1287/moor.19.4.769.
George Casella, Christian P. Robert & Martin T. Wells (2004):
Generalized Accept-Reject Sampling Schemes.
Lecture Notes-Monograph Series 45,
pp. 342–347,
doi:10.1214/lnms/1196285403.
Available at http://www.jstor.org/stable/4356322.
Thomas M. Cover & Joy A. Thomas (2006):
Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing).
Wiley-Interscience.
Leonardo De Moura & Nikolaj Bjørner (2008):
Z3: an efficient SMT solver.
In: Proceedings of the 14th international conference on Tools and algorithms for the construction and analysis of systems,
TACAS'08,
pp. 337–340.
Aleksandar S. Dimovski (2017):
Probabilistic Analysis Based On Symbolic Game Semantics and Model Counting.
In: Patricia Bouyer, Andrea Orlandini & Pierluigi San Pietro: Proceedings Eighth International Symposium on Games, Automata, Logics and Formal Verification, GandALF 2017, Roma, Italy, 20-22 September 2017,
EPTCS 256,
pp. 1–15.
Antonio Filieri, Corina S. Pasareanu & Willem Visser (2013):
Reliability analysis in symbolic pathfinder.
In: David Notkin, Betty H. C. Cheng & Klaus Pohl: 35th International Conference on Software Engineering, ICSE '13, San Francisco, CA, USA, May 18-26, 2013.
IEEE Computer Society,
pp. 622–631.
Michael T. Goodrich (2012):
Learning Character Strings via Mastermind Queries, With a Case Study Involving mtDNA.
IEEE Trans. Information Theory 58(11),
pp. 6726–6736,
doi:10.1109/TIT.2012.2208581.
Laurent Hyafil & Ronald L. Rivest (1976):
Constructing optimal binary decision trees is NP-complete.
Information Processing Letters 5(1),
pp. 15 – 17,
doi:10.1016/0020-0190(76)90095-8.
W J. M. Meuffels & Dick den Hertog (2010):
Puzzle —Solving the Battleship Puzzle as an Integer Programming Problem.
Journal of Financial Stability 10,
pp. 156–162.
Kevin G Jamieson & Robert Nowak (2011):
Active Ranking using Pairwise Comparisons.
In: J. Shawe-Taylor, R. S. Zemel, P. L. Bartlett, F. Pereira & K. Q. Weinberger: Advances in Neural Information Processing Systems 24.
Curran Associates, Inc.,
pp. 2240–2248.
Available at http://papers.nips.cc/paper/4427-active-ranking-using-pairwise-comparisons.pdf.
James C. King (1976):
Symbolic execution and program testing.
Commun. ACM 19(7),
pp. 385–394,
doi:10.1145/360248.360252.
Miroslav Klimos & Antonín Kucera (2015):
Cobra: A Tool for Solving General Deductive Games.
In: Logic for Programming, Artificial Intelligence, and Reasoning - 20th International Conference, November 24-28,
pp. 31–47,
doi:10.1016/j.tcs.2006.08.042.
Barteld P. Kooi (2005):
Yet Another Mastermind Strategy.
ICGA Journal 28(1),
pp. 13–20,
doi:10.3233/ICG-2005-28105.
Boris Köpf & David A. Basin (2007):
An information-theoretic model for adaptive side-channel attacks.
In: Proceedings of the 2007 ACM Conference on Computer and Communications Security, CCS 2007, Alexandria, Virginia, USA, October 28-31, 2007,
pp. 286–296.
Nate Lawson (2009):
Timing attack in Google Keyczar library.
https://rdist.root.org/2009/05/28/timing-attack-in-google-keyczar-library/.
Jesús A. De Loera, Raymond Hemmecke, Jeremiah Tauzer & Ruriko Yoshida (2004):
Effective lattice point counting in rational convex polytopes.
Journal of Symbolic Computation 38(4),
pp. 1273 – 1302,
doi:10.1016/j.jsc.2003.04.003.
Symbolic Computation in Algebra and Geometry.
Loi Luu, Shweta Shinde, Prateek Saxena & Brian Demsky (2014):
A model counter for constraints over unbounded strings.
In: Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI),
pp. 57,
doi:10.1109/SP.2009.8.
J Maestro-Montojo, Sancho Salcedo-Sanz & Juan Merelo Guervós (2014):
New solver and optimal anticipation strategies design based on evolutionary computation for the game of MasterMind.
Evolutionary Intelligence 6,
doi:10.1007/s12065-013-0099-6.
Taylor Nelson (2010):
Widespread Timing Vulnerabilities in OpenID implementations.
http://lists.openid.net/pipermail/openid-security/2010-July/001156.html.
Joseph O'Rourke (2004):
Finding minimal enclosing boxes.
International Journal of Computer & Information Sciences 14,
pp. 183–199,
doi:10.1007/BF00991005.
Quoc-Sang Phan, Lucas Bang, Corina S. Pasareanu, Pasquale Malacaria & Tevfik Bultan (2017):
Synthesis of Adaptive Side-Channel Attacks.
In: 30th IEEE Computer Security Foundations Symposium, CSF 2017,
doi:10.1109/CSF.2017.8.
Yewen Pu, Leslie Pack Kaelbling & Armando Solar-Lezama (2017):
Learning to Acquire Information.
In: Proceedings of the Thirty-Third Conference on Uncertainty in Artificial Intelligence, UAI 2017, Sydney, Australia, August 11-15, 2017.
J. Ross Quinlan (1986):
Induction of Decision Trees.
Mach. Learn. 1(1),
pp. 81–106,
doi:10.1023/A:1022643204877.
Anthony Rhodes (2019):
Search Algorithms for Mastermind.
Seemanta Saha, William Eiers, Ismet Burak Kadron, Lucas Bang & Tevfik Bultan (2019):
Incremental Attack Synthesis.
ACM SIGSOFT Software Engineering Notes 44(4),
pp. 16,
doi:10.1007/s10515-013-0122-2.
Claude Shannon (1948):
A Mathematical Theory of Communication.
Bell System Technical Journal 27,
pp. 379–423, 623–656,
doi:10.1002/j.1538-7305.1948.tb00917.x.
Geoffrey Smith (2009):
On the Foundations of Quantitative Information Flow.
In: Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures (FOSSACS),
doi:10.1137/060651380.
eptcs@eptcs.org