DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Termination analysis
Termination analysis
Formal Verification of Termination Criteria for First-Order Recursive Functions
Synthesising Interprocedural Bit-Precise Termination Proofs
Practical Reflection and Metaprogramming for Dependent
Unfailing Haskell
Termination Analysis with Compositional Transition Invariants*
A Flexible Approach to Termination with General Recursion
Proving Conditional Termination
Automated Termination Proofs for Haskell by Term Rewriting
A Predicative Analysis of Structural Recursion
Distilling Programs to Prove Termination
Termination Analysis with Recursive Calling Graphs
Program Termination and Worst Time Complexity with Multi-Dimensional Affine Ranking Functions
Coq with Classes Matthieu Sozeau Currently at the IAS, Princeton
Neural Termination Analysis
Ceta – a Tool for Certified Termination Analysis
SMT Techniques and Solvers in Automated Termination Analysis
Automated Termination Proofs for Haskell by Term Rewriting
Bitprecise Proceduremodular Termination Analysis
Top View
Proving Termination Through Conditional Termination⋆
Termination Proofs for Linear Simple Loops Hongyi Chen Louisiana State University and Agricultural and Mechanical College
A Dynamic Approach to Characterizing Termination of General Logic Programs
Program Termination and Well Partial Orderings
Termination Analysis of C Programs Using Compiler Intermediate Languages
Reasoning About Programs Panagiotis Manolios Northeastern University
VPHL: a Verified Partial-Correctness Logic for Probabilistic Programs
Proving Program Termination.39 His in Recent Years, Powerful New Ter- Ficulty
Implementing Termination Analysis on Quantum Programming
Termination Checking with Types Strong Normalization for Mendler-Style Course-Of-Value Recursion
Formalization of the Undecidability of the Halting Problem for a Functional Language
Dependency Pairs Termination in Dependent Type Theory Modulo Rewriting
Termination of Logic Programs: the Never-Ending Story
Type-Based Termination of Recursive Definitions
Termination Analysis with Calling Context Graphs⋆
Time-Bounded Termination Analysis for Probabilistic Programs with Delays
Methods for Proving Non-Termination of Programs
Dealing with Numeric Fields in Termination Analysis of Java-Like Languages ⋆
Proving Termination of Programs Automatically with Aprove?
Color: a Coq Library on Well-Founded Rewrite Relations and Its Application to the Automated Verification of Termination Certificates Frédéric Blanqui, Adam Koprowski
Refinement Types for Haskell
Types and Verification for Infinite State Systems
Termination Proofs from Tests
Proving Termination Starting from the End
Proving Program Termination Via Term Rewriting
A Specification Language for Distributed Algorithms
Idris, a General Purpose Dependently Typed Programming Language: Design and Implementation
Dependent Type Systems As Macros
Using Partial Evaluation to Improve Domain-Specific Language
Analyzing Program Termination and Complexity Automatically with Aprove
Rewriting Techniques for Analysing Termination and Complexity Bounds of �Afe Programs�
Local Termination: Theory and Practice