Journal articles: '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

11

Jaakko Korpi, and Jussi Koskinen. "Constructive Dynamic Program Slicing Research." International Journal of Advancements in Computing Technology 2, no. 2 (June 30, 2010): 7–23. http://dx.doi.org/10.4156/ijact.vol2.issue2.1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Galindo, Carlos, Sergio Pérez, and Josep Silva. "Exception-sensitive program slicing." Journal of Logical and Algebraic Methods in Programming 130 (January 2023): 100832. http://dx.doi.org/10.1016/j.jlamp.2022.100832.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Pérez, Sergio, Josep Silva, and Salvador Tamarit. "Automatic Testing of Program Slicers." Scientific Programming 2019 (February 25, 2019): 1–15. http://dx.doi.org/10.1155/2019/4108652.

Full text

Abstract:

Program slicing is a technique to extract the part of a program (the slice) that influences or is influenced by a set of variables at a given point (the slicing criterion). Computing minimal slices is undecidable in the general case, and obtaining the minimal slice of a given program is normally computationally prohibitive even for very small programs. Therefore, no matter what program slicer we use, in general, we cannot be sure that our slices are minimal. This is probably the fundamental reason why no benchmark collection of minimal program slices exists. In this work, we present a method to automatically produce quasi-minimal slices. Using our method, we have produced a suite of quasi-minimal slices for Erlang that we have later manually proved they are minimal. We explain the process of constructing the suite, the methodology and tools that were used, and the results obtained. The suite comes with a collection of Erlang benchmarks together with different slicing criteria and the associated minimal slices.

APA, Harvard, Vancouver, ISO, and other styles

14

Binkley, Dave, Sebastian Danicic, Tibor Gyimóthy, Mark Harman, Ákos Kiss, and Bogdan Korel. "Theoretical foundations of dynamic program slicing." Theoretical Computer Science 360, no. 1-3 (August 2006): 23–41. http://dx.doi.org/10.1016/j.tcs.2006.01.012.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Venkatesh, G. A. "The semantic approach to program slicing." ACM SIGPLAN Notices 26, no. 6 (June 1991): 107–19. http://dx.doi.org/10.1145/113446.113455.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Giacobazzi, Roberto, and Isabella Mastroeni. "Non-Standard Semantics for Program Slicing." Higher-Order and Symbolic Computation (formerly LISP and Symbolic Computation) 16, no. 4 (December 2003): 297–339. http://dx.doi.org/10.1023/a:1025872819613.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Gondow, Katsuhiko, and Hayato Kawashima. "Towards ANSI C Program Slicing using XML." Electronic Notes in Theoretical Computer Science 65, no. 3 (July 2002): 30–49. http://dx.doi.org/10.1016/s1571-0661(04)80425-0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Sandberg, Christer, Andreas Ermedahl, Jan Gustafsson, and Björn Lisper. "Faster WCET flow analysis by program slicing." ACM SIGPLAN Notices 41, no. 7 (July 12, 2006): 103–12. http://dx.doi.org/10.1145/1159974.1134666.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Zhang, YingZhou. "A novel formal approach to program slicing." Science in China Series F: Information Sciences 50, no. 5 (October 2007): 657–70. http://dx.doi.org/10.1007/s11432-007-0061-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Barraclough, Richard W., David Binkley, Sebastian Danicic, Mark Harman, Robert M. Hierons, Ákos Kiss, Mike Laurence, and Lahcen Ouarbya. "A trajectory-based strict semantics for program slicing." Theoretical Computer Science 411, no. 11-13 (March 2010): 1372–86. http://dx.doi.org/10.1016/j.tcs.2009.10.025.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Danicic, Sebastian, Chris Fox, Mark Harman, Rob Hierons, John Howroyd, and Michael R. Laurence. "Static Program Slicing Algorithms are Minimal for Free Liberal Program Schemas." Computer Journal 48, no. 6 (July 22, 2005): 737–48. http://dx.doi.org/10.1093/comjnl/bxh121.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

