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

3rd acm and IEEE International conferenceon Formal Methods and Models for Co-design, MEMOCODE'05

作者： Schaumont, Patrick Shukla, Sandeep Verbauwhede, Ingrid UCLA Virginia Tech UCLA KUL

ISBN: (纸本)0780392272

We describe race-free properties of a hardware description language called GEZEL. The language describes networks of cycle-true finite-state-machines with datapaths (FSMDs). We derive a set of four rules under which a network of such FSMDs satisfies the Kahn principle. When applying those rules, GEZEL programs will be determinate and a designer will thus obtain race-free hardware. We define extended FSMD networks as FSMD networks for which some components are user-defined and not specified as FSMDs. An important result is that the determinate properties of the FSMD network are also valid for the extended FSMD network provided that the user-defined components are determinate. Most hardware description languages do not have this determinacy. Their simulation semantics are dependent on simulator implementation, and on a run-time race resolution mechanism. We therefore position GEZEL as a model of computation that RTL designers should have in mind while creating RTL models. In fact, we can generate SystemC and other HDL code from GEZEL models, thereby guaranteeing the determinacy in the generated HDL code. © 2005 IEEE.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Non-null references by default in the Java Modeling language

Non-null references by default in the Java Modeling Language

引用

2005 conference on Specification and Verification of Component-Based Systems, SAVCBS 2005

作者： Chalin, Patrice Rioux, Frédéric Dept. of Computer Science and Software Engineering Dependable Software Research Group Concordia University 1455 de Maisonneuve Blvd. West MontréalQCH3G 1M8 Canada

ISBN: (纸本)1595933719

Based on our experiences and those of our peers, we hypothesized that in Java code, the majority of declarations that are of reference types are meant to be non-null. Unfortunately, the Java Modeling language (JML), like most interface specification and object-oriented programming languages, assumes that such declarations are possibly-null by default. As a consequence, developers need to write specifications that are more verbose than necessary in order to accurately document their module interfaces. In practice, this results in module interfaces being left incompletely and inaccurately specified. In this paper we present the results of a study that confirms our hypothesis. Hence, we propose an adaptation to JML that preserves its language design goals and that allows developers to specify that declarations of reference types are to be interpreted as non-null by default. We explain how this default is safer and results in less writing on the part of specifiers than null-by-default. The paper also reports on an implementation of the proposal in some of the JML tools. © 2005 acm.

关键词： Specifications

来源：评论

学校读者我要写书评

暂无评论

Modeling Turnpike frontend system: A model-driven development framework leveraging UML metamodeling and attribute-oriented programming 05

引用

8th International conference on Model Driven Engineering languages and Systems

作者： Wada, H Suzuki, J Univ Massachusetts Dept Comp Sci Boston MA 02125 USA

ISBN: (纸本)3540290109

This paper describes and empirically evaluates a new model-driven development framework, called Modeling Turnpike (or mTurnpike). It allows developers to model and program domain-specific concepts (ideas and mechanisms specific to a particular business or technology domain) and to transform them to the final (compilable) source code. By leveraging UML metamodeling and attribute-oriented programming, mTurnpike provides an abstraction to represent domain-specific concepts at the modeling and programming layers simultaneously. The mTurnpike frontend system transforms domain-specific concepts from the modeling layer to programming layer, and vise versa, in a seamless manner. Its backend system combines domain-specific models and programs, and transforms them to the final (compilable) source code. This paper focuses on the frontend system of mTurnpike, and describes its design, implementation and performance implications. In order to demonstrate how to exploit mTurnpike in application development, this paper also shows a development process using an example DSL (domain specific language) to specify service-oriented distributed systems.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

What does aspect-oriented programming mena to Cobol

What does aspect-oriented programming mena to Cobol

引用

AOSD 2005: 4th International conference on Aspect-Oriented Software Development

作者： Lämmel, Ralf De Schutter, Kris Free University CWI Amsterdam Netherlands SEL INTEC University Ghent Belgium

ISBN: (纸本)1595930434

We study AOP in the context of business programming with Cobol. We face the following questions: What are join points in Cobol programs? What is advice?. Does classic Cobol provide any constructs that hint at AOP? (Yes!) What are typical crosscutting concerns in the Cobol world? How do otherwise typical crosscutting concerns make sense for Cobol? How does AOP for Cobol align with classic re-engineering transformations for Cobol? We deliver an AOP language design for Cobol. Codename: AspectCobol. While we adopt several ideas from AspectJ and friends, we also devise original techniques for join-point identification and context capture. We briefly discuss a prototypical implementation of AspectCobol. Copyright 2005 acm.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

