Relevant bibliographies by topics / Computer Program Slicing

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers

Academic literature on the topic 'Computer Program Slicing'

Author: Grafiati
Published: 4 June 2021
Last updated: 6 September 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Computer Program Slicing.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Computer Program Slicing"

1

Harman, Mark, and Keith Brian Gallagher. "Program slicing." Information and Software Technology 40, no. 11-12 (December 1998): 577–81. http://dx.doi.org/10.1016/s0950-5849(98)00084-6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Agrawal, Hiralal, and Joseph R. Horgan. "Dynamic program slicing." ACM SIGPLAN Notices 25, no. 6 (June 1990): 246–56. http://dx.doi.org/10.1145/93548.93576.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Canfora, Gerardo, Aniello Cimitile, and Andrea De Lucia. "Conditioned program slicing." Information and Software Technology 40, no. 11-12 (December 1998): 595–607. http://dx.doi.org/10.1016/s0950-5849(98)00086-x.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Tang, Hong Jun. "Program Slicing Technique in Programming Assessment." Applied Mechanics and Materials 263-266 (December 2012): 1884–87. http://dx.doi.org/10.4028/www.scientific.net/amm.263-266.1884.

Full text
Abstract:
For the teachers of teaching basic computer programming language, a very large number of student programs should be graded and human graders have great difficulty in judging the correctness and efficiency of programs. A programming assessment method is proposed based on program slicing technique and the method has reduced the complexity in the assessment of large-scale program by decomposing program. The method divides the program into several slices by generating program dependence graph and on those slices we can get the score of the student program by comparing the student program with the template program. The method has successfully improved the grading process and it is also employed for the undergraduate courses.
APA, Harvard, Vancouver, ISO, and other styles
5

SILVA, JOSEP, and GERMÁN VIDAL. "Forward slicing of functional logic programs by partial evaluation." Theory and Practice of Logic Programming 7, no. 1-2 (January 2007): 215–47. http://dx.doi.org/10.1017/s1471068406002870.

Full text
Abstract:
AbstractProgram slicing has been mainly studied in the context of imperative languages, where it has been applied to a wide variety of software engineering tasks, like program understanding, maintenance, debugging, testing, code reuse, etc. This work introduces the first forward slicing technique for declarative multi-paradigm programs which integrate features from functional and logic programming. Basically, given a program and aslicing criterion(a function call in our setting), the computed forward slice contains those parts of the original program which arereachablefrom the slicing criterion. Our approach to program slicing is based on an extension of (online) partial evaluation. Therefore, it provides a simple way to develop program slicing tools from existing partial evaluators and helps to clarify the relation between both methodologies. A slicing tool for the multi-paradigm language Curry, which demonstrates the usefulness of our approach, has been implemented in Curry itself.
APA, Harvard, Vancouver, ISO, and other styles
6

Rodrigues, Nuno F., and Luís S. Barbosa. "Component Identification Through Program Slicing." Electronic Notes in Theoretical Computer Science 160 (August 2006): 291–304. http://dx.doi.org/10.1016/j.entcs.2006.05.029.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Korel, Bogdan, and Jurgen Rilling. "Dynamic program slicing methods." Information and Software Technology 40, no. 11-12 (December 1998): 647–59. http://dx.doi.org/10.1016/s0950-5849(98)00089-5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Zhang, Ying-Zhou. "SymPas: Symbolic Program Slicing." Journal of Computer Science and Technology 36, no. 2 (March 31, 2021): 397–418. http://dx.doi.org/10.1007/s11390-020-9754-4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Wu, Fangjun. "Formal specification of program slicing." ACM SIGPLAN Notices 41, no. 12 (December 2006): 18–27. http://dx.doi.org/10.1145/1229493.1229497.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Zhang, Xiangyu, and Rajiv Gupta. "Cost effective dynamic program slicing." ACM SIGPLAN Notices 39, no. 6 (June 9, 2004): 94–106. http://dx.doi.org/10.1145/996893.996855.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Computer Program Slicing"

1

Lamoreaux, Candace M. "UV3| Re-engineering the unravel program slicing tool." Thesis, California State University, Long Beach, 2016. http://pqdtopen.proquest.com/#viewpdf?dispub=10140465.

