Rely-Guarantee Reasoning for Automated Bound Analysis of Lock-Free Algorithms

Pani, Thomas; Weißenbacher, Georg; Zuleger, Florian

doi:10.23919/fmcad.2018.8603020

Cited by 5 publications

(6 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, there is a vast amount of literature on (automated) resource analysis. Without hope for a completeness, we briefly mention [1][2][3][4][5][6][7][9][10][11]14,15,17,18,20,[22][23][24][25]39,[44][45][46]52] for an overview of the field. Logarithmic and sublinear bounds are typically not in the focus of the cited approaches, but can be inferred by some tools.…”

Section: Related Workmentioning

confidence: 99%

ATLAS: Automated Amortised Complexity Analysis of Self-adjusting Data Structures

Leutgeb

Moser

Zuleger

2021

Computer Aided Verification

Self Cite

View full text Add to dashboard Cite

Being able to argue about the performance of self-adjusting data structures such as splay trees has been a main objective, when Sleator and Tarjan introduced the notion of amortised complexity.Analysing these data structures requires sophisticated potential functions, which typically contain logarithmic expressions. Possibly for these reasons, and despite the recent progress in automated resource analysis, they have so far eluded automation. In this paper, we report on the first fully-automated amortised complexity analysis of self-adjusting data structures. Following earlier work, our analysis is based on potential function templates with unknown coefficients.We make the following contributions: 1) We encode the search for concrete potential function coefficients as an optimisation problem over a suitable constraint system. Our target function steers the search towards coefficients that minimise the inferred amortised complexity. 2) Automation is achieved by using a linear constraint system in conjunction with suitable lemmata schemes that encapsulate the required non-linear facts about the logarithm. We discuss our choices that achieve a scalable analysis. 3) We present our tool $$\mathsf {ATLAS}$$ ATLAS and report on experimental results for splay trees, splay heaps and pairing heaps. We completely automatically infer complexity estimates that match previous results (obtained by sophisticated pen-and-paper proofs), and in some cases even infer better complexity estimates than previously published.

show abstract

Section: Related Workmentioning

confidence: 99%

ATLAS: Automated Amortised Complexity Analysis of Self-adjusting Data Structures

Leutgeb

Moser

Zuleger

2021

Computer Aided Verification

Self Cite

View full text Add to dashboard Cite

show abstract

“…In comparison to the tool version reported in the conference proceedings [33], we have made major performance improvements by solving graph isomorphism queries to reduce the size of the generated integer programs (cf. Sect.…”

Section: Discussion Of Resultsmentioning

confidence: 99%

“…This is an extended version of the conference paper that appeared at FMCAD 2018 [33]. Besides making the material more accessible through additional explanations and discussions, it adds the following contributions: 1.…”

Section: Contributionsmentioning

confidence: 99%

“…|V | and |E| indicate the size of the generated integer program as transition system with |V | control locations and |E| edges, it(erations) gives the number of iterations for Algorithm 1 to reach a fixed point, and runtime is our tool's runtime in hours:minutes:seconds. Column speedup lists the speedup compared to the tool version reported in the conference proceedings [33]…”

Section: Benchmarksmentioning

confidence: 99%

“…Unfortunately the benchmarking platform used for performance measurement in the conference version was decommissioned, thus runtime results are not directly comparable to[33]. For speedup, we reran the conference version of the tool on the new platform.…”

mentioning

confidence: 99%

See 2 more Smart Citations

Rely-guarantee bound analysis of parameterized concurrent shared-memory programs

Pani

Weißenbacher

Zuleger

2021

Form Methods Syst Des

Self Cite

View full text Add to dashboard Cite

We present a thread-modular proof method for complexity and resource bound analysis of concurrent, shared-memory programs. To this end, we lift Jones’ rely-guarantee reasoning to assumptions and commitments capable of expressing bounds. The compositionality (thread-modularity) of this framework allows us to reason about parameterized programs, i.e., programs that execute arbitrarily many concurrent threads. We automate reasoning in our logic by reducing bound analysis of concurrent programs to the sequential case. As an application, we automatically infer time complexity for a family of fine-grained concurrent algorithms, lock-free data structures, to our knowledge for the first time.

show abstract

Preface of the special issue on the conference on formal methods in computer aided design 2018

Bjørner

Gurfinkel

2021

Form Methods Syst Des

View full text Add to dashboard Cite

The International Conference on Formal Methods in Computer Aided Design (FMCAD), held at Austin, Texas, from October 3 to November 2 in 2018, is the eighteenth in a series of meetings on the theory and applications of rigorous formal techniques for the automated design of systems. The FMCAD conference covers formal aspects of specification, verification, synthesis, testing, and security, and is a leading forum for researchers and practitioners in academia and industry alike.This special issue of the journal on Formal Methods in System Design (FMSD) features extended and revised versions of select contributions from FMCAD 2018. Each contribution received at least two round of peer reviews by at least two experts. The issue contains the following contributions:

show abstract

Rely-Guarantee Reasoning for Automated Bound Analysis of Lock-Free Algorithms

Cited by 5 publications

References 30 publications

ATLAS: Automated Amortised Complexity Analysis of Self-adjusting Data Structures

ATLAS: Automated Amortised Complexity Analysis of Self-adjusting Data Structures

Rely-guarantee bound analysis of parameterized concurrent shared-memory programs

Preface of the special issue on the conference on formal methods in computer aided design 2018

Contact Info

Product

Resources

About