发布求助
文献互助 智能选刊 最新文献

Proceedings of 1994 IEEE International Conference on Computer Languages (ICCL'94)最新文献

筛选
英文 中文
Region analysis: a parallel elimination method for data flow analysis 区域分析:数据流分析的并行消除方法
Proceedings of 1994 IEEE International Conference on Computer Languages (ICCL'94) Pub Date : 1994-05-16 DOI: 10.1109/ICCL.1994.288395
Yong-Fong Lee, B. Ryder, M. Fiuczynski
{"title":"Region analysis: a parallel elimination method for data flow analysis","authors":"Yong-Fong Lee, B. Ryder, M. Fiuczynski","doi":"10.1109/ICCL.1994.288395","DOIUrl":"https://doi.org/10.1109/ICCL.1994.288395","url":null,"abstract":"Parallel data flow analysis methods offer the promise of calculating detailed semantic information about a program at compile-time more efficiently than sequential techniques. Previous work on parallel elimination methods has been hampered by the lack of control over interval size; this can prohibit effective parallel execution of these methods. To overcome this problem, we have designed the region analysis method, a new elimination method for data flow analysis. Region analysis emphasizes flow graph partitioning to enable better load balancing in a more effective parallel algorithm. We present the design of region analysis and the empirical results we have obtained that indicate: the prevalence of large intervals in flow graphs derived from real programs; and the performance improvement of region analysis over parallel Allen-Cocke interval analysis. Our implementation analyzed programs from the Perfect Benchmarks and netlib running on a Sequent Symmetry S81.<<ETX>>","PeriodicalId":137441,"journal":{"name":"Proceedings of 1994 IEEE International Conference on Computer Languages (ICCL'94)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124166436","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 26
Customizing C++ to improve the reusability of class libraries 自定义c++以提高类库的可重用性
Proceedings of 1994 IEEE International Conference on Computer Languages (ICCL'94) Pub Date : 1994-05-16 DOI: 10.1109/ICCL.1994.288392
T. Kojima, A. Sugimoto
{"title":"Customizing C++ to improve the reusability of class libraries","authors":"T. Kojima, A. Sugimoto","doi":"10.1109/ICCL.1994.288392","DOIUrl":"https://doi.org/10.1109/ICCL.1994.288392","url":null,"abstract":"OPTEC is a language extension tool for customizing a strongly typed object-oriented language to improve the usability of specific class libraries. Using OPTEC, a system specific language for non-expert programmers call be built easily by extending C++. The system specific language supports selection of the appropriate private class from the class libraries, simplifies the use of the class, and makes it easy to define a subclass from an abstract class. The language extensions of C++ can be defined by transformation rules. OPTEC uses a tree rewriting method, in which semantic analysis is integrated. We first describe how extension and customization of the C++ language is effective for increasing the reusability of a library. Then, we illustrate the usability of OPTEC by means of extension rule examples, and present an efficient algorithm to apply rules. We also show a software organization of OPTEC and its application result.<<ETX>>","PeriodicalId":137441,"journal":{"name":"Proceedings of 1994 IEEE International Conference on Computer Languages (ICCL'94)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129610307","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A three-level object-based model 基于对象的三层模型
Proceedings of 1994 IEEE International Conference on Computer Languages (ICCL'94) Pub Date : 1994-05-16 DOI: 10.1109/ICCL.1994.288385
M. Hitchens, J. Rosenberg
{"title":"A three-level object-based model","authors":"M. Hitchens, J. Rosenberg","doi":"10.1109/ICCL.1994.288385","DOIUrl":"https://doi.org/10.1109/ICCL.1994.288385","url":null,"abstract":"The three fundamental areas of functionality in an object-based system are the creation, encapsulation and access of related data. Parallel to these areas of functionality we may identify three levels of data: data which exists as long as an object does, data which exists for the length of a procedure invocation and data which exists for the length of a process's use of an object. A new object model is proposed based on these levels of functionality and data. Objects are divided into three distinct categories (called modules, instances and handles). Each category has an explicitly defined set of functions (which are already implicitly existent in most object-based systems), including creation of one of the levels of data. Every object in a system belongs to one (and only one) category. Under this model, users should be able to more readily understand the use of any given object, as its category would be easily identifiable.<<ETX>>","PeriodicalId":137441,"journal":{"name":"Proceedings of 1994 IEEE International Conference on Computer Languages (ICCL'94)","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128948042","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Using metaprogramming to add persistence to CLOS 使用元编程向CLOS添加持久性
Proceedings of 1994 IEEE International Conference on Computer Languages (ICCL'94) Pub Date : 1994-05-16 DOI: 10.1109/ICCL.1994.288386
Arthur H. Lee, J. Zachary
{"title":"Using metaprogramming to add persistence to CLOS","authors":"Arthur H. Lee, J. Zachary","doi":"10.1109/ICCL.1994.288386","DOIUrl":"https://doi.org/10.1109/ICCL.1994.288386","url":null,"abstract":"By encapsulating aspects of language semantics within a set of default classes and allowing the programmer to derive new versions, object-oriented languages whose semantics con be tailored to the needs of individual programmers have been provided. The degree to which such languages are simultaneously flexible and efficient is an open question. We describe our experience with using this technique to incorporate support for persistence into the Common Lisp Object System (CLOS) via its metaobject protocol. For many aspects of our implementation, the metaobject protocol was perfectly suitable. In other cases, we had to variously extend the protocol, pay an unacceptable performance penalty, or modify the language implementation directly. Based on our experience, we propose some improvements to the protocol. We also present some performance measurements that reveal the need for improved language implementation techniques.<<ETX>>","PeriodicalId":137441,"journal":{"name":"Proceedings of 1994 IEEE International Conference on Computer Languages (ICCL'94)","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116257725","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 10
Real spreadsheets for real programmers 真正的程序员的真正的电子表格
Proceedings of 1994 IEEE International Conference on Computer Languages (ICCL'94) Pub Date : 1994-05-16 DOI: 10.1109/ICCL.1994.288396
Alan G. Yoder, D. Cohn
{"title":"Real spreadsheets for real programmers","authors":"Alan G. Yoder, D. Cohn","doi":"10.1109/ICCL.1994.288396","DOIUrl":"https://doi.org/10.1109/ICCL.1994.288396","url":null,"abstract":"Spreadsheets as a computing metaphor have received desultory attention from the programming languages community. Efforts to map real problems onto the metaphor however, have been hampered by serious flaws in the design and implementation of commonly available packages. We show that the intuition behind such efforts is sound; we define a spreadsheet mini-language, then use it to program solutions to some well-known problems. Since our minilanguage is in principle highly concurrent, we conclude that correctly constructed spreadsheet languages can offer both intuition and access to parallel computational resources to their users.<<ETX>>","PeriodicalId":137441,"journal":{"name":"Proceedings of 1994 IEEE International Conference on Computer Languages (ICCL'94)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116619785","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 38
Is there a future for functional languages in parallel programming? 函数式语言在并行编程中有未来吗?
Proceedings of 1994 IEEE International Conference on Computer Languages (ICCL'94) Pub Date : 1994-05-16 DOI: 10.1109/ICCL.1994.288371
B. Szymanski, J. Feo, J. Hicks, J. Jagannathan, Vivek Sarkar, D. Skillicorn
{"title":"Is there a future for functional languages in parallel programming?","authors":"B. Szymanski, J. Feo, J. Hicks, J. Jagannathan, Vivek Sarkar, D. Skillicorn","doi":"10.1109/ICCL.1994.288371","DOIUrl":"https://doi.org/10.1109/ICCL.1994.288371","url":null,"abstract":"This panel provides an outlook for the role of functional languages in parallel programming from the perspective of researchers who are actively involved in the design and implementation of parallel functional languages. The panel focuses on developments in parallel programming and functional programming and their interactions. The panelists discuss the impact of these developments on the future of parallel functional languages from the perspective of their research groups.<<ETX>>","PeriodicalId":137441,"journal":{"name":"Proceedings of 1994 IEEE International Conference on Computer Languages (ICCL'94)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121696424","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
A*: a language for implementing language processors A*:实现语言处理器的语言
Proceedings of 1994 IEEE International Conference on Computer Languages (ICCL'94) Pub Date : 1994-05-16 DOI: 10.1109/ICCL.1994.288398
David A. Ladd, J. Ramming
{"title":"A*: a language for implementing language processors","authors":"David A. Ladd, J. Ramming","doi":"10.1109/ICCL.1994.288398","DOIUrl":"https://doi.org/10.1109/ICCL.1994.288398","url":null,"abstract":"A* is an experimental language designed to facilitate the creation of language-processing tools. It is analogous either to an interpreted yacc with Awk as its statement language, or to a version of Awk which processes programs rather than records. A* offers two principal advantages over the combination of lex, yacc, and C: a high-level interpreted base language and built-in parse tree construction. A* programmers are thus able to accomplish many useful tasks with little code. This paper describes the motivation for A*, its design, and its evolution. Experience with A* is described, and then the paper concludes with an analysis of A*'s principal weaknesses.<<ETX>>","PeriodicalId":137441,"journal":{"name":"Proceedings of 1994 IEEE International Conference on Computer Languages (ICCL'94)","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122188295","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 57
Composites: trees for data parallel programming 复合:用于数据并行编程的树
Proceedings of 1994 IEEE International Conference on Computer Languages (ICCL'94) Pub Date : 1994-05-16 DOI: 10.1109/ICCL.1994.288394
Mark Chu-Carroll, L. Pollock
{"title":"Composites: trees for data parallel programming","authors":"Mark Chu-Carroll, L. Pollock","doi":"10.1109/ICCL.1994.288394","DOIUrl":"https://doi.org/10.1109/ICCL.1994.288394","url":null,"abstract":"Data parallel programming languages offer ease of programming and debugging and scalability of parallel programs to increasing numbers of processors. Unfortunately, the usefulness of these languages for non-scientific programmers and loosely coupled parallel machines is currently limited. We present the composite tree model which seeks to provide greater flexibility via parallel data types, support for more general, hierarchical parallelism, parallel control flow, and efficient execution on loosely coupled, coarse grained parallel machines such as workstation networks. The composite tree model is a new model of parallel programming based on merging data parallelism with object oriented programming languages, and can be implemented as a small set of extensions to any pure, static typed, object oriented programming language.<<ETX>>","PeriodicalId":137441,"journal":{"name":"Proceedings of 1994 IEEE International Conference on Computer Languages (ICCL'94)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123815439","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
Visual language for behavioral specifications of reactive systems 反应性系统行为规范的视觉语言
Proceedings of 1994 IEEE International Conference on Computer Languages (ICCL'94) Pub Date : 1994-05-16 DOI: 10.1109/ICCL.1994.288380
Lewis H Chau, Gary K Chan
{"title":"Visual language for behavioral specifications of reactive systems","authors":"Lewis H Chau, Gary K Chan","doi":"10.1109/ICCL.1994.288380","DOIUrl":"https://doi.org/10.1109/ICCL.1994.288380","url":null,"abstract":"Complex reactive systems require specifying the relationship of inputs and outputs in the time domain. Typically, such descriptions involve complex sequences of events, often, with explicit timing constraints, that combine to form the system's overall behavior. In addition, most reactive systems are highly concurrent and hierarchical. Investigating formal methods for behavior specification of reactive systems presents real challenges. A new visual language for behavioral specification of complex reactive systems is described. We call it Constraint Narrowing Grammar (CNG). CNG combines concepts from logic programming, rewriting, and lazy evaluation. The non-deterministic and nonterminating properties of CNG make it a nice formalism to model infinite reactive systems' behavior. We demonstrate how a graphical specification can be mapped to CNG rules and show step-by-step how notations of hierarchy, concurrency, and event communication are introduced into the specification. The resulting grammar is an executable behavioral specification of complex reactive systems.<<ETX>>","PeriodicalId":137441,"journal":{"name":"Proceedings of 1994 IEEE International Conference on Computer Languages (ICCL'94)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130590470","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Generating optimizing specializers 生成优化专家
Proceedings of 1994 IEEE International Conference on Computer Languages (ICCL'94) Pub Date : 1994-05-16 DOI: 10.1109/ICCL.1994.288382
R. Glück, J. Jørgensen
{"title":"Generating optimizing specializers","authors":"R. Glück, J. Jørgensen","doi":"10.1109/ICCL.1994.288382","DOIUrl":"https://doi.org/10.1109/ICCL.1994.288382","url":null,"abstract":"We propose a new method for improving the specialization of programs by inserting an interpreter between a subject program and a specializer. We formulate three specializer projections which enable us to generate specializers from interpreters. The goal is to provide a new way to control the specialization of programs, and we report the first practical results. This is a step towards the automatic production of specializers. Using an existing, self-applicable partial evaluator we succeeded in generating a stand-alone specializer for a first-order functional language which is stronger than the partial evaluator used for its generation. The generated specializer corresponds to a simple supercompiler. As an example we show that the generated specializer can achieve the same speed-up effect as the Knuth, Morris and Pratt algorithm (D.E. Knuth et al., vol. 6, no. 2, 1977) by specializing a naive matcher with respect to a fixed pattern. The generated specializer is also strong enough to handle bounded static variation, a case which partial evaluators usually can not handle.<<ETX>>","PeriodicalId":137441,"journal":{"name":"Proceedings of 1994 IEEE International Conference on Computer Languages (ICCL'94)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132138495","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 38
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信