Fine-grained interoperability through mirrors and contracts

引用

acm sigplan NOTICES 2005年第10期40卷 231-245页

作者： Gray, KE Findler, RB Flatt, M Univ Utah Salt Lake City UT 84112 USA Univ Chicago Chicago IL 60637 USA

As a value flows across the boundary between interoperating languages, it must be checked and converted to fit the types and representations of the target language. For simple forms of data, the checks and coercions can be immediate, for higher order data, such as functions and objects. some must be delayed until the value is used in a particular way. Typically, these coercions and checks are implemented by an ad-hoc mixture of wrappers, reflection, and dynamic predicates. We observe that 1) the wrapper and reflection operations fit the profile of mirrors, 2) the checks correspond to contracts, and 3) the timing and shape of mirror operations coincide with the timing and shape of contract operations. Based on these insights, we present a new model of interoperability that builds on the ideas of mirrors and contracts, and we describe an interoperable implementation of Java and Scheme that is guided by the model.

关键词： languages design interoperability mirrors contracts Java Scheme

来源：评论

学校读者我要写书评

暂无评论

Formal loop merging for signal transforms

引用

acm sigplan NOTICES 2005年第6期40卷 315-326页

作者： Franchetti, F Voronenko, Y Püschel, M Carnegie Mellon Univ Dept Elect & Comp Engn Pittsburgh PA 15213 USA

A critical optimization in the domain of linear signal transforms, such as the discrete Fourier transform (DFT), is loop merging, which increases data locality and reuse and thus performance. In particular, this includes the conversion of shuffle operations into array reindexings. To date, loop merging is well understood only for the DFT, and only for Cooley-Tukey FFT based algorithms, which excludes DFT sizes divisible by large primes. In this paper, we present a formal loop merging framework for general signal transforms and its implementation within the SPIRAL code generator. The framework consists of Sigma-SPL, a mathematical language to express loops and index mappings;a rewriting system to merge loops in E-SPL;and a compiler that translates Sigma-SPL into code. We apply the framework to DFT sizes that cannot be handled using only the Cooley-Tukey FFT and compare our method to FFTW 3.0.1 and the vendor library Intel MKL 7.2.1. Compared to FFTW our generated code is a factor of 2-4 faster under equal implementation conditions (same algorithms, same unrolling threshold). For some sizes we show a speed-up of a factor of 9 using Bluestein's algorithm. Further, we give a detailed comparison against the Intel vendor library MKL;our generated code is between 2 times faster and 4.5 times slower.

关键词： linear signal transform discrete Fourier transform DFT loop optimization domain-specific language automatic performance tuning

来源：评论

学校读者我要写书评

暂无评论

Incrementalization across object abstraction

引用

acm sigplan NOTICES 2005年第10期40卷 473-486页

作者： Liu, YA Stoller, SD Gorbovitski, M Rothamel, T Liu, YE SUNY Stony Brook Dept Comp Sci Stony Brook NY 11794 USA Univ Manitoba Dept Comp Sci Winnipeg MB R3T 2N2 Canada

Object abstraction supports the separation of what operations are provided by systems and components from how the operations are implemented, and is essential in enabling the construction of complex systems from components. Unfortunately, clear and modular implementations have poor performance when expensive query operations are repeated, while efficient implementations that incrementally maintain these query results are much more difficult to develop and to understand, because the code blows up significantly, and is no longer clear or modular. This paper describes a powerful and systematic method that first allows the "what" of each component to be specified in a clear and modular fashion and implemented straightforwardly in an object-oriented language;then analyzes the queries and updates, across object abstraction, in the straightforward implementation: and finally derives the sophisticated and efficient "how;, of each component by incrementally maintaining the results of repeated expensive queries with respect to updates to their parameters. Our implementation and experimental results for example applications in query optimization, role-based access control, etc. demonstrate tire effectiveness and benefit of the method.

关键词： design languages performance abstraction design program transformation incrementalization invariants program analysis program optimization object-oriented

来源：评论

学校读者我要写书评