YI, XIAODONG, JI WANG, and XUEJUN YANG. "SLICING EXECUTION FOR MODEL CHECKING C PROGRAMS." International Journal of Software Engineering and Knowledge Engineering 16, no. 05 (October 2006): 747–68. http://dx.doi.org/10.1142/s0218194006002987.

Full text

Abstract:

This paper presents a novel method, namely slicing execution, for model checking C programs with respect to temporal safety properties. The distinguished feature is that it shows a nice approach to the efficient reduction of state space by abstraction and symbolic representation. Slicing execution is founded on an over-approximated semantics of C programs by variable abstraction, and executes symbolically only the relevant statements under abstraction criteria to construct over-approximated finite models of programs, which may be model checked. The variable abstraction criterion begins with a proper initial set of program variables and may be iteratively refined according to spurious counterexamples generated during model checking. In general, the properties to be verified often involve only a few variables in practical programs. In these cases, significant state space reduction, as well as considerable improvement of the scalability, may be achieved. The presented method has been used to verify the initial handshake process of SSL protocol based on the C source code of openssl-0.9.6c. The experiment results confirm that slicing execution is not only practical but also effective.

APA, Harvard, Vancouver, ISO, and other styles

23

Rilling, Juergen, and S. P. Mudur. "3D visualization techniques to support slicing-based program comprehension." Computers & Graphics 29, no. 3 (June 2005): 311–29. http://dx.doi.org/10.1016/j.cag.2005.03.007.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Cao, Heling, Fei Wang, Miaolei Deng, and Lei Li. "The improved dynamic slicing for spectrum-based fault localization." PeerJ Computer Science 8 (September 7, 2022): e1071. http://dx.doi.org/10.7717/peerj-cs.1071.

Full text

Abstract:

Background Spectrum-based Fault localization have proven to be useful in the process of software testing and debugging. However, how to improve the effectiveness of software fault localization has always been a research hot spot in the field of software engineering. Dynamic slicing can extract program dependencies under certain conditions. Thus, this technology is expected to benefit for locating fault. Methods We propose an improved dynamic slicing for spectrum-based fault localization under a general framework. We first obtain the dynamic slice of program execution. Secondly, we construct a mixed slice spectrum matrix from the dynamic slice of each test case and the corresponding test results. Finally, we compute the suspiciousness value of each statement in the mixed-slice spectram matrix. Results To verify the performance of our method, we conduct an empirical study on 15 widely used open-source programs. Experimental results show that our approach achieves significant improvement than the compared techniques. Conclusions Our approach can reduce approximately 1% to 17.79% of the average cost of code examined significantly.

APA, Harvard, Vancouver, ISO, and other styles

25

ZHANG, Ying-Zhou, Zhong-Qiang WU, Ju QIAN, Wei-Feng ZHANG, and Bao-Wen XU. "A Monadic Slicing Algorithm for a Program with Pointers." Chinese Journal of Computers 33, no. 3 (April 28, 2010): 473–82. http://dx.doi.org/10.3724/sp.j.1016.2010.00473.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Mohan Liu, Mohan Liu, Xiaoming Tang Mohan Liu, and Hanming Fei Xiaoming Tang. "Design of Malicious Code Detection System Based on Binary Code Slicing." 電腦學刊 33, no. 3 (June 2022): 225–38. http://dx.doi.org/10.53106/199115992022063303018.

Full text

Abstract:

<p>Malicious code threatens the safety of computer systems. Researching malicious code design techniques and mastering code behavior patterns are the basic work of network security prevention. With the game of network offense and defense, malicious code shows the characteristics of invisibility, polymorphism, and multi-dismutation. How to correctly and effectively understand malicious code and extract the key malicious features is the main goal of malicious code detection technology. As an important method of program understanding, program slicing is used to analyze the program code by using the idea of “decomposition”, and then extract the code fragments that the analyst is interested in. In recent years, data mining and machine learning techniques have been applied to the field of malicious code detection. The reason why it has become the focus of research is that it can use data mining to dig out meaningful patterns from a large amount of existing code data. Machine learning can It helps to summarize the identification knowledge of known malicious code, so as to conduct similarity search and help find unknown malicious code. The machine learning heuristic malicious code detection method firstly needs to automatically or manually extract the structure, function and behavior characteristics of the malicious code, so we can first slice the malicious code and then perform the detection. Through the improvement of the classic program slicing algorithm, this paper effectively improves the slicing problem between binary code processes. At the same time, it implements a malicious code detection system. The machine code byte sequence variable-length N-gram is used as the feature extraction method to further prove that the efficiency and accuracy of malicious code detection technology based on data mining and machine learning. </p> <p> </p>