Full text
Abstract:

Static program slicing is a technique used to analyze code for single points of failure or errors that could cause catastrophic events in a software system. This analysis technique is especially useful in large-scale systems where a software failure could have very serious consequences.

In 1995 the National Institute of Standards and Technology (NIST) created a Computer Aided Software Engineering (CASE) tool called Unravel, a static program slicing tool that they used to evaluate the safety and integrity of software. Because of the old libraries used by Unravel, it can no longer be run on modern computer systems. This project re-engineers the original Unravel application so that it can run on modern computer systems.

The re-engineered version of the program, called Unravel V3 (UV3), implements all the functional requirements of the original program but provides a more modern user interface and moves the program from the procedural language of C to the object oriented language C#.

APA, Harvard, Vancouver, ISO, and other styles
2

Hurtig, Christian. "Efficient FBD Test Generation Through Program Slicing." Thesis, Mälardalens högskola, Akademin för innovation, design och teknik, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-38568.

Full text
Abstract:
Program slicing has been used as a way to improve the efficiency of debugging and program analysis. Nowadays, automated test generation is being used to create tests automatically by analysing the program structure and suggesting necessary tests. This kind of techniques are prone to efficiency problems when applied to large programs containing many lines of code. This is especially true for software in industrial practice, such as the ones running on Programmable logic controllers (PLC) that are used in a wide variety of tasks from toys to avionics and rail transport. Function Block Diagram (FBD) is a language used for programming PLCs that has gained lots of attention in industrial practice due to its graphical nature. These FBD programs are often used in real time and safety critical systems, and these systems require extensive testing in order to prove that they pass safety requirements of their respective domains. In order to improve the efficiency of applying automated test generation on FBD programs we propose two FBD program slicing algorithms based on the structure of these diagrams and how they are programmed. These FBD program slicing algorithms are applied on several industrial programs for PLCs in order to evaluate their feasibility and what effect slicing has on test generation. Six FBD programs were selected out of 189 provided by Bombardier Transportation Sweden AB. The six programs were sliced according to these FBD slicing algorithms and then evaluated in terms of efficiency and applicability. Our results suggest that slicing can be used to reduce the needed generation time and memory usage required for automated test generation. However, our observations show that slicing can also increase the number of test cases generated and how this test cases are merged into one test suite for the entire program.
APA, Harvard, Vancouver, ISO, and other styles
3

Wang, Ray(Ray Y. ). "A system for dynamic slicing and program visualization." Thesis, Massachusetts Institute of Technology, 2019. https://hdl.handle.net/1721.1/121764.

Full text
Abstract:
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2019
Cataloged from PDF version of thesis.
Includes bibliographical references (pages 54-55).
Dynamic analysis, which involves gathering information about a program as it is executing, is becoming increasingly common as reverse engineers attempt to more efficiently analyze complex software systems. In this thesis, I implement a technique called dynamic slicing, which determines how values in a program's register or memory, such as strings, are computed as a function of the program's initial state. This technique is then evaluated on sets of programs of interest to reverse engineers: string generation and string encoding/decoding algorithms. A common source of these algorithms is malware, which often employs these mechanisms to obfuscate and to make human-driven reverse engineering more difficult. In particular, malware will use Domain Generation Algorithms (DGAs) to construct seemingly randomized domain names to contact their control servers. We demonstrate that metrics and graphs produced with dynamic slicing can be successfully employed on these algorithm classes, elucidating interesting features from different families of malware and reducing the manual workload of malware reverse engineers.
by Ray Wang.
M. Eng.
M.Eng. Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science
APA, Harvard, Vancouver, ISO, and other styles
4

Fu, Jian 1974. "A new approach on slicing techniques for program reuse /." Thesis, McGill University, 1998. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=20954.

