Selectively-amortized resource bounding (Q2145338)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Selectively-amortized resource bounding	scientific article

Statements

scholarly article

0 references

Selectively-amortized resource bounding (English)

0 references

0 references

Bor-Yuh Evan Chang

0 references

Ashutosh Trivedi

0 references

publication date

17 June 2022

0 references

full work available at URL

https://arxiv.org/abs/2108.08263

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

More Precise Yet Widely Applicable Cost Analysis

0 references

Amortised Resource Analysis with Separation Logic

0 references

Automated resource analysis with Coq proof objects

0 references

Computer Aided Verification

0 references

Synthesis of Circular Compositional Program Proofs via Abduction

0 references

A fistful of dollars: formalizing asymptotic complexity claims via deductive program verification

0 references

0 references

0 references

Multivariate amortized resource analysis

0 references

Towards automatic resource bound analysis for OCaml

0 references

Polynomial Invariants for Affine Programs

0 references

Type-directed bounding of collections in reactive programs

0 references

Completing the temporal picture

0 references

Complexity and resource bound analysis of imperative programs using difference constraints

0 references

Amortized Computational Complexity

0 references

Program Slicing

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-030-88806-0_14

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2145338

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2145338&oldid=36818570"