Lexicographic Ranking Supermartingales: An Efficient Approach to Termination of Probabilistic Programs, PACMPL, vol.2, pp.1-34, 2018. ,
Running on Fumes, Lecture Notes in Computer Science, vol.11847, pp.63-78, 2019. ,
Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs, Static Analysis, vol.6337, pp.117-133, 2010. ,
URL : https://hal.archives-ouvertes.fr/inria-00523298
Type-Based Complexity Analysis of Probabilistic Functional Programs, 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2019. ,
URL : https://hal.archives-ouvertes.fr/hal-02103943
On probabilistic term rewriting, Science of Computer Programming, vol.185, p.102338, 2020. ,
URL : https://hal.archives-ouvertes.fr/hal-02381877
TcT: Tyrolean Complexity Tool, Tools and Algorithms for the Construction and Analysis of Systems, pp.407-423, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01392188
On probabilistic term rewriting, Science of Computer Programming, vol.185, p.102338, 2020. ,
URL : https://hal.archives-ouvertes.fr/hal-02381877
Formal certification of code-based cryptographic proofs, Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '09, pp.90-101, 2008. ,
Monotonicity Constraints for Termination in the Integer Domain, Logical Methods in Computer Science, vol.7, issue.3, pp.1-43, 2011. ,
Mortality of iterated piecewise affine functions over the integers: Decidability and complexity, Computability, vol.4, issue.1, pp.19-56, 2015. ,
Tight Worst-Case Bounds for Polynomial Loop Programs, Lecture Notes in Computer Science, vol.11425, pp.80-97, 2019. ,
ON THE EDGE OF DECIDABILITY IN COMPLEXITY ANALYSIS OF LOOP PROGRAMS, International Journal of Foundations of Computer Science, vol.23, issue.07, pp.1451-1464, 2012. ,
Proving Positive Almost-Sure Termination, Proc. of 16 th RTA, vol.3467, pp.323-337, 2005. ,
URL : https://hal.archives-ouvertes.fr/inria-00000522
Runtime analysis of probabilistic programs with unbounded recursion, Journal of Computer and System Sciences, vol.81, issue.1, pp.288-310, 2015. ,
On Intersection Types and Probabilistic Lambda Calculi, Proceedings of the 20th International Symposium on Principles and Practice of Declarative Programming, vol.8, pp.1-8, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01926420
Alternating Runtime and Size Complexity Analysis of Integer Programs, Tools and Algorithms for the Construction and Analysis of Systems, vol.8413, pp.140-155, 2014. ,
Analyzing Runtime and Size Complexity of Integer Programs, ACM Transactions on Programming Languages and Systems, vol.38, issue.4, pp.1-50, 2016. ,
Compositional certified resource bounds, ACM SIGPLAN Notices, vol.50, issue.6, pp.467-478, 2015. ,
Compositional Specification and Analysis of Cost-Based Properties in Probabilistic Programs, FM 2005: Formal Methods, vol.3582, pp.107-122, 2005. ,
Probabilistic Program Analysis with Martingales, Computer Aided Verification, vol.8044, pp.511-526, 2013. ,
Expectation Invariants for Probabilistic Program Loops as Fixed Points, Static Analysis, pp.85-100, 2014. ,
Termination Analysis of Probabilistic Programs Through Positivstellensatz?s, Computer Aided Verification, vol.9779, pp.3-22, 2016. ,
Automated Recurrence Analysis for Almost-Linear Expected-Runtime Bounds, Computer Aided Verification, vol.10426, pp.118-139, 2017. ,
Stochastic invariants for probabilistic termination, ACM SIGPLAN Notices, vol.52, issue.1, pp.145-160, 2017. ,
Two languages for estimating program efficiency, Communications of the ACM, vol.17, issue.6, pp.301-308, 1974. ,
Mechanically Proving Termination Using Polynomial Interpretations, Proc. of 11 th CC, vol.34, pp.159-178, 2002. ,
URL : https://hal.archives-ouvertes.fr/hal-01984434
MapReduce, Communications of the ACM, vol.51, issue.1, pp.107-113, 2008. ,
Small Formulas for Large Programs: On-Line Constraint Simplification in Scalable Static Analysis, Static Analysis, pp.236-252, 2010. ,
Quantitative Analysis of Probabilistic Pushdown Automata: Expectations and Variances, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05), pp.117-126 ,
From Shapes to Amortized Complexity, Lecture Notes in Computer Science, vol.10747, pp.205-225, 2017. ,
Complexity Analysis for Java with AProVE, Lecture Notes in Computer Science, vol.10510, pp.85-101, 2017. ,
SAT Solving for Termination Analysis with Polynomial Interpretations, Theory and Applications of Satisfiability Testing ? SAT 2007, vol.4501, pp.340-354 ,
PSI: Exact Symbolic Inference for Probabilistic Programs, Computer Aided Verification, vol.9779, pp.62-83, 2016. ,
SPEED, ACM SIGPLAN Notices, vol.44, issue.1, pp.127-139, 2009. ,
Combining abstract interpreters, Proceedings of the 2006 ACM SIGPLAN conference on Programming language design and implementation - PLDI '06, pp.376-386, 2006. ,
The reachability-bound problem, ACM SIGPLAN Notices, vol.45, issue.6, pp.292-304, 2010. ,
Representing polynomials by positive linear functions on compact convex polyhedra, Pacific Journal of Mathematics, vol.132, issue.1, pp.35-62, 1988. ,
Amdahl's Law in the Multicore Era, Computer, vol.41, issue.7, pp.33-38, 2008. ,
Automated Complexity Analysis Based on the Dependency Pair Method, Automated Reasoning, vol.5195, pp.364-379 ,
Towards automatic resource bound analysis for OCaml, Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages - POPL 2017, pp.359-373, 2017. ,
A flow calculus of mwp -bounds for complexity analysis, ACM Transactions on Computational Logic, vol.10, issue.4, pp.1-41, 2009. ,
A weakest pre-expectation semantics for mixed-sign expectations, 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), pp.1-12, 2017. ,
Weakest Precondition Reasoning for Expected Run?Times of Probabilistic Programs, Programming Languages and Systems, vol.9632, pp.364-389, 2016. ,
Weakest Precondition Reasoning for Expected Runtimes of Randomized Algorithms, Journal of the ACM, vol.65, issue.5, pp.1-68, 2018. ,
On the Hardness of Almost?Sure Termination, Mathematical Foundations of Computer Science 2015, pp.307-318, 2015. ,
The Probabilistic Model Checking Landscape, Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science - LICS '16, pp.31-45, 2016. ,
Linear-Invariant Generation for Probabilistic Programs:, Static Analysis, vol.6337, pp.390-406, 2010. ,
Analysis of the fork-join queue, IEEE Transactions on Computers, vol.38, issue.2, pp.250-255, 1989. ,
Semantics of probabilistic programs, Journal of Computer and System Sciences, vol.22, issue.3, pp.328-350, 1981. ,
A probabilistic PDL, Journal of Computer and System Sciences, vol.30, issue.2, pp.162-178, 1985. ,
A new proof rule for almost-sure termination, Proceedings of the ACM on Programming Languages, vol.2, issue.POPL, pp.1-28, 2018. ,
Response-time analysis of composite web services, IEEE Internet Computing, vol.8, issue.1, pp.90-92, 2004. ,
Probability and Computing, Probability and Computing: Randomized Algorithms and Probabilistic Analysis, 2005. ,
An Abstract Analysis of the Probabilistic Termination of Programs, Proc. of 8 th SAS, vol.2126, 2001. ,
, , pp.111-126
From Jinja Bytecode to Term Rewriting: A Complexity Reflecting Transformation, Part, vol.261, pp.116-143, 2018. ,
Bounded expectations: resource analysis for probabilistic programs, ACM SIGPLAN Notices, vol.53, issue.4, pp.496-512, 2018. ,
Verifying and Synthesizing Constant-Resource Implementations with Types, Proc. of 38 th S&P, pp.710-728, 2017. ,
Reasoning about Recursive Probabilistic Programs, Proc. of 31 nd LICS, pp.672-681, 2016. ,
A Complete Method for the Synthesis of Linear Ranking Functions, Lecture Notes in Computer Science, vol.2937, pp.239-251, 2004. ,
An Introduction to the Analysis of Algorithms, 1996. ,
A Simple and Scalable Static Analysis for Bound Analysis and Amortized Complexity Analysis, Computer Aided Verification, vol.8559, pp.745-761, 2014. ,
Complexity and Resource Bound Analysis of Imperative Programs Using Difference Constraints, Journal of Automated Reasoning, vol.59, issue.1, pp.3-45, 2017. ,
Ranking and Repulsing Supermartingales for Reachability in Probabilistic Programs, Automated Technology for Verification and Analysis, vol.11138, pp.476-493, 2018. ,
PMAF: An Algebraic Framework for Static Analysis of Probabilistic Programs, Proc. of 39 th PLDI, pp.513-528, 2018. ,
Cost analysis of nondeterministic probabilistic programs, Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation - PLDI 2019, pp.204-220, 2019. ,
URL : https://hal.archives-ouvertes.fr/hal-02016018
Mechanical program analysis, Communications of the ACM, vol.18, issue.9, pp.528-539, 1975. ,
Verifying Program Performance, JACM, vol.23, pp.691-699, 1976. ,
The worst-case execution-time problem?overview of methods and survey of tools, ACM Transactions on Embedded Computing Systems, vol.7, issue.3, pp.1-53, 2008. ,
Computation takes time, but how much?, Communications of the ACM, vol.57, issue.2, pp.94-103, 2014. ,
Introduction to operational semantics, The Formal Semantics of Programming Languages, 1993. ,