发布求助
文献互助 智能选刊 最新文献

ACM Sigplan Notices最新文献

筛选
英文 中文
A domain-specific language for exploratory data visualization 用于探索性数据可视化的特定领域语言
ACM Sigplan Notices Pub Date : 2018-11-05 DOI: 10.1145/3393934.3278138
SmeltzerKarl, ErwigMartin
{"title":"A domain-specific language for exploratory data visualization","authors":"SmeltzerKarl, ErwigMartin","doi":"10.1145/3393934.3278138","DOIUrl":"https://doi.org/10.1145/3393934.3278138","url":null,"abstract":"With an ever-growing amount of collected data, the importance of visualization as an analysis component is growing in concert. The creation of good visualizations often doesn't happen in one step b...","PeriodicalId":50923,"journal":{"name":"ACM Sigplan Notices","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2018-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1145/3393934.3278138","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46435245","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}
引用次数: 0
Query-based object-oriented programming: a declarative web of objects 基于查询的面向对象编程:一个声明性的对象网络
ACM Sigplan Notices Pub Date : 2018-10-24 DOI: 10.1145/3393673.3276949
SeginerYoav, VosseTheo, HarariGil, KolodnyUri
{"title":"Query-based object-oriented programming: a declarative web of objects","authors":"SeginerYoav, VosseTheo, HarariGil, KolodnyUri","doi":"10.1145/3393673.3276949","DOIUrl":"https://doi.org/10.1145/3393673.3276949","url":null,"abstract":"We present a declarative, object-oriented language in which queries play a central role. Queries are used not only to access data, but also to refer to the application’s object members and as a mea...","PeriodicalId":50923,"journal":{"name":"ACM Sigplan Notices","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2018-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1145/3393673.3276949","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42530777","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}
引用次数: 0
AutoBench: comparing the time performance of Haskell programs AutoBench:比较Haskell程序的时间性能
ACM Sigplan Notices Pub Date : 2018-09-17 DOI: 10.1145/3299711.3242749
A. T. HandleyMartin, HuttonGraham
{"title":"AutoBench: comparing the time performance of Haskell programs","authors":"A. T. HandleyMartin, HuttonGraham","doi":"10.1145/3299711.3242749","DOIUrl":"https://doi.org/10.1145/3299711.3242749","url":null,"abstract":"Two fundamental goals in programming are correctness (producing the right results) and efficiency (using as few resources as possible). Property-based testing tools such as QuickCheck provide a lig...","PeriodicalId":50923,"journal":{"name":"ACM Sigplan Notices","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2018-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1145/3299711.3242749","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43471894","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}
引用次数: 0
Deriving via: or, how to turn hand-written instances into an anti-pattern 派生通过：或者，如何将手写实例转化为反模式
ACM Sigplan Notices Pub Date : 2018-09-17 DOI: 10.1145/3299711.3242746
BlöndalBaldur, LöhAndres, ScottRyan
{"title":"Deriving via: or, how to turn hand-written instances into an anti-pattern","authors":"BlöndalBaldur, LöhAndres, ScottRyan","doi":"10.1145/3299711.3242746","DOIUrl":"https://doi.org/10.1145/3299711.3242746","url":null,"abstract":"Haskell's deriving construct is a cheap and cheerful way to quickly generate instances of type classes that follow common patterns. But at present, there is only a subset of such type class pattern...","PeriodicalId":50923,"journal":{"name":"ACM Sigplan Notices","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2018-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1145/3299711.3242746","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49607131","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}
引用次数: 0
Compositionality in scenario-aware dataflow: a rendezvous perspective 场景感知数据流中的组合性:一个集合视角
ACM Sigplan Notices Pub Date : 2018-06-19 DOI: 10.1145/3299710.3211339
SkelinMladen, GeilenMarc
{"title":"Compositionality in scenario-aware dataflow: a rendezvous perspective","authors":"SkelinMladen, GeilenMarc","doi":"10.1145/3299710.3211339","DOIUrl":"https://doi.org/10.1145/3299710.3211339","url":null,"abstract":"Finite-state machine-based scenario-aware dataflow (FSM-SADF) is a dynamic dataflow model of computation that combines streaming data and finite-state control. For the most part, it preserves the d...","PeriodicalId":50923,"journal":{"name":"ACM Sigplan Notices","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2018-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1145/3299710.3211339","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45561857","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}
引用次数: 0
Calling-to-reference context translation via constraint-guided CFL-reachability 通过约束引导的cfl可达性实现调用到引用上下文的转换
ACM Sigplan Notices Pub Date : 2018-06-11 DOI: 10.1145/3296979.3192378
Cheng Cai, Qirun Zhang, Zhiqiang Zuo, Khanh Nguyen, G. Xu, Z. Su
{"title":"Calling-to-reference context translation via constraint-guided CFL-reachability","authors":"Cheng Cai, Qirun Zhang, Zhiqiang Zuo, Khanh Nguyen, G. Xu, Z. Su","doi":"10.1145/3296979.3192378","DOIUrl":"https://doi.org/10.1145/3296979.3192378","url":null,"abstract":"A calling context is an important piece of information used widely to help developers understand program executions (e.g., for debugging). While calling contexts offer useful control information, information regarding data involved in a bug (e.g., what data structure holds a leaking object), in many cases, can bring developers closer to the bug's root cause. Such data information, often exhibited as heap reference paths, has already been needed by many tools. The only way for a dynamic analysis to record complete reference paths is to perform heap dumping, which incurs huge runtime overhead and renders the analysis impractical. This paper presents a novel static analysis that can precisely infer, from a calling context of a method that contains a use (e.g., read or write) of an object, the heap reference paths leading to the object at the time the use occurs. Since calling context recording is much less expensive, our technique provides benefits for all dynamic techniques that need heap information, significantly reducing their overhead.","PeriodicalId":50923,"journal":{"name":"ACM Sigplan Notices","volume":"74 1","pages":"196 - 210"},"PeriodicalIF":0.0,"publicationDate":"2018-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90177295","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}
引用次数: 12
SWOOP: software-hardware co-design for non-speculative, execute-ahead, in-order cores SWOOP:用于非推测性、提前执行、顺序核的软硬件协同设计
ACM Sigplan Notices Pub Date : 2018-06-11 DOI: 10.1145/3296979.3192393
Kim-Anh Tran, A. Jimborean, Trevor E. Carlson, K. Koukos, Magnus Själander, S. Kaxiras
{"title":"SWOOP: software-hardware co-design for non-speculative, execute-ahead, in-order cores","authors":"Kim-Anh Tran, A. Jimborean, Trevor E. Carlson, K. Koukos, Magnus Själander, S. Kaxiras","doi":"10.1145/3296979.3192393","DOIUrl":"https://doi.org/10.1145/3296979.3192393","url":null,"abstract":"Increasing demands for energy efficiency constrain emerging hardware. These new hardware trends challenge the established assumptions in code generation and force us to rethink existing software optimization techniques. We propose a cross-layer redesign of the way compilers and the underlying microarchitecture are built and interact, to achieve both performance and high energy efficiency. In this paper, we address one of the main performance bottlenecks — last-level cache misses — through a software-hardware co-design. Our approach is able to hide memory latency and attain increased memory and instruction level parallelism by orchestrating a non-speculative, execute-ahead paradigm in software (SWOOP). While out-of-order (OoO) architectures attempt to hide memory latency by dynamically reordering instructions, they do so through expensive, power-hungry, speculative mechanisms.We aim to shift this complexity into software, and we build upon compilation techniques inherited from VLIW, software pipelining, modulo scheduling, decoupled access-execution, and software prefetching. In contrast to previous approaches we do not rely on either software or hardware speculation that can be detrimental to efficiency. Our SWOOP compiler is enhanced with lightweight architectural support, thus being able to transform applications that include highly complex control-flow and indirect memory accesses.","PeriodicalId":50923,"journal":{"name":"ACM Sigplan Notices","volume":"49 1","pages":"328 - 343"},"PeriodicalIF":0.0,"publicationDate":"2018-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84324483","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}
引用次数: 12
Verifying that web pages have accessible layout 验证网页是否具有可访问的布局
ACM Sigplan Notices Pub Date : 2018-06-11 DOI: 10.1145/3296979.3192407
P. Panchekha, Adam T. Geller, Michael D. Ernst, Zachary Tatlock, S. Kamil
{"title":"Verifying that web pages have accessible layout","authors":"P. Panchekha, Adam T. Geller, Michael D. Ernst, Zachary Tatlock, S. Kamil","doi":"10.1145/3296979.3192407","DOIUrl":"https://doi.org/10.1145/3296979.3192407","url":null,"abstract":"Usability and accessibility guidelines aim to make graphical user interfaces accessible to all users, by, say, requiring that text is sufficiently large, interactive controls are visible, and heading size corresponds to importance. These guidelines must hold on the infinitely many possible renderings of a web page generated by differing screen sizes, fonts, and other user preferences. Today, these guidelines are tested by manual inspection of a few renderings, because 1) the guidelines are not expressed in a formal language, 2) the semantics of browser rendering are not well understood, and 3) no tools exist to check all possible renderings of a web page. VizAssert solves these problems. First, it introduces visual logic to precisely specify accessibility properties. Second, it formalizes a large fragment of the browser rendering algorithm using novel finitization reductions. Third, it provides a sound, automated tool for verifying assertions in visual logic. We encoded 14 assertions drawn from best-practice accessibility and mobile-usability guidelines in visual logic. VizAssert checked them on on 62 professionally designed web pages. It found 64 distinct errors in the web pages, while reporting only 13 false positive warnings.","PeriodicalId":50923,"journal":{"name":"ACM Sigplan Notices","volume":"80 1","pages":"1 - 14"},"PeriodicalIF":0.0,"publicationDate":"2018-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80406784","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}
引用次数: 31
On-stack replacement, distilled 栈内替换，蒸馏
ACM Sigplan Notices Pub Date : 2018-06-11 DOI: 10.1145/3296979.3192396
Daniele Cono D'Elia, C. Demetrescu
{"title":"On-stack replacement, distilled","authors":"Daniele Cono D'Elia, C. Demetrescu","doi":"10.1145/3296979.3192396","DOIUrl":"https://doi.org/10.1145/3296979.3192396","url":null,"abstract":"On-stack replacement (OSR) is essential technology for adaptive optimization, allowing changes to code actively executing in a managed runtime. The engineering aspects of OSR are well-known among VM architects, with several implementations available to date. However, OSR is yet to be explored as a general means to transfer execution between related program versions, which can pave the road to unprecedented applications that stretch beyond VMs. We aim at filling this gap with a constructive and provably correct OSR framework, allowing a class of general-purpose transformation functions to yield a special-purpose replacement. We describe and evaluate an implementation of our technique in LLVM. As a novel application of OSR, we present a feasibility study on debugging of optimized code, showing how our techniques can be used to fix variables holding incorrect values at breakpoints due to optimizations.","PeriodicalId":50923,"journal":{"name":"ACM Sigplan Notices","volume":"15 1","pages":"166 - 180"},"PeriodicalIF":0.0,"publicationDate":"2018-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87128103","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}
引用次数: 13
User-guided program reasoning using Bayesian inference 使用贝叶斯推理的用户引导程序推理
ACM Sigplan Notices Pub Date : 2018-06-11 DOI: 10.1145/3296979.3192417
Mukund Raghothaman, S. Kulkarni, K. Heo, M. Naik
{"title":"User-guided program reasoning using Bayesian inference","authors":"Mukund Raghothaman, S. Kulkarni, K. Heo, M. Naik","doi":"10.1145/3296979.3192417","DOIUrl":"https://doi.org/10.1145/3296979.3192417","url":null,"abstract":"Program analyses necessarily make approximations that often lead them to report true alarms interspersed with many false alarms. We propose a new approach to leverage user feedback to guide program analyses towards true alarms and away from false alarms. Our approach associates each alarm with a confidence value by performing Bayesian inference on a probabilistic model derived from the analysis rules. In each iteration, the user inspects the alarm with the highest confidence and labels its ground truth, and the approach recomputes the confidences of the remaining alarms given this feedback. It thereby maximizes the return on the effort by the user in inspecting each alarm. We have implemented our approach in a tool named Bingo for program analyses expressed in Datalog. Experiments with real users and two sophisticated analyses---a static datarace analysis for Java programs and a static taint analysis for Android apps---show significant improvements on a range of metrics, including false alarm rates and number of bugs found.","PeriodicalId":50923,"journal":{"name":"ACM Sigplan Notices","volume":"29 8","pages":"722 - 735"},"PeriodicalIF":0.0,"publicationDate":"2018-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1145/3296979.3192417","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72475546","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}
引用次数: 42
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信