research-article

Verified resource guarantees using COSTA and KeY

Authors:

Guillermo Román-DíezAuthors Info & Claims

PEPM '11: Proceedings of the 20th ACM SIGPLAN workshop on Partial evaluation and program manipulation

Pages 73 - 76

https://doi.org/10.1145/1929501.1929513

Published: 24 January 2011 Publication History

Get Access

Abstract

Resource guarantees allow being certain that programs will run within the indicated amount of resources, which may refer to memory consumption, number of instructions executed, etc. This information can be very useful, especially in real-time and safety-critical applications. Nowadays, a number of automatic tools exist, often based on type systems or static analysis, which produce such resource guarantees. In spite of being based on theoretically sound techniques, the implemented tools may contain bugs which render the resource guarantees thus obtained not completely trustworthy. Performing full-blown verification of such tools is a daunting task, since they are large and complex. In this work we investigate an alternative approach whereby, instead of the tools, we formally verify the results of the tools. We have implemented this idea using COSTA, a state-of-the-art static analysis system, for producing resource guarantees and KeY, a state-of-the-art verification tool, for formally verifying the correctness of such resource guarantees. Our preliminary results show that the proposed tool cooperation can be used for automatically producing verified resource guarantees.

References

[1]

E. Albert, P. Arenas, M. Codish, S. Genaim, G. Puebla, and D. Zanardini. Termination Analysis of Java Bytecode. In FMOODS'08, volume 5051 of LNCS, pages 2--18. Springer, 2008.

Digital Library

Google Scholar

[2]

E. Albert, P. Arenas, S. Genaim, and G. Puebla. Closed-Form Upper Bounds in Static Cost Analysis. Journal of Automated Reasoning, 2010. To appear.

Digital Library

Google Scholar

[3]

E. Albert, P. Arenas, S. Genaim, G. Puebla, and D. Zanardini. Cost Analysis of Java Bytecode. In ESOP'07, volume 4421 of LNCS, pages 157--172. Springer, 2007.

Digital Library

Google Scholar

[4]

B. Beckert, R. Hähnle, and P. Schmitt, editors. Verification of a Object-Oriented Software: The KeY Approach, volume 4334 of LNCS. Springer, 2006.

Digital Library

Google Scholar

[5]

K. Crary and S. Weirich. Resource Bound Certification. In POPL'05, pages 184--198. ACM Press, 2000.

Digital Library

Google Scholar

[6]

G. Necula. Proof-Carrying Code. In POPL 1997. ACM Press, 1997.

Digital Library

Google Scholar

[7]

A. Pnueli, M. Siegel, and E. Singerman. Translation Validation. In TACAS'98, volume 1384 of LNCS, pages 151--166. Springer, 1998.

Digital Library

Google Scholar

[8]

A. Podelski and A. Rybalchenko. A Complete Method for the Synthesis of Linear Ranking Functions. In VMCAI'04, LNCS. Springer, 2004.

Google Scholar

Cited By

View all

Albert EGenaim SMerayo ARomán-Díez G(2022)When COSTA Met KeY: Verified Cost BoundsThe Logic of Software. A Tasting Menu of Formal Methods10.1007/978-3-031-08166-8_2(19-37)Online publication date: 4-Jul-2022
https://doi.org/10.1007/978-3-031-08166-8_2
Mallick AChaudhari MSheth UPalanikumar GJoshi G(2019)Rateless Codes for Near-Perfect Load Balancing in Distributed Matrix-Vector MultiplicationProceedings of the ACM on Measurement and Analysis of Computing Systems10.1145/33667063:3(1-40)Online publication date: 17-Dec-2019
https://dl.acm.org/doi/10.1145/3366706
Horváth IScully ZVan Houdt B(2019)Mean Field Analysis of Join-Below-Threshold Load Balancing for Resource Sharing ServersProceedings of the ACM on Measurement and Analysis of Computing Systems10.1145/33667053:3(1-21)Online publication date: 17-Dec-2019
https://dl.acm.org/doi/10.1145/3366705
Show More Cited By

Index Terms

Verified resource guarantees using COSTA and KeY
1. Software and its engineering
  1. Software notations and tools
    1. General programming languages
2. Theory of computation
  1. Semantics and reasoning
    1. Program reasoning
      1. Program analysis
    2. Program semantics

Recommendations

A formal verification framework for static analysis

Static analysis tools, such as resource analyzers, give useful information on software systems, especially in real-time and safety-critical applications. Therefore, the question of the reliability of the obtained results is highly important. State-of-...
Verified squared: does critical software deserve verified tools?
POPL '11: Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages

