Domain-specific languages (DSLs) are high level languages defined for combining expressivity and simplicity by means of constructs which are close to the problem domain and distant from the intricacies of underlying software implementation constraints. This paper presents a language to graphically document the analysis and design decisions embodied in collaborative system development. The language was designed as a conservative extension of the UML and it enables the application of the MDD approach to the development of such systems.
{"title":"A Domain Specific Language for the Development of Collaborative Systems","authors":"Luis Mariano Bibbo, Diego García, C. Pons","doi":"10.1109/SCCC.2008.12","DOIUrl":"https://doi.org/10.1109/SCCC.2008.12","url":null,"abstract":"Domain-specific languages (DSLs) are high level languages defined for combining expressivity and simplicity by means of constructs which are close to the problem domain and distant from the intricacies of underlying software implementation constraints. This paper presents a language to graphically document the analysis and design decisions embodied in collaborative system development. The language was designed as a conservative extension of the UML and it enables the application of the MDD approach to the development of such systems.","PeriodicalId":415835,"journal":{"name":"2008 International Conference of the Chilean Computer Science Society","volume":"696 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122982739","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}
Asynchronous data communication mechanisms (ACMs) have been extensively studied as data connectors between independently timed concurrent processes. In this work an automatic method for synthesis of re-reading ACMs is introduced. This method is is oriented to the generation of hardware artifacts. The behavior of re-reading ACMs is formally defined and the correctness properties are discussed. Then it is shown how to generate the ACMs specifications and how they can be translated into a proper hardware implementation. Verilog has been used as the target language to describe the hardware being synthesized.
{"title":"Hardware Synthesis for Asynchronous Communications Mechanisms","authors":"K. Gorgônio, J. Cortadella","doi":"10.1109/SCCC.2008.21","DOIUrl":"https://doi.org/10.1109/SCCC.2008.21","url":null,"abstract":"Asynchronous data communication mechanisms (ACMs) have been extensively studied as data connectors between independently timed concurrent processes. In this work an automatic method for synthesis of re-reading ACMs is introduced. This method is is oriented to the generation of hardware artifacts. The behavior of re-reading ACMs is formally defined and the correctness properties are discussed. Then it is shown how to generate the ACMs specifications and how they can be translated into a proper hardware implementation. Verilog has been used as the target language to describe the hardware being synthesized.","PeriodicalId":415835,"journal":{"name":"2008 International Conference of the Chilean Computer Science Society","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129125724","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}
In this paper, we present an experimental study of a framework for construction of graphical interfaces, conducted from the perspective of a tool of quality, the PDCA cycle. The steps related to the implementation of an experimental study, since its planning until the analysis of results are described. The paper aims to show how the PDCA can be used to provide continuous improvement in the conduct of experiments.
{"title":"An Experimental Study of the FIB Framework Driven by the PDCA Cycle","authors":"A. Chaves, G. C. L. Leal, E. Huzita","doi":"10.1109/SCCC.2008.10","DOIUrl":"https://doi.org/10.1109/SCCC.2008.10","url":null,"abstract":"In this paper, we present an experimental study of a framework for construction of graphical interfaces, conducted from the perspective of a tool of quality, the PDCA cycle. The steps related to the implementation of an experimental study, since its planning until the analysis of results are described. The paper aims to show how the PDCA can be used to provide continuous improvement in the conduct of experiments.","PeriodicalId":415835,"journal":{"name":"2008 International Conference of the Chilean Computer Science Society","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122409352","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}
In this paper we present a scheduling algorithm that assigns tasks of medium size grain. The behavior of the proposed algorithm, called extended latency time (ELT), is compared with the dominant sequence clustering (DSC) algorithm. One of the inputs values required by the ELT algorithm is the maximum number of processors available in the architecture. This value corresponds to the number of processors used by DSC for the same DAG (directed acyclic graph), but ELT uses no more processors than necessary. Although ELT algorithm was specifically designed for assigning fine grained DAGs, results show that the number of processors used by ELT for the assignment of medium grained DAGs is, at most, the same number as used by DSC. When comparing the results for each algorithm in terms of average CPU use, the proposed ELT algorithm is superior in 100% of the cases, so that the performance in terms of CPU use is always lower for DSC.
{"title":"A Scheduling Algorithm to Optimize Parallel Processes","authors":"M. Solar","doi":"10.1109/SCCC.2008.8","DOIUrl":"https://doi.org/10.1109/SCCC.2008.8","url":null,"abstract":"In this paper we present a scheduling algorithm that assigns tasks of medium size grain. The behavior of the proposed algorithm, called extended latency time (ELT), is compared with the dominant sequence clustering (DSC) algorithm. One of the inputs values required by the ELT algorithm is the maximum number of processors available in the architecture. This value corresponds to the number of processors used by DSC for the same DAG (directed acyclic graph), but ELT uses no more processors than necessary. Although ELT algorithm was specifically designed for assigning fine grained DAGs, results show that the number of processors used by ELT for the assignment of medium grained DAGs is, at most, the same number as used by DSC. When comparing the results for each algorithm in terms of average CPU use, the proposed ELT algorithm is superior in 100% of the cases, so that the performance in terms of CPU use is always lower for DSC.","PeriodicalId":415835,"journal":{"name":"2008 International Conference of the Chilean Computer Science Society","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133659959","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}
F. Galera, J. A. Martínez, M. A. Sanchis, A. Gómez-Skarmeta
During the last years, peer to peer (P2P) networks are becoming more and more popular because of their inherent properties that allow users to exchange information and also to collaborate between them with a tremendous easiness.In parallel to this evolution, the use of MANETs has been increased due to the low effort needed to their deployment.Nowadays every user equipped with a mobile device like a laptop or a PDA could create an ad-hoc network just configuring their wireless device. Thus, users without any infrastructure can connect to others. Using P2P platforms upon these kind of network will allow users to collaborate and exchange information. However the mayor application area of these P2P platforms is still the fixed network.This paper presents a new architecture for a collaborative working environment especially designed for MANETs solving the main drawbacks of other P2P platforms designed for static wired networks with the requirement of a high bandwidth. Our approach is based on clustering MANETs allowing efficient communication among nearby nodes without impairment of distant peers connectivity.
{"title":"Design of a Cluster-Based Peer to Peer Architecture for MANETs","authors":"F. Galera, J. A. Martínez, M. A. Sanchis, A. Gómez-Skarmeta","doi":"10.1109/SCCC.2008.25","DOIUrl":"https://doi.org/10.1109/SCCC.2008.25","url":null,"abstract":"During the last years, peer to peer (P2P) networks are becoming more and more popular because of their inherent properties that allow users to exchange information and also to collaborate between them with a tremendous easiness.In parallel to this evolution, the use of MANETs has been increased due to the low effort needed to their deployment.Nowadays every user equipped with a mobile device like a laptop or a PDA could create an ad-hoc network just configuring their wireless device. Thus, users without any infrastructure can connect to others. Using P2P platforms upon these kind of network will allow users to collaborate and exchange information. However the mayor application area of these P2P platforms is still the fixed network.This paper presents a new architecture for a collaborative working environment especially designed for MANETs solving the main drawbacks of other P2P platforms designed for static wired networks with the requirement of a high bandwidth. Our approach is based on clustering MANETs allowing efficient communication among nearby nodes without impairment of distant peers connectivity.","PeriodicalId":415835,"journal":{"name":"2008 International Conference of the Chilean Computer Science Society","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115670580","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}
Jaime A. Pavlich-Mariscal, S. Demurjian, L. Michel
This paper proposes an approach for secure software design and coding; and, it provides a formal underpinning for security assurance, i.e., a proof that the generated code correctly realizes security specifications. The base of the proposed approach is a set of security features by J. Pavlich-Mariscal et al (2007) that separate security concerns from the main design. To create specific access control models, designers can select the features they require, compose them, and represent them through security diagrams, i.e., extensions to UML to represent security concerns. These security specifications are then transitioned into aspect-oriented enforcement code. To provide security assurance, this paper formalizes the application behavior using labeled transition systems and structural operational semantics; and it uses simulation relations to demonstrate the correctness of the secure code.
{"title":"A Framework of Composable Access Control Definition, Enforcement and Assurance","authors":"Jaime A. Pavlich-Mariscal, S. Demurjian, L. Michel","doi":"10.1109/SCCC.2008.18","DOIUrl":"https://doi.org/10.1109/SCCC.2008.18","url":null,"abstract":"This paper proposes an approach for secure software design and coding; and, it provides a formal underpinning for security assurance, i.e., a proof that the generated code correctly realizes security specifications. The base of the proposed approach is a set of security features by J. Pavlich-Mariscal et al (2007) that separate security concerns from the main design. To create specific access control models, designers can select the features they require, compose them, and represent them through security diagrams, i.e., extensions to UML to represent security concerns. These security specifications are then transitioned into aspect-oriented enforcement code. To provide security assurance, this paper formalizes the application behavior using labeled transition systems and structural operational semantics; and it uses simulation relations to demonstrate the correctness of the secure code.","PeriodicalId":415835,"journal":{"name":"2008 International Conference of the Chilean Computer Science Society","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132458073","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
扫码关注我们
求助内容：
应助结果提醒方式：