检索结果-内蒙古大学图书馆

9th acm sigplan International Workshop on the State Of the Art in Program Analysis, SOAP 2020, co-located with the 41st acm sigplan conference on programming language design and implementation, PLDI 2020

the proceedings contain 3 papers. the topics discussed include: formal reasoning and the hacker way;TACAI: an intermediate representation based on abstract interpretation;value and allocation sensitivity in static pyt...

ISBN: (纸本)9781450379977

关键词：

来源：评论

学校读者我要写书评

暂无评论

Slicing Probabilistic Programs 14

Slicing Probabilistic Programs

引用

35th acm sigplan conference on programming language design and implementation (PLDI)

作者： Hur, Chung-Kil Nori, Aditya V. Rajamani, Sriram K. Samuel, Selva Seoul Natl Univ Seoul 151 South Korea

ISBN: (纸本)9781450327848

Probabilistic programs use familiar notation of programming languages to specify probabilistic models. Suppose we are interested in estimating the distribution of the return expression r of a probabilistic program P. We are interested in slicing the probabilistic program P and obtaining a simpler program SLI (P) which retains only those parts of P that are relevant to estimating r, and elides those parts of P that are not relevant to estimating r. We desire that the SLI transformation be both correct and efficient. By correct, we mean that P and SLI (P) have identical estimates on r. By efficient, we mean that estimation over SLI (P) be as fast as possible. We show that the usual notion of program slicing, which traverses control and data dependencies backward from the return expression r, is unsatisfactory for probabilistic programs, since it produces incorrect slices on some programs and sub-optimal ones on others. Our key insight is that in addition to the usual notions of control dependence and data dependence that are used to slice non-probabilistic programs, a new kind of dependence called observe dependence arises naturally due to observe statements in probabilistic programs. We propose a new definition of SLI (P) which is both correct and efficient for probabilistic programs, by including observe dependence in addition to control and data dependences for computing slices. We prove correctness mathematically, and we demonstrate efficiency empirically. We show that by applying the SLI transformation as a pre-pass, we can improve the efficiency of probabilistic inference, not only in our own inference tool R2, but also in other systems for performing inference such as Church and Infer. NET.

关键词： Probabilistic programming Program Slicing Bayesian Reasoning

来源：评论

学校读者我要写书评

暂无评论

Implicit Invocation Meets Safe, Implicit Concurrency 10

Implicit Invocation Meets Safe, Implicit Concurrency

引用

9th International conference on Generative programming and Component Engineering

作者： Long, Yuheng Mooney, Sean L. Sondag, Tyler Rajan, Hridesh Iowa State Univ Dept Comp Sci Ames IA 50011 USA

ISBN: (纸本)9781450301541

Writing correct and efficient concurrent programs still remains a challenge. Explicit concurrency is difficult, error prone, and creates code which is hard to maintain and debug. this type of concurrency also treats modular program design and concurrency as separate goals, where modularity often suffers. To solve these problems, we are designing a new language that we call Panini. In this paper, we focus on Panini's asynchronous, typed events which reconcile the modularity goal promoted by the implicit invocation design style with the concurrency goal of exposing potential concurrency between the execution of subjects and observers. Since modularity is improved and concurrency is implicit in Panini, programs are easier to reason about and maintain. the language incorporates a static analysis to determine potential conflicts between handlers and a dynamic analysis which uses the conflict information to determine a safe order for handler invocation. this mechanism avoids races and deadlocks entirely, yielding programs with a guaranteed deterministic semantics. To evaluate our language design and implementation we show several examples of its usage as well as an empirical study of program performance. We found that not only is developing and understanding Panini programs significantly easier compared to standard concurrent object-oriented programs, but also performance of Panini programs is comparable to their equivalent hand-tuned versions written using Java's fork-join framework.

关键词： languages design Performance Safe Implicit Concurrency Modularity

来源：评论

学校读者我要写书评

暂无评论

A Compiler and Run-time System for Network programming languages 12

A Compiler and Run-time System for Network Programming Langu...

引用

39th Annual acm sigplan-SIGACT Symposium on Principles of programming languages

作者： Monsanto, Christopher Foster, Nate Harrison, Rob Walker, David Princeton Univ Princeton NJ 08544 USA

ISBN: (纸本)9781450310833

Software-defined networks (SDNs) are a new kind of network architecture in which a controller machine manages a distributed collection of switches by instructing them to install or uninstall packet-forwarding rules and report traffic statistics. the recently formed Open Networking Consortium, whose members include Google, Facebook, Microsoft, Verizon, and others, hopes to use this architecture to transform the way that enterprise and data center networks are implemented. In this paper, we define a high-level, declarative language, called Net Core, for expressing packet-forwarding policies on SDNs. Net-Core is expressive, compositional, and has a formal semantics. To ensure that a majority of packets are processed efficiently on switches instead of on the controller we present new compilation algorithms for Net Core and couple them with a new run-time system that issues rule installation commands and traffic-statistics queries to switches. Together, the compiler and run-time system generate efficient rules whenever possible and outperform the simple, manual techniques commonly used to program SDNs today. In addition, the algorithms we develop are generic, assuming only that the packet-matching capabilities available on switches satisfy some basic algebraic laws. Overall, this paper delivers a new design for a high-level network programming language;an improved set of compiler algorithms;a new run-time system for SDN architectures;the first formal semantics and proofs of correctness in this domain;and an implementation and evaluation that demonstrates the performance benefits over traditional manual techniques.

