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

Experience report: Functional programming in C-Rules

acm sigplan NOTICES 2007年第9期42卷 25-28页

作者： Wazny, Jeremy Constraint Technol Int Melbourne Vic 3000 Australia

C-Rules is a business rules management system developed by Constraint Technologies International(1) (CTI), designed for use in transportation problems. Users define rules describing various aspects of a problem, such as solution costs and legality, which are then queried from a host application, typically an optimising solver. At its core, C-Rules provides a functional expression language which affords users both power and flexibility when formulating rules. In this paper we will describe our experiences of using functional programming both at the end-user level, as well as at the implementation level. We highlight some of the benefits we, and the product's users, have enjoyed from the decision to base our rule system on features such as: higher-order functions, referential transparency, and static, polymorphic typing. We also outline some of our experiences in using Haskell to build an efficient compiler for the core language.

关键词： design languages

来源：评论

学校读者我要写书评

暂无评论

Hybrid Context-Sensitivity for Points-To Analysis 13

Hybrid Context-Sensitivity for Points-To Analysis

引用

acm sigplan conference on programming language design and implementation

作者： George Kastrinis Yannis Smaragdakis Department of Informatics University of Athens

ISBN: (纸本)9781450320146

Context-sensitive points-to analysis is valuable for achieving high precision with good performance. The standard flavors of context-sensitivity are call-site-sensitivity (kCFA) and object-sensitivity. Combining both flavors of context-sensitivity increases precision but at an infeasibly high cost. We show that a selective combination of call-site- and object-sensitivity for Java points-to analysis is highly profitable. Namely, by keeping a combined context only when analyzing selected language features, we can closely approximate the precision of an analysis that keeps both contexts at all times. In terms of speed, the selective combination of both kinds of context not only vastly outperforms non-selective combinations but is also faster than a mere object-sensitive analysis. This result holds for a large array of analyses (e.g., 1-object-sensitive, 2-object-sensitive with a context-sensitive heap, type-sensitive) establishing a new set of performance/precision sweet spots.

关键词： Points-to analysis Context-sensitivity Object-sensitivity Type-sensitivity Algorithms languages Performance language algorithms Analysis Flavoring Agents Precision language feature

来源：评论

学校读者我要写书评

暂无评论

A practical type system and language for reference immutability

A practical type system and language for reference immutabil...

引用

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

作者： Birka, A Ernst, MD MIT Comp Sci & Artificial Intelligence Lab Cambridge MA 02139 USA

This paper describes a type system that is capable of expressing and enforcing immutability constraints. The specific constraint expressed is that the abstract state of the object to which an immutable reference refers cannot be modified using that reference. The abstract state is (part of) the transitively reachable state: that is, the state of the object and all state reachable from it by following references. The type system permits explicitly excluding fields or objects from the abstract state of an object. For a statically type-safe language, the type system guarantees reference immutability. If the language is extended with immutability downcasts, then run-time checks enforce the reference immutability constraints. In order to better understand the usability and efficacy of the type system, we have implemented an extension to Java, called Javari, that includes all the features of our type system. Javari is interoperable with Java and existing JVMs. It can be viewed as a proposal for the semantics of the Java const keyword, though Javari's syntax uses readonly instead. This paper describes the design and implementation of Javari, including the type-checking rules for the language. This paper also discusses experience with 160,000 lines of Javari code. Javari was easy to use and provided a number of benefits, including detecting errors in well-tested code.

关键词： type system verification immutability readonly mutable Javari Java const

来源：评论

学校读者我要写书评

暂无评论

Combinatorial sketching for finite programs

Combinatorial sketching for finite programs

引用

12th International conference on Architectural Support for programming languages and Operating Systems

作者： Solar-Lezama, Armando Bodik, Liviu Tancau Rastislav Saraswat, Vijay Seshia, Sanjit Univ Calif Berkeley Berkeley CA 94720 USA

Sketching is a software synthesis approach where the programmer develops a partial implementation - a sketch - and a separate specification of the desired functionality. The synthesizer then completes the sketch to behave like the specification. The correctness of the synthesized implementation is guaranteed by the compiler, which allows, among other benefits, rapid development of highly tuned implementations without the fear of introducing bugs. We develop SKETCH, a language for finite programs with linguistic support for sketching. Finite programs include many high-performance kernels, including cryptocodes. In contrast to prior synthesizers, which had to be equipped with domain-specific rules, SKETCH completes sketches by means of a combinatorial search based on generalized boolean satisfiability. Consequently, our combinatorial synthesizer is complete for the class of finite programs: it is guaranteed to complete any sketch in theory, and in practice has scaled to realistic programming problems. Freed from domain rules, we can now write sketches as simple-to-understand partial programs, which are regular programs in which difficult code fragments are replaced with holes to be filled by the synthesizer. Holes may stand for index expressions, lookup tables, or bitmasks, but the programmer can easily define new kinds of holes using a single versatile synthesis operator. We have used SKETCH to synthesize an efficient implementation of the AES cipher standard. The synthesizer produces the most complex part of the implementation and runs in about an hour.

关键词： languages design performance sketching SAT

来源：评论

学校读者我要写书评

暂无评论

Fast Algorithms for Dyck-CFL-Reachability with Applications to Alias Analysis 13

Fast Algorithms for Dyck-CFL-Reachability with Applications ...

引用

acm sigplan conference on programming language design and implementation

作者： Qirun Zhang Michael R. Lyu Hao Yuan Zhendong Su The Chinese University of Hong Kong BOPU Technologies University of California

ISBN: (纸本)9781450320146

