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

From ML to Ada: Strongly-typed language interoperability via source translation

Journal of Functional Programming 1998年第4期8.0卷 367-412页

作者： Tolmach, Andrew Oliva, Dino P. Pacific Software Research Center Department of Computer Science Portland State University Portland OR 97207-0751 P.O. Box 751 United States Pacific Software Research Center Dept. of Comp. Sci. and Engineering Oregon Graduate Institute Portland OR 97291-1000 20000 N.W. Walker Road United States Bell Laboratories Murray Hill NJ 07974-0636 600 Mountain Ave. United States

We describe a system that supports source-level integration of ML-like functional language code with ANSI C or Ada83 code. The system works by translating the functional code into type-correct, 'vanilla' C or Ada;it offers simple, efficient, type-safe inter-operation between new functional code components and 'legacy' third-generation-language components. Our translator represents a novel synthesis of techniques including user-parameterized specification of primitive types and operators;removal of polymorphism by code specialization;removal of higher-order functions using closure datatypes and interpretation;and aggressive optimization of the resulting first-order code, which can be viewed as encoding the result of a closure analysis. Programs remain fully typed at every stage of the translation process, using only simple, standard type systems. Target code runs at speeds comparable to the output of current optimizing ML compilers, even though handicapped by a conservative garbage collector.

关键词：

来源：评论

学校读者我要写书评

暂无评论

The consensus glossary of temporal database concepts - february 1998 version

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in computer science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 1998年 1399卷 367-405页

作者： Jensen, Christian S. Dyreson, Curtis E. Bohlen, Michael Clifford, James Elmasri, Ramez Gadia, Shashi K Grandi, Fabio Hayes, Pat Jajodia, Sushil Käfer, Wolfgang Kline, Nick Lorentzos, Nikos Mitsopoulos, Yannis Montanari, Angelo Nonen, Daniel Peressi, Elisa Pernici, Barbara Roddick, John F Sarda, Nandlal L Scalas, Maria Rita Segev, Arie Snodgrass, Richard T Soo, Mike D. Tansel, Abdullah Tiberio, Paolo Wiederhold, Gio Aalborg University Department of Computer Science Fredrik Bajers Vej 7E Aalborg ØDK-9220 Denmark Computer Science Dept Aalborg University Denmark Computer Science Dept James Cook University Australia Computer Science Engineer¬ing Dept University of Texas at Arlington United States Computer Science Dept Iowa State University United States CIOC-CNR DEIS University of Bologna Italy Beckman Institute United States In¬formation and Software Systems Engineering Dept George Mason University United States Mercedes Benz Agricultural University of Athens Greece Informatics Laboratory Agricultural University of Athens Greece Infor¬matics Laboratory Agricultural University of Athens Greece Dip. di Matematica e Informatica Universita di Udine Italy Computer Science Dept Concordia University Canada Dip. di Matematica e Informatica Universita di Udine Italy Electronic Engineering and Information Sciences Dept Politecnico di Milano Italy School of Computer and Information Science University of South Australia Australia Computer Science and Engineering Dept Indian Institute of Technology Bombay India University of Bologna Italy School of Business Adm. and Computer Science Research Dept University of California United States Computer Science Dept Uni¬versity of Arizona United States Computer Science and Engineering Dept University of South Florida United States Bernard M. Baruch College City University of New York United States CIOC-CNR DEIS University of Bologna Italy Computer Science Dept Stanford University United States

This document1 contains definitions of a wide range of concepts specific to and widely used within temporal databases. In addition to providing definitions, the document also includes explanations of concepts as well as discussions of the adopted names. The consensus effort that lead to this glossary was initiated in Early 1992. Earlier versions appeared in SIGMOD Record in September 1992 and March 1994. The present glossary subsumes all the previous documents. The glossary meets the need for creating a higher degree of consensus on the definition and naming of temporal database concepts. Two sets of criteria are included. First, all included concepts were required to satisfy four relevance criteria, and, second, the naming of the concepts was resolved using a set of evaluation criteria. The concepts are grouped into three categories: concepts of general database interest, of temporal database interest, and of specialized interest. © Springer-Verlag Berlin Heidelberg 1998.

关键词： Database systems

来源：评论

学校读者我要写书评

暂无评论

Building program optimizers with rewriting strategies 98

Building program optimizers with rewriting strategies

引用

Proceedings of the third ACM SIGPLAN international conference on Functional programming

作者： Eelco Visser Zine-el-Abidine Benaissa Andrew Tolmach Pacific Software Research Center and Dept. of Comp. Science and Engineering Oregon Graduate Institute P.O. Box 91000 Portland Oregon Pacific Software Research Center and Dept. of Comp. Science and Engineering Oregon Graduate Institute P.O. Box 91000 Portland Oregon and Dept. of Comp. Science and Engineering Oregon Graduate Institute P.O. Box 91000 Portland Oregon and Dept. of Computer Science Portland State University P.O. Box 751 Portland Oregon