The formal verification of programs has progressed tremendously in the last decade. In this talk, I review some of the obstacles that [6, 8, 15, 18] remain to be lifted before source-level verification tools can be taken really seriously in the critical ...
Verified resource guarantees for heap manipulating programs
FASE'12: Proceedings of the 15th international conference on Fundamental Approaches to Software Engineering

Program properties that are automatically inferred by static analysis tools are generally not considered to be completely trustworthy, unless the tool implementation or the results are formally verified. Here we focus on the formal verification of ...

Comments

Information & Contributors

Information

Published In

PEPM '11: Proceedings of the 20th ACM SIGPLAN workshop on Partial evaluation and program manipulation

January 2011

72 pages

ISBN:9781450304856

DOI:10.1145/1929501

Program Chairs:
Siau-Cheng Khoo
National University of Singapore, Singapore
,
Jeremy Siek
University of Colorado at Boulder, USA

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

In-Cooperation

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 24 January 2011

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

POPL '11

Sponsor:

SIGPLAN

POPL '11: The 38th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages

January 24 - 25, 2011

Texas, Austin, USA

Acceptance Rates

Overall Acceptance Rate 66 of 120 submissions, 55%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

26
Total Citations
View Citations
137
Total Downloads

Downloads (Last 12 months)2
Downloads (Last 6 weeks)1

Reflects downloads up to 29 Jul 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Albert EGenaim SMerayo ARomán-Díez G(2022)When COSTA Met KeY: Verified Cost BoundsThe Logic of Software. A Tasting Menu of Formal Methods10.1007/978-3-031-08166-8_2(19-37)Online publication date: 4-Jul-2022
https://doi.org/10.1007/978-3-031-08166-8_2
Mallick AChaudhari MSheth UPalanikumar GJoshi G(2019)Rateless Codes for Near-Perfect Load Balancing in Distributed Matrix-Vector MultiplicationProceedings of the ACM on Measurement and Analysis of Computing Systems10.1145/33667063:3(1-40)Online publication date: 17-Dec-2019
https://dl.acm.org/doi/10.1145/3366706
Horváth IScully ZVan Houdt B(2019)Mean Field Analysis of Join-Below-Threshold Load Balancing for Resource Sharing ServersProceedings of the ACM on Measurement and Analysis of Computing Systems10.1145/33667053:3(1-21)Online publication date: 17-Dec-2019
https://dl.acm.org/doi/10.1145/3366705
Bronzino FSchmitt PAyoubi SMartins GTeixeira RFeamster N(2019)Inferring Streaming Video Quality from Encrypted TrafficProceedings of the ACM on Measurement and Analysis of Computing Systems10.1145/33667043:3(1-25)Online publication date: 17-Dec-2019
https://dl.acm.org/doi/10.1145/3366704
de Magalhães C(2017)Toward Understanding Work Characteristics in Software EngineeringACM SIGSOFT Software Engineering Notes10.1145/3011286.301130641:6(1-6)Online publication date: 5-Jan-2017
https://dl.acm.org/doi/10.1145/3011286.3011306
Gyori ALambeth BKhurshid SMarinov D(2017)Exploring Underdetermined Specifications using Java PathFinderACM SIGSOFT Software Engineering Notes10.1145/3011286.301129541:6(1-5)Online publication date: 5-Jan-2017
https://dl.acm.org/doi/10.1145/3011286.3011295
Kersten RSchäf MKahsai T(2017)Resource Contracts for JavaACM SIGSOFT Software Engineering Notes10.1145/3011286.301129441:6(1-5)Online publication date: 5-Jan-2017
https://dl.acm.org/doi/10.1145/3011286.3011294
Nagarajan SShafiei NKhurshid S(2017)Towards Exhaustive Testing of Websites using JPFACM SIGSOFT Software Engineering Notes10.1145/3011286.301129341:6(1-5)Online publication date: 5-Jan-2017
https://dl.acm.org/doi/10.1145/3011286.3011293
Brockschmidt MEmmes FFalke SFuhs CGiesl J(2016)Analyzing Runtime and Size Complexity of Integer ProgramsACM Transactions on Programming Languages and Systems10.1145/286657538:4(1-50)Online publication date: 2-Aug-2016
https://dl.acm.org/doi/10.1145/2866575
Hamin JJacobs B(2016)Modular Verification of Termination and Execution Time Bounds Using Separation Logic2016 IEEE 17th International Conference on Information Reuse and Integration (IRI)10.1109/IRI.2016.22(110-117)Online publication date: Jul-2016
https://doi.org/10.1109/IRI.2016.22
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

A formal verification framework for static analysis

Verified squared: does critical software deserve verified tools?

Verified resource guarantees for heap manipulating programs