Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.14279/13810
Title: Creating and manipulating control flow graphs with multilevel grouping and code coverage
Authors: Sofokleous, Anastasis A. 
Andreou, Andreas S. 
Ioakim, Gianna 
Major Field of Science: Engineering and Technology
Field Category: Electrical Engineering - Electronic Engineering - Information Engineering
Keywords: Node grouping;Code coverage;Control flow graph
Issue Date: May-2006
Source: 8th International Conference on Enterprise Information Systems, Paphos; Cyprus; 23 May 2006 through 27 May 2006
Volume: DISI
Conference: International Conference on Enterprise Information Systems 
Abstract: Various researchers and practitioners have proposed the use of control flow graphs for investigating software engineering aspects, such as testing, slicing, program analysis and debugging. However, the relevant software applications support only low level languages (e.g. C, C++) and most, if not all, of the research papers do not provide information or any facts showing the tool implementation for the control flow graph, leaving it to the reader to imagine either that the author is using third party software for creating the graph, or that the graph is constructed manually (by hand). In this paper, we extend our previous work on a dedicated program analysis architecture and we describe a tool for automatic production of the control flow graph that offers advanced capabilities, such as vertices grouping, code coverage and enhanced user interaction.
URI: https://hdl.handle.net/20.500.14279/13810
ISBN: 9728865414
Type: Conference Papers
Affiliation : Brunel University 
University of Cyprus 
Publication Type: Peer Reviewed
Appears in Collections:Δημοσιεύσεις σε συνέδρια /Conference papers or poster or presentation

CORE Recommender
Show full item record

SCOPUSTM   
Citations 50

2
checked on Nov 6, 2023

Page view(s) 50

316
Last Week
0
Last month
1
checked on Nov 21, 2024

Google ScholarTM

Check

Altmetric


Items in KTISIS are protected by copyright, with all rights reserved, unless otherwise indicated.