scientific article; zbMATH DE number 6027825
From MaRDI portal
Publication:5389068
DOI10.4230/LIPIcs.RTA.2011.21zbMath1236.68219MaRDI QIDQ5389068
Pierre Courtieu, Xavier Urbain, Olivier Pons, Evelyne Contejean, Julien Forest
Publication date: 24 April 2012
Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_a155.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (13)
Analyzing program termination and complexity automatically with \textsf{AProVE} ⋮ Automatically proving termination and memory safety for programs with pointer arithmetic ⋮ Unnamed Item ⋮ Optimizing a Certified Proof Checker for a Large-Scale Computer-Generated Proof ⋮ Formalizing Size-Optimal Sorting Networks: Extracting a Certified Proof Checker ⋮ Formally proving size optimality of sorting networks ⋮ A Lambda-Free Higher-Order Recursive Path Order ⋮ Rewrite rules for \(\mathrm{CTL}^\ast\) ⋮ A framework for developing stand-alone certifiers ⋮ CSI – A Confluence Tool ⋮ Multi-dimensional interpretations for termination of term rewriting ⋮ Certification of Classical Confluence Results for Left-Linear Term Rewrite Systems ⋮ Tuple interpretations for termination of term rewriting
Uses Software
This page was built for publication:
