Formally Analyzing Expected Time Complexity of Algorithms Using Theorem Proving

[1]  H. Katzgraber.  Introduction to Monte Carlo Methods , 2009, 0905.1629.

[2]  John Harrison,et al.  Handbook of Practical Logic and Automated Reasoning , 2009 .

[3]  Sofiène Tahar,et al.  Formal Probabilistic Analysis of Stuck-at Faults in Reconfigurable Memory Arrays , 2009, IFM.

[4]  Sofiène Tahar,et al.  Using Theorem Proving to Verify Expectation and Variance for Discrete Random Variables , 2008, Journal of Automated Reasoning.

[5]  Christel Baier,et al.  Principles of model checking , 2008 .

[6]  Sofiène Tahar,et al.  Performance Analysis of ARQ Protocols using a Theorem Prover , 2008, ISPASS 2008 - IEEE International Symposium on Performance Analysis of Systems and software.

[7]  Sergei Vassilvitskii,et al.  The hiring problem and Lake Wobegon strategies , 2008, SODA '08.

[8]  Sofiène Tahar,et al.  Performance Analysis and Functional Verification of the Stop-and-Wait Protocol in HOL , 2008, Journal of Automated Reasoning.

[9]  Sofiène Tahar,et al.  Formalization of Continuous Probability Distributions , 2007, CADE.

[10]  Nicole Immorlica,et al.  Matroids, secretary problems, and online mechanisms , 2007, SODA '07.

[11]  Anthony Hall,et al.  Realising the Benefits of Formal Methods , 2005, J. Univers. Comput. Sci..

[12]  Tamar Frankel.  [The theory and the practice...]. , 2001, Tijdschrift voor diergeneeskunde.

[13]  Marta Z. Kwiatkowska,et al.  Quantitative Analysis With the Probabilistic Model Checker PRISM , 2006, QAPL.

[14]  Mahesh Viswanathan,et al.  VESTA: A statistical model-checker and analyzer for probabilistic systems , 2005, Second International Conference on the Quantitative Evaluation of Systems (QEST'05).

[15]  Anders Hald.  Montmort and the Essay d'Analyse sur les Jeux de Hazard, 1708 and 1713 , 2005 .

[16]  Robert D. Kleinberg.  A multiple-choice secretary algorithm with applications to online auctions , 2005, SODA '05.

[17]  Annabelle McIver,et al.  Abstraction, Refinement and Proof for Probabilistic Systems , 2004, Monographs in Computer Science.

[18]  J. Hurd,et al.  Probabilistic guarded commands mechanized in HOL , 2005, Theor. Comput. Sci..

[19]  Christel Baier,et al.  Validation of Stochastic Systems: A Guide to Current Research (Lecture Notes in Computer Science) , 2004 .

[20]  Jan J. M. M. Rutten,et al.  Mathematical techniques for analyzing concurrent and probabilistic systems , 2004, CRM monograph series.

[21]  Christel Baier,et al.  Validation of Stochastic Systems , 2004, Lecture Notes in Computer Science.

[22]  Christel Baier,et al.  Model-Checking Algorithms for Continuous-Time Markov Chains , 2002, IEEE Trans. Software Eng..

[23]  Joe Hurd,et al.  Formal verification of probabilistic algorithms , 2003 .

[24]  David Anthony Parker,et al.  Implementation of symbolic model checking for probabilistic systems , 2003 .

[25]  David A. Wagner,et al.  A Generalized Birthday Problem , 2002, CRYPTO.

[26]  John N. Tsitsiklis,et al.  Introduction to Probability , 2002 .

[27]  David Parker,et al.  IMPLEMENTATION OF SYMBOLIC MODEL CHECKING FOR , 2002 .

[28]  Matthew C. Whitney.  Exploring the Birthday Paradox Using a Monte Carlo Simulation and Graphing Calculators. , 2001 .

[29]  David Thomas,et al.  The Art in Computer Programming , 2001 .

[30]  Kevin J. Hastings.  Introduction to Probability with Mathematica , 2000 .

[31]  Steve Linton,et al.  Automated theorem proving in support of computer algebra: symbolic definite integration as a case study , 1999, ISSAC '99.

[32]  MA John Harrison PhD.  Theorem Proving with the Real Numbers , 1998, Distinguished Dissertations.

[33]  Zohar Manna,et al.  Formal verification of probabilistic systems , 1997 .

[34]  Charles M. Grinstead,et al.  Introduction to probability , 1999, Statistics for the Behavioural Sciences.

[35]  J. Harrison.  Formalized Mathematics , 1996 .

[36]  Douglas R. Stinson,et al.  Cryptography: Theory and Practice , 1995 .

[37]  P. Laplace.  Théorie analytique des probabilités , 1995 .

[38]  Tatsuya Akutsu.  On Determining the Congruity of Point Sets in Higher Dimensions , 1994, ISAAC.

[39]  Lawrence Charles Paulson,et al.  Isabelle: A Generic Theorem Prover , 1994 .

[40]  M. Gordon,et al.  Introduction to HOL: a theorem proving environment for higher order logic , 1993 .

[41]  Edmund M. Clarke,et al.  Verification Tools for Finite-State Concurrent Systems , 1993, REX School/Symposium.

[42]  Philippe Flajolet,et al.  Birthday Paradox, Coupon Collectors, Caching Algorithms and Self-Organizing Search , 1992, Discret. Appl. Math..

[43]  Peter Whittle,et al.  Probability via expectation , 1992 .

[44]  Philippe Flajolet,et al.  Automatic Average-Case Analysis of Algorithm , 1991, Theor. Comput. Sci..

[45]  John H. Reif,et al.  A randomized parallel algorithm for planar graph isomorphism , 1990, SPAA '90.

[46]  Claire Jones,et al.  Probabilistic non-determinism , 1990 .

[47]  Andrzej Ne ' dzusiak.  Fields and Probability , 1990 .

[48]  Józef Bia las.  The σ-additive Measure Theory , 1990 .

[49]  L. Devroye.  Non-Uniform Random Variate Generation , 1986 .

[50]  Dexter Kozen,et al.  A probabilistic PDL , 1983, J. Comput. Syst. Sci..

[51]  P. Freeman.  The Secretary Problem and its Extensions: A Review , 1983 .

[52]  Lajos Takács,et al.  The problem of coincidences , 1980 .

[53]  Pierre Raymond de Montmort.  Essay D'Analyse Sur Les Jeux De Hazard , 1980 .

[54]  Robin Milner,et al.  A Theory of Type Polymorphism in Programming , 1978, J. Comput. Syst. Sci..

[55]  Jorge Nuno Silva,et al.  Mathematical Games , 1959, Nature.

[56]  Alonzo Church,et al.  A formulation of the simple theory of types , 1940, Journal of Symbolic Logic.