Lower-bound synthesis using loop specialization and Max-SMT
type: Item
instance of: scholarly article
title: Lower-bound synthesis using loop specialization and Max-SMT
zbMATH Open document ID: 1493.68098
DOI: 10.1007/978-3-030-81688-9_40
author: Elvira Albert
author: Samir Genaim
author: Enrique Martin-Martin
author: Alicia Merayo
author: Albert Rubio
publication date: 2022-03-25T00:00:00Z
Mathematics Subject Classification ID: 68N30
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 68T20
zbMATH DE Number: 7498211
describes a project that uses: LoAT
describes a project that uses: z3
MaRDI profile type: Publication
full work available at URL: 978-3-030-81688-9 40
OpenAlex ID: W3183759032
cites work: Automatic Inference of Upper Bounds for Recurrence Relations in Cost Analysis
cites work: On the Inference of Resource Usage Upper and Lower Bounds
cites work: Computer Aided Verification
cites work: On automation of \(\mathsf{CTL}^*\) verification for infinite-state systems
cites work: A Calculus for Modular Loop Acceleration
cites work: Lower Runtime Bounds for Integer Programs
cites work: Automatic Static Cost Analysis for Parallel Programs
cites work: Automated Termination Analysis of Java Bytecode by Term Rewriting
cites work: Q3818127
cites work: Complexity and resource bound analysis of imperative programs using difference constraints
cites work: Mechanical program analysis
cites work: A New Algorithm for Identifying Loops in Decompilation
description: scientific article; zbMATH DE number 7498211