Reasoning about Function Objects

Nordio, Martín; Calcagno, Cristiano; Meyer, Bertrand; Müller, Péter; Tschannen, Julian

doi:10.1007/978-3-642-13953-6_5

Cited by 18 publications

(16 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The Boogie translation implemented in AutoProof can handle polymorphism appropriately even for non-pure routines; it is based on a methodology for agents [19] and on a methodology for pure routines [3,12]. The rest of the section discusses how to translate postconditions and preconditions of redefined routines in a way that accommodates polymorphism, while still supporting modular reasoning.…”

Section: Polymorphism In Boogiementioning

confidence: 99%

See 1 more Smart Citation

Automatic Verification of Advanced Object-Oriented Features: The AutoProof Approach

Tschannen

Furia

Nordio

et al. 2012

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. Static program verifiers such as Spec#, Dafny, jStar, and VeriFast define the state of the art in automated functional verification techniques. The next open challenges are to make verification tools usable even by programmers not fluent in formal techniques. This paper discusses some techniques used in AutoProof, a verification tool that translates Eiffel programs to Boogie and uses the Boogie verifier to prove them. In an effort to be usable with real programs, AutoProof fully supports several advanced object-oriented features including polymorphism, inheritance, and function objects. AutoProof also adopts simple strategies to reduce the amount of annotations needed when verifying programs (e.g., frame conditions). The paper illustrates the main features of AutoProof's translation, including some whose implementation is underway, and demonstrates them with examples and a case study.

show abstract

Section: Polymorphism In Boogiementioning

confidence: 99%

“…Then, Section 5.2 discusses how to specify agents; Sections 5.3 and 5.4 describe the translation of agents implemented in AutoProof; and Section 5.5 presents how the translation handles framing. This section is based on our previous work [19].…”

Section: Agents (Function Objects)mentioning

confidence: 99%

Automatic Verification of Advanced Object-Oriented Features: The AutoProof Approach

Tschannen

Furia

Nordio

et al. 2012

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…Spec# is another specification language which requires methods called from specifications be pure [10]. Finally, Nordio et al employ pure methods to model pre-and post-conditions for function objects [24].…”

Section: Related Workmentioning

confidence: 99%

JPure: A Modular Purity System for Java

Pearce

2011

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Purity Analysis is the problem of determining whether or not a method may have side-effects. This has applications in automatic parallelisation, extended static checking, and more. We present a novel purity system for Java that employs purity annotations which can be checked modularly. This is done using a flow-sensitive, intraprocedural analysis. The system exploits two properties, called freshness and locality, to increase the range of methods that can be considered pure. JPure also includes an inference engine for annotating legacy code. We evaluate our system against several packages from the Java Standard Library. Our results indicate it is possible to uncover significant amounts of purity efficiently.

show abstract

“…The currently available implementation, illustrated through an example session in Section 2, focuses on the integration of two well-known techniques: static verification based on Hoare-style proofs, currently implemented in Eve through the AutoProof tool [27,20], and dynamic analysis based on random testing, implemented through AutoTest [19]. Section 4 describes these tools.…”

Section: Verification As a Matter Of Coursementioning

confidence: 99%

“…AutoProof [20]-a more recent member of the Eiffel tool-set-is an automatic verification tool that translates Eiffel programs (with contracts) into annotated Boogie programs. AutoProof then uses the Boogie verifier [2] to check whether the Eiffel implementation satisfies its specification.…”

Section: The Tools Of Evementioning

confidence: 99%

Usable Verification of Object-Oriented Programs by Combining Static and Dynamic Techniques

Tschannen

Furia

Nordio

et al. 2011

Software Engineering and Formal Methods

Self Cite

View full text Add to dashboard Cite

Abstract. With formal techniques becoming more and more powerful, the next big challenge is making software verification practical and usable. The Eve verification environment contributes to this goal by seamlessly integrating a static prover and an automatic testing tool into a development environment. The paper discusses the general principles behind the integration of heterogeneous verification tools; the peculiar challenges involved in combining static proofs and dynamic testing techniques; and how the combination, implemented in Eve through a blackboard architecture, can improve the user experience with little overhead over usual development practices. Eve is freely available for download.

show abstract

Reasoning about Function Objects

Cited by 18 publications

References 22 publications

Automatic Verification of Advanced Object-Oriented Features: The AutoProof Approach

Automatic Verification of Advanced Object-Oriented Features: The AutoProof Approach

JPure: A Modular Purity System for Java

Usable Verification of Object-Oriented Programs by Combining Static and Dynamic Techniques

Contact Info

Product

Resources

About