Matches in SemOpenAlex for { <https://semopenalex.org/work/W13410392> ?p ?o ?g. }
Showing items 1 to 73 of
73
with 100 items per page.
- W13410392 abstract "This thesis presents our work concerning computation of dynamic slicing of aspect oriented programs. Program slicing is a decomposition technique which extracts program elements related to a particular computation from a program. A program slice consists of those parts of a program that may directly or indirectly affect the values computed at some program point of interest, referred to as a slicing criterion. A program slice an be static or dynamic. Static slice contains all the statements that may affect the slicing criterion for every possible inputs to the program. Dynamic slice contains only those statements that actually affect the slicing criterion for a particular input to the program. Aspect-Oriented Programming is a new programming technique proposed for cleanly modularizing the cross- cutting structure of concerns. An aspect is an area of concern that cuts across the structure of a program. The main idea behind Aspect-Oriented Programming (AOP) is to allow a program to be constructed by describing each concern separately. Aspect J is an aspect-oriented extension to the Java programming language. Aspect J adds new concepts and associated constructs called join points, point cuts, advices, introductions, aspects to Java. We first store the statements executed for a particular execution in an execution trace le. Next, we develop a dependence-based representation alled Dynamic Aspect-Oriented Dependence Graph (DADG) as the intermediate program representation. The DADG is an arc-classied digraph which represents various dynamic dependences between the statements of an aspect-oriented program for a particular execution. Then, we present an efficient dynamic slicing technique for aspect-oriented programs using DADG. Taking any vertex as the starting point, our algorithm performs a graph traversal on the DADG using breadth-first graph traversal or depth-first graph traversal. Then, the traversed vertices are mapped to the original program to compute the dynamic slices. We have shown that our proposed algorithm efficiently calculates dynamic slices. The space complexity of the algorithm is O(S). The run-time complexity of the algorithm is O(S 2 ). We have also shown that our dynamic slicing algorithm computes correct dynamic slices." @default.
- W13410392 created "2016-06-24" @default.
- W13410392 creator A5038463691 @default.
- W13410392 date "2007-01-01" @default.
- W13410392 modified "2023-09-27" @default.
- W13410392 title "Computation of dynamic slices of aspect oriented programs" @default.
- W13410392 hasPublicationYear "2007" @default.
- W13410392 type Work @default.
- W13410392 sameAs 13410392 @default.
- W13410392 citedByCount "0" @default.
- W13410392 crossrefType "dissertation" @default.
- W13410392 hasAuthorship W13410392A5038463691 @default.
- W13410392 hasConcept C136764020 @default.
- W13410392 hasConcept C138885662 @default.
- W13410392 hasConcept C168065819 @default.
- W13410392 hasConcept C17744445 @default.
- W13410392 hasConcept C199360897 @default.
- W13410392 hasConcept C199539241 @default.
- W13410392 hasConcept C2776190703 @default.
- W13410392 hasConcept C2776359362 @default.
- W13410392 hasConcept C2777904410 @default.
- W13410392 hasConcept C41008148 @default.
- W13410392 hasConcept C41895202 @default.
- W13410392 hasConcept C45374587 @default.
- W13410392 hasConcept C548217200 @default.
- W13410392 hasConcept C60051680 @default.
- W13410392 hasConcept C75291252 @default.
- W13410392 hasConcept C91071405 @default.
- W13410392 hasConcept C94625758 @default.
- W13410392 hasConceptScore W13410392C136764020 @default.
- W13410392 hasConceptScore W13410392C138885662 @default.
- W13410392 hasConceptScore W13410392C168065819 @default.
- W13410392 hasConceptScore W13410392C17744445 @default.
- W13410392 hasConceptScore W13410392C199360897 @default.
- W13410392 hasConceptScore W13410392C199539241 @default.
- W13410392 hasConceptScore W13410392C2776190703 @default.
- W13410392 hasConceptScore W13410392C2776359362 @default.
- W13410392 hasConceptScore W13410392C2777904410 @default.
- W13410392 hasConceptScore W13410392C41008148 @default.
- W13410392 hasConceptScore W13410392C41895202 @default.
- W13410392 hasConceptScore W13410392C45374587 @default.
- W13410392 hasConceptScore W13410392C548217200 @default.
- W13410392 hasConceptScore W13410392C60051680 @default.
- W13410392 hasConceptScore W13410392C75291252 @default.
- W13410392 hasConceptScore W13410392C91071405 @default.
- W13410392 hasConceptScore W13410392C94625758 @default.
- W13410392 hasLocation W134103921 @default.
- W13410392 hasOpenAccess W13410392 @default.
- W13410392 hasPrimaryLocation W134103921 @default.
- W13410392 hasRelatedWork W104878183 @default.
- W13410392 hasRelatedWork W120582129 @default.
- W13410392 hasRelatedWork W1724827882 @default.
- W13410392 hasRelatedWork W1984248430 @default.
- W13410392 hasRelatedWork W2141381576 @default.
- W13410392 hasRelatedWork W2145018748 @default.
- W13410392 hasRelatedWork W2159315778 @default.
- W13410392 hasRelatedWork W2170886957 @default.
- W13410392 hasRelatedWork W2242363224 @default.
- W13410392 hasRelatedWork W2245513008 @default.
- W13410392 hasRelatedWork W2247790717 @default.
- W13410392 hasRelatedWork W2296552740 @default.
- W13410392 hasRelatedWork W2346217839 @default.
- W13410392 hasRelatedWork W25686311 @default.
- W13410392 hasRelatedWork W2746442073 @default.
- W13410392 hasRelatedWork W285864563 @default.
- W13410392 hasRelatedWork W2917535202 @default.
- W13410392 hasRelatedWork W3041479431 @default.
- W13410392 hasRelatedWork W366794214 @default.
- W13410392 hasRelatedWork W70225202 @default.
- W13410392 isParatext "false" @default.
- W13410392 isRetracted "false" @default.
- W13410392 magId "13410392" @default.
- W13410392 workType "dissertation" @default.