关键词： Software-defined Networking OpenFlow Frenetic Network programming languages Domain specific languages

来源：评论

学校读者我要写书评

暂无评论

Classbox/J: Controlling the scope of change in Java

Classbox/J: Controlling the scope of change in Java

引用

20th conference on Object-Oriented programming, Systems, languages and Applications

作者： Bergel, A Ducasse, S Nierstrasz, O Univ Bern Software Composit Grp Bern Switzerland Univ Savoie Language & Software Evolut Grp LISTIC Chambery France

Unanticipated changes to complex software systems can introduce anomalies such as duplicated code, suboptimal inheritance relationships and a proliferation of run-tirne downcasts. Refactoring to eliminate these anomalies may not be an option, at least in certain stages of software evolution. Classboxes are modules that restrict the visibility of changes to selected clients only, thereby offering more freedom in the way unanticipated changes may be implemented, and thus reducing the need for convoluted design anomalies. In this paper we demonstrate how classboxes can be implemented in statically-typed languages like Java. We also present an extended case study of Swing, a Java GUI package built on top of AWT, and we document the ensuing anomalies that Swing introduces. We show how Classbox/J, a prototype implementation of classboxes for Java, is used to provide a cleaner implementation of Swing using local refinement rather than subclassing.

关键词： language design module package open-classes class extension

来源：评论

学校读者我要写书评

暂无评论

Reactive Imperative programming with Dataflow Constraints 11

Reactive Imperative Programming with Dataflow Constraints

引用

2th acm International conference on Systems, programming, languages, and Applications: Software for Humanity (SPLASH)

作者： Demetrescu, Camil Finocchi, Irene Ribichini, Andrea Univ Roma La Sapienza Dept Comp & Syst Sci Rome Italy

ISBN: (纸本)9781450309400

Dataflow languages provide natural support for specifying constraints between objects in dynamic applications, where programs need to react efficiently to changes of their environment. Researchers have long investigated how to take advantage of dataflow constraints by embedding them into procedural languages. Previous mixed imperative/dataflow systems, however, require syntactic extensions or libraries of ad hoc data types for binding the imperative program to the dataflow solver. In this paper we propose a novel approach that smoothly combines the two paradigms without placing undue burden on the programmer. In our framework, programmers can define ordinary statements of the imperative host language that enforce constraints between objects stored in special memory locations designated as "reactive". Differently from previous approaches, reactive objects can be of any legal type in the host language, including primitive data types, pointers, arrays, and structures. Statements defining constraints are automatically re-executed every time their input memory locations change, letting a program behave like a spreadsheet where the values of some variables depend upon the values of other variables. the constraint solving mechanism is handled transparently by altering the semantics of elementary operations of the host language for reading and modifying objects. We provide a formal semantics and describe a concrete embodiment of our technique into C/C++, showing how to implement it efficiently in conventional platforms using off-the-shelf compilers. We discuss common coding idioms and relevant applications to reactive scenarios, including incremental computation, observer design pattern, and data structure repair. the performance of our implementation is compared to ad hoc problem-specific change propagation algorithms, as well as to language-centric approaches such as self-adjusting computation and subject/observer communication mechanisms, showing that the proposed approa

关键词： Reactive programming dataflow programming imperative programming constraint solving incremental computation observer design pattern data structure repair

来源：评论

学校读者我要写书评

暂无评论

SOAP 2021 - Proceedings of the 10th acm sigplan International Workshop on the State of the Art in Program Analysis, co-located with PLDI 2021

SOAP 2021 - Proceedings of the 10th ACM SIGPLAN Internationa...

引用

10th acm sigplan International Workshop on the State Of the Art in Program Analysis, SOAP 2021, co-located with the 42nd acm sigplan International conference on programming language design and implementation, PLDI 2021

ISBN: (纸本)9781450384681

the proceedings contain 8 papers. the topics discussed include: static analysis for dummies: experiencing LiSA;security and quality: two sides of the same coin?;program analysis for reversible languages;PerfLens: a data-driven performance bug detection and fix platform;Weldr: fusing binaries for simplified analysis;multi-language static code analysis on the LARA framework;serialization-aware call graph construction;and scalable string analysis: an experience report.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Implicitly threaded parallelism in Manticore

引用

