A Set-based Logical Language for Specification of Combinatorial Models

Anna Zamansky; Maria Spichkova

doi:10.1145/3290688.3290700

A Set-based Logical Language for Specification of Combinatorial Models

Anna Zamansky, Maria Spichkova

Department of Information Systems

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

Abstract

We propose a logical language for specifying combinatorial models, which employs the notion of sets and their complements to overcome some weaknesses of the use of standard Boolean semantics. The proposed language may lead to better modelling techniques in combinatorial test design, with the potential to lower the cognitive load of the modeller and thereby reduce the risk of modelling errors.

Original language	English
Title of host publication	Proceedings of the Australasian Computer Science Week Multiconference, ACSW 2019
Publisher	Association for Computing Machinery
ISBN (Electronic)	9781450366038
DOIs	https://doi.org/10.1145/3290688.3290700
State	Published - 29 Jan 2019
Event	2019 Australasian Computer Science Week Multiconference, ACSW 2019 - Sydney, Australia Duration: 29 Jan 2019 → 31 Jan 2019

Publication series

Name	ACM International Conference Proceeding Series

Conference

Conference	2019 Australasian Computer Science Week Multiconference, ACSW 2019
Country/Territory	Australia
City	Sydney
Period	29/01/19 → 31/01/19

Bibliographical note

Publisher Copyright:
© 2019 Association for Computing Machinery.

Keywords

combinatorial models
combinatorial test design
modelling
testing

ASJC Scopus subject areas

Software
Human-Computer Interaction
Computer Vision and Pattern Recognition
Computer Networks and Communications

Access to Document

10.1145/3290688.3290700

Cite this

@inproceedings{689fec77f13b4d84a79dd6529f60fa9a,

title = "A Set-based Logical Language for Specification of Combinatorial Models",

abstract = "We propose a logical language for specifying combinatorial models, which employs the notion of sets and their complements to overcome some weaknesses of the use of standard Boolean semantics. The proposed language may lead to better modelling techniques in combinatorial test design, with the potential to lower the cognitive load of the modeller and thereby reduce the risk of modelling errors.",

keywords = "combinatorial models, combinatorial test design, modelling, testing",

author = "Anna Zamansky and Maria Spichkova",

note = "Publisher Copyright: {\textcopyright} 2019 Association for Computing Machinery.; 2019 Australasian Computer Science Week Multiconference, ACSW 2019 ; Conference date: 29-01-2019 Through 31-01-2019",

year = "2019",

month = jan,

day = "29",

doi = "10.1145/3290688.3290700",

language = "English",

series = "ACM International Conference Proceeding Series",

publisher = "Association for Computing Machinery",

booktitle = "Proceedings of the Australasian Computer Science Week Multiconference, ACSW 2019",

address = "United States",

}

Zamansky, A & Spichkova, M 2019, A Set-based Logical Language for Specification of Combinatorial Models. in Proceedings of the Australasian Computer Science Week Multiconference, ACSW 2019., a57, ACM International Conference Proceeding Series, Association for Computing Machinery, 2019 Australasian Computer Science Week Multiconference, ACSW 2019, Sydney, Australia, 29/01/19. https://doi.org/10.1145/3290688.3290700

A Set-based Logical Language for Specification of Combinatorial Models. / Zamansky, Anna; Spichkova, Maria.
Proceedings of the Australasian Computer Science Week Multiconference, ACSW 2019. Association for Computing Machinery, 2019. a57 (ACM International Conference Proceeding Series).

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

TY - GEN

T1 - A Set-based Logical Language for Specification of Combinatorial Models

AU - Zamansky, Anna

AU - Spichkova, Maria

PY - 2019/1/29

Y1 - 2019/1/29

N2 - We propose a logical language for specifying combinatorial models, which employs the notion of sets and their complements to overcome some weaknesses of the use of standard Boolean semantics. The proposed language may lead to better modelling techniques in combinatorial test design, with the potential to lower the cognitive load of the modeller and thereby reduce the risk of modelling errors.

AB - We propose a logical language for specifying combinatorial models, which employs the notion of sets and their complements to overcome some weaknesses of the use of standard Boolean semantics. The proposed language may lead to better modelling techniques in combinatorial test design, with the potential to lower the cognitive load of the modeller and thereby reduce the risk of modelling errors.

KW - combinatorial models

KW - combinatorial test design

KW - modelling

KW - testing

UR - http://www.scopus.com/inward/record.url?scp=85061288882&partnerID=8YFLogxK

U2 - 10.1145/3290688.3290700

DO - 10.1145/3290688.3290700

M3 - Conference contribution

AN - SCOPUS:85061288882

T3 - ACM International Conference Proceeding Series

BT - Proceedings of the Australasian Computer Science Week Multiconference, ACSW 2019

PB - Association for Computing Machinery

T2 - 2019 Australasian Computer Science Week Multiconference, ACSW 2019

Y2 - 29 January 2019 through 31 January 2019

ER -

A Set-based Logical Language for Specification of Combinatorial Models

Abstract

Publication series

Conference

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this