Towards version controlling in RefactorErl

Static source code analyser tools are operating on an intermediate representation of the source code that is usually a tree or a graph. Those representations need to be updated according to the different versions of the source code. However, the developers might be interested in the changes or might...

Teljes leírás

Elmentve itt :
Bibliográfiai részletek
Szerzők: Ciuciu-Kiss Jenifer Tabita
Tóth Melinda
Bozó István
Testületi szerző: Conference of PhD Students in Computer Science (12.) (2020) (Szeged)
Dokumentumtípus: Cikk
Megjelent: University of Szeged, Institute of Informatics Szeged 2021
Sorozat:Acta cybernetica 25 No. 2
Kulcsszavak:Programozás
Tárgyszavak:
doi:10.14232/actacyb.289386

Online Access:http://acta.bibl.u-szeged.hu/75606
LEADER 01862nab a2200265 i 4500
001 acta75606
005 20220512140303.0
008 220512s2021 hu o 0|| eng d
022 |a 0324-721X 
024 7 |a 10.14232/actacyb.289386  |2 doi 
040 |a SZTE Egyetemi Kiadványok Repozitórium  |b hun 
041 |a eng 
100 2 |a Ciuciu-Kiss Jenifer Tabita 
245 1 0 |a Towards version controlling in RefactorErl  |h [elektronikus dokumentum] /  |c  Ciuciu-Kiss Jenifer Tabita 
260 |a University of Szeged, Institute of Informatics  |b Szeged  |c 2021 
300 |a 205-221 
490 0 |a Acta cybernetica  |v 25 No. 2 
520 3 |a Static source code analyser tools are operating on an intermediate representation of the source code that is usually a tree or a graph. Those representations need to be updated according to the different versions of the source code. However, the developers might be interested in the changes or might need information about previous versions, therefore, keeping different versions of the source code analysed by the tools are required. RefactorErl is an open-source static analysis and transformation tool for Erlang that uses a graph representation to store and manipulate the source code. The aim of our research was to create an extension of the Semantic Program Graph of RefactorErl that is able to store different versions of the source code in a single graph. The new method resulted in 30% memory footprint decrease compared to the available workaround solutions. 
650 4 |a Természettudományok 
650 4 |a Számítás- és információtudomány 
695 |a Programozás 
700 0 1 |a Tóth Melinda  |e aut 
700 0 1 |a Bozó István  |e aut 
710 |a Conference of PhD Students in Computer Science (12.) (2020) (Szeged) 
856 4 0 |u http://acta.bibl.u-szeged.hu/75606/1/cybernetica_025_numb_002_205-221.pdf  |z Dokumentum-elérés