Dynamic Languages Symposium最新文献

Whalesong: running racket in the browser 鲸鱼:在浏览器中运行球拍

Dynamic Languages Symposium Pub Date : 2013-10-28 DOI: 10.1145/2508168.2508172

Daniel Yoo, S. Krishnamurthi

引用次数: 12

All about the with statement in JavaScript: removing with statements in JavaScript applications 关于JavaScript中的with语句:删除JavaScript应用程序中的with语句

Dynamic Languages Symposium Pub Date : 2013-10-28 DOI: 10.1145/2508168.2508173

Changhee Park, Hongki Lee, Sukyoung Ryu

{"title":"All about the with statement in JavaScript: removing with statements in JavaScript applications","authors":"Changhee Park, Hongki Lee, Sukyoung Ryu","doi":"10.1145/2508168.2508173","DOIUrl":"https://doi.org/10.1145/2508168.2508173","url":null,"abstract":"The with statement in JavaScript makes static analysis of JavaScript applications difficult by introducing a new scope at run time and thus invalidating lexical scoping. Therefore, many static approaches to JavaScript program analysis and the strict mode of ECMAScript 5 simply disallow the with statement. To justify exclusion of the with statement, we should better understand the actual usage patterns of the with statement.\u0000 In this paper, we present the usage patterns of the with statement in real-world JavaScript applications currently used in the 898 most popular web sites. We investigate whether we can rewrite the with statements in each pattern to other statements not using the with statement. We show that we can rewrite all the static occurrences of the with statement that do not have any dynamic code generating functions. Even though the rewriting process is not applicable to any dynamically generated with statements, our results are still promising. Because all the static approaches that disallow the with statement also disallow dynamic code generation, such static approaches can allow the with statement using our rewriting process. We formally present our rewriting strategy, provide its implementation, and show its faithfulness using extensive testing. We believe that removing with statements will simplify JavaScript program analysis designs without considering dynamic scope introduction while imposing fewer syntactic restrictions.","PeriodicalId":344101,"journal":{"name":"Dynamic Languages Symposium","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115044603","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}

引用次数: 11

Improved type specialization for dynamic scripting languages 改进了动态脚本语言的类型专门化

Dynamic Languages Symposium Pub Date : 2013-10-28 DOI: 10.1145/2508168.2508177

Madhukar N. Kedlaya, Jared Roesch, Behnam Robatmili, Mehrdad Reshadi, B. Hardekopf

{"title":"Improved type specialization for dynamic scripting languages","authors":"Madhukar N. Kedlaya, Jared Roesch, Behnam Robatmili, Mehrdad Reshadi, B. Hardekopf","doi":"10.1145/2508168.2508177","DOIUrl":"https://doi.org/10.1145/2508168.2508177","url":null,"abstract":"Type feedback and type inference are two common methods used to optimize dynamic languages such as JavaScript. Each of these methods has its own strengths and weaknesses, and we propose that each can benefit from the other if combined in the right way. We explore the interdependency between these two methods and propose two novel ways to combine them in order to significantly increase their aggregate benefit and decrease their aggregate overhead. In our proposed strategy, an initial type inference pass is applied that can reduce type feedback overhead by enabling more intelligent placement of profiling hooks. This initial type inference pass is novel in the literature. After profiling, a final type inference pass uses the type information from profiling to generate efficient code. While this second pass is not novel, we significantly improve its effectiveness in a novel way by feeding the type inference pass information about the function signature, i.e., the types of the function's arguments for aspecific function invocation. Our results show significant speedups when using these low-overhead strategies, ranging from 1.2x to 4x over an implementation that does not perform type feedback or type inference based optimizations. Our experiments are carried out across a wide range of traditional benchmarks and realistic web applications. The results also show an average reduction of 23.5% in the size of the profiled data for these benchmarks.","PeriodicalId":344101,"journal":{"name":"Dynamic Languages Symposium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130306150","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}

引用次数: 24

TeJaS: retrofitting type systems for JavaScript TeJaS:为JavaScript改进类型系统

Dynamic Languages Symposium Pub Date : 2013-10-28 DOI: 10.1145/2508168.2508170

Benjamin S. Lerner, J. Politz, Arjun Guha, S. Krishnamurthi

{"title":"TeJaS: retrofitting type systems for JavaScript","authors":"Benjamin S. Lerner, J. Politz, Arjun Guha, S. Krishnamurthi","doi":"10.1145/2508168.2508170","DOIUrl":"https://doi.org/10.1145/2508168.2508170","url":null,"abstract":"JavaScript programs vary widely in functionality, complexity, and use, and analyses of these programs must accommodate such variations. Type-based analyses are typically the simplest such analyses, but due to the language's subtle idioms and many application-specific needs---such as ensuring general-purpose type correctness, security properties, or proper library usage---we have found that a single type system does not suffice for all purposes. However, these varied uses still share many reusable common elements.\u0000 In this paper we present TeJaS, a framework for building type systems for JavaScript. TeJaS has been engineered modularly to encourage experimentation. Its initial type environment is reified, to admit easy modeling of the various execution contexts of JavaScript programs, and its type language and typing rules are extensible, to enable variations of the type system to be constructed easily.\u0000 The paper presents the base TeJaS type system, which performs traditional type-checking for JavaScript. Because JavaScript demands complex types, we explain several design decisions to improve user ergonomics. We then describe TeJaS's modular structure, and illustrate it by reconstructing the essence of a very different type system for JavaScript. Systems built from TeJaS have been applied to several real-world, third-party JavaScript programs.","PeriodicalId":344101,"journal":{"name":"Dynamic Languages Symposium","volume":"6 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121301777","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}

引用次数: 51

Polymorphic identifiers: uniform resource access in objective-smalltalk 多态标识符:objective-smalltalk中的统一资源访问

Dynamic Languages Symposium Pub Date : 2013-10-28 DOI: 10.1145/2508168.2508169

Marcel Weiher, R. Hirschfeld

{"title":"Polymorphic identifiers: uniform resource access in objective-smalltalk","authors":"Marcel Weiher, R. Hirschfeld","doi":"10.1145/2508168.2508169","DOIUrl":"https://doi.org/10.1145/2508168.2508169","url":null,"abstract":"In object-oriented programming, polymorphic dispatch of operations decouples clients from specific providers of services and allows implementations to be modified or substituted without affecting clients.\u0000 The Uniform Access Principle (UAP) tries to extend these qualities to resource access by demanding that access to state be indistinguishable from access to operations. Despite language features supporting the UAP, the overall goal of substitutability has not been achieved for either alternative resources such as keyed storage, files or web pages, or for alternate access mechanisms: specific kinds of resources are bound to specific access mechanisms and vice versa. Changing storage or access patterns either requires changes to both clients and service providers and trying to maintain the UAP imposes significant penalties in terms of code-duplication and/or performance overhead.\u0000 We propose introducing first class identifiers as polymorphic names for storage locations to solve these problems. With these Polymorphic Identifiers, we show that we can provide uniform access to a wide variety of resource types as well as storage and access mechanisms, whether parametrized or direct, without affecting client code, without causing code duplication or significant performance penalties.","PeriodicalId":344101,"journal":{"name":"Dynamic Languages Symposium","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125153484","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}

引用次数: 5

Efficient dynamic access analysis using JavaScript proxies 使用JavaScript代理的高效动态访问分析

Dynamic Languages Symposium Pub Date : 2013-10-28 DOI: 10.1145/2508168.2508176

M. Keil, Peter Thiemann

引用次数: 11

Optimizing MATLAB feval with dynamic techniques 用动态技术优化MATLAB仿真

Dynamic Languages Symposium Pub Date : 2013-10-28 DOI: 10.1145/2508168.2508174

Nurudeen Lameed, L. Hendren

引用次数: 2

Type refinement for static analysis of JavaScript 用于JavaScript静态分析的类型细化

Dynamic Languages Symposium Pub Date : 2013-10-28 DOI: 10.1145/2508168.2508175

Vineeth Kashyap, J. Sarracino, J. Wagner, Ben Wiedermann, B. Hardekopf

{"title":"Type refinement for static analysis of JavaScript","authors":"Vineeth Kashyap, J. Sarracino, J. Wagner, Ben Wiedermann, B. Hardekopf","doi":"10.1145/2508168.2508175","DOIUrl":"https://doi.org/10.1145/2508168.2508175","url":null,"abstract":"Static analysis of JavaScript has proven useful for a variety of purposes, including optimization, error checking, security auditing, program refactoring, and more. We propose a technique called type refinement that can improve the precision of such static analyses for JavaScript without any discernible performance impact. Refinement is a known technique that uses the conditions in branch guards to refine the analysis information propagated along each branch path. The key insight of this paper is to recognize that JavaScript semantics include many implicit conditional checks on types, and that performing type refinement on these implicit checks provides significant benefit for analysis precision.\u0000 To demonstrate the effectiveness of type refinement, we implement a static analysis tool for reporting potential type-errors in JavaScript programs. We provide an extensive empirical evaluation of type refinement using a benchmark suite containing a variety of JavaScript application domains, ranging from the standard performance benchmark suites (Sunspider and Octane), to open-source JavaScript applications, to machine-generated JavaScript via Emscripten. We show that type refinement can significantly improve analysis precision by up to 86% without affecting the performance of the analysis.","PeriodicalId":344101,"journal":{"name":"Dynamic Languages Symposium","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115208460","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}

引用次数: 26

Cast insertion strategies for gradually-typed objects 为逐渐类型的对象强制转换插入策略

Dynamic Languages Symposium Pub Date : 2013-10-28 DOI: 10.1145/2508168.2508171

Esteban Allende, J. Fabry, É. Tanter

引用次数: 22

Bootstrapping a self-hosted research virtual machine for JavaScript: an experience report 为JavaScript引导一个自托管的研究虚拟机:一份体验报告

Dynamic Languages Symposium Pub Date : 2011-10-24 DOI: 10.1145/2047849.2047858

Maxime Chevalier-Boisvert, Erick Lavoie, M. Feeley, Bruno Dufour

引用次数: 11