Probabilistic Termination of CHRiSM Programs
Authors:
- 1 January 2012
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 221-236
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Constraint Handling Rules2009
- Mechanizing and Improving Dependency PairsJournal of Automated Reasoning, 2007
- Proving Positive Almost Sure Termination Under Strategies2006
- Probabilistic Constraint Handling RulesElectronic Notes in Theoretical Computer Science, 2002
- A Formal Approach to Probabilistic TerminationLecture Notes in Computer Science, 2002
- Probabilistic Rewrite Strategies. Applications to ELAN2002
- Proving Termination of Constraint Solver Programs2000
- Constraint-based termination analysis of logic programsACM Transactions on Programming Languages and Systems, 1999
- Controlling generalization and polyvariance in partial deduction of normal logic programsACM Transactions on Programming Languages and Systems, 1998
- Reasoning about Termination of Pure Prolog ProgramsInformation and Computation, 1993