Literatura académica sobre el tema "Reachability testing"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte las listas temáticas de artículos, libros, tesis, actas de conferencias y otras fuentes académicas sobre el tema "Reachability testing".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Artículos de revistas sobre el tema "Reachability testing"
HWANG, GWAN-HWAN, KUO-CHUNG TAI y TING-LU HUANG. "REACHABILITY TESTING: AN APPROACH TO TESTING CONCURRENT SOFTWARE". International Journal of Software Engineering and Knowledge Engineering 05, n.º 04 (diciembre de 1995): 493–510. http://dx.doi.org/10.1142/s0218194095000241.
Texto completoLei, Y. y R. H. Carver. "Reachability testing of concurrent programs". IEEE Transactions on Software Engineering 32, n.º 6 (junio de 2006): 382–403. http://dx.doi.org/10.1109/tse.2006.56.
Texto completoCarver, Richard H. y Yu Lei. "Distributed reachability testing of concurrent programs". Concurrency and Computation: Practice and Experience 22, n.º 18 (12 de noviembre de 2010): 2445–66. http://dx.doi.org/10.1002/cpe.1573.
Texto completoAceto, Luca, Patricia Bouyer, Augusto Burgueño y Kim G. Larsen. "The power of reachability testing for timed automata". Theoretical Computer Science 300, n.º 1-3 (mayo de 2003): 411–75. http://dx.doi.org/10.1016/s0304-3975(02)00334-1.
Texto completoYim, Jaegeol, Peter C. Nelson y Tadao Murata. "Predicate-Transition Net Reachability Testing Using Heuristic Search". IEEJ Transactions on Electronics, Information and Systems 114, n.º 9 (1994): 907–13. http://dx.doi.org/10.1541/ieejeiss1987.114.9_907.
Texto completoRamaswamy, Vidhya, Jayalal Sarma y K. S. Sunil. "Space complexity of reachability testing in labelled graphs". Journal of Computer and System Sciences 105 (noviembre de 2019): 40–53. http://dx.doi.org/10.1016/j.jcss.2019.04.002.
Texto completoWONG, W. ERIC y YU LEI. "REACHABILITY GRAPH-BASED TEST SEQUENCE GENERATION FOR CONCURRENT PROGRAMS". International Journal of Software Engineering and Knowledge Engineering 18, n.º 06 (septiembre de 2008): 803–22. http://dx.doi.org/10.1142/s0218194008003878.
Texto completoAichernig, Bernhard K. y Elisabeth Jöbstl. "Towards Symbolic Model-Based Mutation Testing: Combining Reachability and Refinement Checking". Electronic Proceedings in Theoretical Computer Science 80 (27 de febrero de 2012): 88–102. http://dx.doi.org/10.4204/eptcs.80.7.
Texto completoCheremisinov, D. y L. Cheremisinova. "Model Based Testing of Concurrent Systems Based on Reachability Graph Reduction". Pattern Recognition and Image Analysis 30, n.º 1 (enero de 2020): 7–15. http://dx.doi.org/10.1134/s1054661820010046.
Texto completoLu, Chao y Yansheng Lu. "Combination reduction: A SYN-sequence selection strategy for reachability testing of concurrent programs". Wuhan University Journal of Natural Sciences 12, n.º 6 (noviembre de 2007): 1024–28. http://dx.doi.org/10.1007/s11859-007-0054-4.
Texto completoTesis sobre el tema "Reachability testing"
Zhou, Xinwei. "Reachability relations in selective regression testing". Thesis, London South Bank University, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.265281.
Texto completoSehovic, Mirsad y Markus Carlsson. "Nåbarhetstestning i en baneditor : En undersökning i hur nåbarhetstester kan implementeras i en baneditor samt funktionens potential i att ersätta manuell testning". Thesis, Linnéuniversitetet, Institutionen för datavetenskap (DV), 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-36394.
Texto completoThe following study examines whether it is possible to implement reachability testing in a map editor designed for 2D-platform games. The purpose of reachability testing is to replace manual testing, that being the level designer having to play through the map just to see if the player can reach all supposedly reachable positions in the map.A simple map editor is created to enable the implementation after which we perform a theoretical study in order to determine which algorithm would be best suited for the implementation of the reachability testing.The results comparing algorithms shows that A* (A star) worked best with the function. Whether or not manual testing can be replaced by automatic testing is open for debate, however the results points to an increase in time efficiency when it comes to level design.
Lin, Heng-Yi y 林恆毅. "Reachability Testing with Java Monitor". Thesis, 2011. http://ndltd.ncl.edu.tw/handle/84669939963659974254.
Texto completo國立臺灣師範大學
資訊工程研究所
100
Concurrent programs exhibit nondeterministic behavior in that multiple executions thereof with the same input might produce different sequences of synchronization events and different results. This is because different executions of a concurrent major issues in the testing of concurrent programs is to explore different interleavings or exhaust all the possible interleavings of the target programs. In this paper we present a framework we have developed for performing dynamic testing on monitor-based and shared-memory concurrent programs. The proposed scheme only has to analyze the synchronization sequences (SYN-sequences) that are collected during the dynamic testing of the concurrent program – static analysis of syntax and semantics of the target concurrent program is unnecessary. It also does not need to employ a model checker to explore the feasible interleavings of the execution of the concurrent program. If the SYN-sequence of the tested concurrent program is finite, our scheme can perform dynamic testing on all the feasible SYN-sequences. The implementation and experimental results obtained with real codes and some benchmark programs demonstrate the feasibility of the proposed scheme.
Che-Sheng, Lin. "Reachability Testing for Concurent Programs with Busy-Waiting Loops". 2004. http://www.cetd.com.tw/ec/thesisdetail.aspx?etdun=U0021-2004200710585065.
Texto completoLei, Yu. "Reachability analysis and testing of asynchronous message-passing programs". 2002. http://www.lib.ncsu.edu/theses/available/etd-04232002-210706/unrestricted/etd.pdf.
Texto completoLin, Che-Sheng y 林哲生. "Reachability Testing for Concurent Programs with Busy-Waiting Loops". Thesis, 2005. http://ndltd.ncl.edu.tw/handle/28350092022218984462.
Texto completoYen, Wen Hsain y 顏文賢. "A General Model to Perform Reachability Testing for Message Passing Programs". Thesis, 2010. http://ndltd.ncl.edu.tw/handle/17005165402860907390.
Texto completo國立臺灣師範大學
資訊工程研究所
98
Software testing is always an important problem during our life, because the big chance of software which has errors is not only in our writing programs, but also in the achine system programs which execute all the times, and then all the nondeterministic errors occur. In the reality world, we usually execute concurrent programs, the very few times to execute a sequential program, It is the big chance that errors will occur. Dr. Gwan-Hwan Hwang has proposed “Reachability testing”, this paper is follow this work and view this major study is based on a core of reachability testing an extension of the framework used by the message passing model, reachability testing in accordance with the spirit of this research, and propose a solution, using unique message id and filter to enhance the function of reachability testing ,we focus on the race variants of synchronization sequences of multiple receiver, this paper mainly two kinds of message passing model for analysis of synchronous message passing and asynchronous message passing, and for Richard H. Carver and Yu Lei’s work[5][17] to make some different views and queries. In addition, we found that improvement of Richard H. Carver made race table approach to deal with multiple receiver problems.
Syue, Kuang-Yao y 薛光耀. "State Storing in Prefix-Based Replay to Accelerate the Reachability Testing". Thesis, 2009. http://ndltd.ncl.edu.tw/handle/g6ghta.
Texto completo國立臺灣師範大學
資訊工程研究所
97
In software testing, our reachability testing [1] for concurrent program is mainly for testing, which main purpose is to find out all the interleaves for user analysis of reference for research in this area, there are improve the performance, but also from outside the application of research, such as web service, dynamic effective testing, analysis of multi-core competition and so on. The main purpose of this study is to improve the effectiveness of the system reachability testing, reachability testing system to improve performance also were the subject of further study. In real life, we have a concurrent software, and it will be quite large. Running reachability testing will be very time-consuming, and some time may be five or six hours, or even the largest of about a week like this. We enhance the effectiveness of the system, make any assumptions at this system, omitted, and some algorithm improvements. My research is mainly in the reachability testing for prefix-based replay for improvement. It would retain the current status of execution to the next prefix-based replay ,it would jump directly to the destination to do it, and use this method to accelerate reachability testing. At present, this method has been in the fine performance of the experimental results.In future work, it would be with the current dynamic effective testing for integration, it could also use this method to further improve the efficiency they provide.
Libros sobre el tema "Reachability testing"
Shimeall, Timothy J. REACHER--a reachability condition derivation tool. Monterey, California: Naval Postgraduate School, 1989.
Buscar texto completoCapítulos de libros sobre el tema "Reachability testing"
Cacciari, Leo y Omar Rafiq. "A temporal reachability analysis". En Protocol Specification, Testing and Verification XV, 35–49. Boston, MA: Springer US, 1996. http://dx.doi.org/10.1007/978-0-387-34892-6_3.
Texto completoHoder, Kryštof y Nikolaj Bjørner. "Generalized Property Directed Reachability". En Theory and Applications of Satisfiability Testing – SAT 2012, 157–71. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-31612-8_13.
Texto completoQi, Xiaofang y Yueran Li. "Parallel Reachability Testing Based on Hadoop MapReduce". En Software Analysis, Testing, and Evolution, 173–84. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-04272-1_11.
Texto completoRay, Rajarshi, Amit Gurung, Binayak Das, Ezio Bartocci, Sergiy Bogomolov y Radu Grosu. "XSpeed: Accelerating Reachability Analysis on Multi-core Processors". En Hardware and Software: Verification and Testing, 3–18. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-26287-1_1.
Texto completoAceto, Luca, Augusto Burgueño y Kim G. Larsen. "Model checking via reachability testing for timed automata". En Tools and Algorithms for the Construction and Analysis of Systems, 263–80. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/bfb0054177.
Texto completoAceto, Luca, Patricia Bouyer, Augusto Burgueño y Kim G. Larsen. "The Power of Reachability Testing for Timed Automata". En Lecture Notes in Computer Science, 245–56. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/978-3-540-49382-2_22.
Texto completoRamaswamy, Vidhya, Jayalal Sarma y K. S. Sunil. "Space Complexity of Reachability Testing in Labelled Graphs". En Language and Automata Theory and Applications, 351–63. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-53733-7_26.
Texto completoClaessen, Koen, Jonatan Kilhamn, Laura Kovács y Bengt Lennartson. "A Supervisory Control Algorithm Based on Property-Directed Reachability". En Hardware and Software: Verification and Testing, 115–30. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-70389-3_8.
Texto completoGroz, Roland, Keqin Li, Alexandre Petrenko y Muzammil Shahbaz. "Modular System Verification by Inference, Testing and Reachability Analysis". En Testing of Software and Communicating Systems, 216–33. Berlin, Heidelberg: Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-68524-1_16.
Texto completoCarver, Richard H. y Yu Lei. "A General Model for Reachability Testing of Concurrent Programs". En Formal Methods and Software Engineering, 76–98. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-30482-1_14.
Texto completoActas de conferencias sobre el tema "Reachability testing"
Fraser, Gordon y Paul Ammann. "Reachability and Propagation for LTL Requirements Testing". En 2008 Eighth International Conference on Quality Software (QSIC). IEEE, 2008. http://dx.doi.org/10.1109/qsic.2008.21.
Texto completoBush, Randy, James Hiebert, Olaf Maennel, Matthew Roughan y Steve Uhlig. "Testing the reachability of (new) address space". En the 2007 SIGCOMM workshop. New York, New York, USA: ACM Press, 2007. http://dx.doi.org/10.1145/1321753.1321756.
Texto completoMadhukar, Kumar, Ravindra Metta, Priyanka Singh y R. Venkatesh. "Reachability Verification of Rhapsody Statecharts". En 2013 IEEE 6th International Conference On Software Testing, Verification and Validation Workshops (ICSTW). IEEE, 2013. http://dx.doi.org/10.1109/icstw.2013.73.
Texto completoOortwijn, Wytse, Tom van Dijk y Jaco van de Pol. "Distributed binary decision diagrams for symbolic reachability". En ISSTA '17: International Symposium on Software Testing and Analysis. New York, NY, USA: ACM, 2017. http://dx.doi.org/10.1145/3092282.3092284.
Texto completoZajac, Piotr, Jacques H. Collet y Andrzej Napieralski. "Self-Configuration and Reachability Metrics in Massively Defective Multiport Chips". En 2008 14th IEEE International On-Line Testing Symposium (IOLTS). IEEE, 2008. http://dx.doi.org/10.1109/iolts.2008.58.
Texto completoPu, Fangli y Hai-Yin Xu. "A Feasible Strategy for Reachability Testing of Internet-Based Concurrent Programs". En 2008 IEEE International Conference on Networking, Sensing and Control (ICNSC). IEEE, 2008. http://dx.doi.org/10.1109/icnsc.2008.4525469.
Texto completoFeliú, Marco A., Camilo Rocha y Swee Balachandran. "Verification-driven development of ICAROUS based on automatic reachability analysis: a preliminary case study". En ISSTA '17: International Symposium on Software Testing and Analysis. New York, NY, USA: ACM, 2017. http://dx.doi.org/10.1145/3092282.3120995.
Texto completoRadkowski, Rafael y Helene Waßmann. "Utilizing the Human Hand for Ergonomics Analyses in a Mobile Augmented Reality Testing Platform". En ASME 2007 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2007. http://dx.doi.org/10.1115/detc2007-35248.
Texto completo