, Conversion of control dependence to data dependence, Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , POPL '83, pp.177-189, 1983.
DOI : 10.1145/567067.567085
, Automatic recognition of induction variables and recurrence relations by abstract interpretation, ACM SIG- PLAN Conference on Programming Language Design and Implementation (PLDI), White Plains, pp.283-295, 1990.
, Principles of model checking, 2008.
, Computer-Aided Security Proofs for the Working Cryptographer, IACR International Cryptology Conference (CRYPTO), pp.71-90, 2011.
DOI : 10.1007/978-3-642-22792-9_5
URL : https://hal.archives-ouvertes.fr/hal-01112075
, Proving Positive Almost-Sure Termination, International Conference on Rewriting Techniques and Applications (RTA), pp.323-337, 2005.
DOI : 10.1007/978-3-540-32033-3_24
URL : https://hal.archives-ouvertes.fr/inria-00099867
, Probabilistic Program Analysis with Martingales, International Conference on Computer Aided Verification (CAV), pp.511-526, 2013.
DOI : 10.1007/978-3-642-39799-8_34
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.360.1642
, Expectation Invariants for Probabilistic Program Loops as Fixed Points, International Symposium on Static Analysis (SAS), pp.85-100, 2014.
DOI : 10.1007/978-3-319-10936-7_6
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.671.4172
, Deductive Proofs of Almost Sure Persistence and Recurrence Properties, International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), pp.260-279, 2016.
DOI : 10.1007/978-3-662-49674-9_15
, Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs, pp.327-342, 2016.
, Counterexample-Guided Polynomial Loop Invariant Generation by Lagrange Interpolation, International Conference on Computer Aided Verification (CAV), pp.658-674, 2015.
DOI : 10.1007/978-3-319-21690-4_44
URL : http://arxiv.org/abs/1502.04280
, LiQuor: A tool for qualitative and quantitative linear time analysis of reactive systems, Third International Conference on the Quantitative Evaluation of Systems (QEST), pp.131-132, 2006.
, Linear Invariant Generation Using Non-linear Constraint Solving, International Conference on Computer Aided Verification (CAV), pp.420-432, 2003.
DOI : 10.1007/978-3-540-45069-6_39
, Automatic discovery of linear restraints among variables of a program, Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , POPL '78, pp.84-96, 1978.
DOI : 10.1145/512760.512770
, Z3: An Efficient SMT Solver, International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), pp.337-340, 2008.
DOI : 10.1007/978-3-540-78800-3_24
, Guarded commands, nondeterminacy and formal derivation of programs, Communications of the ACM, vol.18, issue.8, pp.453-457, 1975.
DOI : 10.1145/360933.360975
, Probabilistic CTL $$^{*}$$ : The Deductive Way, International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), pp.280-296, 2016.
DOI : 10.1007/978-3-662-49674-9_16
, Proving Termination of Probabilistic Programs Using Patterns, International Conference on Computer Aided Verification (CAV), pp.123-138, 2012.
DOI : 10.1007/978-3-642-31424-7_14
, Probabilistic termination: Soundness, completeness, and compositionality, ACM SIGPLAN?SIGACT Symposium on Principles of Programming Languages (POPL), pp.489-501, 2015.
, Termination of Probabilistic Concurrent Program, ACM Transactions on Programming Languages and Systems, vol.5, issue.3, pp.356-380, 1983.
DOI : 10.1145/2166.357214
, Open source computer algebra systems, SymPy. ACM Commun. Comput. Algebra, vol.45, pp.3-4225, 2012.
DOI : 10.1145/1394042.1394046
, Weakest Precondition Reasoning for Expected Run???Times of Probabilistic Programs, European Symposium on Programming (ESOP), 2016.
DOI : 10.1007/978-3-642-76771-5
, Linear-Invariant Generation for Probabilistic Programs:, International Symposium on Static Analysis (SAS), pp.390-406, 2010.
DOI : 10.1007/978-3-642-15769-1_24
, The ins and outs of the probabilistic model checker MRMC, Performance Evaluation, vol.68, issue.2, pp.90-104, 2011.
DOI : 10.1016/j.peva.2010.04.001
, Reasoning Algebraically About P-Solvable Loops, International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), pp.249-264, 2008.
DOI : 10.1007/978-3-540-78800-3_18
, Semantics of probabilistic programs, Journal of Computer and System Sciences, vol.22, issue.3, pp.328-350, 1981.
DOI : 10.1016/0022-0000(81)90036-2
URL : http://doi.org/10.1016/0022-0000(81)90036-2
, PRISM 4.0: Verification of Probabilistic Real-Time Systems, International Conference on Computer Aided Verification (CAV), pp.585-591, 2011.
DOI : 10.1007/3-540-45657-0_17
URL : https://hal.archives-ouvertes.fr/hal-00648035
, Abstraction, Refinement and Proof for Probabilistic Systems. Monographs in Computer Science, 2005.
, The octagon abstract domain. Higher-Order and Symbolic Computation, pp.31-100, 2006.
, An Abstract Analysis of the Probabilistic Termination of Programs, International Symposium on Static Analysis (SAS), pp.111-126, 2001.
DOI : 10.1007/3-540-47764-0_7
, Randomized Algorithms, 1995.
, A hoare-like proof system for analysing the computation time of programs, Science of Computer Programming, vol.9, issue.2, pp.107-136, 1987.
DOI : 10.1016/0167-6423(87)90029-3
, Generating all polynomial invariants in simple loops, Journal of Symbolic Computation, vol.42, issue.4, pp.443-476, 2007.
DOI : 10.1016/j.jsc.2007.01.002
, Probability with Martingales, 1991.
DOI : 10.1017/CBO9780511813658