ISBN: (纸本)9781581130249

We describe a language for defining term rewriting strategies, and its application to the production of program optimizers. Valid transformations on program terms can be described by a set of rewrite rules; rewriting strategies are used to describe when and how the various rules should be applied in order to obtain the desired optimization effects. Separating rules from strategies in this fashion makes it easier to reason about the behavior of the optimizer as a whole, compared to traditional monolithic optimizer implementations. We illustrate the expressiveness of our language by using it to describe a simple optimizer for an ML-like intermediate *** basic strategy language uses operators such as sequential composition, choice, and recursion to build transformers from a set of labeled unconditional rewrite rules. We also define an extended language in which the side-conditions and contextual rules that arise in realistic optimizer specifications can themselves be expressed as strategy-driven rewrites. We show that the features of the basic and extended languages can be expressed by breaking down the rewrite rules into their primitive building blocks, namely matching and building terms in variable binding environments. This gives us a low-level core language which has a clear semantics, can be implemented straightforwardly and can itself be optimized. The current implementation generates C code from a strategy specification.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Royal Academy of Medicine in Ireland - Section of Bioengineering - Proceedings of meeting held in Dundalk, Co. Louth, in February 1998.

引用

IRISH JOURNAL OF MEDICAL science 1998年第4期167卷 256-276页

作者： [Anonymous] Orthopaedic Research Unit The Queen’s University of Belfast School of Biomedical Sciences The Queen’s University of Belfast Howmedica International Ltd. Raheen Industrial Estate Limerick Department of Mechanical Engineering Trinity College Dublin 2 Mater Hospital Dublin 7 Orthopaedic Research Laboratory Århus University Hospital Denmark University of Limerick Limerick Limerick Regional Hospital Raheen Limerick Boston Scientific Ireland Ltd. Galway Department of Mechanical Engineering University College Dublin Dublin Department of Electrical and Electronic Engineering University College Dublin Dublin Bioengineering Research Centre Department of Mechanical Engineering University College Dublin Dublin Northern Ireland Bio-Engineering Centre (NIBEC) School of Electrical and Mechanical Engineering University of Ulster Newtownabbey Department of Mechanical & Manufacturing Engineering The Ashby Building The Queen’s University of Belfast Johnson and Johnson Professional Orthopaedic Division Queensway England Department of Cardiology and Department of Medical Physics & Bioengineering St. James’s Hospital Dublin 8 Burke House Ellison Street Castlebar Royal College of Surgeons in Ireland Department of Surgery Beaumont Hospital Dublin Department of Electronic and Electrical Engineering Trinity College Dublin 2 Department of Aeronautical Engineering The Queen’s University of Belfast Vascular Unit Belfast City Hospital Department of Medical Physics and Bioengineering St. James’s Hospital Dublin 8 Centre for Biomedical Electronics Department of Electronic and Computer Engineering University of Limerick Limerick Department of Mechanical and Aeronautical Engineering University of Limerick Limerick School of Health Sciences University of Ulster Ireland School of Physiotherapy University of Ulster Newtownabbey Clinical Engineering NI Medical Physics Agency Belfast and Radiology Royal Victoria Hospital Musgrave Park Hospital University of Limerick Biomedical Institute (ULBMI) Uni

来源：评论

学校读者我要写书评

暂无评论

Establishing experience factories at Daimler-Benz: an experience report 98

Establishing experience factories at Daimler-Benz: an experi...

引用

Proceedings of the 20th international conference on software engineering

作者： Frank Houdek Kurt Schneider Eva Wieser Daimler-Benz AG Research and Technology P.O. Box 23 60 89013 Ulm Germany and University of Ulm Faculty of Computer Science Dept. Software Engineering 89069 Ulm Germany Daimler-Benz AG Research and Technology P.O. Box 23 60 89013 Ulm Germany

来源：评论

学校读者我要写书评

暂无评论

Success factors for software reuse that are applicable across domains and businesses 97

Success factors for software reuse that are applicable acros...

引用

1997 ACM Symposium on Applied Computing, SAC 1997

作者： Rine, David C. Dept. of Computer Science and Information and Software Systems Engineering School of Information Technology and Engineering George Mason University Fairfax VA United States

ISBN: (纸本)0897918509

The problem researched is that there presently does not exist a set of success factors which are common across organizations and have some predictability relationship to software reuse. For completeness, this research also investigated possible predictive relationships between software reuse and both productivity and quality. A 1995 survey was conducted to determine the state-of-the-practice. The data from the survey was statistically analyzed to evaluate the relationships among reuse capability, productivity, quality, and the individual software reuse success factors. The results of the analysis showed some of the success factors to have a predictive relationship to software reuse capability. software reuse capability also had a predictive relationship to productivity and quality. Based on the research results, the leading indicators of software reuse capability are: product-line approach, architecture which standardizes interfaces and data formats, common software architecture across the product-line, design for manufacturing approach, domain engineering, management which understands reuse issues, software reuse advocate(s) in senior management, state-of-the-art tools and methods, precedence of reusing high level software artifacts such as requirements and design versus just code reuse, and trace end-user requirements to the components (systems, subsystems, and/or software modules) which support them. © 1997 ACM.