Full text
Abstract:
An alternative approach to developing reusable components from scratch is to recover them from existing systems. We apply program slicing, introduced by Weiser, to extract reusable functions for later study. Program Slicing is a method of finding all statements that might directly or indirectly affect that values of variables. It is implemented by analyzing the program's data flow and control flow.
We extend the definition of program slice to an encapsulated slicing algorithm, since we intend to present a new approach on decomposing a routine into a set of routines and get an executable sequence of those subroutines to obtain the same effects as the original routine. Here, the routine could be function, procedure, or method, etc. The approach is related to assign programs and subroutines as object methods exploiting object-oriented design metrics in another part of the study.
Our study is to propose a functional reusable slicing algorithm. The goal for our whole project is using some specific techniques to extract the reusable components from the existing procedure code based on certain applications as well as preserving the functions of target code.
APA, Harvard, Vancouver, ISO, and other styles
5

Kaczka, Jennings Rachel Ania. "vizSlice: An Approach for Understanding Slicing Data via Visualization." Miami University / OhioLINK, 2017. http://rave.ohiolink.edu/etdc/view?acc_num=miami1493378579021583.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Nestra, Härmel. "Iteratively defined transfinite trace semantics and program slicing with respect to them /." Online version, 2006. http://dspace.utlib.ee/dspace/bitstream/10062/1109/5/nestraharmel.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Ranganath, Venkatesh Prasad. "Scalable and accurate approaches for program dependence analysis, slicing, and verification of concurrent object oriented programs." Diss., Manhattan, Kan. : Kansas State University, 2006. http://hdl.handle.net/2097/248.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Alomari, Hakam W. "Supporting Software Engineering Via Lightweight Forward Static Slicing." Kent State University / OhioLINK, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=kent1341996135.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Hu, Hanqing. "USING PROGRAM SLICING AND SEQUENCE ALIGNMENT TO ANALYZE ORGANISMS OF AVIDA, A DIGITAL EVOLUTION PLATFORM." Miami University / OhioLINK, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=miami1331015337.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Louw, Francoise. "A program slicer for LF." Thesis, Stellenbosch : University of Stellenbosch, 2006. http://hdl.handle.net/10019.1/17378.

Full text
Abstract:
Thesis (MSc)--University of Stellenbosch, 2006.
ENGLISH ABSTRACT: Program slicing was originally described by Mark Weiser in 1984. He proposed this as a technique to aid in debugging because he conjectured that this is what programmers did naturally when debugging. Here program slicing is applied to an experimental concurrent language called LF. Existing techniques are adapted to accommodate the unique features of the language.
AFRIKAANSE OPSOMMING: Programdeling is oorspronklik deur Mark Weiser beskryf in 1984. Hy het dit voorgestel as ’n tegniek om ontfouting te vergemaklik, want hy het geglo dat dit is wat programmeerders van nature self doen. Programdeling word hier toegepas op ’n eksperimentele gelyklopende taal genaamd LF. Bestaande tegnieke word gewysig om die taal se unieke eienskappe in ag te neem.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Computer Program Slicing"

1

United States. National Aeronautics and Space Administration., ed. A survey of program slicing for software engineering. [Clear Lake City, Tex.]: Research Institute for Computing and Information Systems, University of Houston--Clear Lake, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Paint Shop Pro 9 and Studio in Easy Steps: Edit Photos like a Pro! Southam: Computer Step, 2005.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Computer Program Slicing"

1

