A uniform random test data generator for path testing

Path-oriented Random Testing (PRT) aims at generating a uniformly spread out sequence of random test data that execute a single control flow path within a program. The main challenge of PRT lies in its ability to build efficiently such a test suite in order to minimize the number of rejects (test da...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:The Journal of systems and software Ročník 83; číslo 12; s. 2618 - 2626
Hlavní autoři: Gotlieb, Arnaud, Petit, Matthieu
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Elsevier Inc 01.12.2010
Elsevier Sequoia S.A
Elsevier
Témata:
ISSN:0164-1212, 1873-1228
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract Path-oriented Random Testing (PRT) aims at generating a uniformly spread out sequence of random test data that execute a single control flow path within a program. The main challenge of PRT lies in its ability to build efficiently such a test suite in order to minimize the number of rejects (test data that execute another control flow path). We address this problem with an original divide-and-conquer approach based on constraint reasoning over finite domains, a well-recognized Constraint Programming technique. Our approach first derives path conditions by using backward symbolic execution and computes a tight over-approximation of their associated subdomain by using constraint propagation and constraint refutation. Second, a uniform random test data generator is extracted from this approximated subdomain. We implemented this approach and got experimental results that show the practical benefits of PRT based on constraint reasoning. On average, we got a two-order magnitude CPU time improvement over standard Random Testing on a set of paths extracted from classical benchmark programs.
AbstractList Path-oriented Random Testing (PRT) aims at generating a uniformly spread out sequence of random test data that execute a single control flow path within a program. The main challenge of PRT lies in its ability to build efficiently such a test suite in order to minimize the number of rejects (test data that execute another control flow path). We address this problem with an original divide-and-conquer approach based on constraint reasoning over finite domains, a well-recognized Constraint Programming technique. Our approach first derives path conditions by using backward symbolic execution and computes a tight over-approximation of their associated subdomain by using constraint propagation and constraint refutation. Second, a uniform random test data generator is extracted from this approximated subdomain. We implemented this approach and got experimental results that show the practical benefits of PRT based on constraint reasoning. On average, we got a two-order magnitude CPU time improvement over standard Random Testing on a set of paths extracted from classical benchmark programs. [PUBLICATION ABSTRACT]
Path-oriented Random Testing (PRT) aims at generating a uniformly spread out sequence of random test data that execute a single control flow path within a program. The main challenge of PRT lies in its ability to build efficiently such a test suite in order to minimize the number of rejects (test data that execute another control flow path). We address this problem with an original divide-and-conquer approach based on constraint reasoning over finite domains, a well-recognized Constraint Programming technique. Our approach first derives path conditions by using backward symbolic execution and computes a tight over-approximation of their associated subdomain by using constraint propagation and constraint refutation. Second, a uniform random test data generator is extracted from this approximated subdomain. We implemented this approach and got experimental results that show the practical benefits of PRT based on constraint reasoning. On average, we got a two-order magnitude CPU time improvement over standard Random Testing on a set of paths extracted from classical benchmark programs.
Author Gotlieb, Arnaud
Petit, Matthieu
Author_xml – sequence: 1
  givenname: Arnaud
  surname: Gotlieb
  fullname: Gotlieb, Arnaud
  email: Arnaud.Gotlieb@irisa.fr
– sequence: 2
  givenname: Matthieu
  surname: Petit
  fullname: Petit, Matthieu
  email: Matthieu.Petit@irisa.fr
BackLink https://inria.hal.science/inria-00540283$$DView record in HAL
BookMark eNp9kE1LAzEQhoMoWD9-gLfFiwdpnUk22RRPRfyCghc9h2w2q1m2SU1SwX9vasWDB0-ZMM87zDxHZN8Hbwk5Q5ghoLgaZkNKMwrlD3IGFPfIBGXDpkip3CeTwtSlRnpIjlIaAKChQCeEL6qNd32Iqypq34VVlW3KVaezrl6tt1HnEKvSr9Y6v303nX89IQe9HpM9_XmPycvd7fPNw3T5dP94s1hOTc14ntY9AkdG6bxFKwUXddO0neCmRW5oT2sKrRBoOKOdBdog533L7VwDttS0kh2Ty93cNz2qdXQrHT9V0E49LJbK-ei0AuA1UMk-sNAXO3odw_umbKpWLhk7jtrbsElK1vNagMQtef6HHMIm-nKKagRjgjVsXiDcQSaGlKLtfzdAUFvpalBFutpKVyBVkV4yzZ-McVlnF3yO2o3_Jq93SVt8fjgbVTLOemM7F63Jqgvun_QXtY6a3A
CODEN JSSODM
CitedBy_id crossref_primary_10_3390_app131810351
crossref_primary_10_1007_s00521_024_10794_y
crossref_primary_10_1016_j_eswa_2025_127216
crossref_primary_10_1007_s10009_018_0493_6
crossref_primary_10_1145_3664605
crossref_primary_10_1016_j_jksuci_2015_05_002
crossref_primary_10_1109_TSE_2020_2987377
crossref_primary_10_1016_j_infsof_2022_107091
crossref_primary_10_1016_j_infsof_2024_107564
crossref_primary_10_1109_TR_2019_2892230
crossref_primary_10_1007_s00500_024_09680_5
crossref_primary_10_1145_3447265
Cites_doi 10.1109/TSE.1984.5010257
10.1002/stvr.333
10.1109/TSE.1975.6312836
10.1109/TSE.1976.233816
10.1109/32.62448
10.1016/S0743-1066(98)10006-7
10.2307/2347988
ContentType Journal Article
Copyright 2010 Elsevier Inc.
Copyright Elsevier Sequoia S.A. Dec 2010
Distributed under a Creative Commons Attribution 4.0 International License
Copyright_xml – notice: 2010 Elsevier Inc.
– notice: Copyright Elsevier Sequoia S.A. Dec 2010
– notice: Distributed under a Creative Commons Attribution 4.0 International License
DBID AAYXX
CITATION
7SC
8FD
JQ2
L7M
L~C
L~D
1XC
VOOES
DOI 10.1016/j.jss.2010.08.021
DatabaseName CrossRef
Computer and Information Systems Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
Hyper Article en Ligne (HAL)
Hyper Article en Ligne (HAL) (Open Access)
DatabaseTitle CrossRef
Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
DatabaseTitleList Computer and Information Systems Abstracts


Computer and Information Systems Abstracts
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 1873-1228
EndPage 2626
ExternalDocumentID oai:HAL:inria-00540283v1
2186062301
10_1016_j_jss_2010_08_021
S0164121210002244
Genre Feature
GroupedDBID --K
--M
-~X
.DC
.~1
0R~
1B1
1~.
1~5
29L
4.4
457
4G.
5GY
5VS
7-5
71M
8P~
9JN
9M8
AABNK
AACTN
AAEDT
AAEDW
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AAXUO
AAYFN
AAYOK
ABBOA
ABEFU
ABFNM
ABFRF
ABFSI
ABJNI
ABMAC
ABTAH
ABXDB
ABYKQ
ACDAQ
ACGFO
ACGFS
ACGOD
ACNNM
ACRLP
ACZNC
ADBBV
ADEZE
ADHUB
ADJOM
ADMUD
AEBSH
AEFWE
AEKER
AENEX
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AHZHX
AI.
AIALX
AIEXJ
AIKHN
AITUG
AJBFU
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
AOUOD
ASPBG
AVWKF
AXJTR
AZFZN
BKOJK
BKOMP
BLXMC
CS3
DU5
E.L
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-Q
G8K
GBLVA
GBOLZ
HLZ
HVGLF
HZ~
IHE
J1W
KOM
LG9
M41
MO0
MS~
N9A
O-L
O9-
OAUVE
OZT
P-8
P-9
P2P
PC.
PQQKQ
Q38
R2-
RIG
RNS
ROL
RPZ
RXW
SBC
SDF
SDG
SDP
SES
SEW
SPC
SPCBC
SSV
SSZ
T5K
TAE
TN5
TWZ
UHS
UNMZH
VH1
WUQ
XPP
ZMT
ZY4
~G-
9DU
AATTM
AAXKI
AAYWO
AAYXX
ABDPE
ABWVN
ACLOT
ACRPL
ACVFH
ADCNI
ADNMO
AEIPS
AEUPX
AFJKZ
AFPUW
AGQPQ
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
APXCP
CITATION
EFKBS
~HD
7SC
8FD
AFXIZ
AGCQF
AGRNS
JQ2
L7M
L~C
L~D
SSH
1XC
VOOES
ID FETCH-LOGICAL-c435t-4f10513229b1e8656477bd65cb15c2f2420b661c532de027155fb5e9a01b2cb83
ISICitedReferencesCount 19
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000284674200021&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0164-1212
IngestDate Tue Oct 14 20:21:53 EDT 2025
Sat Sep 27 18:35:55 EDT 2025
Fri Jul 25 04:26:20 EDT 2025
Tue Nov 18 21:50:31 EST 2025
Sat Nov 29 05:52:16 EST 2025
Fri Feb 23 02:33:19 EST 2024
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 12
Keywords Random testing
Path testing
Constraint reasoning
Path Testing
Language English
License https://www.elsevier.com/tdm/userlicense/1.0
Distributed under a Creative Commons Attribution 4.0 International License: http://creativecommons.org/licenses/by/4.0
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c435t-4f10513229b1e8656477bd65cb15c2f2420b661c532de027155fb5e9a01b2cb83
Notes SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
OpenAccessLink https://inria.hal.science/inria-00540283
PQID 763363739
PQPubID 45802
PageCount 9
ParticipantIDs hal_primary_oai_HAL_inria_00540283v1
proquest_miscellaneous_849460811
proquest_journals_763363739
crossref_primary_10_1016_j_jss_2010_08_021
crossref_citationtrail_10_1016_j_jss_2010_08_021
elsevier_sciencedirect_doi_10_1016_j_jss_2010_08_021
PublicationCentury 2000
PublicationDate 2010-12-01
PublicationDateYYYYMMDD 2010-12-01
PublicationDate_xml – month: 12
  year: 2010
  text: 2010-12-01
  day: 01
PublicationDecade 2010
PublicationPlace New York
PublicationPlace_xml – name: New York
PublicationTitle The Journal of systems and software
PublicationYear 2010
Publisher Elsevier Inc
Elsevier Sequoia S.A
Elsevier
Publisher_xml – name: Elsevier Inc
– name: Elsevier Sequoia S.A
– name: Elsevier
References Gogate, Dechter (bib0060) 2008
Pacheco, Lahiri, Ernst, Ball (bib0105) 2007
Sen, Marinov, Agha (bib0110) 2005
Gogate, Dechter (bib0055) 2006
Wichmann, Hill (bib0115) 1982; 31
Williams, Marre, Mouy, Roger (bib0120) 2005
Goodenough, Gerhart (bib0065) 1975; 1
Chan, Chan, Chen, Yiu (bib0020) 2004
Ecuyer (bib0045) 2004
Hentenryck, Saraswat, Deville (bib0085) 1997; 37
Muchnick, Jones (bib0095) 1981
Duran, Ntafos (bib0040) 1984; 10
Anand, Pasareanu, Visser (bib0005) 2007
Dechter, Kask, Bin, Emek (bib0125) 2002
Howden (bib0090) 1976; 2
Myers (bib0100) 1979
Chen, Leung, Mak (bib0025) 2004
Godefroid, Klarlund, Sen (bib0050) 2005
Hamlet, Taylor (bib0080) 1990; 16
Gotlieb, Petit (bib0070) 2006
Botella, Gotlieb, Michel (bib0015) 2006; 16
Collavizza, Rueher (bib0030) 2006
Andrews, Haldar, Lei, Hang (bib0010) 2006
Gotlieb, Petit (bib0130) 2008
Dechter (10.1016/j.jss.2010.08.021_bib0125) 2002
Goodenough (10.1016/j.jss.2010.08.021_bib0065) 1975; 1
Hentenryck (10.1016/j.jss.2010.08.021_bib0085) 1997; 37
Pacheco (10.1016/j.jss.2010.08.021_bib0105) 2007
Sen (10.1016/j.jss.2010.08.021_bib0110) 2005
Duran (10.1016/j.jss.2010.08.021_bib0040) 1984; 10
Godefroid (10.1016/j.jss.2010.08.021_bib0050) 2005
Gogate (10.1016/j.jss.2010.08.021_bib0060) 2008
Andrews (10.1016/j.jss.2010.08.021_bib0010) 2006
Ecuyer (10.1016/j.jss.2010.08.021_bib0045) 2004
Botella (10.1016/j.jss.2010.08.021_bib0015) 2006; 16
Hamlet (10.1016/j.jss.2010.08.021_bib0080) 1990; 16
Gotlieb (10.1016/j.jss.2010.08.021_bib0070) 2006
Howden (10.1016/j.jss.2010.08.021_bib0090) 1976; 2
Chan (10.1016/j.jss.2010.08.021_bib0020) 2004
Collavizza (10.1016/j.jss.2010.08.021_bib0030) 2006
Gotlieb (10.1016/j.jss.2010.08.021_bib0130) 2008
Gogate (10.1016/j.jss.2010.08.021_bib0055) 2006
Chen (10.1016/j.jss.2010.08.021_bib0025) 2004
Anand (10.1016/j.jss.2010.08.021_bib0005) 2007
Myers (10.1016/j.jss.2010.08.021_bib0100) 1979
Williams (10.1016/j.jss.2010.08.021_bib0120) 2005
Muchnick (10.1016/j.jss.2010.08.021_bib0095) 1981
Wichmann (10.1016/j.jss.2010.08.021_bib0115) 1982; 31
References_xml – year: 2006
  ident: bib0010
  article-title: Tool support for randomized unit testing
  publication-title: 1st ACM Int. Workshop on Random Testing (RT’06)
– year: 1979
  ident: bib0100
  article-title: The Art of Software Testing
– volume: 37
  start-page: 139
  year: 1997
  end-page: 164
  ident: bib0085
  article-title: Design, implementation, and evaluation of the constraint language cc(fd)
  publication-title: Journal of Logic Programming
– start-page: 213
  year: 2005
  end-page: 223
  ident: bib0050
  article-title: Dart: directed automated random testing
  publication-title: Proc. of PLDI’05
– year: 2004
  ident: bib0020
  article-title: Adaptive random testing with cg constraint
  publication-title: Proc. of the 28th Int. Computer Software and Applications Conf. (COMPSAC’04)
– volume: 2
  start-page: 208
  year: 1976
  end-page: 214
  ident: bib0090
  article-title: Reliability of the path analysis testing strategy
  publication-title: IEEE Transactions on Software Engineering
– year: 2008
  ident: bib0130
  article-title: Constraint reasonning in path-oriented random testing
  publication-title: 32nd Annual IEEE International Computer Software and Applications Conference (COMPSAC’08)
– volume: 16
  start-page: 1402
  year: 1990
  end-page: 1411
  ident: bib0080
  article-title: Partition testing does not inspire confidence
  publication-title: IEEE Transactions on Software Engineering
– volume: 10
  start-page: 438
  year: 1984
  end-page: 444
  ident: bib0040
  article-title: An evaluation of random testing
  publication-title: IEEE Transactions on Software Engineering
– volume: 1
  start-page: 156
  year: 1975
  end-page: 173
  ident: bib0065
  article-title: Toward a theory of test data selection
  publication-title: IEEE Transactions on Software Engineering
– year: 2004
  ident: bib0045
  article-title: Random Number Generation, Chapter 2 of Handbook of Computational Statistics
– volume: 16
  start-page: 97
  year: 2006
  end-page: 121
  ident: bib0015
  article-title: Symbolic execution of floating-point computations. The Software Testing
  publication-title: Verification and Reliability Journal
– year: 2006
  ident: bib0070
  article-title: Path-oriented random testing
  publication-title: 1st ACM Int. Workshop on Random Testing (RT’06)
– start-page: 15
  year: 2002
  end-page: 21
  ident: bib0125
  article-title: Generating random solutions for constraint satisfaction problems
  publication-title: Eighteenth National Conference on Artificial Intelligence
– start-page: 263
  year: 2005
  end-page: 272
  ident: bib0110
  article-title: Cute: a concolic unit testing engine for c
  publication-title: Proc. of ESEC/FSE-13
– year: 1981
  ident: bib0095
  publication-title: 1981 Program Flow Analysis: Theory and Applications
– volume: 31
  start-page: 188
  year: 1982
  end-page: 190
  ident: bib0115
  article-title: Algorithm as 183: an efficient and portable pseudo-random number generator
  publication-title: Applied Statistics
– year: 2005
  ident: bib0120
  article-title: Pathcrawler: automatic generation of path tests by combining static and dynamic analysis
  publication-title: Proc. Dependable Computing-EDCC’05
– start-page: 271
  year: 2008
  end-page: 276
  ident: bib0060
  article-title: Studies in solution sampling
  publication-title: Proc. of the Twenty-Third AAAI Conference on Artificial Intelligence (AAAI’08)
– year: 2007
  ident: bib0105
  article-title: Feedback-directed random test generation
  publication-title: Proc. of the Int. Conf. on Software Engineering (ICSE’07)
– year: 2007
  ident: bib0005
  article-title: JPF-S.E: a symbolic execution extension to java pathfinder
  publication-title: Conf. on Tools and Algo. for the Construction and Analysis of Systems (TACAS’07)
– start-page: 320
  year: 2004
  end-page: 329
  ident: bib0025
  article-title: Adaptive random testing
  publication-title: ASIAN’04
– start-page: 182
  year: 2006
  end-page: 196
  ident: bib0030
  article-title: Exploration of the capabilities of constraint programming for software verification
  publication-title: Tools and Algorithms for the Construction and Analysis of Systems (TACAS’06)
– start-page: 711
  year: 2006
  end-page: 715
  ident: bib0055
  article-title: A new algorithm for sampling csp solutions uniformly at random
  publication-title: Principles and Practice of Constraint Programming (CP’06), volume 4204 of LNCS
– year: 2008
  ident: 10.1016/j.jss.2010.08.021_bib0130
  article-title: Constraint reasonning in path-oriented random testing
– volume: 10
  start-page: 438
  issue: July (4)
  year: 1984
  ident: 10.1016/j.jss.2010.08.021_bib0040
  article-title: An evaluation of random testing
  publication-title: IEEE Transactions on Software Engineering
  doi: 10.1109/TSE.1984.5010257
– year: 2006
  ident: 10.1016/j.jss.2010.08.021_bib0070
  article-title: Path-oriented random testing
– year: 2007
  ident: 10.1016/j.jss.2010.08.021_bib0005
  article-title: JPF-S.E: a symbolic execution extension to java pathfinder
– volume: 16
  start-page: 97
  issue: June (2)
  year: 2006
  ident: 10.1016/j.jss.2010.08.021_bib0015
  article-title: Symbolic execution of floating-point computations. The Software Testing
  publication-title: Verification and Reliability Journal
  doi: 10.1002/stvr.333
– year: 2004
  ident: 10.1016/j.jss.2010.08.021_bib0045
– volume: 1
  start-page: 156
  issue: June (2)
  year: 1975
  ident: 10.1016/j.jss.2010.08.021_bib0065
  article-title: Toward a theory of test data selection
  publication-title: IEEE Transactions on Software Engineering
  doi: 10.1109/TSE.1975.6312836
– year: 1981
  ident: 10.1016/j.jss.2010.08.021_bib0095
– volume: 2
  start-page: 208
  issue: September (3)
  year: 1976
  ident: 10.1016/j.jss.2010.08.021_bib0090
  article-title: Reliability of the path analysis testing strategy
  publication-title: IEEE Transactions on Software Engineering
  doi: 10.1109/TSE.1976.233816
– year: 2007
  ident: 10.1016/j.jss.2010.08.021_bib0105
  article-title: Feedback-directed random test generation
– volume: 16
  start-page: 1402
  issue: December (12)
  year: 1990
  ident: 10.1016/j.jss.2010.08.021_bib0080
  article-title: Partition testing does not inspire confidence
  publication-title: IEEE Transactions on Software Engineering
  doi: 10.1109/32.62448
– year: 1979
  ident: 10.1016/j.jss.2010.08.021_bib0100
– start-page: 182
  year: 2006
  ident: 10.1016/j.jss.2010.08.021_bib0030
  article-title: Exploration of the capabilities of constraint programming for software verification
– start-page: 271
  year: 2008
  ident: 10.1016/j.jss.2010.08.021_bib0060
  article-title: Studies in solution sampling
– start-page: 15
  year: 2002
  ident: 10.1016/j.jss.2010.08.021_bib0125
  article-title: Generating random solutions for constraint satisfaction problems
– year: 2006
  ident: 10.1016/j.jss.2010.08.021_bib0010
  article-title: Tool support for randomized unit testing
– volume: 37
  start-page: 139
  year: 1997
  ident: 10.1016/j.jss.2010.08.021_bib0085
  article-title: Design, implementation, and evaluation of the constraint language cc(fd)
  publication-title: Journal of Logic Programming
  doi: 10.1016/S0743-1066(98)10006-7
– start-page: 320
  year: 2004
  ident: 10.1016/j.jss.2010.08.021_bib0025
  article-title: Adaptive random testing
– start-page: 263
  year: 2005
  ident: 10.1016/j.jss.2010.08.021_bib0110
  article-title: Cute: a concolic unit testing engine for c
– start-page: 711
  year: 2006
  ident: 10.1016/j.jss.2010.08.021_bib0055
  article-title: A new algorithm for sampling csp solutions uniformly at random
– volume: 31
  start-page: 188
  year: 1982
  ident: 10.1016/j.jss.2010.08.021_bib0115
  article-title: Algorithm as 183: an efficient and portable pseudo-random number generator
  publication-title: Applied Statistics
  doi: 10.2307/2347988
– year: 2005
  ident: 10.1016/j.jss.2010.08.021_bib0120
  article-title: Pathcrawler: automatic generation of path tests by combining static and dynamic analysis
– year: 2004
  ident: 10.1016/j.jss.2010.08.021_bib0020
  article-title: Adaptive random testing with cg constraint
– start-page: 213
  year: 2005
  ident: 10.1016/j.jss.2010.08.021_bib0050
  article-title: Dart: directed automated random testing
SSID ssj0007202
Score 2.0831442
Snippet Path-oriented Random Testing (PRT) aims at generating a uniformly spread out sequence of random test data that execute a single control flow path within a...
SourceID hal
proquest
crossref
elsevier
SourceType Open Access Repository
Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 2618
SubjectTerms Approximation
Benchmarks
Computer Science
Constraint reasoning
Construction
Divide & conquer algorithms
Flow paths
Generators
Mathematical analysis
Path testing
Product testing
Programming
Programming languages
Random testing
Reasoning
Software Engineering
Studies
Test methods
Title A uniform random test data generator for path testing
URI https://dx.doi.org/10.1016/j.jss.2010.08.021
https://www.proquest.com/docview/763363739
https://www.proquest.com/docview/849460811
https://inria.hal.science/inria-00540283
Volume 83
WOSCitedRecordID wos000284674200021&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals 2021
  customDbUrl:
  eissn: 1873-1228
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0007202
  issn: 0164-1212
  databaseCode: AIEXJ
  dateStart: 19950101
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Jb9QwFLaGKQcuUDYxlCIfemKUKoud2McIlbYIVRyKNDcrdhx1RiVTNcnQn8_zksyCWrUHLtFM7FhJvpf3PttvQehIFZTCHI0GMmQ6IBGJAkYiBnOe0sqUYqyyxSayiws2m_Gfo9F5Hwuzus7qmt3d8Zv_CjWcA7BN6OwT4B4GhRPwG0CHI8AOx0cBn0-72oRb_Z6CGSpN8Ago_qnxBDXlkrXdVrfOhaYYsW3srddiLTkbPNXlenapnBtQ2n-Ktb_s6bIFDmu3dHLo35VrTQtjuVigtr2a625zdWHLU8MvOKYmr2G0pTFd6ZleMuJN_Zd6bar9XxcO_4-edksGi-NF03j3OnYculDp7ZzYO7Zq8CDsndMWAoYQZghhymmalAJ7cUY5G6O9_Pxk9n0wy1lsHVCHB-q3uK2z38593EdSnl0Zb9kdo22ZyOU-eumhwbmD_jUa6foNetWX58BeW79FNMdeErCTBGzAxkYS8CAJGNqxkQTsJeEd-vXt5PLrWeCrZAQKqG4bkAoosllT4DLSDOg5yTJZplTJiKq4AgoWSiBhiiZxqcM4AwJZSap5EUYyVpIl79G4Xtb6A8JFWCVRkjJVVgUYUKCuVKYwIZWMF5xUZILC_rUI5VPIm0om1-JeOCboy3DJjcuf8lBn0r9r4QmgI3YC5Oahy44Al2F4kzD9LP8h5jV808LOSYBDr6DbQQ-c8N9rI8C8JmmSJXyC8NAKGtZsmxW1XnaNYISTFJhz9PEpz3KAXqy_p09o3N52-hA9V6t23tx-9sL5F-XXmcU
linkProvider Elsevier
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+uniform+random+test+data+generator+for+path+testing&rft.jtitle=The+Journal+of+systems+and+software&rft.au=Gotlieb%2C+Arnaud&rft.au=Petit%2C+Matthieu&rft.date=2010-12-01&rft.issn=0164-1212&rft.volume=83&rft.issue=12&rft.spage=2618&rft.epage=2626&rft_id=info:doi/10.1016%2Fj.jss.2010.08.021&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_jss_2010_08_021
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0164-1212&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0164-1212&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0164-1212&client=summon