abstract eng
This commit is contained in:
parent
35e170cae6
commit
14d6ee8bcb
1 changed files with 6 additions and 7 deletions
13
paper.tex
13
paper.tex
|
@ -78,21 +78,20 @@
|
|||
\begin{abstract}
|
||||
Program slicing is an analysis technique that can be applied to practically all programming languages. However, in the presence of exception handling, current program slicing software has a precision problem. This project tackles the problem of program slicing with exception handling, analysing the problem from a general perspective (for any kind of exception system), but focusing our efforts in the object-oriented paradigm, specifically the Java language. The solution is still general enough to be applicable to other paradigms and programming languages.
|
||||
|
||||
In this thesis, we study the currently available solutions to the problem, and we propose a generalization that includes at least the \texttt{try-catch} and \texttt{throw} statements. The solution we propose produces slices that guarantee completeness and are as correct as possible. The implementation of the technique proposed will be in Java.
|
||||
|
||||
|
||||
In this thesis, we study the currently available solutions to the problem, and we propose a generalization that includes at least the \texttt{try-catch} and \texttt{throw} statements. We provide detailed descriptions, generalizations and solutions for two problems that increase the size of slices and one problem that greatly reduces the precision of slices.
|
||||
The solutions we propose produce slices that guarantee completeness and are as correct as possible, given the restrictions set by the exception handling system.
|
||||
|
||||
The analysis performed and solutions proposed are specific for the Java programming language, but are general enough that they can be ported effortlessly to other programming languages with similar exception handling capabilities. They are also specific for static backward slicing, but are likewise compatible with other variants of program slicing.
|
||||
\end{abstract}
|
||||
|
||||
\selectlanguage{spanish}
|
||||
\begin{abstract}
|
||||
La fragmentación de programas es una técnica de análisis que se aplica en prácticamente todos los lenguajes de programación. Sin embargo, en presencia de excepciones los fragmentadores actuales tienen problemas de precisión. En este proyecto se aborda el problema de la fragmentación de programas con excepciones, analizando el problema desde una perspectiva general (para cualquier tipo de excepción), pero focalizando la implementación en el paradigma orientado a objetos, concretamente en el lenguaje Java.
|
||||
|
||||
Se estudiarán las soluciones actuales al problema y se propondrá una generalización que al menos incluya las construcciones try-catch y Throws. La solución propuesta deberá producir fragmentos que garanticen la completitud y que sean lo más precisos posible. La implementación de la técnica propuesta se hará en Java.
|
||||
|
||||
\end{abstract}
|
||||
|
||||
\selectlanguage{catalan}
|
||||
\begin{abstract}
|
||||
La fragmentaçió de programmaris és una tècnica d'anàlisis que s'aplica en pràcticamente tots els llenguatges de programació.
|
||||
|
||||
\end{abstract}
|
||||
|
||||
\selectlanguage{english}
|
||||
|
|
Loading…
Reference in a new issue