APA, Harvard, Vancouver, ISO, and other styles

27

Binkley, David W., Sebastian Danicic, Mark Harman, John Howroyd, and Lahcen Ouarbya. "A formal relationship between program slicing and partial evaluation." Formal Aspects of Computing 18, no. 2 (May 10, 2006): 103–19. http://dx.doi.org/10.1007/s00165-005-0077-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Lu, Qi, Fubo Zhang, and Jiahua Qian. "Program slicing: Its improved algorithm and application in verification." Journal of Computer Science and Technology 3, no. 1 (January 1988): 29–39. http://dx.doi.org/10.1007/bf02943330.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Li, Tun, Yang Guo, and Si-Kun Li. "Automatic circuit extractor for HDL description using program slicing." Journal of Computer Science and Technology 19, no. 5 (September 2004): 718–28. http://dx.doi.org/10.1007/bf02945599.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Liu, Wangyu, and Mingke Li. "A new two-step adaptive direct slicing approach for bio-scaffolds in tissue engineering." Rapid Prototyping Journal 23, no. 6 (October 17, 2017): 1170–84. http://dx.doi.org/10.1108/rpj-09-2016-0147.

Full text

Abstract:

Purpose This paper aims to propose the new two-step adaptive direct slicing method for building bio-scaffold with digital micro-mirror device (DMD)-based MPμSLA systems. Design/methodology/approach In this paper, the authors proposed a new approach to directly slice a scaffold’s CAD model (i.e the three-dimensional model built by computer-aided design platforms) and save the slices’ data as BMP (bitmap, i.e. the data format used in DMD) files instead of other types of two-dimensional patterns as an intermediary. The proposed two-step strategy in this paper, i.e. a CAD model’s exterior surface and internal architecture were sliced, respectively, at first, and then assembled together to obtain one intact slice. The assembly process is much easier and convenient based on the slice data in BMP format. To achieve the adaptive slicing for both the exterior part and internal part, two new indices, the exterior surface-dominated index and internal architecture-dominated index, are, respectively, utilized as the error estimation indices. The proposed approach in this paper is developed on SolidWorks platform, but it can also be implemented on other platforms. Findings The authors found that the approach is not only more accurate but also more efficient by avoiding the repeated running of those inefficient rasterization programs. The approach is able to save computer resource and time, and enhance the robustness of slicing program, as well as is appropriate for the scaffolds’ model with internal pore architecture and external free-form surface. Practical implications Bio-scaffolds in tissue engineering require precise control over material distribution, such as the porosity, connectivity, internal pore architecture and external free-form surface. The proposed two-step adaptive direct slicing approach is a good balance of slicing efficiency and accuracy and can be useful for slicing bio-scaffolds’ models. Originality/value This paper gives supports to build bio-scaffold with DMD-based MPμSLA systems.

APA, Harvard, Vancouver, ISO, and other styles

31

