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

Dependence analysis for pointer variables

sigplan Notices (acm Special Interest Group on programming languages) 1989年第7期24卷 28-40页

作者： Horwitz, Susan Pfeiffer, Phil Reps, Thomas Univ of Wisconsin United States

Our concern is how to determine data dependences between program constructs in programming languages with pointer variables. We are particularly interested in computing data dependences for languages that manipulate heap-allocated storage, such as Lisp and Pascal. We have defined a family of algorithms that compute safe approximations to the flow, output, and anti-dependences of a program written in such a language. Our algorithms account for destructive updates to fields of a structure and thus are not limited to the cases where all structures are trees or acyclic graphs;they are applicable to programs that build cyclic structures. For structured programming constructs, the technique can be extended to distinguish between loop-carried and loop-independent dependences, as well as to determine lower bounds on minimum distances for loop-carried dependences.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

A race-free hardware modeling language

A race-free hardware modeling language

引用

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

来源：评论

学校读者我要写书评

暂无评论

Query language for multidimensional arrays: design, implementation, and optimization techniques

Query language for multidimensional arrays: Design, implemen...

引用

proceedings of the 1996 acm SIGMOD International conference on Management of Data

作者： Libkin, Leonid Machlin, Rona Wong, Limsoon Bell Lab

While much recent research has focussed on extending databases beyond the traditional relational model, relatively little has been done to develop database tools for querying data organized in (multidimensional) arrays. The scientific computing community has made little use of available database technology. Instead, multidimensional scientific data is typically stored in local files conforming to various data exchange formats and queried via specialized access libraries tied in to general purpose programming languages. To allow such data to be queried using known database techniques, we design and implement a query language for multidimensional arrays. Our main design decision is to treat arrays as functions from index sets to values rather than as collection types. This leads to clean syntax and semantics as well as simple but powerful optimization rules. We present a calculus for arrays that extends standard calculi for complex objects. We derive a higher-level comprehension style query language based on this calculus and describe its implementation, including a data driver for the NetCDF data exchange format. Next, we explore some optimization rules obtained from the equational laws of our core calculus. Finally, we study the expressiveness of our calculus and prove that it essentially corresponds to adding ranking to a query language for complex objects.

关键词： Query languages

来源：评论

学校读者我要写书评

暂无评论

language-specific make technology for the Java™ programming language

引用

acm sigplan NOTICES 2002年第11期37卷 373-385页

作者： Dmitriev, M Sun Microsyst Inc Mt View CA 94043 USA

Keeping the code of a Java(TM) application consistent (code is consistent if all of the project classes can be recompiled together without errors) prevents late linking errors, and thus may significantly improve development turnaround time. In this paper we describe a make technology for the Java programming language, that is based on smart dependency checking, guarantees consistency of the project code, and at the same time reduces the number of source code recompilations to the minimum. After project code consistency is initially assured by complete recompilation, the information extracted from the binary classes is stored in a so-called project database. Whenever the source code for some class C is changed, its recompiled binary is compared to the old version of C preserved in the project database. As a, result, we find a minimum subset of classes that depend on C and may be affected by the particular change made to it. These are recompiled in turn, and absence of compilation errors at this phase guarantees the consistency of the new project code. To determine which dependent classes to recompile, we categorize all source incompatible changes, and for each category establish a criterion for finding the smallest possible subset of dependent classes.

关键词： design languages Java dependency checking make development turnaround time

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Ansible Lightspeed: A Code Generation Service for IT Automation 24

Ansible Lightspeed: A Code Generation Service for IT Automat...

引用

39th acm/IEEE International conference on Automated Software Engineering (ASE)

作者： Sahoo, Priyam Pujar, Saurabh Nalawade, Ganesh Gebhardt, Richard Mandel, Louis Buratti, Luca Red Hat Raleigh NC USA IBM Res Yorktown Hts NY 10598 USA

ISBN: (数字)9798400712487

ISBN: (纸本)9798400712487

The availability of Large language Models (LLMs) which can generate code, has made it possible to create tools that improve developer productivity. Integrated development environments or IDEs which developers use to write software are often used as an interface to interact with LLMs. Although many such tools have been released, almost all of them focus on general-purpose programming languages. Domain-specific languages, such as those crucial for Information Technology (IT) automation, have not received much attention. Ansible is one such YAML-based IT automation-specific language. Ansible Lightspeed is an LLM-based service designed explicitly to generate Ansible YAML, given natural language prompt. In this paper, we present the design and implementation of the Ansible Lightspeed service. We then evaluate its utility to developers using diverse indicators, including extended utilization, analysis of user edited suggestions, as well as user sentiments analysis. The evaluation is based on data collected for 10,696 real users including 3,910 returning users. The code for Ansible Lightspeed service and the analysis framework is made available for others to use. To our knowledge, our study is the first to involve thousands of users of code assistants for domain-specific languages. We are also the first code completion tool to present N-Day user retention figures, which is 13.66% on Day 30. We propose an improved version of user acceptance rate, called Strong Acceptance rate, where a suggestion is considered accepted only if less than 50% of it is edited and these edits do not change critical parts of the suggestion. By focusing on Ansible, Lightspeed is able to achieve a strong acceptance rate of 49.08% for multi-line Ansible task suggestions. With our findings we provide insights into the effectiveness of small, dedicated models in a domain-specific context. We hope this work serves as a reference for software engineering and machine learning researchers exploring code c

