FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2007152238> ?p ?o ?g. }

• W2007152238 abstract "Graph theory is playing an increasingly important role in the design, analysis, and testing of computer programs. It's importance is derived from the fact that flow of control and flow of data for any program can be expressed in terms of directed graphs. From the graph representing the flow of control, called the program graph, many others can be derived that either partially or completely preserve the program control structure. One derived graph known as a cyclomatic tree is of particular value in program testing. It is so named because the number of leaves of the tree is equal to the cyclomatic number of the program graph. A thorough treatment of cyclomatic numbers is provided in [3]. A program called the Complexity/Path Analyzer (CPA) has been developed that builds and utilizes a program cyclomatic tree to provide test planning information, automatically place software counters called probes as discussed in [9] and [10] in a program, and provide selected parameters such as program length and program graph cyclomatic number. The paper discusses the features and derivation of cyclomatic trees as well as their value and application to testing and test data generation.A cyclomatic tree provides a test planner with information useful for planning program tests. In particular, it furnishes test data selection criteria for developing tests that are minimally thorough as defined by Huang in [9]. A test data selection criterion will be defined as minimally thorough if any complete test with respect to the criterion is at least minimally thorough. The term complete is used as defined by Goodenhough and Gerhart in [13]. A test is defined to be a non empty sequence of test cases. Each test case consists of an element selected from the input domain of the program being tested. The paper discusses the merits of one particular technique selected to achieve a minimally thorough test data selection criteria. Part of the technique is automated by the CPA program." @default.
• W2007152238 created "2016-06-24" @default.
• W2007152238 creator A5060420807 @default.
• W2007152238 date "1978-01-01" @default.
• W2007152238 modified "2023-09-27" @default.
• W2007152238 title "An application of graph theory to software test data selection" @default.
• W2007152238 cites W1567200861 @default.
• W2007152238 cites W1964962870 @default.
• W2007152238 cites W1967855779 @default.
• W2007152238 cites W1996528637 @default.
• W2007152238 cites W2026740477 @default.
• W2007152238 cites W2051095001 @default.
• W2007152238 cites W2060872943 @default.
• W2007152238 cites W2068874648 @default.
• W2007152238 cites W2132840411 @default.
• W2007152238 cites W2162436812 @default.
• W2007152238 doi "https://doi.org/10.1145/800283.811109" @default.
• W2007152238 hasPublicationYear "1978" @default.
• W2007152238 type Work @default.
• W2007152238 sameAs 2007152238 @default.
• W2007152238 citedByCount "2" @default.
• W2007152238 crossrefType "proceedings-article" @default.
• W2007152238 hasAuthorship W2007152238A5060420807 @default.
• W2007152238 hasConcept C124101348 @default.
• W2007152238 hasConcept C132525143 @default.
• W2007152238 hasConcept C160191386 @default.
• W2007152238 hasConcept C187303228 @default.
• W2007152238 hasConcept C199360897 @default.
• W2007152238 hasConcept C27458966 @default.
• W2007152238 hasConcept C2777904410 @default.
• W2007152238 hasConcept C41008148 @default.
• W2007152238 hasConcept C489000 @default.
• W2007152238 hasConcept C77088390 @default.
• W2007152238 hasConcept C80444323 @default.
• W2007152238 hasConcept C88468194 @default.
• W2007152238 hasConceptScore W2007152238C124101348 @default.
• W2007152238 hasConceptScore W2007152238C132525143 @default.
• W2007152238 hasConceptScore W2007152238C160191386 @default.
• W2007152238 hasConceptScore W2007152238C187303228 @default.
• W2007152238 hasConceptScore W2007152238C199360897 @default.
• W2007152238 hasConceptScore W2007152238C27458966 @default.
• W2007152238 hasConceptScore W2007152238C2777904410 @default.
• W2007152238 hasConceptScore W2007152238C41008148 @default.
• W2007152238 hasConceptScore W2007152238C489000 @default.
• W2007152238 hasConceptScore W2007152238C77088390 @default.
• W2007152238 hasConceptScore W2007152238C80444323 @default.
• W2007152238 hasConceptScore W2007152238C88468194 @default.
• W2007152238 hasLocation W20071522381 @default.
• W2007152238 hasOpenAccess W2007152238 @default.
• W2007152238 hasPrimaryLocation W20071522381 @default.
• W2007152238 hasRelatedWork W1495147523 @default.
• W2007152238 hasRelatedWork W1996528637 @default.
• W2007152238 hasRelatedWork W2009853560 @default.
• W2007152238 hasRelatedWork W2043283064 @default.
• W2007152238 hasRelatedWork W2091299652 @default.
• W2007152238 hasRelatedWork W2098272565 @default.
• W2007152238 hasRelatedWork W2102816978 @default.
• W2007152238 hasRelatedWork W2105436591 @default.
• W2007152238 hasRelatedWork W2107983375 @default.
• W2007152238 hasRelatedWork W2119007879 @default.
• W2007152238 hasRelatedWork W2150453862 @default.
• W2007152238 hasRelatedWork W2159120852 @default.
• W2007152238 hasRelatedWork W2386370756 @default.
• W2007152238 hasRelatedWork W2394427252 @default.
• W2007152238 hasRelatedWork W2397209900 @default.
• W2007152238 hasRelatedWork W2400943888 @default.
• W2007152238 hasRelatedWork W2464228044 @default.
• W2007152238 hasRelatedWork W851196379 @default.
• W2007152238 hasRelatedWork W1916614160 @default.
• W2007152238 hasRelatedWork W311922570 @default.
• W2007152238 isParatext "false" @default.
• W2007152238 isRetracted "false" @default.
• W2007152238 magId "2007152238" @default.
• W2007152238 workType "article" @default.