Naoi, Kuniaki, and Naohisa Takahashi. "Program slicing using a path dependence flow graph." Systems and Computers in Japan 27, no. 12 (1996): 73–91. http://dx.doi.org/10.1002/scj.4690271207.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Takada, Tomonori, Katsuro Inoue, Fumiaki Ohata, and Yoshiyuki Ashida. "A program slicing method using lightweight dynamic information." Electronics and Communications in Japan (Part II: Electronics) 89, no. 11 (2006): 60–67. http://dx.doi.org/10.1002/ecjb.20318.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Amtoft, Torben. "Slicing for modern program structures: a theory for eliminating irrelevant loops." Information Processing Letters 106, no. 2 (April 2008): 45–51. http://dx.doi.org/10.1016/j.ipl.2007.10.002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Danicic, Sebastian, Mark Harman, John Howroyd, and Lahcen Ouarbya. "A non-standard semantics for program slicing and dependence analysis." Journal of Logic and Algebraic Programming 72, no. 2 (July 2007): 191–206. http://dx.doi.org/10.1016/j.jlap.2007.02.010.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Field, John, and Frank Tip. "Dynamic dependence in term rewriting systems and its application to program slicing." Information and Software Technology 40, no. 11-12 (December 1998): 609–36. http://dx.doi.org/10.1016/s0950-5849(98)00087-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Ariawan, Ariawan, and Budy Santoso. "PKM Usaha Kecil Menengah Kerajinan Karawo Di Kelurahan Padebuolo Kecamatan Kota Timur Kota Gorontalo Provinsi Gorontalo." JATI EMAS (Jurnal Aplikasi Teknik dan Pengabdian Masyarakat) 2, no. 2 (October 27, 2018): 105. http://dx.doi.org/10.36339/je.v2i2.163.

Full text

Abstract:

Karawo's handicrafts as a superior cultural product of the region, is the identity and also the cultural heritagein Gorontalo City. However, the development of the two partners has problems both in terms of production process,management aspects, and marketing as well. The approach used in achieving the objectives of the CommunityPartnership Program (PKM) is a training method by practicing directly with partners, counseling with lectures,discussions and mentoring each partner and evaluation. The results of the Community Partnership ProgramImplementation (PKM) to overcome partner’s problems are: (a) Production aspects such as cooperating with thegovernment and producers/ distributors of raw materials, so that each partner has one distributor to fulfill raw materials,providing training and mentoring of motif designs using the computer program, so that each partner has skilled personnelin designing motifs using a computer program, Providing training and mentoring procedures and slicing techniques, sothat each partner has additional skilled personnel in the slicing process, Providing equipment / machinery assistance insupporting the production process, so that equipment / machinery is available in supporting the production process ineach partner. (b) Management aspects by providing training and mentoring to the management of business management,so that each partner has human resources who have knowledge and skills in business management. (c) Marketing aspectsby providing training and mentoring on promotion and marketing strategies through social media as well as the practiceof making online stores, so that each partner has the knowledge and insight on promotion and marketing strategies andhas one social media based online store that partners are able to manage by themselves

APA, Harvard, Vancouver, ISO, and other styles

37

Ray, Mitrabinda, Kanhaiya lal Kumawat, and Durga Prasad Mohapatra. "Source Code Prioritization Using Forward Slicing for Exposing Critical Elements in a Program." Journal of Computer Science and Technology 26, no. 2 (March 2011): 314–27. http://dx.doi.org/10.1007/s11390-011-9438-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Feyzi, Farid, and Saeed Parsa. "A program slicing-based method for effective detection of coincidentally correct test cases." Computing 100, no. 9 (January 29, 2018): 927–69. http://dx.doi.org/10.1007/s00607-018-0591-z.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Naoi, Kuniaki, and Naohisa Takahashi. "Program slicing based on data-flow computation of path dependence flow graphs." Systems and Computers in Japan 28, no. 11 (October 1997): 22–33. http://dx.doi.org/10.1002/(sici)1520-684x(199710)28:11<22::aid-scj3>3.0.co;2-m.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Ku, T. S., and B. Ravani. "Model Based Rigid Body Guidance in Presence of Nonconvex Geometric Constraints." Journal of Mechanisms, Transmissions, and Automation in Design 111, no. 4 (December 1, 1989): 570–80. http://dx.doi.org/10.1115/1.3259039.

Full text

Abstract:

This paper presents an efficient algorithm for guidance of a convex rigid body in-between nonconvex polygonal objects in a Computer-Aided Design (CAD) environment. A shrinking procedure is used that separates the kinematic from the shape constraints by reducing the problem to that of guidance of a line segment in an expanded environment. A slicing technique together with an algorithm for decomposition of the interface channel between the nonconvex objects is used to generate the motion program for the line segment. The results can be applied to model based guidance of mobile robots or automatic motion planning for robot manipulators.