关键词： computer software reusability

来源：评论

学校读者我要写书评

暂无评论

From domain models to architecture frameworks 97

From domain models to architecture frameworks

引用

1997 Symposium on software Reusability, SSR 1997

作者： Meekel, Jacques Horton, Thomas B. France, Robert B. Mellone, Charlie Dalvi, Sajid Motorola Inc. Corporate Software Research and Development Boynton BeachFL United States Motorola Inc. Integrated Software Products Boynton BeachFL United States Dept of Computer Science and Engineering Florida Atlantic University Boca RatonFL United States

ISBN: (纸本)0897919459

This paper addresses how domain analysis served to help create reusable architectures and components in the development of a real-time embedded system. The subject domain is portable wireless communication devices. The paper discusses this experience in terms of discovering and developing reusable frameworks for this domain. Some interesting differences between this approach and what is usually suggested as a process for developing frameworks are described. © 1997 ACM.

关键词： Reusability

来源：评论

学校读者我要写书评

暂无评论

Usability of compromise-free statistical databases

Usability of compromise-free statistical databases

引用

International Working Conference on Scientific and Statistical Database Management

作者： L. Branliovic M. Miller P. Horak G. Wrightson Dept. of Comput. Sci. & Software Eng. Newcastle Univ. NSW Australia Department of Mathematics Kuwait University Kuwait Department of Computer Science and Software Engineering University of Newcastle NSW Australia

The usability of a statistical database is defined to be the ratio of the cardinality of the largest set of queries which can be answered without compromise to the total number of queries. In this paper, we present new results concerning the usability of secure statistical databases for general SUM, COUNT and MEAN queries, as well as for the corresponding range queries. We give the usability of these k-dimensional databases for all k/spl ges/1. The paper concludes with a discussion of the implications of our results.

关键词： Usability Databases computer science software engineering Data security Information security Cities and towns Remuneration Aggregates Frequency

来源：评论

学校读者我要写书评

暂无评论

1D representations and systems theory for a class of 2D linear systems 4

1D representations and systems theory for a class of 2D line...

引用

4th European Control Conference, ECC 1997

作者： Galkowski, K. Rogers, E. Owens, D.H. Department of Robotics and Software Engineering Technical University of Zielona Gora ul. Podgorna 50 Zielona Gora65-246 Poland ISIS Group Dept. Electronics and Computer Science University of Southampton SouthamptonSO17 1BJ United Kingdom School of Engineering University of Exeter North Park Road ExeterEX4 4QF United Kingdom

ISBN: (纸本)9783952426906

Repetitive, or multipass, processes are a class of systems characterised by a series of sweeps through a set of dynamics defined over a finite fixed duration. The class of so-called discrete linear repetitive processes have strong structural links with well studied classes of 2D linear systems and also with standard (1D) linear systems. One possible approach to the (control related) analysis of these processes is to embed their basic 2D structure in a 1D representation. This paper develops such a representation and uses it to characterise the key systems theoretic property of controllability for this class of linear repetitive processes.

关键词： Linear systems

来源：评论

学校读者我要写书评

暂无评论

An object-oriented dependency graph for program slicing

An object-oriented dependency graph for program slicing

引用

Technology of Object-Oriented Languages and Systems (TOOLS)

作者： Jian-Liang Chen Feng-Jian Wang Yung-Lin Chen Dept. of Comput. Sci. & Inf. Eng. Nat. Chiao Tung Univ. Hsinchu Taiwan Department of Computer Science and Information Engineering National Chiao Tung University Taiwan Software Engineering Laboratory Institute for Information Industry Taiwan

Program dependency graphs (PDG) facilitate program analysis and related applications such as program slicing, which is a method to identify the relevant entities of the program according to data and control dependencies. In the past, PDGs and program slicing were mostly developed for (conventional) imperative programs. Recently, the object-oriented (OO) paradigm has gained momentum and popularity. The OO paradigm introduces the features of object abstraction, encapsulation, inheritance and polymorphism to programs, but is not considered in PDGs and program slicing. In this paper, we present an object-oriented dependency graph (ODG) to represent the structure of OO programs. The ODG is defined based on a property multi-digraph that is extended from a directed graph by augmenting multiple edge types, vertex properties and property relations. With these extensions, the ODG can avoid specious dependencies due to object encapsulation. Based on the ODG, a program slicing method for OO software is developed. Besides data and control dependencies, dependencies caused by OO features are taken into consideration in our slicing method. Through the ODG, the slicing method can be applied to facilitate the understanding, debugging and maintenance of OO software in the same way that traditional program slicing methods do.

关键词： Encapsulation Debugging Information analysis software testing computer science Data engineering software engineering Laboratories computer industry Industrial control

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：