关键词： Productivity Sentiment analysis Codes Automation Large language models Natural languages Machine learning Software Software engineering Domain specific languages

来源：评论

学校读者我要写书评

暂无评论

Semantics of program dependence

引用

sigplan Notices (acm Special Interest Group on programming languages) 1989年第7期24卷 13-27页

作者： Cartwright, Robert Felleisen, Matthias Rice Univ United States

Optimizing and parallelizing compilers for procedural languages rely on various forms of program dependence graphs (pdgs) to express the essential control and data dependences among atomic program operations. In this paper, we provide a semantic justification for this practice by deriving two different forms of program dependence graph - the output pdg and the def-order pdg - and their semantic definitions from non-strict generalizations of the denotational semantics of the programming language. In the process, we demonstrate that both the output pdg and the def-order pdg (with minor technical modifications) are conventional data-flow programs. In addition, we show that the semantics of the def-order pdg dominates the semantics of the output pdg and that both of these semantics dominate - rather than preserve - the semantics of sequential execution.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Towards integrating modeling and programming languages: The case of UML and Java 2

Towards integrating modeling and programming languages: The ...

引用

2nd International Workshop on The Globalization of Modeling languages, GEMOC 2014, Co-located with acm/IEEE 17th International conference on Model Driven Engineering languages and Systems, Models 2014

作者： Neubauer, Patrick Mayerhofer, Tanja Kappel, Gerti Business Informatics Group Vienna University of Technology Austria

Today, modeling and programming constitute separate activities carried out using modeling respectively programming languages, which are neither well integrated with each other nor have a one-to-one correspondence. As a consequence, platform and implementation details, such as the usage of existing software components and libraries, are usually introduced on code level only. This impedes accurate model-level analyses that take platform-specific decisions into account as well as the direct deployment of executable models on the target platform. In this work we present an approach for integrating existing software libraries with fUML models - an executable variant of UML models for which a standardized virtual machine exists - not only at design time but also at runtime. As a result of that, the modeler is empowered with the capabilities provided by existing software libraries on model level. Our approach is evaluated based on unit tests and initial case studies available in the ReMoDD repository that assess the correctness, performance, and completeness of our implementation.

关键词： Unified Modeling language

来源：评论

学校读者我要写书评

暂无评论

A model transformation semantics and analysis methodology for SecureUML 06

引用

9th International conference on Model Driven Engineering languages and Systems

作者： Brucker, Achim D. Doser, Juergen Wolff, Burkhart ETH CH-8092 Zurich Switzerland

ISBN: (纸本)3540457720

SecureUML is a security modeling language for formalizing access control requirements in a declarative way. It is equipped with a UML notation in terms of a UML profile, and can be combined with arbitrary design modeling languages. We present a semantics for SecureUML in terms of a model transformation to standard UML/OCL. The transformation scheme is used as part of an implementation of a tool chain ranging from front-end visual modeling tools over code-generators to the interactive theorem proving environment HOL-OCL. The methodological consequences for an analysis of the generated OCL formulae are discussed.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Considerate Reasoning and the Composite design Pattern 10

引用

11th International conference on Verification, Model Checking, and Abstract Interpretation

作者： Summers, Alexander J. Drossopoulou, Sophia Imperial Coll London London England

ISBN: (纸本)9783642113185

We propose Considerate Reasoning, a novel specification and verification technique based on object invariants. This technique supports succinct specifications of implementations which follow the pattern of breaking properties of other objects and then notifying them appropriately. It allows the specification to be concerned only with the properties directly relevant to the current method call, with no need to explicitly mention the concerns of subcalls. In this way, the specification reflects the division of responsibility present in the implementation, and reflects what we regard as the natural argument behind the design. We specify and prove the well-known Composite design pattern using Considerate Reasoning. We show how to encode our approach in Boogie2. The resulting specification verifies automatically within a few seconds;no manual guidance is required beyond the careful representation of the invariants themselves.

关键词： Specifications

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：