The context-free language (CFL) reachability problem is a well-known fundamental formulation in program analysis. In practice, many program analyses, especially pointer analyses, adopt a restricted version of CFL-reachability, Dyck-CFL-reachability, and compute on edge-labeled bidirected graphs. Solving the all-pairs Dyck-CFL-reachability on such bidirected graphs is expensive. For a bidirected graph with n nodes and m edges, the traditional dynamic programming style algorithm exhibits a subcubic time complexity for the Dyck language with k kinds of parentheses. When the underlying graphs are restricted to bidirected trees, an algorithm with O(n log n log k) time complexity was proposed recently. This paper studies the Dyck-CFL-reachability problems on bidirected trees and graphs. In particular, it presents two fast algorithms with O(n) and O(n + m log m) time complexities on trees and graphs respectively. We have implemented and evaluated our algorithms on a state-of-the-art alias analysis for Java. Results on standard benchmarks show that our algorithms achieve orders of magnitude speedup and consume less memory.

关键词： Dyck-CFL-reachability Alias analysis Algorithms design Experimentation languages algorithms language experimentation analysis programme complexity classes Parentheses logs logarithm (log)

来源：评论

学校读者我要写书评

暂无评论

From Datalog to FLIX: A Declarative language for Fixed Points on Lattices

引用

acm sigplan NOTICES 2016年第6期51卷 194-208页

作者： Madsen, Magnus Yee, Ming-Ho Lhotak, Ondrej Univ Waterloo Waterloo ON N2L 3G1 Canada

We present FLIX, a declarative programming language for specifying and solving least fixed point problems, particularly static program analyses. FLIX is inspired by Datalog and extends it with lattices and monotone functions. Using FLIX, implementors of static analyses can express a broader range of analyses than is currently possible in pure Datalog, while retaining its familiar rule-based syntax. We define a model-theoretic semantics of FLIX as a natural extension of the Datalog semantics. This semantics captures the declarative meaning of FLIX programs without imposing any specific evaluation strategy. An efficient strategy is semi-naive evaluation which we adapt for FLIX. We have implemented a compiler and runtime for FLIX, and used it to express several well-known static analyses, including the IFDS and IDE algorithms. The declarative nature of FLIX clearly exposes the similarity between these two algorithms.

关键词： logic programming static analysis Datalog Logic programming Static Analysis

来源：评论

学校读者我要写书评

暂无评论

A General Constraint-centric Scheduling Framework for Spatial Architectures 13

A General Constraint-centric Scheduling Framework for Spatia...

引用

acm sigplan conference on programming language design and implementation

作者： Tony Nowatzki Michael Sartin-Tarm Lorenzo De Carli Karthikeyan Sankaralingam Cristian Estan Behnam Robatmili University of Wisconsin-Madison Broadcom Qualcomm Research Silicon Valley

ISBN: (纸本)9781450320146

Specialized execution using spatial architectures provides energy efficient computation, but requires effective algorithms for spatially scheduling the computation. Generally, this has been solved with architecture-specific heuristics, an approach which suffers from poor compiler/architect productivity, lack of insight on optimality, and inhibits migration of techniques between architectures. Our goal is to develop a scheduling framework usable for all spatial architectures. To this end, we expresses spatial scheduling as a constraint satisfaction problem using Integer Linear programming (ILP). We observe that architecture primitives and scheduler responsibilities can be related through five abstractions: placement of computation, routing of data, managing event timing, managing resource utilization, and forming the optimization objectives. We encode these responsibilities as 20 general ILP constraints, which are used to create schedulers for the disparate TRIPS, DySER, and PLUG architectures. Our results show that a general declarative approach using ILP is implementable, practical, and typically matches or outperforms specialized schedulers.

关键词： Spatial Architectures Spatial Architecture Scheduling Integer Linear programming

来源：评论

学校读者我要写书评

暂无评论

MAP: A functional analysis and design method

Proceedings of the ACM SIGPLAN International Conference on F...

引用

Proceedings of the acm sigplan International conference on Functional programming, ICFP 1998年 342-342页

作者： Russell, Dan Kingston Univ Surrey United Kingdom

MAP has been developed to address the need for an analysis and design method which directly supports software development using a functional language. MAP breaks down software development into a set of manageable and linked techniques which are combined to make a productive whole. In addition, it can be used as a natural communication medium which avoids the idiosyncracies of particular implementation languages, and through CASE tool support can act as an effective and efficient consistency checker.

关键词： Software engineering

来源：评论

学校读者我要写书评

暂无评论

Aspects and class-based security A survey of interactions between adviceWeaving and the java 2 security model

Aspects and class-based security A survey of interactions be...

引用

2nd Workshop on Virtual Machines and Intermediate languages for Emerging Modularization Mechanisms, VMIL 2008

作者： Sewe, Andreas Bockisch, Christoph Mezini, Mira Technische Universität Darmstadt Hochschulstr. 10 64289 Darmstadt Germany

ISBN: (纸本)9781605583846

Various aspect-oriented languages, e.g., AspectJ, Aspect- Werkz, and JAsCo, have been proposed as extensions to one particular object-oriented base language, namely Java. But these extensions do not fully take the interactions with the Java 2 security model into account. In particular, the implementation technique of advice weaving gives rise to two security issues: the erroneous assignment of aspects to protection domains and the violation of namespace separation. Therefore, a comprehensive discussion of the design choices available with respect to interactions with the dynamic class loading facilities of the Java VM is provided. ©2008.

关键词： Aspect oriented programming

来源：评论

学校读者我要写书评

暂无评论

design and implementation of HoME

引用

sigplan Notices (acm Special Interest Group on programming languages) 1992年第7期27卷 44-44页

作者： Ogata, Kazuhiro Kurihara, Satoshi Inari, Mikio Doi, Norihisa

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：