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

How could object-oriented concepts and parallelism cohabit? 面向对象的概念和并行是如何共存的?

Proceedings of 1994 IEEE International Conference on Computer Languages (ICCL'94) Pub Date : 1994-05-16 DOI: 10.1109/ICCL.1994.288381

J. Bahsoun, Jean-Pierre Briot, D. Caromel, L. Féraud, Oscar Nierstrasz, P. Wegner

{"title":"How could object-oriented concepts and parallelism cohabit?","authors":"J. Bahsoun, Jean-Pierre Briot, D. Caromel, L. Féraud, Oscar Nierstrasz, P. Wegner","doi":"10.1109/ICCL.1994.288381","DOIUrl":"https://doi.org/10.1109/ICCL.1994.288381","url":null,"abstract":"A lot of new languages and new concepts have been conceived in order to promote parallelism in the object-oriented framework. These proposals could be investigated using different concepts related to parallelism and object orientation. Among these concepts, we can find shared variables/message passing, inheritance/delegation, reflection. The degrees of a good cohabitation may be appreciated by combining the above concepts. In order to have significant criteria we have to determine how languages fit some requirements. These requirements should cover the different phases of programs development i.e. specification, design and implementation. To structure the discussion, we may focus on some formalisms and languages, in order to specify and to implement concurrent objects. The benefits of the different classes of these formalisms and languages should be discussed from a methodological point of view. The issues to be addressed in this context could include the following questions: what are the main characteristic design principles and methodologies of concurrent object-oriented programming? How could the current object-oriented methodologies handle concurrent and distributed objects?.<<ETX>>","PeriodicalId":137441,"journal":{"name":"Proceedings of 1994 IEEE International Conference on Computer Languages (ICCL'94)","volume":"57 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":"134564240","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}

引用次数: 6

State space reduction in abstract interpretation of parallel programs 并行程序抽象解释中的状态空间缩减

Proceedings of 1994 IEEE International Conference on Computer Languages (ICCL'94) Pub Date : 1994-05-16 DOI: 10.1109/ICCL.1994.288373

Jyh-Herng Chow, W. Harrison

{"title":"State space reduction in abstract interpretation of parallel programs","authors":"Jyh-Herng Chow, W. Harrison","doi":"10.1109/ICCL.1994.288373","DOIUrl":"https://doi.org/10.1109/ICCL.1994.288373","url":null,"abstract":"Traditional compiler techniques operating on control flow graphs are not adequate for analyzing parallel programs where data can flow from one node to another through the shared memory, even though the nodes are not related by control flow edges. Abstract interpretation provides a general and unified framework for program analyses, and can be applied to parallel programs without much difficulty. However, the state space explosion problem in abstract interpretation of parallel programs must be relieved in order to make compile-time analyses practical. Although abstract interpretation itself provides an excellent mechanism for state space reduction by state abstraction, lower precision analysis often results from taking a higher degree of abstraction. In this paper, we present state space reduction that preserves analysis precision by eliminating redundant interleavings, based on Valmari's (1990) stubborn set method. We also propose an iterative algorithm for analyzing programs with pointers and closures, in which knowledge about shared locations required by existing methods is not available. The proposed algorithm has been implemented, and we discuss preliminary results of the implementation.<<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":"125845790","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}

引用次数: 14

A compositional approach to concurrent object-oriented programming 并发面向对象编程的组合方法

Proceedings of 1994 IEEE International Conference on Computer Languages (ICCL'94) Pub Date : 1994-05-16 DOI: 10.1109/ICCL.1994.288387

R. Pandey, J. Browne

引用次数: 11

Semantics for a real-time object-oriented programming language 用于实时面向对象编程语言的语义

Proceedings of 1994 IEEE International Conference on Computer Languages (ICCL'94) Pub Date : 1994-05-16 DOI: 10.1109/ICCL.1994.288384

I. Satoh, M. Tokoro

引用次数: 15

Taming control flow: a structured approach to eliminating goto statements 驯服控制流:消除goto语句的结构化方法

Proceedings of 1994 IEEE International Conference on Computer Languages (ICCL'94) Pub Date : 1994-05-16 DOI: 10.1109/ICCL.1994.288377

Ana M. Erosa, L. Hendren

{"title":"Taming control flow: a structured approach to eliminating goto statements","authors":"Ana M. Erosa, L. Hendren","doi":"10.1109/ICCL.1994.288377","DOIUrl":"https://doi.org/10.1109/ICCL.1994.288377","url":null,"abstract":"In designing optimizing and parallelizing compilers, it is often simpler and more efficient to deal with programs that have structured control flow. Although most programmers naturally program in a structured fashion, there remain many important programs and benchmarks that include some number of goto statements, thus rendering the entire program unstructured. Such unstructured programs cannot be handled with compilers built with analyses and transformations for structured programs. In this paper we present a straight-forward algorithm to structure C programs by eliminating all goto statements. The method works directly on a high-level abstract syntax tree (AST) representation of the program and could easily be integrated into any compiler that uses an AST-based intermediate representation. The actual algorithm proceeds by eliminating each goto by first applying a sequence of goto-movement transformations followed by the appropriate goto-elimination transformation. We have implemented the method in the McCAT (McGill Compiler Architecture Testbed) optimizing/parallelizing C compiler and we present experimental results that demonstrate that the method is both efficient and effective.<<ETX>>","PeriodicalId":137441,"journal":{"name":"Proceedings of 1994 IEEE International Conference on Computer Languages (ICCL'94)","volume":"101 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":"123187503","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}

引用次数: 104

Achieving asynchronous speedup while preserving synchronous semantics: an implementation of instructional footprinting in Linda 在保持同步语义的同时实现异步加速:Linda中教学足迹的实现

Proceedings of 1994 IEEE International Conference on Computer Languages (ICCL'94) Pub Date : 1994-05-16 DOI: 10.1109/ICCL.1994.288393

Kenneth D. Landry, J. Arthur

引用次数: 12

Haskell-style overloading is NP-hard haskell风格的重载是NP-hard的

Proceedings of 1994 IEEE International Conference on Computer Languages (ICCL'94) Pub Date : 1994-05-16 DOI: 10.1109/ICCL.1994.288390

D. Volpano

引用次数: 6

A functional specification language for instruction set architectures 指令集体系结构的功能规范语言

Proceedings of 1994 IEEE International Conference on Computer Languages (ICCL'94) Pub Date : 1994-05-16 DOI: 10.1109/ICCL.1994.288397

T. A. Cook, Edwin A. Harcourt

引用次数: 14

Structure notation of dynamic systems: a pictorial language approach 动态系统的结构符号:一种图形语言方法

Proceedings of 1994 IEEE International Conference on Computer Languages (ICCL'94) Pub Date : 1994-05-16 DOI: 10.1109/ICCL.1994.288378

M. Rodrigues, Chris W. Loftus, M. Ratcliffe, Youfu Li

{"title":"Structure notation of dynamic systems: a pictorial language approach","authors":"M. Rodrigues, Chris W. Loftus, M. Ratcliffe, Youfu Li","doi":"10.1109/ICCL.1994.288378","DOIUrl":"https://doi.org/10.1109/ICCL.1994.288378","url":null,"abstract":"Describes a visual programming environment called PROX (Pictorial Programming for Control Systems and Simulation) and its application to the development of software code for dynamic systems. We show how PROX is used for modeling and simulating a continuous process of interdependent variables with emphasis on user software development. Some of PROX key features are highlighted, such as encouraging users to consider the structure of the model and the interdependency of variables through feedback processes as the cause for behaviour in dynamic systems. PROX is an example of how software engineering, artificial intelligence and model building can be integrated into a single framework to help users to generate code and create their own understanding of dynamic systems. PROX is written in Pop-11 under X Windows, allowing the user to write application programs by simply connecting icons. As the building blocks are hooked together, PROX creates equations and procedures behind the scenes and, as soon as the connections are drawn, programs can be run immediately and variables can be plotted. In this way, assumptions about the structure of the system being modeled can rapidly be tested without the freed for extensive recompilation.<<ETX>>","PeriodicalId":137441,"journal":{"name":"Proceedings of 1994 IEEE International Conference on Computer Languages (ICCL'94)","volume":"91 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":"116669067","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

A multiparadigm language for reactive systems 响应式系统的多范式语言

Proceedings of 1994 IEEE International Conference on Computer Languages (ICCL'94) Pub Date : 1994-05-16 DOI: 10.1109/ICCL.1994.288379

Muriel Jourdan, Fabienne Lagnier, F. Maraninchi, Pascal Raymond

引用次数: 56