Enabledness-based Testing of Object Protocols

Godoy, Javier; Galeotti, Juan Pablo; Garbervetsky, Diego; Uchitel, Sebastián

doi:10.1145/3415153

Cited by 2 publications

(2 citation statements)

References 93 publications

(151 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…EPAs can be built automatically from code [17,19] or from specifications [16,18] and have been used to support behaviour validation [16,17,19] and verification [26].…”

Section: Enabledness Preserving Abstractionsmentioning

confidence: 99%

“…EPAs were successfully applied to the validation of APIs specified in the form of pre-post conditions [18] and programs [19]. EPAs has been also used for testing program with rich protocols [26]. Our abstractions differ from EPAs in several aspects: EPAs rely on function preconditions, while herein any set of predicates can be used to partition the state space (e.g., quotienting with enum state variables produced revealing abstractions).…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Predicate abstractions for smart contract validation

Godoy¹,

Galeotti²,

Garbervetsky³

et al. 2022

Proceedings of the 25th International Conference on Model Driven Engineering Languages and Systems

Self Cite

View full text Add to dashboard Cite

Smart contracts are immutable programs deployed on the blockchain that can manage significant assets. Because of this, verification and validation of smart contracts is of vital importance. Indeed, it is industrial practice to hire independent specialized companies to audit smart contracts before deployment. Auditors typically rely on a combination of tools and experience but still fail to identify problems in smart contracts before deployment, causing significant losses. In this paper, we propose using predicate abstraction to construct models which can be used by auditors to explore and validate smart contact behaviour at the function call level by proposing predicates that expose different aspects of the contract. We propose predicates based on requires clauses and enum-type state variables as a starting point for contract validation and report on an evaluation on two different benchmarks. CCS CONCEPTS• Software and its engineering → Software verification and validation; Software testing and debugging.

show abstract

“…EPAs can be built automatically from code [17,19] or from specifications [16,18] and have been used to support behaviour validation [16,17,19] and verification [26].…”

Section: Enabledness Preserving Abstractionsmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Predicate abstractions for smart contract validation

Godoy¹,

Galeotti²,

Garbervetsky³

et al. 2022

Proceedings of the 25th International Conference on Model Driven Engineering Languages and Systems

Self Cite

View full text Add to dashboard Cite

show abstract

Abstraction-Aware Inference of Metamorphic Relations

Nolasco,

Molina,

Degiovanni

et al. 2024

Proc. ACM Softw. Eng.

View full text Add to dashboard Cite

Metamorphic testing is a valuable technique that helps in dealing with the oracle problem. It involves testing software against specifications of its intended behavior given in terms of so called metamorphic relations , statements that express properties relating different software elements (e.g., different inputs, methods, etc). The effective application of metamorphic testing strongly depends on identifying suitable domain-specific metamorphic relations, a challenging task, that is typically manually performed. This paper introduces MemoRIA, a novel approach that aims at automatically identifying metamorphic relations. The technique focuses on a particular kind of metamorphic relation, which asserts equivalences between methods and method sequences. MemoRIA works by first generating an object-protocol abstraction of the software being tested, then using fuzzing to produce candidate relations from the abstraction, and finally validating the candidate relations through run-time analysis. A SAT-based analysis is used to eliminate redundant relations, resulting in a concise set of metamorphic relations for the software under test. We evaluate our technique on a benchmark consisting of 22 Java subjects taken from the literature, and compare MemoRIA with the metamorphic relation inference technique SBES. Our results show that by incorporating the object protocol abstraction information, MemoRIA is able to more effectively infer meaningful metamorphic relations, that are also more precise, compared to SBES, measured in terms of mutation analysis. Also, the SAT-based reduction allows us to significantly reduce the number of reported metamorphic relations, while in general having a small impact in the bug finding ability of the corresponding obtained relations.

show abstract

Enabledness-based Testing of Object Protocols

Cited by 2 publications

References 93 publications

Predicate abstractions for smart contract validation

Predicate abstractions for smart contract validation

Abstraction-Aware Inference of Metamorphic Relations

Contact Info

Product

Resources

About