{"title":"Defining the syntax of extensible languages","authors":"L. Reis, V. O. D. Iorio, R. Bigonha","doi":"10.1145/2554850.2554898","DOIUrl":"https://doi.org/10.1145/2554850.2554898","url":null,"abstract":"The interest in Domain-Specific Languages (DSLs) has been increasing as a way of improving the productivity and read-ability of software. Some modern extensible languages offer facilities for building modular specifications for extensions, so they may be considered an interesting option for implementing domain specific languages. But there are at least two disadvantages that currently affect most extensible languages. First, their syntax is usually defined informally, because there is a lack of formal tools for the definition of extensible languages. Second, extensible languages are usually implemented in an ad-hoc and inefficient way. In this paper, we show how the syntax of extensible languages like Fortress and SugarJ can be formally defined using a novel model designated Adaptable Parsing Expression Grammars (APEG). The formal definitions of the languages help clarifying many aspects of their syntax. We also use an interpreter of the APEG model to parse programs of the languages, showing that the model can be used in practice to implement parsers for extensible languages.","PeriodicalId":285655,"journal":{"name":"Proceedings of the 29th Annual ACM Symposium on Applied Computing","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115605804","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}
{"title":"Predicting change propagation impacts in collaborative business processes","authors":"W. Fdhila, S. Rinderle-Ma","doi":"10.1145/2554850.2554966","DOIUrl":"https://doi.org/10.1145/2554850.2554966","url":null,"abstract":"During the life cycle of a Business-to-Business (B2B) collaboration, companies may need to redesign or change parts of their service orchestrations. A change request proposed by one partner will, in most cases, result in changes to other partner orchestration. An accurate prediction of the behavior of a change request and an analysis of its impacts on the collaboration allows to avoid significant costs related to unsuccessful propagation, e.g. negotiation fail. This paper focuses on predicting the likelihood of a change request propagation as well as its ripple effects on the overall collaboration. To estimate these values, the approach analyses the collaboration structure through a priori analysis. We will show how the prediction models can be specified and implemented within a proof-of-concept prototype. Discussion will be provided on visualization possibilities and model validation.","PeriodicalId":285655,"journal":{"name":"Proceedings of the 29th Annual ACM Symposium on Applied Computing","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115665813","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}
Ruizhi Gao, J. Eo, W. E. Wong, Xinwei Gao, Shou-Yu Lee
{"title":"An empirical study of requirements-based test generation on an automobile control system","authors":"Ruizhi Gao, J. Eo, W. E. Wong, Xinwei Gao, Shou-Yu Lee","doi":"10.1145/2554850.2554934","DOIUrl":"https://doi.org/10.1145/2554850.2554934","url":null,"abstract":"Requirements-based test generation techniques have been widely used in industry to help practitioners generate appropriate test cases to ensure that their software systems behave according to customer expectations. These tests provide a solid foundation for functional testing -- a critical, essential step that must be performed properly for quality assurance of any software system. In this paper, we present a study, in collaboration with Hyundai Motor Company, on a real-life industrial software system used to control the driver's demand torque of an automobile. Since any hazardous incident caused by this mechanism may result in significant property loss or even fatalities, its safe and reliable operation becomes absolutely imperative. To overcome this problem, we propose a framework including different requirements-based test generation techniques such as equivalence class partitioning (ECP), boundary value analysis (BVA), a choice relation framework, and predicate testing-based BOR, BRO, and BRE strategies. In addition, a tool named C-Set has been developed to support the BOR, BRO and BRE-based automatic test generation. Results from our study indicate that weaknesses in any of the above techniques can be mitigated by exploiting the strengths of the other techniques. As a result, a set of high quality test cases for the software being studied can be efficiently generated to help Hyundai engineers improve their productivity.","PeriodicalId":285655,"journal":{"name":"Proceedings of the 29th Annual ACM Symposium on Applied Computing","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115793010","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}
W. Watanabe, R. J. Geraldo, Renata Pontin de Mattos Fortes
{"title":"Keyboard navigation mechanisms in tab widgets: an investigation on ARIA's conformance","authors":"W. Watanabe, R. J. Geraldo, Renata Pontin de Mattos Fortes","doi":"10.1145/2554850.2554947","DOIUrl":"https://doi.org/10.1145/2554850.2554947","url":null,"abstract":"This study presents an investigation on how keyboard accessibility has been delivered in RIA - Rich Internet Applications. We conducted an evaluation on 32 websites which contained Tab Widgets, from the 150 websites of Alexa's top most accessed websites list. The evaluation process consisted of checking if the Widgets implemented ARIA - Accessible Rich Internet Applications requirements, like the use of role/state semantic attributes and presentation of keyboard interaction strategies. The results showed that, even though the ARIA specification achieved the status of W3C Candidate Recommendation in 2011, few websites implemented Tab Widgets according to ARIA in the Web. The study also identified alternative keyboard navigation mechanisms that are accessible to Assistive Technologies users, despite the disadvantages they might represent.","PeriodicalId":285655,"journal":{"name":"Proceedings of the 29th Annual ACM Symposium on Applied Computing","volume":"234 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114814966","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}
{"title":"An I/O scheduler based on fine-grained access patterns to improve SSD performance and lifespan","authors":"Mingyang Wang, Yimin Hu","doi":"10.1145/2554850.2554971","DOIUrl":"https://doi.org/10.1145/2554850.2554971","url":null,"abstract":"Although the many benefits delivered by Solid State Disks (SSDs), they also pose some unique and serious challenges to I/O and file system designers. Unlike HDDs and other memory devices, SSDs cannot perform in-place updates. A block has to be erased before it can be re-written. Moreover, the costs of different SSD operations are highly asymmetric. A write operation in an SSD is an order of magnitude slower than a read operation, and an erase operation is in turn an order of magnitude slower than a write. Moreover, a block can endure only a limited number of erasures before it wears out. Most SSDs employ a log-structured Flash-Translation-Layer (FTL) to solve the not-in-place update problem. The unique operations of the FTLs, together with the asymmetric overheads of different operations, imply that many traditional solutions optimized for HDDs do not work well for SSDs. For example, sequential writes that are not perfectly aligned to the flash block boundary, may reduce performance and increase wearing overhead. In this paper, we proposed a novel I/O scheduler which is based on fine-grained access patterns in a per-process per-stream manner. These patterns are used to guide a set of novel scheduling policies, including pre-alignment, inner-padding, write merging, merging-and-splitting, to improve the write performance of SSDs that adopt log-structured FTLs. Simulation results show that these policies can improve write performance by up to 60%. Moreover, the schemes reduce SSD erasure cycle by up to 64%, which is directly translated to a major improvement on the lifespan of SSDs.","PeriodicalId":285655,"journal":{"name":"Proceedings of the 29th Annual ACM Symposium on Applied Computing","volume":"601 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116307612","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}
{"title":"Transformation approach from KAOS goal models to BPMN models using refinement patterns","authors":"Hiroki Horita, Kozo Honda, Y. Sei, Hiroyuki Nakagawa, Yasuyuki Tahara, Akihiko Ohsuga","doi":"10.1145/2554850.2555119","DOIUrl":"https://doi.org/10.1145/2554850.2555119","url":null,"abstract":"It is important to make sure that software satisfies stakeholders' requirements. However, as software has been getting more large-scale and complicated in recent years, it has certainly become more difficult to satisfy requirements. Even if there are goal-oriented requirements analysis approaches as techniques to systematically satisfy stakeholders' requirements, it is still difficult to maintain consistency of goal models and other requirements artifacts. In this paper, we propose a transformation approach that transforms models of KAOS, a well-known goal modeling methodology, into preliminary BPMN models by using refinement pattern of KAOS in a systematic way. It can assure consistency between systematically defined user's requirements and their realization process.","PeriodicalId":285655,"journal":{"name":"Proceedings of the 29th Annual ACM Symposium on Applied Computing","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116394440","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}
{"title":"A CUDA-based implementation of OpenGL-compatible rasterization library prototype","authors":"Young Chun Kwon, Nakhoon Baek","doi":"10.1145/2554850.2559922","DOIUrl":"https://doi.org/10.1145/2554850.2559922","url":null,"abstract":"Traditional 3D graphics pipelines have been mostly implemented as fixed-function special-purpose hardware chips. Recently, introducing programmable graphics pipelines, there was dramatic changes in their implementations. Additionally, introducing general purpose GPUs (graphics processing units), we got parallel computing pipelines such as CUDA and OpenCL, based on the parallel processing facilities of those GPUs. In this paper, we aimed to implement a full-software 3D graphics pipeline on those parallel computing pipelines, to finally show that the new full-software implementation can substitute the traditional graphics pipelines. In the previous work [1], they implemented the 3D rasterization engine on the CUDA architecture, for some special applications. Based on that CUDA-based 3D rasterization engine, we added the OpenGL 1.2-specific API (application program interface) functions, to build up a source-level compatible 3D graphics library for existing OpenGL graphics application programs. In near future, we will implement a wholly new OpenGL graphics library features on the CUDA pipeline. Those efforts are focused on the demonstration of feasibility for the unification of 3D graphics pipelines and parallel computing pipelines. We expect that this unification will give us remarkable advances in the future graphics hardware design.","PeriodicalId":285655,"journal":{"name":"Proceedings of the 29th Annual ACM Symposium on Applied Computing","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123575809","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}
{"title":"XIS-mobile: a DSL for mobile applications","authors":"André Ribeiro, A. Silva","doi":"10.1145/2554850.2554926","DOIUrl":"https://doi.org/10.1145/2554850.2554926","url":null,"abstract":"Mobile applications are becoming increasingly more present in our daily life, allowing people to perform several tasks through the use of smartphones or tablets. Despite fostering the innovation, the rapid growth of the mobile market resulted in some fragmentation of the mobile platforms. The existence of different mobile operating systems with different programming languages and tools can be a problem when someone wants to release an application in multiple platforms. Rewriting the application for each platform is usually impracticable either in terms of budget or time, requiring a great effort. Therefore, a solution that could generate cross-platform applications without compromising the quality, would decrease the time to market and increase the number of potential users. This paper presents the XIS-Mobile language, defined as a UML profile in the context of the Sparx Systems Enterprise Architect, and discusses its main challenges and benefits in the context of the cross-platform mobile application development.","PeriodicalId":285655,"journal":{"name":"Proceedings of the 29th Annual ACM Symposium on Applied Computing","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117124930","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}
{"title":"Feature description based on center-symmetric local mapped patterns","authors":"C. T. Ferraz, Osmando Pereira, A. Gonzaga","doi":"10.1145/2554850.2554895","DOIUrl":"https://doi.org/10.1145/2554850.2554895","url":null,"abstract":"Local feature description has gained a lot of interest in many applications, such as texture recognition, image retrieval and face recognition. This paper presents a novel method for local feature description based on gray-level difference mapping, called Center-Symmetric Local Mapped Pattern (CS-LMP). The proposed descriptor is invariant to image scale, rotation, illumination and partial viewpoint changes. Furthermore, this descriptor more effectively captures the nuances of the image pixels. The training set is composed of rotated and scaled images, with changes in illumination and view points. The test set is composed of rotated and scaled images. In our experiments, the descriptor is compared to the Center-Symmetric Local Binary Pattern (CS-LBP). The results show that our descriptor performs favorably compared to the CS-LBP.","PeriodicalId":285655,"journal":{"name":"Proceedings of the 29th Annual ACM Symposium on Applied Computing","volume":"35 15","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120857894","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}
{"title":"Performance analysis of the golden-SM in the V2V network","authors":"Myung-Chul Park, D. Han","doi":"10.1145/2554850.2559916","DOIUrl":"https://doi.org/10.1145/2554850.2559916","url":null,"abstract":"This paper shows that golden code spatial modulation (Golden-SM) improves the performance of bandwidth efficiency and reception in vehicle-to-vehicle (V2V) networks. The conventional multi-input multi-output (MIMO) scheme, space-time block code (STBC), increases the reception performance in correlated channel but cannot increase the bandwidth efficiency since it transmits two symbols during two symbol duration. SM increases the reception performance in correlated channel, and golden code increases the bandwidth efficiency since it transmits four symbols during two symbol duration. Therefore, the simulation shows Golden-SM scheme has better performance than STBC in V2V network channels which have Rician channel properties with correlation between transmit antennas.","PeriodicalId":285655,"journal":{"name":"Proceedings of the 29th Annual ACM Symposium on Applied Computing","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124069494","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}