scientific article; zbMATH DE number 7453196
From MaRDI portal
Publication:5020657
Cites work
- scientific article; zbMATH DE number 1088021 (Why is no real title available?)
- scientific article; zbMATH DE number 3302923 (Why is no real title available?)
- A positive supercompiler
- Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages
- Automatic Termination Proofs for Programs with Shape-Shifting Heaps
- Automatic termination proofs with transformation orderings
- Computer Aided Verification
- Cyclic proofs of program termination in separation logic
- On Computable Numbers, with an Application to the Entscheidungsproblem
- Programming Languages and Systems
- Proving termination of programs automatically with AProVE
- Termination Analysis with Calling Context Graphs
- Termination of rewriting
- The concept of a supercompiler
- The size-change principle for program termination
- Verification, Model Checking, and Abstract Interpretation
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5020657)