{"@context":{"@vocab":"https://cir.nii.ac.jp/schema/1.0/","rdfs":"http://www.w3.org/2000/01/rdf-schema#","dc":"http://purl.org/dc/elements/1.1/","dcterms":"http://purl.org/dc/terms/","foaf":"http://xmlns.com/foaf/0.1/","prism":"http://prismstandard.org/namespaces/basic/2.0/","cinii":"http://ci.nii.ac.jp/ns/1.0/","datacite":"https://schema.datacite.org/meta/kernel-4/","ndl":"http://ndl.go.jp/dcndl/terms/","jpcoar":"https://github.com/JPCOAR/schema/blob/master/2.0/"},"@id":"https://cir.nii.ac.jp/crid/1360004236274162944.json","@type":"Article","productIdentifier":[{"identifier":{"@type":"DOI","@value":"10.1145/2771783.2771807"}},{"identifier":{"@type":"URI","@value":"https://dl.acm.org/doi/10.1145/2771783.2771807"}},{"identifier":{"@type":"URI","@value":"https://dl.acm.org/doi/pdf/10.1145/2771783.2771807"}}],"resourceType":"学術雑誌論文(journal article)","dc:title":[{"@value":"Calculation coverage testing in scientific applications"}],"description":[{"notation":[{"@value":"A typical implementation of scientific applications includes a large number of iterative calculations. For performance optimization, these calculations are often partitioned, grouped, and reordered for execution. Since this refactoring is repeatedly performed during development, it is one of the major source of bugs and thus tool support is necessary for debugging. This study discusses this problem and proposes tool support through a testing framework. This testing framework can help developers perform the tests we call calculation coverage testing. It investigates whether the grouped calculations cover all the calculations performed by the original (and often naively implemented) program. It also investigates whether their execution order is correct. To demonstrate this idea, we also presents HPCUnit, our prototype testing framework for Java, and then reports an empirical study applying it to the Java Grande Forum Benchmark Suite."}]}],"creator":[{"@id":"https://cir.nii.ac.jp/crid/1380004236274163073","@type":"Researcher","foaf:name":[{"@value":"Yoshiki Sato"}],"jpcoar:affiliationName":[{"@value":"University of Tokyo, Japan"}]},{"@id":"https://cir.nii.ac.jp/crid/1380004236274163072","@type":"Researcher","foaf:name":[{"@value":"Shumpei Hozumi"}],"jpcoar:affiliationName":[{"@value":"University of Tokyo, Japan"}]},{"@id":"https://cir.nii.ac.jp/crid/1420001326213615744","@type":"Researcher","personIdentifier":[{"@type":"KAKEN_RESEARCHERS","@value":"80282713"},{"@type":"NRID","@value":"1000080282713"},{"@type":"CINII_AUTHOR_ID","@value":"DA12226973"},{"@type":"URI","@value":"https://ci.nii.ac.jp/author/DA12226973#entity"},{"@type":"URI","@value":"https://viaf.org/viaf/NII%7CDA12226973"},{"@type":"NRID","@value":"9000381493561"},{"@type":"NRID","@value":"9000406313268"},{"@type":"NRID","@value":"9000403549200"},{"@type":"NRID","@value":"9000398792315"},{"@type":"NRID","@value":"9000241442264"},{"@type":"NRID","@value":"9000017506613"},{"@type":"NRID","@value":"9000391780316"},{"@type":"NRID","@value":"9000384340527"},{"@type":"NRID","@value":"9000406313008"},{"@type":"NRID","@value":"9000020043022"},{"@type":"NRID","@value":"9000020128664"},{"@type":"NRID","@value":"9000408781395"},{"@type":"NRID","@value":"9000283722502"},{"@type":"NRID","@value":"9000327928903"},{"@type":"NRID","@value":"9000346959498"},{"@type":"NRID","@value":"9000019995707"},{"@type":"NRID","@value":"9000283722566"},{"@type":"NRID","@value":"9000019949296"},{"@type":"NRID","@value":"9000287166205"},{"@type":"NRID","@value":"9000283467731"},{"@type":"RESEARCHMAP","@value":"https://researchmap.jp/chibash"}],"foaf:name":[{"@value":"Shigeru Chiba"}],"jpcoar:affiliationName":[{"@value":"University of Tokyo, Japan"}]}],"publication":{"prism:publicationName":[{"@value":"Proceedings of the 2015 International Symposium on Software Testing and Analysis"}],"dc:publisher":[{"@value":"ACM"}],"prism:publicationDate":"2015-07-13","prism:startingPage":"350","prism:endingPage":"360"},"reviewed":"false","dc:rights":["https://www.acm.org/publications/policies/copyright_policy#Background"],"url":[{"@id":"https://dl.acm.org/doi/10.1145/2771783.2771807"},{"@id":"https://dl.acm.org/doi/pdf/10.1145/2771783.2771807"}],"createdAt":"2015-07-10","modifiedAt":"2025-06-18","project":[{"@id":"https://cir.nii.ac.jp/crid/1040000782320195968","@type":"Project","projectIdentifier":[{"@type":"KAKEN","@value":"26870165"},{"@type":"JGN","@value":"JP26870165"},{"@type":"URI","@value":"https://kaken.nii.ac.jp/grant/KAKENHI-PROJECT-26870165/"}],"notation":[{"@language":"ja","@value":"並列コレクション向けモジュール化技術の研究開発"}]}],"relatedProduct":[{"@id":"https://cir.nii.ac.jp/crid/1360011143632788352","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Scalable fine-grained call path tracing"}]},{"@id":"https://cir.nii.ac.jp/crid/1360011144971999872","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Java-MaC: A Run-Time Assurance Approach for Java Programs"}]},{"@id":"https://cir.nii.ac.jp/crid/1360292618913276800","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Verification of MPI-Based Software for Scientific Computation"}]},{"@id":"https://cir.nii.ac.jp/crid/1360292619532989696","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Implicit and explicit optimizations for stencil computations"}]},{"@id":"https://cir.nii.ac.jp/crid/1360574093687222784","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Efficient Verification of Halting Properties for MPI Programs with Wildcard Receives"}]},{"@id":"https://cir.nii.ac.jp/crid/1360574095440854912","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"A set of level 3 basic linear algebra subprograms"}]},{"@id":"https://cir.nii.ac.jp/crid/1360574096264030592","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Improving data locality with loop transformations"}]},{"@id":"https://cir.nii.ac.jp/crid/1360855567862428288","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"First-principles calculations of electron states of a silicon nanowire with 100,000 atoms on the K computer"}]},{"@id":"https://cir.nii.ac.jp/crid/1360855570465716736","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Mop"}]},{"@id":"https://cir.nii.ac.jp/crid/1360861404405296512","@type":"Article","relationType":["references"]},{"@id":"https://cir.nii.ac.jp/crid/1361137043768145152","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"A parallel java grande benchmark suite"}]},{"@id":"https://cir.nii.ac.jp/crid/1361418520992810240","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Metamorphic Testing for Web Services: Framework and a Case Study"}]},{"@id":"https://cir.nii.ac.jp/crid/1361418521170538624","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Formal verification of practical MPI programs"}]},{"@id":"https://cir.nii.ac.jp/crid/1362262946102678016","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Smaller Footprint for Java Collections"}]},{"@id":"https://cir.nii.ac.jp/crid/1362544420464840832","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"An innovative approach for testing bioinformatics programs using metamorphic testing"}]},{"@id":"https://cir.nii.ac.jp/crid/1362825895104484864","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"On Testing Non-Testable Programs"}]},{"@id":"https://cir.nii.ac.jp/crid/1363107369609551616","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Adding trace matching with free variables to AspectJ"}]},{"@id":"https://cir.nii.ac.jp/crid/1363670318962037376","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"The cache performance and optimizations of blocked algorithms"}]},{"@id":"https://cir.nii.ac.jp/crid/1363670320036449664","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Using model checking with symbolic execution to verify parallel numerical programs"}]},{"@id":"https://cir.nii.ac.jp/crid/1363951795050421120","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Dynamic Verification of MPI Programs with Reductions in Presence of Split Operations and Relaxed Orderings"}]},{"@id":"https://cir.nii.ac.jp/crid/1364233270525548160","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"An Overview of the Runtime Verification Tool Java PathExplorer"}]},{"@id":"https://cir.nii.ac.jp/crid/1370004236281011076","@type":"Product","relationType":["references"]},{"@id":"https://cir.nii.ac.jp/crid/1370005521286604931","@type":"Product","relationType":["references"]},{"@id":"https://cir.nii.ac.jp/crid/1370857758748458880","@type":"Product","relationType":["references"]},{"@id":"https://cir.nii.ac.jp/crid/1371412896171803392","@type":"Product","relationType":["references"]},{"@id":"https://cir.nii.ac.jp/crid/1371412896171803394","@type":"Product","relationType":["references"]},{"@id":"https://cir.nii.ac.jp/crid/1371412896171803520","@type":"Product","relationType":["references"]},{"@id":"https://cir.nii.ac.jp/crid/1371412896171803523","@type":"Product","relationType":["references"]}],"dataSourceIdentifier":[{"@type":"CROSSREF","@value":"10.1145/2771783.2771807"},{"@type":"KAKEN","@value":"PRODUCT-20595571"},{"@type":"OPENAIRE","@value":"doi_dedup___::e814e5abce4eddf6a8b9e37e85ea65a4"}]}