APA, Harvard, Vancouver, ISO, and other styles

41

CLARK, DAVID, ROBERTO GIACOBAZZI, and CHUNYAN MU. "Foreword: programming language interference and dependence." Mathematical Structures in Computer Science 21, no. 6 (October 27, 2011): 1109–10. http://dx.doi.org/10.1017/s0960129511000168.

Full text

Abstract:

Interference and dependence are closely related concepts: interference being the observable phenomenon connected with dependence. Essentially, interference means that the behaviour of some parts of a dynamic system may influence the behaviour of other parts of the same system, while dependence specifies how the semantics of sub-components of a dynamic system are related. Identifying, measuring and controlling interference is essential in many aspects of modern computer science, in particular, in security, program analysis and verification, debugging, systems specification, model checking, program manipulation, program slicing, reverse engineering, data mining, distributed databases and systems biology. In all these fields, dependency and interference play a key role in designing suitable abstractions or in partitioning complex systems into simpler ones. Reasoning about dependency and interference requires theories, models and semantics, as well as algorithms and tools for their analysis. Beginning in 2004, the series of Programming Language Interference and Dependence (PLID) workshops has been devoted to promoting and spreading cutting-edge research in this field, with a particular emphasis on unpublished results with great impact on the theoretical basis. PLID2007, which was held at the The Technical University of Denmark on 21 August 2007, was particularly successful, and constituted the ideal forum for announcing a call for papers for a special journal issue on programming language interference and dependence, which would not necessarily be restricted to PLID2007 contributions. From the many expressions of interest, we selected six contributions by leading researchers in the field, some of which had been presented at the PLID2007 workshop. The selected papers focus on foundational aspects of dependency and interference, with applications in language-based security, data-base management systems and program slicing.

APA, Harvard, Vancouver, ISO, and other styles

42

Li, Renjian, Ji Wang, Liqian Chen, Wanwei Liu, and Dengping Wei. "Quantitative analysis for symbolic heap bounds of CPS software." Computer Science and Information Systems 8, no. 4 (2011): 1251–76. http://dx.doi.org/10.2298/csis110302054l.

Full text

Abstract:

One important quantitative property of CPS (Cyber-Physical Systems) software is its heap bound for which a precise analysis result needs to combine shape analysis and numeric reasoning. In this paper, we present a framework for statically finding symbolic heap bounds of CPS software. The basic idea is to separate numeric reasoning from shape analysis by first constructing an ASTG (Abstract State Transition Graph) and then extracting a pure numeric representation which can be analyzed for the heap bounds. A quantitative shape analysis method based on symbolic execution is defined in the framework to generate the ASTG. The numeric representation is extracted based on program slicing technique and inputted into an abstract interpretation tool for computing the heap bounds. We take list manipulating programs as an example to explain how to instantiate the framework for important data structures and to exhibit its practicability. A novel list abstraction method is also presented to support the instantiation of the framework.

APA, Harvard, Vancouver, ISO, and other styles

43

Tang, Frederick L. W., and C. F. Lin. "PRACTICAL METHOD FOR EVALUATION DIRECTIONAL SPECTRA AFTER SHOALING AND REFRACTION." Coastal Engineering Proceedings 1, no. 20 (January 29, 1986): 59. http://dx.doi.org/10.9753/icce.v20.59.

Full text

Abstract:

Different Methods have been developed to calculate the deformation of spectrum as waves advance to the shallow water. Wave ray method is a traditional way to compute the change of wave ray after refraction. It is restricted to the regular wave. After slicing the linear spectrum, a lot of components of spectrum can be gained, and each component can be considered as a monochromatic wave. And then after the deformed components are worked out at the same point in sea, a deformed spectrum in shallow water is gained by summing up them. Therefore the wave ray method could be extended to the irregular wave in ocean. In real bathymetry, the difficulty in applying such method is to solve the wave ray which must pass through the assigned point. In this paper, calculation approach as well as computer program are contrived to adopted in real bathymetry. The results of computation reveal some significant characteristics of directional spectra in shallow water. Furthermore, the statistical features of waves at the point of interest are to be evaluated.

