Journal of Computer Languages最新文献_第8页

Method name recommendation based on source code metrics 基于源代码度量的方法名称推荐

IF 2.2 3区计算机科学

Journal of Computer Languages Pub Date : 2023-01-01 DOI: 10.1016/j.cola.2022.101177

Saeed Parsa, Morteza Zakeri-Nasrabadi, Masoud Ekhtiarzadeh, Mohammad Ramezani

引用次数: 4

Preserving hand-drawn qualities in audiovisual performance through sketch-based interaction 通过基于草图的交互保留视听表演中的手绘品质

IF 2.2 3区计算机科学

Journal of Computer Languages Pub Date : 2023-01-01 DOI: 10.1016/j.cola.2022.101186

Samuelle Bourgault, Jennifer Jacobs

{"title":"Preserving hand-drawn qualities in audiovisual performance through sketch-based interaction","authors":"Samuelle Bourgault, Jennifer Jacobs","doi":"10.1016/j.cola.2022.101186","DOIUrl":"https://doi.org/10.1016/j.cola.2022.101186","url":null,"abstract":"<div><p>Live coding – the real-time procedural creation of audiovisual works – suggests opportunities to extend hand-drawn animation; however, existing live coding systems are incompatible with manual animation workflows. Manual input is not a primary datatype in existing live coding languages and live coding tools require using symbolic programming environments. We theorize that by applying direct manipulation to the domain of live coding, we can enable animators to create expressive mappings between hand-drawn animations and audio effects in realtime. We present Megafauna, a sketch-based system for audiovisual performance, informed by interviews with professional animators. Megafauna supports the integrated generation and control of hand-drawn animation and audio sequences by enabling animators to directly sketch mapping functions between animation frames and sound generators. We demonstrate the expressive potential of Megafauna by reproducing animated compositions from procedural and manual domains. We evaluate the opportunities of our approach for live production through an expert review of a performance piece created with Megafauna.</p></div>","PeriodicalId":48552,"journal":{"name":"Journal of Computer Languages","volume":"74 ","pages":"Article 101186"},"PeriodicalIF":2.2,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49875704","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A domain-specific language for structure manipulation in constraint system-based GUIs 用于在基于约束系统的gui中进行结构操作的领域特定语言

IF 2.2 3区计算机科学

Journal of Computer Languages Pub Date : 2023-01-01 DOI: 10.1016/j.cola.2022.101175

Knut Anders Stokke , Mikhail Barash , Jaakko Järvi

{"title":"A domain-specific language for structure manipulation in constraint system-based GUIs","authors":"Knut Anders Stokke , Mikhail Barash , Jaakko Järvi","doi":"10.1016/j.cola.2022.101175","DOIUrl":"https://doi.org/10.1016/j.cola.2022.101175","url":null,"abstract":"<div><p>A common frustration with programming Graphical User Interfaces (GUIs) is that features for manipulating structures, such as lists and trees, are limited, inconsistent, buggy, or even missing. Implementing complete and convenient sets of operations for inserting, removing, and reordering elements in such structures can be tedious and difficult: a structure that appears as one collection to the user can be implemented as several different data structures and a web of dependencies between them. Structural modifications require changes both to the GUI’s model and view, and possibly extraneous bookkeeping operations, such as adding and removing event handlers.</p><p>This paper introduces a DSL that helps programmers to implement a complete set of operations to structures displayed in GUIs. The programmer specifies structures and relations between elements in the structure. Concretely, the latter are definitions of methods for establishing and unestablishing relations. Operations that manipulate structures are specified as rules that control which relations should hold before and after a rule is applied. From these specifications, our tools generate an easy-to-use API for structure manipulation. We target constraint system-based Web GUIs: the DSL generates JavaScript and relies on dataflow constraint systems for expressing dependencies between elements in GUI structures. Our DSL gives tangible representations with well-defined operations for ad-hoc and incidental GUI structures.</p></div>","PeriodicalId":48552,"journal":{"name":"Journal of Computer Languages","volume":"74 ","pages":"Article 101175"},"PeriodicalIF":2.2,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49875707","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

A sensemaking analysis of API learning using React 使用React的API学习的语义分析

IF 2.2 3区计算机科学

Journal of Computer Languages Pub Date : 2023-01-01 DOI: 10.1016/j.cola.2022.101189

Caitlin Kelleher , Michelle Brachman

引用次数: 0

MoTrans-BDI: Leveraging the Beliefs-Desires-Intentions agent architecture for collaborative model transformation by example MoTrans-BDI:通过示例利用信念-愿望-意图代理体系结构进行协作模型转换

IF 2.2 3区计算机科学

Journal of Computer Languages Pub Date : 2023-01-01 DOI: 10.1016/j.cola.2022.101174

Ahmed Siabdelhadi , Abdelhafid Chadli , Hadda Cherroun , Abdelkader Ouared , Houari Sahraoui

{"title":"MoTrans-BDI: Leveraging the Beliefs-Desires-Intentions agent architecture for collaborative model transformation by example","authors":"Ahmed Siabdelhadi , Abdelhafid Chadli , Hadda Cherroun , Abdelkader Ouared , Houari Sahraoui","doi":"10.1016/j.cola.2022.101174","DOIUrl":"https://doi.org/10.1016/j.cola.2022.101174","url":null,"abstract":"<div><p>Due to the growing interest in model-driven system development techniques, the efficient design of automated model transformations between heterogeneous models has become a major challenge in software development. While a number of specialized languages have been proposed, aiming at specifying model transformations, there is currently no matured foundation for specifying transformations between such models that are based on designers/experts collaboration in order to propose a solution that satisfies users’ requirements and application constraints. This transformation process is a complex task and must emulate how designers and experts with different perspectives behave and reflect about model transformations. In this paper, we propose a framework based on a novel approach for the specification and design of model transformations called MoTrans-BDI, which leverages Evolutionary Multi-Agent System (EMAS) to simulate designers’ expertise for the transformation of models. Our approach is based on the Belief-Desire-Intention (BDI) agent model and the Contract Net Protocol where agents’ beliefs feed from a series of transformation examples. The emphasis of using the specific model is the opportunity to produce a target model that may be composed of parts from different experts’ designs. We first experimentally evaluate MoTrans-BDI on twelve handmade UML2REL model transformation problems. All types of agents are able to produce perfect target models compared to human experts’ collaboratively-produced target models. Second, we empirically evaluate MoTrans-BDI’s proposal in terms of response time on Star Schema Benchmark (SSB) queries. An application of MoTrans-BDI in the case of UML2REL transformation is performed to stress and highlight the transformation process steps.</p></div>","PeriodicalId":48552,"journal":{"name":"Journal of Computer Languages","volume":"74 ","pages":"Article 101174"},"PeriodicalIF":2.2,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49903349","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

PeachPie: Mature PHP to CLI compiler PeachPie：成熟的PHP到CLI编译器

IF 2.2 3区计算机科学

Journal of Computer Languages Pub Date : 2022-12-01 DOI: 10.1016/j.cola.2022.101152

Robert Husák , Jakub Míšek , Filip Zavoral , Jan Kofroň

引用次数: 0

COMORP: Rapid prototyping for mathematical database cost models development COMORP：用于数学数据库成本模型开发的快速原型

IF 2.2 3区计算机科学

Journal of Computer Languages Pub Date : 2022-12-01 DOI: 10.1016/j.cola.2022.101173

Abdelkader Ouared , Moussa Amrani , Pierre-Yves Schobbens

{"title":"COMORP: Rapid prototyping for mathematical database cost models development","authors":"Abdelkader Ouared , Moussa Amrani , Pierre-Yves Schobbens","doi":"10.1016/j.cola.2022.101173","DOIUrl":"https://doi.org/10.1016/j.cola.2022.101173","url":null,"abstract":"<div><p>The database technology evolution trends had pushed the researchers to redesign and adapt the past mathematical database cost models with the consideration of additional aspects due to the emergence of this evolution. As a result, many scientists today propose database cost models by rethinking query processing<span> and optimization with every change in hardware, workload, and applications. This requires a high level of domain expertise. However, assisting users to build database cost models by context-aware is difficult and an increasingly harder challenge. A new paradigm is needed to change cost model development methodology by designing it at a high level of abstraction to mitigate the gap between core database and conceptual modeling communities in order to shorten its long development cycle. Moreover, we need to support incrementally complex design of cost models and follow the evolution of database technologies that change rapidly and continuously to fit the new requirements. We investigate Model-Driven Engineering paradigms that enable database cost models, fast prototyping of modeling/analysis and optimize reusability of its integration components. This article presents a framework that aims to develop cost models as an extensible and customized kernel that provides metrics related to the most sensitive layers of database systems and assists the cost model composition process by combinations of fundamental primitives. We implement our framework to help designers/researchers create a successful cost model product semi-automatically correlate with their manifests. Experimental evaluations show that by using our framework, we can reduce the time spent by 60% on CM building, while being able to recommend useful components with up to 90%.</span></p></div>","PeriodicalId":48552,"journal":{"name":"Journal of Computer Languages","volume":"73 ","pages":"Article 101173"},"PeriodicalIF":2.2,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72221283","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Block-based abstractions and expansive services to make advanced computing concepts accessible to novices 基于块的抽象和扩展服务，使高级计算概念可供新手访问

IF 2.2 3区计算机科学

Journal of Computer Languages Pub Date : 2022-12-01 DOI: 10.1016/j.cola.2022.101156

Corey Brady , Brian Broll , Gordon Stein , Devin Jean , Shuchi Grover , Veronica Cateté , Tiffany Barnes , Ákos Lédeczi

{"title":"Block-based abstractions and expansive services to make advanced computing concepts accessible to novices","authors":"Corey Brady , Brian Broll , Gordon Stein , Devin Jean , Shuchi Grover , Veronica Cateté , Tiffany Barnes , Ákos Lédeczi","doi":"10.1016/j.cola.2022.101156","DOIUrl":"https://doi.org/10.1016/j.cola.2022.101156","url":null,"abstract":"<div><p>Many block-based programming environments have proven to be effective at engaging novices in learning programming. However, most offer only restricted access to the outside world, limiting learners to commands and computing resources built in to the environment. Some allow learners to drag and drop files, connect to sensors and robots locally or issue HTTP requests. But in a world where most of the applications in our daily lives are <em>distributed</em><span> (i.e., their functionality depends on communicating with other computers or accessing resources and data on the internet), the limited support for beginners to envision and create such distributed programs is a lost opportunity. We argue that it is feasible to create environments with simple yet powerful abstractions that open up distributed computing<span> and other widely-used but advanced computing concepts including networking, the Internet of Things, and cybersecurity to novices. The paper presents the architecture of and design decisions behind NetsBlox, a programming environment that supports these ideas. We show how NetsBlox expands opportunities for learning considerably: NetsBlox projects can access a wealth of online data and web services, and they can communicate with other projects. Moreover, the tool infrastructure enables young learners to collaborate with each other during program construction, whether they share their physical location or study remotely. Importantly, providing access to the wider world will also help counter widespread student perceptions that block-based environments are mere toys, and show that they are capable of creating compelling applications. In this way, NetsBlox offers an illuminating example of how tools can be designed to democratize access to powerful ideas in computing.</span></span></p></div>","PeriodicalId":48552,"journal":{"name":"Journal of Computer Languages","volume":"73 ","pages":"Article 101156"},"PeriodicalIF":2.2,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72221277","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 3

Context-sensitive parsing for programming languages 程序设计语言的上下文敏感解析

IF 2.2 3区计算机科学

Journal of Computer Languages Pub Date : 2022-12-01 DOI: 10.1016/j.cola.2022.101172

Boštjan Slivnik

{"title":"Context-sensitive parsing for programming languages","authors":"Boštjan Slivnik","doi":"10.1016/j.cola.2022.101172","DOIUrl":"https://doi.org/10.1016/j.cola.2022.101172","url":null,"abstract":"<div><p>Parsing programming languages using context-sensitive rather than context-free grammars is being considered here because a stronger formalism might be beneficial for dealing with increasingly complex programming languages and their syntax, or is more appropriate in some applications. A new deterministic non-backtracking algorithm for parsing deterministic context-sensitive languages is described. It is a significant improvement of the algorithm built into <span>WEAVE</span> and <span>CWEAVE</span> tools for literate programming and requires that the language is described by a context-sensitive reduction system, namely a deterministic formalism similar to a context-sensitive grammar but with strict rules about how reductions are to be applied. The new algorithm uses a reduction automaton for finding the position of the next reduction at each step during parsing rather than a hardcoded trie that is build into the original algorithm of <span>WEAVE</span> and <span>CWEAVE</span>. The new algorithm performs at least twice as few operations per input symbol as the original one. Furthermore, it is shown that parsing a language described by a context-sensitive reduction system need not be limited to typesetting purposes as in literate programming but can be used as a general parsing approach.</p></div>","PeriodicalId":48552,"journal":{"name":"Journal of Computer Languages","volume":"73 ","pages":"Article 101172"},"PeriodicalIF":2.2,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2590118422000697/pdfft?md5=71c396f28a0247b058401c5f5001037f&pid=1-s2.0-S2590118422000697-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72221279","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Where-provenance for bidirectional editing in spreadsheets 电子表格中双向编辑的出处

IF 2.2 3区计算机科学

Journal of Computer Languages Pub Date : 2022-12-01 DOI: 10.1016/j.cola.2022.101155

Jack Williams , Andrew D. Gordon

引用次数: 0