{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T16:37:23Z","timestamp":1694623043848},"reference-count":31,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2004,11,1]],"date-time":"2004-11-01T00:00:00Z","timestamp":1099267200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Form. Asp. Comput."],"published-print":{"date-parts":[[2004,11]]},"abstract":"<jats:title>Abstract.<\/jats:title>\n          <jats:p>\n            One of the strengths of using\n            <jats:italic>stream X-machines<\/jats:italic>\n            to specify a system is that, under certain well defined conditions, it is possible to produce a test set that is guaranteed to determine the correctness of an implementation. However, the existing method assumes that the implementation of each processing function is proved to be correct before the actual testing can take place, so it only test the system\n            <jats:italic>integration<\/jats:italic>\n            . This paper presents a new method for generating test sets from a deterministic stream X-machine specification that generalises the existing integration testing method. This method no longer requires the implementations of the processing functions to be proved correct prior to the actual testing. Instead, the testing of the processing functions is performed along with the integration testing.\n          <\/jats:p>","DOI":"10.1007\/s00165-004-0045-6","type":"journal-article","created":{"date-parts":[[2004,6,1]],"date-time":"2004-06-01T16:02:25Z","timestamp":1086105745000},"page":"374-386","source":"Crossref","is-referenced-by-count":16,"title":["Complete deterministic stream X-machine testing"],"prefix":"10.1145","volume":"16","author":[{"given":"Florentin","family":"Ipate","sequence":"first","affiliation":[{"name":"Department of Computer Science and Mathematics, University of Pitesti, Str Targu din Vale 1, 0300, Pitesti, Romania"}]}],"member":"320","reference":[{"issue":"1","key":"p_1","first-page":"17","article-title":"P systems with replicated rewriting and stream X-machines (Eilenberg machines)","volume":"49","author":"Aguado J","year":"2002","journal-title":"Fundamenta Informaticae"},{"key":"p_2","first-page":"494","article-title":"Communicating stream X-machines are no more than X-machines","volume":"5","author":"Blnescu T","year":"1999","journal-title":"J Universal Comput Sci"},{"key":"p_3","first-page":"13","volume-title":"Martin-Vide C, Mitrana V (eds) Words, sequences, grammars, languages: where biology, computer science, linguistics and mathematics meet, vol 1","author":"Blnescu T","year":"2000"},{"key":"p_4","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1007\/s001650070006","article-title":"Generalized stream X machines with output delimited type","volume":"12","author":"Bal T","year":"2000","journal-title":"Formal Aspects Comput"},{"issue":"1","key":"p_5","first-page":"17","article-title":"Formal black box testing for partially specified deterministic finite state machines","volume":"28","author":"Blnescu T","year":"2003","journal-title":"Foundations Comput Decis Syst"},{"key":"p_6","first-page":"296","volume-title":"proceedings of the 6th European conference ECAL","author":"Blnescu T","year":"2001"},{"key":"p_7","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1016\/0950-5849(95)01066-1","article-title":"Communicating X-machines","volume":"38","author":"Barnard J","year":"1996","journal-title":"Inf Software Technol"},{"key":"p_8","first-page":"86","volume-title":"Proceedings of the 30th design automation conference dallas","author":"Ch K-T","year":"1993"},{"issue":"3","key":"p_9","first-page":"178","article-title":"Testing software design modelled by finite state machines","volume":"4","author":"Cho TS","year":"1978","journal-title":"IEEE Trans Software Eng"},{"issue":"6","key":"p_10","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1007\/s001650070007","article-title":"A structured way to use channels for communication in X-machine systems","volume":"12","author":"Cowling A","year":"2000","journal-title":"Formal Aspects Comput"},{"key":"p_11","volume-title":"Automata, languages and machines, vol A","author":"Eil S","year":"1994"},{"key":"p_12","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/978-1-4615-2303-1_7","article-title":"Using an X-machine to model a video cassette recorder","volume":"3","author":"Fairtlough M","year":"1995","journal-title":"Curr Issues Electron Model"},{"issue":"5","key":"p_13","first-page":"490","article-title":"A new approach to communicating X-machines","volume":"6","author":"Ge H","year":"2000","journal-title":"J Universal Comput Sci"},{"issue":"6","key":"p_14","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/s001650070005","article-title":"Generalized stream X-machines and cooperating distributed grammar systems","volume":"12","author":"Ghe M","year":"2000","journal-title":"Formal Aspects Comput"},{"issue":"6","key":"p_15","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/s001650070003","article-title":"Testing conformance to a quasi-non-deterministic stream X-machine","volume":"12","author":"Hi RM","year":"2000","journal-title":"Formal Aspects Comput"},{"key":"p_16","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1049\/sej.1988.0009","article-title":"X-machines as a basis for dynamic system specification","volume":"3","author":"Hol M","year":"1988","journal-title":"Software Eng J"},{"key":"p_17","first-page":"199","volume-title":"Proceedings of the 2nd IFAC workshop on safety and reliability in emerging control technologies Daytona Beach","author":"Holcombe M","year":"1995"},{"key":"p_18","volume-title":"Correct systems: building a business process solution","author":"Ho M","year":"1998"},{"key":"p_19","first-page":"359","article-title":"Another look at computability","volume":"20","author":"Ip F","year":"1996","journal-title":"Informatica"},{"key":"p_20","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1080\/00207169708804559","article-title":"An integration testing method that is proved to find all faults","volume":"63","author":"Ip F","year":"1997","journal-title":"Int J Comput Math"},{"key":"p_21","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1080\/00207169808804689","article-title":"A method for refining and testing generalized machine specifications","volume":"68","author":"Ip F","year":"1998","journal-title":"Int J Comput Math"},{"key":"p_22","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/(SICI)1099-1689(199806)8:2<61::AID-STVR154>3.0.CO;2-W","article-title":"Specification and testing using generalized machines: a presentation and a case study","volume":"8","author":"Ip F","year":"1998","journal-title":"Software Test Verification Reliability"},{"issue":"6","key":"p_23","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1007\/s001650070004","article-title":"Generating test sequences from non-deterministic generalized stream X-machines","volume":"12","author":"Ip F","year":"2000","journal-title":"Formal Aspects Comput"},{"issue":"2","key":"p_24","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/s002000100090","article-title":"An integrated refinement and testing method for stream X-machines","volume":"13","author":"Ip F","year":"2002","journal-title":"Applicable Algebra Eng Commun Comput"},{"issue":"6","key":"p_25","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1007\/s001650200021","article-title":"Testing conditions for communicating stream X-machine systems","volume":"13","author":"Ip F","year":"2002","journal-title":"Formal Aspects Comput"},{"key":"p_26","volume-title":"On the minimality of stream X-machines. Comput J 46(3)","author":"Ipa F","year":"2003"},{"key":"p_27","first-page":"134","volume-title":"Athens","author":"Ke P","year":"2000"},{"key":"p_28","first-page":"163","volume-title":"Mastorakis N (ed) systems and control: theory and applications, world scientific and engineering","author":"Kehris E","year":"2000"},{"issue":"8","key":"p_29","doi-asserted-by":"crossref","first-page":"1090","DOI":"10.1109\/5.533956","article-title":"Principles and methods of testing finite state machines - A survey","volume":"84","author":"Le D","year":"1996","journal-title":"Proc IEEE"},{"issue":"6","key":"p_30","first-page":"667","article-title":"The category-partition method for specifying and generating functional tests","volume":"31","author":"Os TJ","year":"1989","journal-title":"Commun ACM"},{"key":"p_31","first-page":"774","volume-title":"Generating test cases for EFSM with given fault models","author":"Wa C-J","year":"1993"}],"container-title":["Formal Aspects of Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00165-004-0045-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00165-004-0045-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1007\/s00165-004-0045-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,6]],"date-time":"2022-01-06T15:46:35Z","timestamp":1641483995000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1007\/s00165-004-0045-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,11]]},"references-count":31,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2004,11]]}},"alternative-id":["10.1007\/s00165-004-0045-6"],"URL":"https:\/\/doi.org\/10.1007\/s00165-004-0045-6","relation":{},"ISSN":["0934-5043","1433-299X"],"issn-type":[{"value":"0934-5043","type":"print"},{"value":"1433-299X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,11]]}}}