APA, Harvard, Vancouver, ISO, and other styles

44

Barguil, Samier, Victor Lopez Alvarez, Luis Miguel Contreras Murillo, Oscar Gonzalez de Dios, Alejandro Alcala Alvarez, Carlos Manso, Pol Alemany, et al. "Packet Optical Transport Network Slicing with Hard and Soft Isolation." Applied Sciences 11, no. 13 (July 5, 2021): 6219. http://dx.doi.org/10.3390/app11136219.

Full text

Abstract:

Network operators have been dealing with the necessity of a dynamic network resources allocation to provide a new generation of customer-tailored applications. In that sense, Telecom providers have to migrate their BSS/OSS systems and network infrastructure to more modern solutions to introduce end-to-end automation and support the new use cases derived from the 5G adoption and transport network slices. In general, there is a joint agreement on making this transition to an architecture defined by programmable interfaces and standard protocols. Hence, this paper uses the iFusion architecture to control and program the network infrastructure. The work presents an experimental validation of the network slicing instantiation in an IP/Optical environment using a set of standard protocols and interfaces. The work provides results of the creation, modification and deletion of the network slices. Furthermore, it demonstrates the usage of standard communication protocols (Netconf and Restconf) in combination with standard YANG data models.

APA, Harvard, Vancouver, ISO, and other styles

45

Qiang, Gao. "Research on Software Vulnerability Detection Method Based on Improved CNN Model." Scientific Programming 2022 (July 12, 2022): 1–8. http://dx.doi.org/10.1155/2022/4442374.

Full text

Abstract:

A software construction detection algorithm based on improved CNN model is proposed. Firstly, extract the vulnerability characteristics of the software, extract the characteristics from the static code by using the program slicing technology, establish the vulnerability library, standardize the vulnerability language, and vectorize it as the input data. Gru model is used to optimize CNN neural network. The organic combination of the two can quickly process the feature data and retain the calling relationship between the codes. Compared with single CNN and RNN model, it has stronger vulnerability detection ability and higher detection accuracy. In contrast, the software algorithm of the improved CNN model has strong vulnerability detection ability and higher detection accuracy. In terms of training loss rate, the DNN + Gru model is 17.2% lower than the single RNN model, 10.5% lower than the single CNN model, and 7% lower than the VulDeePecker model.

APA, Harvard, Vancouver, ISO, and other styles

46

Leeke, Matthew. "Simultaneous Fault Models for the Generation and Location of Efficient Error Detection Mechanisms." Computer Journal 63, no. 5 (April 30, 2019): 758–73. http://dx.doi.org/10.1093/comjnl/bxz022.

Full text

Abstract:

Abstract The application of machine learning to software fault injection data has been shown to be an effective approach for the generation of efficient error detection mechanisms (EDMs). However, such approaches to the design of EDMs have invariably adopted a fault model with a single-fault assumption, limiting the relevance of the detectors and their evaluation. Software containing more than a single fault is commonplace, with safety standards recognizing that critical failures are often the result of unlikely or unforeseen combinations of faults. This paper addresses this shortcoming, demonstrating that it is possible to generate efficient EDMs under simultaneous fault models. In particular, it is shown that (i) efficient EDMs can be designed using fault injection data collected under models accounting for the occurrence of simultaneous faults, (ii) exhaustive fault injection under a simultaneous bit flip model can yield improved EDM efficiency, (iii) exhaustive fault injection under a simultaneous bit flip model can be made non-exhaustive and (iv) EDMs can be relocated within a software system using program slicing, reducing the resource costs of experimentation to practicable levels without sacrificing EDM efficiency.

APA, Harvard, Vancouver, ISO, and other styles

47

Tonn, Bruce. "Will Psychological Disorders Afflict Uploaded Personalities?" World Futures Review 3, no. 4 (November 2011): 25–34. http://dx.doi.org/10.1177/194675671100300404.

Full text

Abstract:

