A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
"Bagatelle in C arranged for VDM SoLo"
2001
Journal of universal computer science (Online)
Preserved Fulltext
The latter include code slicing, a "shortcut" which trims down the complexity of handling the formal semantics of all program variables at the same time. ...
This paper sketches a reverse engineering discipline which combines formal and semi-formal methods. ...
The use of VDMTools R under a Free Academic Site License provided by IFAD is gratefully acknowledged. ...
doi:10.3217/jucs-007-08-0754
dblp:journals/jucs/Oliveira01
fatcat:l3g2qlqwtvfptfmkg6epdpsg4m
Extracting Reusable Object-Oriented Legacy Code Segments with Combined Formal Concept Analysis and Slicing Techniques for Service Integration
2006
Proceedings - International Conference on Quality Software
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In the extraction phase, formal concept analysis, which is a general and flexible technique for recovering structural design information, and inter-procedural program slicing are adopted as main reverse ...
Our approach produces extracted components with core legacy object-oriented code function in Web services by wrapping underlying computing models with XML. ...
Reverse engineering techniques, such as formal concept analysis and static program slicing, are applied in this component mining process. ...
doi:10.1109/qsic.2006.29
dblp:conf/qsic/ZhangYC06
fatcat:i5a6w4l5yzggtkolfdsageceom
Deriving a Slicing Algorithm via FermaT Transformations
2011
IEEE Transactions on Software Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We develop a formal specification for program slicing, in the form of a WSL specification statement, which is refined into a simple slicing algorithm by applying a sequence of general purpose program transformations ...
The main novel contributions of this paper are: (1) Developing a formal specification for slicing. (2) Expressing the definition of slicing in terms of a WSL specification statement. (3) By applying correctness ...
To convert the formal definition of program slicing into a specification statement which defines program for slicing a subset of WSL, we need the following: 1. ...
doi:10.1109/tse.2010.13
fatcat:z36kbr57p5b6boa7p2w4vbgkne
Specialization slicing
2014
SIGPLAN notices
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Moreover, by combining specialization slicing with forward slicing, we obtain a method for removing unwanted features from a program. ...
We formalize the specialization-slicing problem as a partitioning problem on the elements of the possibly-infinite unrolled program. ...
We are grateful for the help with CodeSurfer/C, and timely improvements to it, that was provided by Thomas Johnson, Jason Dickens, and Chi-Hua Chen of GrammaTech, Inc. ...
doi:10.1145/2666356.2594345
fatcat:ftyw6vrg3re3tizseto6v3ksru
Specialization slicing
2013
Proceedings of the 35th ACM SIGPLAN Conference on Programming Language Design and Implementation - PLDI '14
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
Moreover, by combining specialization slicing with forward slicing, we obtain a method for removing unwanted features from a program. ...
We formalize the specialization-slicing problem as a partitioning problem on the elements of the possibly-infinite unrolled program. ...
We are grateful for the help with CodeSurfer/C, and timely improvements to it, that was provided by Thomas Johnson, Jason Dickens, and Chi-Hua Chen of GrammaTech, Inc. ...
doi:10.1145/2594291.2594345
dblp:conf/pldi/AungHJR14
fatcat:ysiw3snocbbvtcakfwq6m6diuq
Specialization Slicing
2014
ACM Transactions on Programming Languages and Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
Moreover, by combining specialization slicing with forward slicing, we obtain a method for removing unwanted features from a program. ...
We formalize the specialization-slicing problem as a partitioning problem on the elements of the possibly-infinite unrolled program. ...
We are grateful for the help with CodeSurfer/C, and timely improvements to it, that was provided by Thomas Johnson, Jason Dickens, and Chi-Hua Chen of GrammaTech, Inc. ...
doi:10.1145/2566620
fatcat:lsbedk4vtnggdblegca3nolnhe
Program Slicing Based Buffer Overflow Detection
2010
Journal of Software Engineering and Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This paper describes a new technology, named program slicing, to detect the buffer overflow leak in security-critical C code. ...
Secondly, we utilize debug technology to get the size of memory applied by the variable and the size of memory used for these code segments (the slicing result) further. ...
Program Slicing Program slicing [6] , originally introduced by Weiser, has been widely used in maintenance of software, program debugging, software testing, code analysis, reverse engineering and so on ...
doi:10.4236/jsea.2010.310113
fatcat:s3wqxspppvfujm5pbgdgtpfg6q
A formalisation of the relationship between forms of program slicing
2006
Science of Computer Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This paper further develops a formal framework for comparing forms of slicing using a theory of program projection. ...
This framework is used to reveal the ordering relationship between various static, dynamic, simultaneous and conditioned forms of slicing. ...
Tibor Gyimóthy andÁkos Kiss are supported by The Péter Pázmány Program of the Hungarian National Office of Research and Technology (no. RET-07/2005). ...
doi:10.1016/j.scico.2006.04.007
fatcat:hmljtkadd5afxarxtfrwxethwy
Reverse engineering and system renovation---an annotated bibliography
1997
Software engineering notes
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
We put the contributions not only in alphabetical order but also grouped by topic so that readers focusing on a certain topic can read their annotations in the alphabetical listing. ...
For the sake of ease we also incorporated a brief introduction to the field of reverse engineering. ...
In this paper the technique of program slicing is used to facilitate maintenance of software systems by extending the notion of program slice to a so-called decomposition slice (a slice that captures all ...
doi:10.1145/251759.251849
fatcat:kyy62sw6avbklkljq4t7p4ml4e
A formal relationship between program slicing and partial evaluation
2006
Formal Aspects of Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
It is proved that for terminating programs, a residual program produced by partial evaluation is semantically equivalent to a conditioned slice. ...
A formal relationship between program slicing and partial evaluation is established. ...
The semantic equivalence preserved by conditioned slicing is defined as follows: Definition
A formal relationship between program slicing and partial evaluation This section casts partial evaluation ...
doi:10.1007/s00165-005-0077-6
fatcat:c43xac2ozffefd6belw73jxcoq
Extracting Business Rule from existing COBOL programs for Redevelopment
2019
International Journal Of Engineering And Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
into a unified documentation describing the data, decision and procedural flow of each program slice. ...
Firstly, the programs were restructured, secondly the programs were sliced into business logic modules, third the business modules were subjected to a multi view analysis and finally the views were integrated ...
Formally a business rule is a code segment in program where a input is checked based on some condition using conditional operators and result either assigned after calculation or in form of Boolean yes ...
doi:10.18535/ijecs/v8i05.4317
fatcat:nl7tz343zjfzxgxz7cuc52ncti
Verified Self-Explaining Computation
[chapter]
2019
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
This paper formalizes forward and backward dynamic slicing algorithms for a simple imperative programming language, and formally verifies their duality using the Coq proof assistant. ...
There has been a great deal of work on verifying compilers and static analyses, but far less on verifying dynamic analyses such as program slicing. ...
This work was supported by ERC Consolidator Grant Skye (grant number 682315). ...
doi:10.1007/978-3-030-33636-3_4
fatcat:s7jzuudwjzfvllvk26esso3b6y
Getting Objects Methods and Interactions by Extracting Business Rules from Legacy Systems
2014
Journal of Systems Integration
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
The optimal scenario is evolving those systems by profiting from the valuable knowledge embedded in them. ...
This paper aims to present an approach for knowledge acquisition from existing legacy systems by extracting business rules from source code. ...
Program slicing overview The concept of program slicing was originally introduced in 1979 by (Weiser, 1979; 1981; 1982) . ...
doi:10.20470/jsi.v5i3.204
fatcat:pg4xbbxpyrcqjow2jcz4fzzrke
Recursive AOP for Reversible Software
2019
Baltic Journal of Modern Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
instead of by modules and to run weaved program at run-time. ...
In order to do reversible computing operational there is a need to code (manually) or to generate opposite "reverse" element for each "forward" element. ...
used by both scientists working on reversible programming and by scientist focused on the aspect oriented paradigm. ...
doi:10.22364/bjmc.2019.7.3.09
fatcat:jflbkut7g5g3pct3s3ptprjfhq
Light-weight context recovery for efficient and accurate program analyses
2000
Proceedings of the 22nd international conference on Software engineering - ICSE '00
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
locations accessed by a procedure under di erent callsites can signi cantly improve the precision and the e ciency of program analyses on programs that use pointer variables. ...
To compute accurate information e cien tly for programs that use pointer variables, a program analysis must account for the fact that a procedure may a c c e s s di erent sets of memory locations when ...
ACKNOWLEDGMENTS This work was supported by NSF under grants CCR-9696157 and CCR-9707792 to Ohio State University. ...
doi:10.1145/337180.337222
dblp:conf/icse/LiangH00
fatcat:kcv3mobsqrhnpoxk62k7l4vxwu
« Previous
Showing results 1 — 15 out of 28,727 results