Pmaude: Rewrite-based specification language for probabilistic object systems, Electr. Notes in Theor. Comput. Sci, vol.153, issue.2, pp.213-239, 2006. ,
Verifying Polytime Computability Automatically, University of Innsbruck, 2013. ,
, Term Rewriting and All That, 1998.
Proving positive almost-sure termination, Proc. of 16 th RTA, vol.3467, pp.323-337, 2005. ,
URL : https://hal.archives-ouvertes.fr/inria-00000522
Proving positive almost sure termination under strategies, Proc. of 17 th RTA, vol.4098, pp.357-371, 2006. ,
Probabilistic Rewrite Strategies. Applications to ELAN, Proc. of 13 th RTA, pp.252-266, 2002. ,
URL : https://hal.archives-ouvertes.fr/inria-00100883
Marcov Chains, 1999. ,
Termination Analysis of Probabilistic Programs Through Positivstellensatz's, Proc. of 28 th CAV, vol.9779, pp.3-22, 2016. ,
Probabilistic Operational Semantics for the Lambda Calculus, RAIRO-TIA, vol.46, issue.3, pp.413-450, 2012. ,
Probabilistic Termination by Monadic Affine Sized Typing, Proc. of 26 th ESOP, pp.393-419, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01635077
On Constructor Rewrite Systems and the Lambda Calculus, LMCS, vol.8, issue.3, 2012. ,
Matrix Interpretations for Proving Termination of Term Rewriting, JAR, vol.40, issue.3, pp.195-220, 2008. ,
Probabilistic Termination: Soundness, Completeness, and Compositionality, Proc. of 42 nd POPL, pp.489-501, 2015. ,
SAT Solving for Termination Analysis with Polynomial Interpretations, Proc. of 10 th SAT, vol.4501, pp.340-354, 2007. ,
Induction for positive almost sure termination, PPDP 2017, pp.167-178, 2007. ,
URL : https://hal.archives-ouvertes.fr/inria-00182435
Probabilistic Encryption, JCSS, vol.28, issue.2, pp.270-299, 1984. ,
Church: a Language for Generative Models, Proc. of 24 th UAI, pp.220-229, 2008. ,
Automated complexity analysis based on contextsensitive rewriting, RTA-TLCA 2014, vol.8560, pp.257-271, 2014. ,
On the hardness of almost-sure termination, Proceedings, Part I, pp.307-318, 2015. ,
Canonical algebraic simplification in computational logic, 1975. ,
Polynomials Over the Reals in Proofs of Termination: From Theory to Practice, ITA, vol.39, issue.3, pp.547-586, 2005. ,
, Probabilistic Automata. Information and Control, vol.6, issue.3, pp.230-245, 1963.
Probabilistic LCF, MFCS. pp, pp.442-451, 1978. ,
Probabilistic Turing Machines and Computability, Proc. of the American Mathematical Society, vol.22, issue.3, pp.704-710, 1969. ,
Term Rewriting Systems, Cambridge Tracts in Theoretical Computer Science, vol.55, 2003. ,
Nagoya Termination Tool, RTA-TLCA 2014, vol.8560, pp.466-475, 2014. ,