Uploading human minds into computer systems is an intriguing concept. Will this process become part of our evolutionary future? This paper begins by arguing that successfully replicating human minds in virtual environments will require more than computing power and the ability to transfer the information content of neural connections into computer memory. Virtual minds must also be equipped with certain properties of the human biological mind that may prove to be not easily transferable. These include psychological motivations and even our collective unconsciousness. Lacking these, virtual minds could suffer from a wide range of serious psychological disorders. Efforts to treat such disorders with “program” fixes would invalidate any plausible claim that a virtual mind had the same ‘identity’ as its biological ancestor, and also raise perplexing ethical issues. The paper next provides a theoretical psychological framework for these assertions, and goes on to explore nine specific psychological disorders that could afflict virtual personalities. The paper then concludes by identifying several ethical issues that might arise from attempts to “fix” the psychological problems of virtual personalities. Uploading would involve first freezing a brain, then slicing it, then scanning the slices with some high- resolution scanning technique, then using automated image processing software to reconstruct and tag a very detailed 3-D map of the original brain. The map would show all the neurons, the matrix of their synaptic interconnections, the strengths of these connections, and other relevant detail. Using computational models of how these basic elements operate, the whole brain could then be emulated on a sufficiently capacious computer.—Nick Bostrom (2004)

APA, Harvard, Vancouver, ISO, and other styles

48

Korel, Bogdan, and Janusz Laski. "Dynamic slicing of computer programs." Journal of Systems and Software 13, no. 3 (November 1990): 187–95. http://dx.doi.org/10.1016/0164-1212(90)90094-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Jia, Liyuan, Song Sang, Xiao Shi, and Fukui Shen. "Investigation on Numerical Simulation of VIV of Deep-Sea Flexible Risers." Applied Sciences 13, no. 14 (July 11, 2023): 8096. http://dx.doi.org/10.3390/app13148096.

Full text

Abstract:

The vortex-induced vibration (VIV) of flexible risers is a complex fluid–structure interaction (FSI) phenomenon. In this study, we conducted a numerical simulation method based on the slicing method to study the vortex-induced vibration (VIV) of deep-sea flexible risers with different slenderness ratios and uniform flow velocities. The method combines the finite element model of the riser structure with the two-dimensional flow field slices solved by the Fluent solver. The fluid–structure interaction was realized by a self-compiled UDF program and the overset mesh technique. The numerical results were validated by comparing them with experimental data. The VIV characteristics of the riser, such as the vibration track, vibration mode, vibration frequency and wake vortex shedding mode, were analyzed. The article reveals the nonlinear dynamic features of flexible riser vibration, such as multi-frequency vibration, wide-frequency vibration and multi-modal vibration. The article also provides insights into the fluid–structure interaction mechanism of VIV of deep-sea flexible risers.

APA, Harvard, Vancouver, ISO, and other styles

50

Desai, Vishruti, and Vivaksha Jariwala. "Efficient and linear static approach for finding the memory leak in C." International Journal of Electrical and Computer Engineering (IJECE) 13, no. 2 (April 1, 2023): 1932. http://dx.doi.org/10.11591/ijece.v13i2.pp1932-1942.

Full text

Abstract:

Code analysis has discovered that memory leaks are common in the C programming language. In the literature, there exist various approaches for statically analyzing and detecting memory leaks. The complexity and diversity of memory leaks make it difficult to find an approach that is both effective and simple. In embedded systems, costly resources like memory become limited as the system’s size diminishes. As a result, memory must be handled effectively and efficiently too. To obtain precise analysis, we propose a novel approach that works in a phase-wise manner. Instead of examining all possible paths for finding memory leaks, we use a program slicing to check for a potential memory leak. We introduce a source-sink flow graph (SSFG) based on source-sink properties of memory allocation-deallocation within the C code. To achieve simplicity in analysis, we also reduce the complexity of analysis in linear time. In addition, we utilize a constraint solver to improve the effectiveness of our approach. To evaluate the approach, we perform manual scanning on various test cases: link list applications, Juliet test cases, and common vulnerabilities and exposures found in 2021. The results show the efficiency of the proposed approach by preparing the SSFG with linear complexity.

APA, Harvard, Vancouver, ISO, and other styles

Journal articles on the topic 'Computer Program Slicing'

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