Clarke, E. M., M. Fujita, S. P. Rajan, T. Reps, S. Shankar, and T. Teitelbaum. "Program Slicing of Hardware Description Languages." In Lecture Notes in Computer Science, 298–313. Berlin, Heidelberg: Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/3-540-48153-2_22.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Takahashi, Masakazu, Noriyoshi Mizukoshi, and Kazuhiko Tsuda. "Efficient Program Verification Using Binary Trees and Program Slicing." In Lecture Notes in Computer Science, 487–93. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-30132-5_69.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Rousseau, Pierre. "A New Approach for Concurrent Program Slicing." In Lecture Notes in Computer Science, 228–42. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11888116_18.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Chalupa, Marek, and Jan Strejček. "Evaluation of Program Slicing in Software Verification." In Lecture Notes in Computer Science, 101–19. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-34968-4_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Beckert, Bernhard, Thorsten Bormer, Stephan Gocht, Mihai Herda, Daniel Lentzsch, and Mattias Ulbrich. "SemSlice: Exploiting Relational Verification for Automatic Program Slicing." In Lecture Notes in Computer Science, 312–19. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-66845-1_20.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Khanfar, Husni, Björn Lisper, and Abu Naser Masud. "Static Backward Program Slicing for Safety-Critical Systems." In Lecture Notes in Computer Science, 50–65. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-19584-1_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Xiao, Jianyu, Deyun Zhang, Haiquan Chen, and Hao Dong. "Improved Program Dependence Graph and Algorithm for Static Slicing Concurrent Programs." In Lecture Notes in Computer Science, 121–30. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11573937_15.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Pimentel, João Felipe, Juliana Freire, Leonardo Murta, and Vanessa Braganholo. "Fine-Grained Provenance Collection over Scripts Through Program Slicing." In Lecture Notes in Computer Science, 199–203. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-40593-3_21.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Silva, Josep. "A Program Slicing Based Method to Filter XML/DTD Documents." In Lecture Notes in Computer Science, 771–82. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. http://dx.doi.org/10.1007/978-3-540-69507-3_67.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Ghorbani, Mohammad, and Mehran S. Fallah. "Run-Time Verification for Observational Determinism Using Dynamic Program Slicing." In Lecture Notes in Computer Science, 405–16. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-69659-1_22.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Computer Program Slicing"

1

Zhang, Ruoyu, Yudi Zheng, Shan Huang, and Zhengwei Qi. "Structured Dynamic Program Slicing." In 2011 International Conference on Computer and Management (CAMAN). IEEE, 2011. http://dx.doi.org/10.1109/caman.2011.5778759.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Campbell, Alexander, and Anthony Cox. "Scenario-Based Program Slicing." In 2008 15th Annual IEEE International Conference on Engineering of Computer Based Systems (ECBS). IEEE, 2008. http://dx.doi.org/10.1109/ecbs.2008.49.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Chen duanzhi. "A collection of program slicing." In 2010 International Conference on Computer Application and System Modeling (ICCASM 2010). IEEE, 2010. http://dx.doi.org/10.1109/iccasm.2010.5622157.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Wu, Fangjun. "Generalized Program Slicing Applied to Z Specifications." In 2009 International Conference on Computer Engineering and Technology (ICCET). IEEE, 2009. http://dx.doi.org/10.1109/iccet.2009.123.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Mohsin, Shaikh, and Zeeshan Kaleem. "Program Slicing Based Software Metrics towards Code Restructuring." In 2010 Second International Conference on Computer Research and Development. IEEE, 2010. http://dx.doi.org/10.1109/iccrd.2010.182.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Yongping Zhang, Jianhua Sun, and Shujuan Jiang. "An Application of Program Slicing in Evolutionary Testing." In 2009 International Conference on Information Engineering and Computer Science. ICIECS 2009. IEEE, 2009. http://dx.doi.org/10.1109/iciecs.2009.5367116.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

AlAbwaini, Nour, Amal Aldaaje, Tamara Jaber, Mohammad Abdallah, and Abdelfatah Tamimi. "Using Program Slicing to Detect the Dead Code." In 2018 8th International Conference on Computer Science and Information Technology (CSIT). IEEE, 2018. http://dx.doi.org/10.1109/csit.2018.8486334.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Wu, Fangjun. "A Formal Mapping between Program Slicing and Z Specifications." In 2009 International Conference on Computer Engineering and Technology (ICCET). IEEE, 2009. http://dx.doi.org/10.1109/iccet.2009.122.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Du, Lin, and Yehong Han. "Research on the Algorithm for Coarse-Grained Web Program Slicing." In 2015 2nd International Conference on Electrical, Computer Engineering and Electronics. Paris, France: Atlantis Press, 2015. http://dx.doi.org/10.2991/icecee-15.2015.234.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Li, Hua, Yong-guang Peng, Xin-ming Ye, and Jing-yuan Yue. "Test Sequence Generation from Combining Property Modeling and Program Slicing." In 2010 IEEE 34th Annual Computer Software and Applications Conference Workshops (COMPSACW). IEEE, 2010. http://dx.doi.org/10.1109/compsacw.2010.18.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Computer Program Slicing' for particular source types:
Journal articles Dissertations / Theses
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography