Synthesis of sup-interpretations: a survey

DOI10.1016/J.TCS.2012.11.003zbMath1282.68091arXiv1210.7136OpenAlexW2070322713MaRDI QIDQ1935778

Romain Péchoux

Publication date: 19 February 2013

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1210.7136

zbMATH Keywords

static analysiscomplexity analysisinterpretationquasi-interpretationresource upper boundssup-interpretation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Functional programming and lambda calculus (68N18) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Grammars and rewriting systems (68Q42)

Related Items (4)

Automatic synthesis of logical models for order-sorted first-order theories ⋮ Applications and extensions of context-sensitive rewriting ⋮ Derivational complexity and context-sensitive Rewriting ⋮ Characterizing polynomial time complexity of stream programs using interpretations

This page was built for publication: Synthesis of sup-interpretations: a survey