AutoProof: auto-active functional verification of object-oriented programs

Furia, Carlo A.; Nordio, Martín; Polikarpova, Nadia; Tschannen, Julian

doi:10.1007/s10009-016-0419-0

Cited by 19 publications

(8 citation statements)

References 40 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…A benchmark is the common or standard infrastructure employed to analyze, evaluate, and compare the reality of solutions, tools, or systems by their executions (for a few de nitions, see [63], [64], [65], [66], [67], [68], [69], [70] and [71]. For some instances in other elds, see [72], [73], [74], [30], [75], and [76]). Sometimes, a measure can simply be used as a benchmark [77].…”

Section: Benchmarkingmentioning

confidence: 99%

DD-KARB: Data-Driven Compliance to Quality by Rule Based Benchmarking

Besharati

Izadi

2022

Preprint

View full text Add to dashboard Cite

Rather than proof and logical evaluation, benchmarking can be used for compliance assessment. Naturally, a set of benchmarks can shape an applied solution to compliance assessment. This paper proposes the KARB solution system, i.e. preventing compliance anomalies through rule-based benchmarking. In fact, rule-based benchmarking means evaluating an under-compliance system with its symbolic specification and using a set of symbolic rules (on the behalf of the semantic logic of evaluation). A case study was conducted to demonstrate and analyze the KARB solution. The IR-QUMA study (Iranian Survey on Quality in Messenger Apps) was then conducted to evaluate the quality of some messenger applications. According to the evaluation results, the hybrid DD-KARB method (with a combination of semantics-awareness and data-drivenness) is more effective than solo methods and can compute a somehow good estimation for the messenger application user quality scores. Therefore, DD-KARB can be considered a method for quality benchmarking in this technical context.

show abstract

Section: Benchmarkingmentioning

confidence: 99%

DD-KARB: Data-Driven Compliance to Quality by Rule Based Benchmarking

Besharati

Izadi

2022

Preprint

View full text Add to dashboard Cite

show abstract

“…As the ongoing integration into proof tool (AutoProof [19]) is not complete, verification has consisted of manual application of the rules, or dynamic testing using EiffelStudio's options for monitoring assertions at run time, or both. These approaches are meaningful since:…”

Section: Challenge Problems and Solutionsmentioning

confidence: 99%

The concept of class invariant in object-oriented programming

Meyer¹,

Arkadova²,

Kogtenkov³

2021

Preprint

View full text Add to dashboard Cite

Class invariants -consistency constraints preserved by every operation on objects of a given type -are fundamental to building and understanding object-oriented programs. They should also be a key help in verifying them, but turn out instead to raise major verification challenges which have prompted a significant literature with, until now, no widely accepted solution. The present work introduces a general proof rule meant to address invariant-related issues and allow verification tools benefit from invariants.It first clarifies the notion of invariant and identify the three problems: callbacks, furtive access and reference leak. As an example, the 2016 Ethereum DAO bug, in which $50 million were stolen, resulted from a callback invalidating an invariant.The discussion starts with a "Simple Model" and an associated proof rule, demonstrating its soundness. It then removes one by one the three assumptions of the Simple Model, each removal bringing up one of the three issues, and introduces the corresponding adaptation to the proof rule. The final version of the rule can tackle tricky examples, including "challenge problems" listed in the literature.

show abstract

“…There are a number of verifiers that have been used in substantial verification efforts. Dafny was employed in IronClad and IronFleet [25,26], Autoproof has been used in the development of a verified Eiffel library [23,43], and F* has been used in Microsoft's project Everest [8]. For object-oriented programming in general, there exist a number of alternatives.…”

Section: Related Workmentioning

confidence: 99%

Experience Report on Formally Verifying Parts of OpenJDK's API with KeY

Knüppel¹,

Thüm²,

Pardylla³

et al. 2018

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

Deductive verification of software has not yet found its way into industry, as complexity and scalability issues require highly specialized experts. The long-term perspective is, however, to develop verification tools aiding industrial software developers to find bugs or bottlenecks in software systems faster and more easily. The KeY project constitutes a framework for specifying and verifying software systems, aiming at making formal verification tools applicable for mainstream software development. To help the developers of KeY, its users, and the deductive verification community, we summarize our experiences with KeY 2.6.1 in specifying and verifying real-world Java code from a users perspective. To this end, we concentrate on parts of the Collections-API of OpenJDK 6, where an informal specification exists. While we describe how we bridged informal and formal specification, we also exhibit accompanied challenges that we encountered. Our experiences are that (a) in principle, deductive verification for API-like code bases is feasible, but requires high expertise, (b) developing formal specifications for existing code bases is still notoriously hard, and (c) the under-specification of certain language constructs in Java is challenging for tool builders. Our initial effort in specifying parts of OpenJDK 6 constitutes a stepping stone towards a case study for future research.

show abstract

AutoProof: auto-active functional verification of object-oriented programs

Cited by 19 publications

References 40 publications

DD-KARB: Data-Driven Compliance to Quality by Rule Based Benchmarking

DD-KARB: Data-Driven Compliance to Quality by Rule Based Benchmarking

The concept of class invariant in object-oriented programming

Experience Report on Formally Verifying Parts of OpenJDK's API with KeY

Contact Info

Product

Resources

About