344
F. Funke et al.
63. Mattheiss, T.H.: An algorithm for determining irrelevant constraints and all vertices
in systems of linear inequalities. Operations Research 21(1), 247–260 (1973), http:
//www.jstor.org/stable/169104
64. McConnell, R.M., Mehlhorn, K., N¨ aher, S., Schweitzer, P.: Certifying algorithms.
Computer Science Review 5(2), 119–161 (2011), https://doi.org/10.1016/j.cosrev.
2010.09.009
65. Naiman, D.Q., Scheinerman, E.R.: Arbitrage and geometry. Preprint (2017), https:
//arxiv.org/abs/1709.07446
66. Namjoshi, K.S.: Certifying model checkers. In: Computer Aided Verification, 13th
International Conference, CAV 2001. pp. 2–13 (2001), https://doi.org/10.1007/
3-540-44585-4 2
67. Peled, D.A., Pnueli, A., Zuck, L.D.: From falsification to verification. In: FST TCS
2001: Foundations of Software Technology and Theoretical Computer Science. pp.
292–304 (2001), https://doi.org/10.1007/3-540-45294-X 25
68. Provan, J.S.: Efficient enumeration of the vertices of polyhedra associated with
network LP’s. Mathematical Programming 63(1), 47–64 (1994), https://doi.org/10.
1007/BF01582058
69. Reiter, M.K., Rubin, A.D.: Crowds: Anonymity for web transactions. ACM
Transactions on Information and System Security 1(1), 66–92 (1998), https:
//doi.org/10.1145/290163.290168
70. Schrijver, A.: Theory of Linear and Integer Programming. John Wiley & Sons, Inc.,
New York, NY, USA (1986)
71. Schrijver, A.: A course in combinatorial optimization. Lecture notes (2017), https:
//homepages.cwi.nl/ ∼ lex/files/dict.pdf
72. Shmatikov, V.: Probabilistic analysis of an anonymity system. Journal of Computer
Security 12(3-4), 355–377 (2004)
73. Vardi, M.Y.: Automatic verification of probabilistic concurrent finite state programs.
In: Proceedings of the 26th Annual Symposium on Foundations of Computer Science.
pp. 327–338. SFCS ’85, IEEE Computer Society (1985), https://doi.org/10.1109/
SFCS.1985.12
74. Vardi, M.Y., Wolper, P.: An automata-theoretic approach to automatic program
verification (preliminary report). In: Proceedings of the Symposium on Logic in
Computer Science (LICS 86). pp. 332–344 (1986)
75. Vohra, R.V.: The ubiquitous farkas lemma. In: Perspectives in Operations Research:
Papers in Honor of Saul Gass’ 80th Birthday. pp. 199–210. Springer US, Boston,
MA (2006), https://doi.org/10.1007/978-0-387-39934-8 11
76. Wimmer, R., Braitling, B., Becker, B.: Counterexample generation for discrete-time
Markov chains using bounded model checking. In: Verification, Model Checking, and
Abstract Interpretation, 10th International Conference, VMCAI 2009. pp. 366–380
(2009), https://doi.org/10.1007/978-3-540-93900-9 29
77. Wimmer, R., Jansen, N., ´
Abrah´ am, E., Becker, B., Katoen, J.: Minimal critical
subsystems for discrete-time markov models. In: Tools and Algorithms for the
Construction and Analysis of Systems - 18th International Conference, TACAS
2012. pp. 299–314 (2012), https://doi.org/10.1007/978-3-642-28756-5 21
78. Wimmer, R., Jansen, N., ´
Abrah´ am, E., Katoen, J., Becker, B.: Minimal counterexamples for linear-time probabilistic verification. Theoretical Computer Science 549,
61–100 (2014), https://doi.org/10.1016/j.tcs.2014.06.020
F. Funke et al.
63. Mattheiss, T.H.: An algorithm for determining irrelevant constraints and all vertices
in systems of linear inequalities. Operations Research 21(1), 247–260 (1973), http:
//www.jstor.org/stable/169104
64. McConnell, R.M., Mehlhorn, K., N¨ aher, S., Schweitzer, P.: Certifying algorithms.
Computer Science Review 5(2), 119–161 (2011), https://doi.org/10.1016/j.cosrev.
2010.09.009
65. Naiman, D.Q., Scheinerman, E.R.: Arbitrage and geometry. Preprint (2017), https:
//arxiv.org/abs/1709.07446
66. Namjoshi, K.S.: Certifying model checkers. In: Computer Aided Verification, 13th
International Conference, CAV 2001. pp. 2–13 (2001), https://doi.org/10.1007/
3-540-44585-4 2
67. Peled, D.A., Pnueli, A., Zuck, L.D.: From falsification to verification. In: FST TCS
2001: Foundations of Software Technology and Theoretical Computer Science. pp.
292–304 (2001), https://doi.org/10.1007/3-540-45294-X 25
68. Provan, J.S.: Efficient enumeration of the vertices of polyhedra associated with
network LP’s. Mathematical Programming 63(1), 47–64 (1994), https://doi.org/10.
1007/BF01582058
69. Reiter, M.K., Rubin, A.D.: Crowds: Anonymity for web transactions. ACM
Transactions on Information and System Security 1(1), 66–92 (1998), https:
//doi.org/10.1145/290163.290168
70. Schrijver, A.: Theory of Linear and Integer Programming. John Wiley & Sons, Inc.,
New York, NY, USA (1986)
71. Schrijver, A.: A course in combinatorial optimization. Lecture notes (2017), https:
//homepages.cwi.nl/ ∼ lex/files/dict.pdf
72. Shmatikov, V.: Probabilistic analysis of an anonymity system. Journal of Computer
Security 12(3-4), 355–377 (2004)
73. Vardi, M.Y.: Automatic verification of probabilistic concurrent finite state programs.
In: Proceedings of the 26th Annual Symposium on Foundations of Computer Science.
pp. 327–338. SFCS ’85, IEEE Computer Society (1985), https://doi.org/10.1109/
SFCS.1985.12
74. Vardi, M.Y., Wolper, P.: An automata-theoretic approach to automatic program
verification (preliminary report). In: Proceedings of the Symposium on Logic in
Computer Science (LICS 86). pp. 332–344 (1986)
75. Vohra, R.V.: The ubiquitous farkas lemma. In: Perspectives in Operations Research:
Papers in Honor of Saul Gass’ 80th Birthday. pp. 199–210. Springer US, Boston,
MA (2006), https://doi.org/10.1007/978-0-387-39934-8 11
76. Wimmer, R., Braitling, B., Becker, B.: Counterexample generation for discrete-time
Markov chains using bounded model checking. In: Verification, Model Checking, and
Abstract Interpretation, 10th International Conference, VMCAI 2009. pp. 366–380
(2009), https://doi.org/10.1007/978-3-540-93900-9 29
77. Wimmer, R., Jansen, N., ´
Abrah´ am, E., Becker, B., Katoen, J.: Minimal critical
subsystems for discrete-time markov models. In: Tools and Algorithms for the
Construction and Analysis of Systems - 18th International Conference, TACAS
2012. pp. 299–314 (2012), https://doi.org/10.1007/978-3-642-28756-5 21
78. Wimmer, R., Jansen, N., ´
Abrah´ am, E., Katoen, J., Becker, B.: Minimal counterexamples for linear-time probabilistic verification. Theoretical Computer Science 549,
61–100 (2014), https://doi.org/10.1016/j.tcs.2014.06.020