Testing non-testable programs using association rules

Antonia Bertolino; Emilio Cruciani; Breno Miranda; Roberto Verdecchia

doi:10.1145/3524481.3527238

Testing non-testable programs using association rules

Antonia Bertolino
, Emilio Cruciani
, Breno Miranda
, Roberto Verdecchia

Research output: Chapter in Book / Report / Conference proceeding › Conference contribution › Academic › peer-review

107 Downloads (Pure)

Abstract

We propose a novel scalable approach for testing non-testable programs denoted as ARMED testing. The approach leverages efficient Association Rules Mining algorithms to determine relevant implication relations among features and actions observed while the system is in operation. These relations are used as the specification of positive and negative tests, allowing for identifying plausible or suspicious behaviors: for those cases when oracles are inherently unknownable, such as in social testing, ARMED testing introduces the novel concept of testing for plausibility. To illustrate the approach we walk-through an application example.

Original language	English
Title of host publication	AST '22
Subtitle of host publication	Proceedings of the 3rd ACM/IEEE International Conference on Automation of Software Test
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	87-91
Number of pages	5
ISBN (Electronic)	9781450392860
DOIs	https://doi.org/10.1145/3524481.3527238
Publication status	Published - 2022
Event	3rd ACM/IEEE International Conference on Automation of Software Test, AST 2022 - Pittsburgh, United States Duration: 17 May 2022 → 18 May 2022

Conference

Conference	3rd ACM/IEEE International Conference on Automation of Software Test, AST 2022
Country/Territory	United States
City	Pittsburgh
Period	17/05/22 → 18/05/22

Bibliographical note

Funding Information:
Acknowledgement. This work is supported by a Facebook 2021 Research Award on “Agent-based user interaction simulation to find and fix integrity and privacy issues”.

Publisher Copyright:
© 2022 ACM.

Funding

Acknowledgement. This work is supported by a Facebook 2021 Research Award on “Agent-based user interaction simulation to find and fix integrity and privacy issues”.

Keywords

association rules
non-testable systems
plausibility testing
testing

Access to Document

10.1145/3524481.3527238

Testing non-testable programs using association rulesFinal published version, 259 KBLicence: Article 25fa Dutch Copyright Act

Persistent URL (handle)

Persistent link

Cite this

@inproceedings{a50b20d40d354a16bc10044a64d31675,

title = "Testing non-testable programs using association rules",

abstract = "We propose a novel scalable approach for testing non-testable programs denoted as ARMED testing. The approach leverages efficient Association Rules Mining algorithms to determine relevant implication relations among features and actions observed while the system is in operation. These relations are used as the specification of positive and negative tests, allowing for identifying plausible or suspicious behaviors: for those cases when oracles are inherently unknownable, such as in social testing, ARMED testing introduces the novel concept of testing for plausibility. To illustrate the approach we walk-through an application example. ",

keywords = "association rules, non-testable systems, plausibility testing, testing",

author = "Antonia Bertolino and Emilio Cruciani and Breno Miranda and Roberto Verdecchia",

note = "Funding Information: Acknowledgement. This work is supported by a Facebook 2021 Research Award on “Agent-based user interaction simulation to find and fix integrity and privacy issues”. Publisher Copyright: {\textcopyright} 2022 ACM.; 3rd ACM/IEEE International Conference on Automation of Software Test, AST 2022 ; Conference date: 17-05-2022 Through 18-05-2022",

year = "2022",

doi = "10.1145/3524481.3527238",

language = "English",

pages = "87--91",

booktitle = "AST '22",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

address = "United States",

}

Bertolino, A, Cruciani, E, Miranda, B & Verdecchia, R 2022, Testing non-testable programs using association rules. in AST '22: Proceedings of the 3rd ACM/IEEE International Conference on Automation of Software Test. Institute of Electrical and Electronics Engineers Inc., pp. 87-91, 3rd ACM/IEEE International Conference on Automation of Software Test, AST 2022, Pittsburgh, United States, 17/05/22. https://doi.org/10.1145/3524481.3527238

Testing non-testable programs using association rules. / Bertolino, Antonia; Cruciani, Emilio; Miranda, Breno et al.
AST '22: Proceedings of the 3rd ACM/IEEE International Conference on Automation of Software Test. Institute of Electrical and Electronics Engineers Inc., 2022. p. 87-91.

Research output: Chapter in Book / Report / Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Testing non-testable programs using association rules

AU - Bertolino, Antonia

AU - Cruciani, Emilio

AU - Miranda, Breno

AU - Verdecchia, Roberto

N1 - Funding Information: Acknowledgement. This work is supported by a Facebook 2021 Research Award on “Agent-based user interaction simulation to find and fix integrity and privacy issues”. Publisher Copyright: © 2022 ACM.

PY - 2022

Y1 - 2022

N2 - We propose a novel scalable approach for testing non-testable programs denoted as ARMED testing. The approach leverages efficient Association Rules Mining algorithms to determine relevant implication relations among features and actions observed while the system is in operation. These relations are used as the specification of positive and negative tests, allowing for identifying plausible or suspicious behaviors: for those cases when oracles are inherently unknownable, such as in social testing, ARMED testing introduces the novel concept of testing for plausibility. To illustrate the approach we walk-through an application example.

AB - We propose a novel scalable approach for testing non-testable programs denoted as ARMED testing. The approach leverages efficient Association Rules Mining algorithms to determine relevant implication relations among features and actions observed while the system is in operation. These relations are used as the specification of positive and negative tests, allowing for identifying plausible or suspicious behaviors: for those cases when oracles are inherently unknownable, such as in social testing, ARMED testing introduces the novel concept of testing for plausibility. To illustrate the approach we walk-through an application example.

KW - association rules

KW - non-testable systems

KW - plausibility testing

KW - testing

UR - https://www.scopus.com/pages/publications/85133488978

UR - https://www.scopus.com/pages/publications/85133488978#tab=citedBy

UR - https://conf.researchr.org/home/ast-2022

U2 - 10.1145/3524481.3527238

DO - 10.1145/3524481.3527238

M3 - Conference contribution

AN - SCOPUS:85133488978

SP - 87

EP - 91

BT - AST '22

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 3rd ACM/IEEE International Conference on Automation of Software Test, AST 2022

Y2 - 17 May 2022 through 18 May 2022

ER -

Testing non-testable programs using association rules

Abstract

Conference

Bibliographical note

Funding

Keywords

Access to Document

Persistent URL (handle)

Other files and links

Fingerprint

Cite this