暂无评论

A formal enforcement framework for role-based access control using aspect-oriented programming 05

引用

8th International conference on Model Driven Engineering languages and Systems

作者： Pavlich-Mariscal, J Michel, L Demurjian, S Univ Connecticut Dept Comp Sci & Engn U2155 Storrs CT 06269 USA

ISBN: (纸本)3540290109

Many of today's software applications require a high-level of security, defined by a detailed policy and attained via mechanisms such as role-based access control (RBAC), mandatory access control, digital signatures, etc. The integration of the design/implementation processes of access-control policies with runtime enforcement mechanisms is crucial to achieve an acceptable level of security for a software application. Our prior research focused on formalizing the concept of a role slice, which is a unified modeling language (UML) artifact that captures RBAC security requirements by defining permissions in the form of allowable or prohibited methods, and by specifying roles as specialized class diagrams that contain those methods. This paper augments this effort by introducing a formal framework for the security of software applications that supports the automatic translation of a role-slice access-control policy (RBAC requirements) into aspect-oriented programming (AOP) enforcement code that is seamlessly integrated with the application. The formal framework provides the necessary underpinnings to automate the integration of security policies into software. A prototyping effort based on Borland's UML tool Together Control Center for defining role-slice diagrams and the associated AOP code generator is under development.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Crosscutting techniques in program specification and analysis 05

Crosscutting techniques in program specification and analysi...

引用

AOSD 2005: 4th International conference on Aspect-Oriented Software Development

作者： Lam, Patrick Kupcak, Viktor Rinard, Martin Computer Science and Artificial Intelligence Laboratory Massachusetts Institute of Technology Cambridge MA 02139 United States

ISBN: (纸本)1595930434

We present three aspect-oriented constructs (formats, scopes, and defaults) that, in combination with a specification language based on abstract sets of objects, enable the modular application of multiple arbitrarily precise (and therefore arbitrarily unscalable) analyses to scalably verify data structure consistency properties in sizable programs. Formats use a form of field introduction to group together the declarations of all of the fields that together comprise a given data structure. Scopes and defaults enable the developer to state certain data structure consistency properties once in a single specification construct that cuts across the preconditions and postconditions of the procedures in the system. Standard approaches, in contrast, scatter and duplicate such properties across the preconditions and postconditions. We have implemented a prototype implementation, specification, analysis, and verification system based on these constructs and used this system to successfully verify a range of data structure consistency properties in several programs. Most previous research in the field of aspect-oriented programming has focused on the use of aspect-oriented concepts in design and implementation. Our experience indicates that aspect-oriented concepts can also be extremely useful for specification, analysis, and verification. Copyright 2005 acm.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Shangri-la: Achieving high performance from compiled network applications while enabling ease of programming

引用

acm sigplan NOTICES 2005年第6期40卷 224-236页

作者： Chen, MK Li, XF Lian, RQ Lin, JH Liu, LX Liu, T Ju, R Intel Corp Microproc Technol Labs Santa Clara CA 95051 USA Intel China Res Ctr Ltd Beijing Peoples R China Chinese Acad Sci Inst Comp Technol Beijing Peoples R China

programming network processors is challenging. To sustain high line rates, network processors have extremely tight memory access and instruction budgets. Achieving desired performance has traditionally required hand-coded assembly. Researchers have recently proposed high-level programming languages for packet processing, but the challenges of compiling these languages into code that is competitive with hand-tuned assembly remain unanswered. This paper describes the Shangri-La compiler, which accepts a packet program written in a C-like high-level language and applies scalar and specialized optimizations to generate a highly optimized binary. Hot code paths identified by profiling are mapped across processing elements to maximize processor utilization. Since our compilation target has no hardware caches, software-controlled caches are generated for frequently accessed application data structures. Packet handling optimizations significantly reduce per-packet memory access and instruction counts. Finally, a custom stack model maps stack frames to the fastest levels of the target processor's heterogeneous memory hierarchy. Binaries generated by the compiler were evaluated on the Intel IXP2400 network processor with eight packet processing cores and eight threads per core. Our results show the importance of both traditional and specialized optimization techniques for achieving the maximum forwarding rates on three network applications, L3-Switch, MPLS and Firewall.

关键词： packet processing network processors chip multiprocessors throughput-oriented computing program partitioning dataflow programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：