2008 International Conference on Software Testing, Verification, and Validation 2008
DOI: 10.1109/icst.2008.48
|View full text |Cite
|
Sign up to set email alerts
|

Less is More: A Minimalistic Approach to UML Model-Based Conformance Test Generation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
13
0

Year Published

2010
2010
2019
2019

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 17 publications
(13 citation statements)
references
References 10 publications
0
13
0
Order By: Relevance
“…Similar to UMTG, Kaplan et al [89] propose another approach, i.e., Archetest, which generates test sequences and test inputs from a domain model and use case specifications together with invariants, guardconditions and postconditions. Yue et al [20] propose a test case generation tool (aToucan4Test), which takes RUCM use case specifications annotated with OCL constraints as input and generates automatically executable test cases.…”
Section: Related Workmentioning
confidence: 99%
“…Similar to UMTG, Kaplan et al [89] propose another approach, i.e., Archetest, which generates test sequences and test inputs from a domain model and use case specifications together with invariants, guardconditions and postconditions. Yue et al [20] propose a test case generation tool (aToucan4Test), which takes RUCM use case specifications annotated with OCL constraints as input and generates automatically executable test cases.…”
Section: Related Workmentioning
confidence: 99%
“…Some research tools already create test cases from models, such as UML models [12]. Since we generate models from text, we should be able to use such test generation tools directly.…”
Section: Test Cases From Modelsmentioning
confidence: 99%
“…The original approaches to symbolic execution were proposed in the 70s and 80s and address sequential programs with simple inputs of a limited set of primitive types [BEL75,Cla76,Kin76,RHC76]. This is mostly because of limitations of automated theorem provers in dealing with complex path conditions and some program types (for instance, floating point arithmetics).…”
Section: Symbolic Executionmentioning
confidence: 99%
“…Test generation techniques that rely on symbolic execution execute the program with symbolic input values, and compute expressions on the input values that indicate the conditions to execute a given path [Kin76]. Symbolic executors rely on automated theorem provers to generate test cases that cover the corresponding program paths.…”
Section: Symbolic Executionmentioning
confidence: 99%