| Understanding the structure of large existing (and evolving) software systems is a major challenge for software engineers. In reverse engineering, we aim to compute, for a given software system, a decomposition of the system into its subsystems. CCVisu is a lightweight tool that takes as input a software graph model and computes a visual representation of the system's structure, i.e., it structures the system into separated groups of artifacts that are strongly related, and places them in a 2- or 3-dimensional space. Besides the decomposition into subsystems, it reveals the relatedness between the subsystems via interpretable distances. The tool reads a software graph from a simple text file in RSF format, e.g., call, inheritance, containment, or co-change graphs. The resulting system structure is currently either directly presented on the screen, or written to an output file in SVG, VRML, or plain text format. The tool is designed as a reusable software component, easy to use, and easy to integrate into other tools; it is based on efficient algorithms and supports several formats for data interchange. |
|
ICSE 2008, Leipzig, May 10-18, © 2008 ACM Online: http://dx.doi.org/10.1145/1370175.1370211 |
@InProceedings{ICSE08,
author = {Dirk Beyer},
title = {{{\sc CCVisu}}: Automatic Visual Software Decomposition},
booktitle = {Proceedings of the 30th ACM/IEEE International Conference on Software Engineering (ICSE~2008, Leipzig, May 10-18)},
publisher = {ACM Press, New York~(NY)},
pages = {967-968},
year = {2008},
isbn = {978-1-60558-079-1},
keyword = {Structural Analysis and Comprehension},
pdf = {../../2008-ICSE.CCVisu_Automatic_Visual_Software_Decomposition.pdf},
url = {http://www.sosy-lab.org/~dbeyer/CCVisu/},
abstract = { Understanding the structure of large existing (and evolving) software systems is a major challenge for software engineers. In reverse engineering, we aim to compute, for a given software system, a decomposition of the system into its subsystems. CCVisu is a lightweight tool that takes as input a software graph model and computes a visual representation of the system's structure, i.e., it structures the system into separated groups of artifacts that are strongly related, and places them in a 2- or 3-dimensional space. Besides the decomposition into subsystems, it reveals the relatedness between the subsystems via interpretable distances. The tool reads a software graph from a simple text file in RSF format, e.g., call, inheritance, containment, or co-change graphs. The resulting system structure is currently either directly presented on the screen, or written to an output file in SVG, VRML, or plain text format. The tool is designed as a reusable software component, easy to use, and easy to integrate into other tools; it is based on efficient algorithms and supports several formats for data interchange. },
annote = { ICSE 2008, Leipzig, May 10-18,
© 2008 ACM
Online: http://dx.doi.org/10.1145/1370175.1370211
},
}
| We present and evaluate a framework and tool for combining multiple program analyses which allows the dynamic (on-line) adjustment of the precision of each analysis depending on the accumulated results. For example, the explicit tracking of the values of a variable may be switched off in favor of a predicate abstraction when and where the number of different variable values that have been encountered has exceeded a specified threshold. The method is evaluated on verifying the SSH client/server software and shows significant gains compared with predicate abstraction-based model checking. |
|
ASE 2008, L'Aquila, September 15-19. © 2008 IEEE Online: http://dx.doi.org/10.1109/ASE.2008.13 |
@InProceedings{ASE08,
author = {Dirk Beyer and Thomas A.~Henzinger and Gr{\'e}gory Th{\'e}oduloz},
title = {Program Analysis with Dynamic Precision Adjustment},
booktitle = {Proceedings of the 23rd IEEE/ACM International Conference on Automated Software Engineering (ASE~2008, L'Aquila, September 15-19)},
publisher = {IEEE Computer Society Press, Los Alamitos~(CA)},
pages = {29-38},
year = {2008},
isbn = {978-1-4244-2187-9},
keyword = {Software Model Checking},
pdf = {../../2008-ASE.Program_Analysis_with_Dynamic_Precision_Adjustment.pdf},
url = {},
abstract = { We present and evaluate a framework and tool for combining multiple program analyses which allows the dynamic (on-line) adjustment of the precision of each analysis depending on the accumulated results. For example, the explicit tracking of the values of a variable may be switched off in favor of a predicate abstraction when and where the number of different variable values that have been encountered has exceeded a specified threshold. The method is evaluated on verifying the SSH client/server software and shows significant gains compared with predicate abstraction-based model checking. },
annote = { ASE 2008, L'Aquila, September 15-19.
© 2008 IEEE
Online: http://dx.doi.org/10.1109/ASE.2008.13 },
}
| We present CSIsat, an interpolating decision procedure for the quantifier-free theory of rational linear arithmetic and equality with uninterpreted function symbols. Our implementation combines the efficiency of linear programming for solving the arithmetic part with the efficiency of a SAT solver to reason about the boolean structure. We evaluate the efficiency of our tool on benchmarks from software verification. Binaries and the source code of CSIsat are publicly available as free software. |
|
CAV 2008, Princeton (NY), July 7-14, Aarti Gupta, Sharad Malik, editors. © 2008 Springer-Verlag Online: http://dx.doi.org/10.1007/978-3-540-70545-1_29 |
@InProceedings{CAV08,
author = {Dirk Beyer and Damien Zufferey and Rupak Majumdar},
title = {{{\sc CSIsat}}: Interpolation for {LA+EUF}},
booktitle = {Proceedings of the 20th International Conference on Computer Aided Verification (CAV~2008, Princeton (NY), July 7-14)},
publisher = {Springer-Verlag, Berlin},
editor = {A.~Gupta and S.~Malik},
series = {LNCS~5123},
pages = {304-308},
year = {2008},
isbn = {978-3-540-70543-7},
keyword = {Software Model Checking},
pdf = {../../2008-CAV.CSIsat_Interpolation_for_LA_EUF.pdf},
url = {http://www.sosy-lab.org/~dbeyer/CSIsat/},
abstract = { We present CSIsat, an interpolating decision procedure for the quantifier-free theory of rational linear arithmetic and equality with uninterpreted function symbols. Our implementation combines the efficiency of linear programming for solving the arithmetic part with the efficiency of a SAT solver to reason about the boolean structure. We evaluate the efficiency of our tool on benchmarks from software verification. Binaries and the source code of CSIsat are publicly available as free software. },
annote = { CAV 2008, Princeton (NY), July 7-14,
Aarti Gupta, Sharad Malik, editors.
© 2008 Springer-Verlag
Online: http://dx.doi.org/10.1007/978-3-540-70545-1_29 },
}
This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All person copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
Les documents contenus dans ces répertoires sont rendus disponibles par les auteurs qui y ont contribué en vue d'assurer la diffusion à temps de travaux savants et techniques sur une base non-commerciale. Les droits de copie et autres droits sont gardés par les auteurs et par les détenteurs du copyright, en dépit du fait qu'ils présentent ici leurs travaux sous forme électronique. Les personnes copiant ces informations doivent adhérer aux termes et contraintes couverts par le copyright de chaque auteur. Ces travaux ne peuvent pas être rendus disponibles ailleurs sans la permission explicite du détenteur du copyright.
This document was translated from BibTEX by bibtex2html