Pub Date : 2021-10-25DOI: 10.1109/CLEI53233.2021.9640192
Marcelo Bruno, Pablo Ibañez, Tamara Techera, Daniel Calegari, Gustavo Betarte
Web applications are permanently being exposed to attacks that exploit their vulnerabilities. To detect and prevent misuse of the functionality provided by an application, it has become necessary to develop techniques that help discern between a valid user of the system and a malicious agent. In recent years, a technology that has been widely deployed to provide automated and non-invasive support for detecting web application attacks is Web Application Firewalls. In this work, we put forward and discuss the application of Process Mining techniques to detect deviations from the expected behavior of web applications. The objects of behavior analysis are logs generated by a widely deployed WAF called ModSecurity. We discuss experiments we have carried out applying our mining method on the well-known e-commerce platform Magento and using the ProM tool for the execution of the process mining techniques.
{"title":"Exploring the Application of Process Mining Techniques to Improve Web Application Security","authors":"Marcelo Bruno, Pablo Ibañez, Tamara Techera, Daniel Calegari, Gustavo Betarte","doi":"10.1109/CLEI53233.2021.9640192","DOIUrl":"https://doi.org/10.1109/CLEI53233.2021.9640192","url":null,"abstract":"Web applications are permanently being exposed to attacks that exploit their vulnerabilities. To detect and prevent misuse of the functionality provided by an application, it has become necessary to develop techniques that help discern between a valid user of the system and a malicious agent. In recent years, a technology that has been widely deployed to provide automated and non-invasive support for detecting web application attacks is Web Application Firewalls. In this work, we put forward and discuss the application of Process Mining techniques to detect deviations from the expected behavior of web applications. The objects of behavior analysis are logs generated by a widely deployed WAF called ModSecurity. We discuss experiments we have carried out applying our mining method on the well-known e-commerce platform Magento and using the ProM tool for the execution of the process mining techniques.","PeriodicalId":6803,"journal":{"name":"2021 XLVII Latin American Computing Conference (CLEI)","volume":"16 1","pages":"1-10"},"PeriodicalIF":0.0,"publicationDate":"2021-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77101032","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-10-25DOI: 10.1109/CLEI53233.2021.9639900
Christian D. Pérez-López, Luis M. Soto-Bovó, José Colbes, D. Pinto
Elastic Optical Networks (EON) are a considerably new technology and have a promising future due to their fast speed, flexibility, and spectrum efficiency. The main point to consider in EON networks is the routing and spectrum assignment (RSA), an NP-complete problem. This work focuses on cases where there is semi-dynamic traffic with variable bandwidth. Initially, we broadly study techniques already proposed to face this problem, focusing on the best use of the spectrum and thus avoid spectrum reassignment, which will be the main objective of this work. This work proposes two promissory algorithms based on Artificial Bee Colony (ABC) and Bee Colony Optimization (BCO) with the encoding of bee based on routing and permutation. For both encodings, we use Fixed Alternative Routing and Mid-Fit and First-Fit spectrum assignment. Various and extensive simulations were conducted with different traffic loads and network topologies considering blocking probability and entropy measures. The efficiency of the algorithms varies according to the topologies. In general terms, routing-based ABC had better results in larger topologies, while permutation-based BCO having outstanding results in smaller topologies. Still, it does not have good results in the same way for larger topologies.
{"title":"Semi-dynamic Routing and Spectrum Assignment with variable bandwidth in Elastic Optical Networks. Bee-inspired Algorithms approach","authors":"Christian D. Pérez-López, Luis M. Soto-Bovó, José Colbes, D. Pinto","doi":"10.1109/CLEI53233.2021.9639900","DOIUrl":"https://doi.org/10.1109/CLEI53233.2021.9639900","url":null,"abstract":"Elastic Optical Networks (EON) are a considerably new technology and have a promising future due to their fast speed, flexibility, and spectrum efficiency. The main point to consider in EON networks is the routing and spectrum assignment (RSA), an NP-complete problem. This work focuses on cases where there is semi-dynamic traffic with variable bandwidth. Initially, we broadly study techniques already proposed to face this problem, focusing on the best use of the spectrum and thus avoid spectrum reassignment, which will be the main objective of this work. This work proposes two promissory algorithms based on Artificial Bee Colony (ABC) and Bee Colony Optimization (BCO) with the encoding of bee based on routing and permutation. For both encodings, we use Fixed Alternative Routing and Mid-Fit and First-Fit spectrum assignment. Various and extensive simulations were conducted with different traffic loads and network topologies considering blocking probability and entropy measures. The efficiency of the algorithms varies according to the topologies. In general terms, routing-based ABC had better results in larger topologies, while permutation-based BCO having outstanding results in smaller topologies. Still, it does not have good results in the same way for larger topologies.","PeriodicalId":6803,"journal":{"name":"2021 XLVII Latin American Computing Conference (CLEI)","volume":"56 1","pages":"1-10"},"PeriodicalIF":0.0,"publicationDate":"2021-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86030319","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-10-25DOI: 10.1109/CLEI53233.2021.9639932
Mathias Zavala, Benjamín Barán
Quantum key distribution has been the focus of an important number of studies due to benefits that a widespread adoption would bring to the ever-changing technological world. For this reason, an effective way to organize the available literature on the topic so as to identify key components as well as open challenges, is needed. The present work, upon analyzing the literature, proposes a taxonomy which tackles two different approaches, one being theory-focused whereas the other considers a practical scenario with the purpose of providing an overview of the structure followed. Furthermore, after a description of the well-known BB84 protocol, a brief review of some advancements is provided. Finally, the proposed taxonomy is utilized to classify related works, bringing to light some of the open challenges that are yet to be fully developed.
{"title":"QKD BB84. A Taxonomy","authors":"Mathias Zavala, Benjamín Barán","doi":"10.1109/CLEI53233.2021.9639932","DOIUrl":"https://doi.org/10.1109/CLEI53233.2021.9639932","url":null,"abstract":"Quantum key distribution has been the focus of an important number of studies due to benefits that a widespread adoption would bring to the ever-changing technological world. For this reason, an effective way to organize the available literature on the topic so as to identify key components as well as open challenges, is needed. The present work, upon analyzing the literature, proposes a taxonomy which tackles two different approaches, one being theory-focused whereas the other considers a practical scenario with the purpose of providing an overview of the structure followed. Furthermore, after a description of the well-known BB84 protocol, a brief review of some advancements is provided. Finally, the proposed taxonomy is utilized to classify related works, bringing to light some of the open challenges that are yet to be fully developed.","PeriodicalId":6803,"journal":{"name":"2021 XLVII Latin American Computing Conference (CLEI)","volume":"16 1","pages":"1-10"},"PeriodicalIF":0.0,"publicationDate":"2021-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89172593","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-10-25DOI: 10.1109/CLEI53233.2021.9640017
Alfonso Vicente, Lorena Etcheverry, Ariel Sabiguero
Multi-tier architectures have been the de facto standard for web applications, leaving little room for alternative solutions. Despite this, there is diversity in the proposals, especially in the tiers' number, size, and responsibilities. In particular, the database-centric approach aims to implement application logic and behavior within an RDBMS. In this work, we present, model, and propose to extend the database-centric approach into an RDBMS-only architecture, where the whole multi-tiered application is implemented in the database server. We present a characterization and description of the architecture and an early prototype that implements the proposal. It is important to note that both the database-centric and the proposed RDBMS-only architectures are a particular case of a three-layered model that needs to be differentiated from monolithic systems. Our preliminary results show that this approach is not only feasible but also advisable in some cases.
{"title":"An RDBMS-only architecture for web applications","authors":"Alfonso Vicente, Lorena Etcheverry, Ariel Sabiguero","doi":"10.1109/CLEI53233.2021.9640017","DOIUrl":"https://doi.org/10.1109/CLEI53233.2021.9640017","url":null,"abstract":"Multi-tier architectures have been the de facto standard for web applications, leaving little room for alternative solutions. Despite this, there is diversity in the proposals, especially in the tiers' number, size, and responsibilities. In particular, the database-centric approach aims to implement application logic and behavior within an RDBMS. In this work, we present, model, and propose to extend the database-centric approach into an RDBMS-only architecture, where the whole multi-tiered application is implemented in the database server. We present a characterization and description of the architecture and an early prototype that implements the proposal. It is important to note that both the database-centric and the proposed RDBMS-only architectures are a particular case of a three-layered model that needs to be differentiated from monolithic systems. Our preliminary results show that this approach is not only feasible but also advisable in some cases.","PeriodicalId":6803,"journal":{"name":"2021 XLVII Latin American Computing Conference (CLEI)","volume":"4 1","pages":"1-9"},"PeriodicalIF":0.0,"publicationDate":"2021-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90088311","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-10-25DOI: 10.1109/CLEI53233.2021.9640062
Rosiane de Freitas, Elton Lever, Raquel Folz, Yuri Gagarin Soares, Fábio Pimentel, M. Salvatierra
The Gangal-Ranade algorithm presents the best approximation ratio for the classic scheduling problem with unit execution time and precedence constrained jobs, on a variable number of identical parallel machines, to minimize the makespan. This work presents results about the optimality of the algorithm when the acyclic directed graph (DAG) that represents the precedence constraints are arborescences (directed trees, in-tree and out-tree), reinforcing that these types of DAGs provide optimal substructures for the problem. Understanding the behavior of this algorithm for classes of arborescences can lead to optimality or better approximations for classes of larger DAGs, which is our ongoing research work. Furthermore, the search for optimal cases for algorithms such as Gangal-Ranade can provide intuition to obtain partial answers to problems that remain open, such as the famous Open 8 in the list presented in the classical Garey and Johnson book.
{"title":"Optimal scheduling of arborescences using the Gangal-Ranade algorithm","authors":"Rosiane de Freitas, Elton Lever, Raquel Folz, Yuri Gagarin Soares, Fábio Pimentel, M. Salvatierra","doi":"10.1109/CLEI53233.2021.9640062","DOIUrl":"https://doi.org/10.1109/CLEI53233.2021.9640062","url":null,"abstract":"The Gangal-Ranade algorithm presents the best approximation ratio for the classic scheduling problem with unit execution time and precedence constrained jobs, on a variable number of identical parallel machines, to minimize the makespan. This work presents results about the optimality of the algorithm when the acyclic directed graph (DAG) that represents the precedence constraints are arborescences (directed trees, in-tree and out-tree), reinforcing that these types of DAGs provide optimal substructures for the problem. Understanding the behavior of this algorithm for classes of arborescences can lead to optimality or better approximations for classes of larger DAGs, which is our ongoing research work. Furthermore, the search for optimal cases for algorithms such as Gangal-Ranade can provide intuition to obtain partial answers to problems that remain open, such as the famous Open 8 in the list presented in the classical Garey and Johnson book.","PeriodicalId":6803,"journal":{"name":"2021 XLVII Latin American Computing Conference (CLEI)","volume":"31 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2021-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81047569","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-10-25DOI: 10.1109/CLEI53233.2021.9640094
Diego Kiedanski, P. Rodríguez-Bocca
In this paper, we study the impact of data complexity and data quality in the overlapping community detection problem. We show that community detection algorithms are very unstable against incomplete or erroneous data, and this result is consistent with all the evaluated performance metrics. We verify it using three quality metrics (F1, NMI, and Omega) when the ground-truth community structure is known, in four very popular and representative detection algorithms: Order Statistics Local Optimization Method (OSLOM), Greedy Clique Expansion (GCE) algorithm, Speaker-listener Label Propagation Algorithm (SLPA), and Cluster Affiliation Model for Big Networks (BIG-CLAM). We evaluate it over a set of real instances that arise from detecting the courses that belong to different careers (degrees) of an engineering University, and over large benchmark sets of synthetic instances frequently used in the literature.
{"title":"Instability of clustering metrics in overlapping community detection algorithms","authors":"Diego Kiedanski, P. Rodríguez-Bocca","doi":"10.1109/CLEI53233.2021.9640094","DOIUrl":"https://doi.org/10.1109/CLEI53233.2021.9640094","url":null,"abstract":"In this paper, we study the impact of data complexity and data quality in the overlapping community detection problem. We show that community detection algorithms are very unstable against incomplete or erroneous data, and this result is consistent with all the evaluated performance metrics. We verify it using three quality metrics (F1, NMI, and Omega) when the ground-truth community structure is known, in four very popular and representative detection algorithms: Order Statistics Local Optimization Method (OSLOM), Greedy Clique Expansion (GCE) algorithm, Speaker-listener Label Propagation Algorithm (SLPA), and Cluster Affiliation Model for Big Networks (BIG-CLAM). We evaluate it over a set of real instances that arise from detecting the courses that belong to different careers (degrees) of an engineering University, and over large benchmark sets of synthetic instances frequently used in the literature.","PeriodicalId":6803,"journal":{"name":"2021 XLVII Latin American Computing Conference (CLEI)","volume":"31 1","pages":"1-11"},"PeriodicalIF":0.0,"publicationDate":"2021-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88888666","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-10-25DOI: 10.1109/CLEI53233.2021.9639942
Gerardo Matturro, Gonzalo Nieto, Alfonso González, Martín Solari
A software startup is an emerging company focused on the creation and development of an innovative software-intensive product or service as the basis for creating business value. Given the limited resources that startups have, the Lean Startup model advocates the creation of a Minimum Viable Product (MVP) to validate the assumptions about the product or service, and the target market. This study presents the results of a series of interviews with founders of software ventures in relation to the type of MVP they implement, the choice of potential clients, validation mechanisms and difficulties they face in the process of developing and validating the MVP. The main results indicate that the preferred MVP types are landing pages and mock-ups with some functionalities, validation with selected early adopters, obtaining feedback based on interviews and comments, and that the main difficulties encountered are due to lack of experience in software development and in choosing the right technology.
{"title":"Minimum Viable Product Creation and Validation in Software Startups","authors":"Gerardo Matturro, Gonzalo Nieto, Alfonso González, Martín Solari","doi":"10.1109/CLEI53233.2021.9639942","DOIUrl":"https://doi.org/10.1109/CLEI53233.2021.9639942","url":null,"abstract":"A software startup is an emerging company focused on the creation and development of an innovative software-intensive product or service as the basis for creating business value. Given the limited resources that startups have, the Lean Startup model advocates the creation of a Minimum Viable Product (MVP) to validate the assumptions about the product or service, and the target market. This study presents the results of a series of interviews with founders of software ventures in relation to the type of MVP they implement, the choice of potential clients, validation mechanisms and difficulties they face in the process of developing and validating the MVP. The main results indicate that the preferred MVP types are landing pages and mock-ups with some functionalities, validation with selected early adopters, obtaining feedback based on interviews and comments, and that the main difficulties encountered are due to lack of experience in software development and in choosing the right technology.","PeriodicalId":6803,"journal":{"name":"2021 XLVII Latin American Computing Conference (CLEI)","volume":"68 1","pages":"1-8"},"PeriodicalIF":0.0,"publicationDate":"2021-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78623269","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-10-25DOI: 10.1109/CLEI53233.2021.9640056
Guillermo Calderón
We present a computer formalization of the problem known as affine reduction of a projective plane. The affine reduction (aka affinization) consists in the construction of an affine plane by removing a line of a projective plane. We work with a representation of von Plato axiom system of constructive geometry which allows the definition of affine and projective geometry as variants of a common structure called apartness geometry. The formalization is written in Agda, a functional programming language and proof-assistant based on the proposition-as-types paradigm. All mathematical definitions, propositions and proofs are constructed following the valid methods of constructive mathematics, and they are directly expressed in the language Agda. In addition to the description of a new formalization of an interesting mathematical problem, the paper can also contribute to introduce ideas about formalization of mathematics in type theory.
{"title":"Formalizing Affinization of a Projective Plane in Agda","authors":"Guillermo Calderón","doi":"10.1109/CLEI53233.2021.9640056","DOIUrl":"https://doi.org/10.1109/CLEI53233.2021.9640056","url":null,"abstract":"We present a computer formalization of the problem known as affine reduction of a projective plane. The affine reduction (aka affinization) consists in the construction of an affine plane by removing a line of a projective plane. We work with a representation of von Plato axiom system of constructive geometry which allows the definition of affine and projective geometry as variants of a common structure called apartness geometry. The formalization is written in Agda, a functional programming language and proof-assistant based on the proposition-as-types paradigm. All mathematical definitions, propositions and proofs are constructed following the valid methods of constructive mathematics, and they are directly expressed in the language Agda. In addition to the description of a new formalization of an interesting mathematical problem, the paper can also contribute to introduce ideas about formalization of mathematics in type theory.","PeriodicalId":6803,"journal":{"name":"2021 XLVII Latin American Computing Conference (CLEI)","volume":"79 1","pages":"1-8"},"PeriodicalIF":0.0,"publicationDate":"2021-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74811454","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-10-25DOI: 10.1109/CLEI53233.2021.9640035
Leibnitz-Pavel Rojas-Bustamante, Hugo Alatrista Salas, Miguel Núñez-del-Prado, Joseph Chamorro Gómez
International and domestic tourism supports the economic growth of countries. To better understand this activity, it is crucial to analyze it from different spatial granularity levels. In this work, networks were generated from data associated with money flow among departments, provinces, and districts. Later, these networks were used to build communities, and the tourist demand was estimated using a gravitational technique. Our findings provide essential information about how domestic tourists behave.
{"title":"Tourism Mobility Modeling based on Credit and Debit Card Transactions","authors":"Leibnitz-Pavel Rojas-Bustamante, Hugo Alatrista Salas, Miguel Núñez-del-Prado, Joseph Chamorro Gómez","doi":"10.1109/CLEI53233.2021.9640035","DOIUrl":"https://doi.org/10.1109/CLEI53233.2021.9640035","url":null,"abstract":"International and domestic tourism supports the economic growth of countries. To better understand this activity, it is crucial to analyze it from different spatial granularity levels. In this work, networks were generated from data associated with money flow among departments, provinces, and districts. Later, these networks were used to build communities, and the tourist demand was estimated using a gravitational technique. Our findings provide essential information about how domestic tourists behave.","PeriodicalId":6803,"journal":{"name":"2021 XLVII Latin American Computing Conference (CLEI)","volume":"157 1","pages":"1-8"},"PeriodicalIF":0.0,"publicationDate":"2021-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73936284","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-10-25DOI: 10.1109/CLEI53233.2021.9640144
Diego Camarmas-Alonso, Félix García Carballeira, Elías Del-Pozo-Puñal, A. Calderón
This article introduces CREATOR, a new generic simulator for assembly programming, developed by the ARCOS group at the UC3M. CREATOR is a new, highly intuitive, and portable simulator that runs from a web browser (no installation needed). This simulator comes with the MIPS32 and RISC-V (32IMF) instruction set. Nevertheless, CREATOR allows, from the simulator itself, to edit and define other instruction sets (instructions, format, registers, etc.). Even more, CREATOR allows the definition of the parameter passing convention to be used in the instruction set. Once each particular instruction set (MIPS32, ARM, RISCV, etc.) has been defined, students can use CREATOR to edit, compile, execute and debug programs written in the associated assembler. The simulator also allows checking that the developed programs comply with the parameter passing convention defined for the instruction set. CREATOR lets us create subroutine libraries that can be loaded and linked to other assembly programs developed in the simulator. All CREATOR features allows teacher to design and deploy practical laboratories more adapted to the desired teaching goals. That improves the teaching experience of the assembly language frequently used in different subjects such as Computer Architecture or Computer Structure. The experience of its use has been very positive in the past courses for students and teachers in both the Universidad Carlos III de Madrid (UC3M) and the Universidad Castilla la Mancha (UCLM).
{"title":"A new generic simulator for the teaching of assembly programming","authors":"Diego Camarmas-Alonso, Félix García Carballeira, Elías Del-Pozo-Puñal, A. Calderón","doi":"10.1109/CLEI53233.2021.9640144","DOIUrl":"https://doi.org/10.1109/CLEI53233.2021.9640144","url":null,"abstract":"This article introduces CREATOR, a new generic simulator for assembly programming, developed by the ARCOS group at the UC3M. CREATOR is a new, highly intuitive, and portable simulator that runs from a web browser (no installation needed). This simulator comes with the MIPS32 and RISC-V (32IMF) instruction set. Nevertheless, CREATOR allows, from the simulator itself, to edit and define other instruction sets (instructions, format, registers, etc.). Even more, CREATOR allows the definition of the parameter passing convention to be used in the instruction set. Once each particular instruction set (MIPS32, ARM, RISCV, etc.) has been defined, students can use CREATOR to edit, compile, execute and debug programs written in the associated assembler. The simulator also allows checking that the developed programs comply with the parameter passing convention defined for the instruction set. CREATOR lets us create subroutine libraries that can be loaded and linked to other assembly programs developed in the simulator. All CREATOR features allows teacher to design and deploy practical laboratories more adapted to the desired teaching goals. That improves the teaching experience of the assembly language frequently used in different subjects such as Computer Architecture or Computer Structure. The experience of its use has been very positive in the past courses for students and teachers in both the Universidad Carlos III de Madrid (UC3M) and the Universidad Castilla la Mancha (UCLM).","PeriodicalId":6803,"journal":{"name":"2021 XLVII Latin American Computing Conference (CLEI)","volume":"21 1","pages":"1-9"},"PeriodicalIF":0.0,"publicationDate":"2021-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87622127","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：