JOURNAL OF FUNCTIONAL programming 2010年第5-6期20卷 537-576页

作者： Fluet, Matthew Rainey, Mike Reppy, John Shaw, Adam Rochester Inst Technol Dept Comp Sci Rochester NY 14623 USA Univ Chicago Dept Comp Sci Chicago IL 60637 USA Toyota Technol Inst Chicago IL USA

the increasing availability of commodity multicore processors is making parallel computing ever more widespread. In order to exploit its potential, programmers need languages that make the benefits of parallelism accessible and understandable. Previous parallel languages have traditionally been intended for large-scale scientific computing, and they tend not to be well suited to programming the applications one typically finds on a desktop system. thus, we need new parallel-language designs that address a broader spectrum of applications. the Manticore project is our effort to address this need. At its core is Parallel ML, a high-level functional language for programming parallel applications on commodity multicore hardware. Parallel ML provides a diverse collection of parallel constructs for different granularities of work. In this paper, we focus on the implicitly threaded parallel constructs of the language, which support fine-grained parallelism. We concentrate on those elements that distinguish our design from related ones, namely, a novel parallel binding form, a nondeterministic parallel case form, and the treatment of exceptions in the presence of data parallelism. these features differentiate the present work from related work on functional data-parallel language designs, which have focused largely on parallel problems with regular structure and the compiler transformations-most notably, flattening-that make such designs feasible. We present detailed examples utilizing various mechanisms of the language and give a formal description of our implementation.

关键词： Multi-core processors Parallel Lines Synclitism data parallel thREADED parallelism Spectra applications language Parallel languages

来源：评论

学校读者我要写书评

暂无评论

Pattern matching for object-like structures in the Go programning language

Pattern matching for object-like structures in the Go progra...

引用

6th Workshop on the implementation, Compilation, Optimization of Object-Oriented languages, Programs and Systems, ICOOOLPS 2011 - In Conjunction with the 25th European conference on Object-Oriented programming, ECOOP 2011

作者： Kaewkasi, Chanwit Kaewkasi, Pitchaya School of Computer Engineering Suranaree University of Technology Nakhon Ratchasima Thailand

ISBN: (纸本)9781450308946

this paper explores the feasibility of implementing pattern matching for the Go programming language. the design of pattern matching is taken from Scala, and reimplemented using Go's constructs and new language extensions, namely casestruct and trait. the evaluations show that pattern matching allows expressing decomposition for struct in concise forms. the concepts of casestruct and trait are suggested to add to the Go language in order to make it properly supports pattern matching. However, the performance of the current implementation is still slower than hand-written struct decompositions. the evaluations also suggest that performance penalty of the type embedding feature proposed by Go for inheritance-like relationship is found in the GCCGO implementation, but not in another implementation, namely 8g. © 2011 acm.

关键词： Pattern matching

来源：评论

学校读者我要写书评

暂无评论

Advanced Automata-Based Algorithms for Program Termination Checking 2018

Advanced Automata-Based Algorithms for Program Termination C...

引用

39th acm sigplan conference on programming language design and implementation (PLDI)

作者： Chen, Yu-Fang Heizmann, Matthias Lengal, Ondrej Li, Yong Tsai, Ming-Hsien Turrini, Andrea Zhang, Lijun Acad Sinica Taipei Taiwan Natl Taipei Univ New Taipei Taiwan Univ Freiburg Freiburg Germany Brno Univ Technol FIT IT4Innovat Ctr Excellence Brno Czech Republic Chinese Acad Sci Univ Chinese Acad Sci Inst Software State Key Lab Comp Sci Beijing Peoples R China Chinese Acad Sci Inst Software State Key Lab Comp Sci Beijing Peoples R China

ISBN: (纸本)9781450356985

In 2014, Heizmann et al. proposed a novel framework for program termination analysis. the analysis starts with a termination proof of a sample path. the path is generalized to a Buchi automaton (BA) whose language (by construction) represents a set of terminating paths. All these paths can be safely removed from the program. the removal of paths is done using automata difference, implemented via BA complementation and intersection. the analysis constructs in this way a set of BAs that jointly "cover" the behavior of the program, thus proving its termination. An implementation of the approach in Ultimate Automizer won the 1st place in the Termination category of SV-Comp 2017. In this paper, we exploit advanced automata-based algorithms and propose several non-trivial improvements of the framework. To alleviate the complementation computation for BAs-one of the most expensive operations in the framework-, we propose a multi-stage generalization construction. We start with generalizations producing subclasses of BAs (such as deterministic BAs) for which efficient complementation algorithms are known, and proceed to more general classes only if necessary. Particularly, we focus on the quite expressive subclass of semideterministic BAs and provide an improved complementation algorithm for this class. Our experimental evaluation shows that the proposed approach significantly improves the power of termination checking within the Ultimate Automizer framework.

关键词： Program Termination Buchi Automata Complementation and language Difference

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：