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

Computer Languages最新文献

筛选
英文 中文
An executable specification language for fast prototyping parallel responsive systems 一种可执行的规范语言，用于并行响应系统的快速原型设计
Computer Languages Pub Date : 1996-04-01 DOI: 10.1016/0096-0551(96)00001-X
H. Heping , H. Zedan
{"title":"An executable specification language for fast prototyping parallel responsive systems","authors":"H. Heping ,&nbsp;H. Zedan","doi":"10.1016/0096-0551(96)00001-X","DOIUrl":"10.1016/0096-0551(96)00001-X","url":null,"abstract":"<div><p>An executable specification language, known as PSP, for fast prototyping parallel responsive systems is introduced. The language is equipped with directly executable mathematical data objects, first order predicates, temporal operators, parallel assignment, state and state history, sets, maps and sequences, etc. An abstract system model of a parallel responsive systems may be constructed using PSP. Using this model, various dynamic behaviors of the system can be studied and analysed at an early design stage. These include detailed temporal relations between every component in the system. Temporal and functional properties of the system can also be expresse within PSP as (temporal) predicates. Global cause-effect relations and other temporal properties of the system can be tested by executing both the abstract system model and its associated functional/temporal asscertions. Inconsistency an incompleteness in the abstract design can then be discoverd against user's intention before real implemention, thus reducing design cost. PSP is illustrated using a lift system.</p></div>","PeriodicalId":100315,"journal":{"name":"Computer Languages","volume":"22 1","pages":"Pages 1-13"},"PeriodicalIF":0.0,"publicationDate":"1996-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0096-0551(96)00001-X","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83985007","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}
引用次数: 11
Engineering quicksort 工程快速排序
Computer Languages Pub Date : 1996-04-01 DOI: 10.1016/0096-0551(96)00005-7
S.Mansoor Sarwar , Syed Aqeel Sarwar , Mansour H.A. Jaragh , Jesse Brandeburg
{"title":"Engineering quicksort","authors":"S.Mansoor Sarwar ,&nbsp;Syed Aqeel Sarwar ,&nbsp;Mansour H.A. Jaragh ,&nbsp;Jesse Brandeburg","doi":"10.1016/0096-0551(96)00005-7","DOIUrl":"10.1016/0096-0551(96)00005-7","url":null,"abstract":"<div><p>This paper describes the results of a large empirical study to measure the run-time behavior of Quicksort by using various methods of computing the pivot element for medium to large size randomly generated integer data. The results of our study contradict the common notion that Quicksort gives best performance if median of three scheme is used to compute the pivot element and array partitions having &lt; 10 elements are sorted by using insertion sort. It was found that Quicksort performs best when median of three scheme is used to decide the pivot element and arrays with &lt; 4 elements are hand sorted. Our method gives an average speedup of &gt; 9% when compared to the method with a cutoff of 10 and sub-arrays with &lt; 10 elements insertion sorted for 1000 ⩽ <em>N</em> 1.5 × 10<sup>6</sup>. Our study shows that advanced hardware features allow for implementation of very fast codes for sorting small arrays, and using such codes instead of insertion sort can lead to substantial improvements for Quicksort, as conjectured by Sedgewick many years ago.</p></div>","PeriodicalId":100315,"journal":{"name":"Computer Languages","volume":"22 1","pages":"Pages 39-47"},"PeriodicalIF":0.0,"publicationDate":"1996-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0096-0551(96)00005-7","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87471100","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
Synchronisation, concurrent object-oriented programming and the inheritance anomaly 同步，并发面向对象编程和继承异常
Computer Languages Pub Date : 1996-04-01 DOI: 10.1016/0096-0551(96)00002-1
S.E. Mitchell, A.J. Wellings
{"title":"Synchronisation, concurrent object-oriented programming and the inheritance anomaly","authors":"S.E. Mitchell,&nbsp;A.J. Wellings","doi":"10.1016/0096-0551(96)00002-1","DOIUrl":"10.1016/0096-0551(96)00002-1","url":null,"abstract":"<div><p>There have been a number of models proposed for integrating concurrency and object-oriented programming. Unfortunately, there have been few criteria proposed for evaluating them. In focusing on issues of inheritance, designers of new concurrent object-oriented programming languages appear to have forgotten the experiences learned from over two decades of concurrent programming. In this paper we review Bloom's criteria for evaluating the expressive power of synchronisation primitives, and apply it in an object-oriented framework. We show that most of the available concurrent object-oriented programming languages lack expressive power, and that this contributes to the so-called inheritance anomaly. We then propose a new model which does address all of Bloom's criteria.</p></div>","PeriodicalId":100315,"journal":{"name":"Computer Languages","volume":"22 1","pages":"Pages 15-26"},"PeriodicalIF":0.0,"publicationDate":"1996-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0096-0551(96)00002-1","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90171140","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}
引用次数: 20
Mealy machines are a better model of lexical analyzers 粉碎机是一种更好的词法分析器模型
Computer Languages Pub Date : 1996-04-01 DOI: 10.1016/0096-0551(96)00003-3
Wuu Yang
{"title":"Mealy machines are a better model of lexical analyzers","authors":"Wuu Yang","doi":"10.1016/0096-0551(96)00003-3","DOIUrl":"10.1016/0096-0551(96)00003-3","url":null,"abstract":"<div><p>Lexical analyzers partition input characters into tokens. When ambiguities arise during lexical analysis, the longest-match rule is generally adopted to resolve the ambiguities. The longest-match rule causes the look-ahead problem in traditional lexical analyzers, which are based on Moore machines. In Moore machines, output tokens are associated with states of the automata. By contrast, because Mealy machines associate output tokens with state transitions, the look-ahead behaviors can be encoded in their state transition tables. Therefore, we believe that lexical analyzers should be based on Mealy machines, rather than Moore machines, in order to solve the look-ahead problem. We propose techniques to construct Mealy machines from regular expressions and to perform sequential and data-parallel lexical analysis with these Mealy machines.</p></div>","PeriodicalId":100315,"journal":{"name":"Computer Languages","volume":"22 1","pages":"Pages 27-38"},"PeriodicalIF":0.0,"publicationDate":"1996-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0096-0551(96)00003-3","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85303807","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
Conversations of objects 对象对话
Computer Languages Pub Date : 1995-10-01 DOI: 10.1016/0096-0551(95)00007-0
A. Romanovsky
{"title":"Conversations of objects","authors":"A. Romanovsky","doi":"10.1016/0096-0551(95)00007-0","DOIUrl":"10.1016/0096-0551(95)00007-0","url":null,"abstract":"<div><p>An increasing range of application systems implemented in concurrent object oriented languages (COOLs) creates a pressing demand for developing approaches which provide a systematic way of tolerating software and hardware faults by using software diversity. This paper deals with the problem of tolerating faults in concurrent systems of this type. The purposes of this paper are as follows: to discuss the most appropriate ways of implementing conversations in COOLs; to map all attributes of conversations onto these languages; to discuss the most relevant peculiarities of COOLs in these terms; to suggest approaches to using the conversation scheme; to find the ways in which characteristics of COOLs can facilitate the use of conversation schemes. Thus we try to show how conversations can be used in existing COOLs in a more practical and realistic manner.</p></div>","PeriodicalId":100315,"journal":{"name":"Computer Languages","volume":"21 3","pages":"Pages 147-163"},"PeriodicalIF":0.0,"publicationDate":"1995-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0096-0551(95)00007-0","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79016206","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
Design of an arabic programming language (ARABLAN) 阿拉伯语编程语言(ARABLAN)的设计
Computer Languages Pub Date : 1995-10-01 DOI: 10.1016/0096-0551(95)00006-2
Mansoor Al-A'Ali, Mohammed Hamid
{"title":"Design of an arabic programming language (ARABLAN)","authors":"Mansoor Al-A'Ali,&nbsp;Mohammed Hamid","doi":"10.1016/0096-0551(95)00006-2","DOIUrl":"10.1016/0096-0551(95)00006-2","url":null,"abstract":"<div><p>It was observed that school children in Arab countries find difficulty in learning programming in a language other than their native language. There are only few Arabic programming languages in the literature; most of which are never or partially implemented. In this paper, we present the design of a new Arabic programming language (ARABLAN) which is planned to be implemented for use in teaching programming for school children in Arab countries.</p></div>","PeriodicalId":100315,"journal":{"name":"Computer Languages","volume":"21 3","pages":"Pages 191-201"},"PeriodicalIF":0.0,"publicationDate":"1995-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0096-0551(95)00006-2","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76696494","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
Carla: A rule language for specifying communications architectures Carla:一种用于指定通信架构的规则语言
Computer Languages Pub Date : 1995-10-01 DOI: 10.1016/0096-0551(95)00009-7
Wayne Citrin , Alistair Cockburn
{"title":"Carla: A rule language for specifying communications architectures","authors":"Wayne Citrin ,&nbsp;Alistair Cockburn","doi":"10.1016/0096-0551(95)00009-7","DOIUrl":"10.1016/0096-0551(95)00009-7","url":null,"abstract":"<div><p>Due to the unique requirements of a series of projects to specify communications architectures using graphical representations (Cara and MFD), we have developed the communications-oriented rule-based language Carla (Cara Rule Language), which provides an executable specification of the architecture being developed. Carla is designed to provide the ability to specify and simulate high-level, possibly incomplete, specifications of communications architectures, and to allow the developer to refine the specification through the addition of behavior-describing rules. Carla is also well-suited to creating black-box specifications of any system whose behavior depends on input/output history. We describe the features of the language, discuss various design issues, and provide examples of various communications protocols specified in Carla.</p></div>","PeriodicalId":100315,"journal":{"name":"Computer Languages","volume":"21 3","pages":"Pages 165-189"},"PeriodicalIF":0.0,"publicationDate":"1995-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0096-0551(95)00009-7","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79855599","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}
引用次数: 1
Side-effect free functions in object-oriented languages 面向对象语言中的无副作用函数
Computer Languages Pub Date : 1995-10-01 DOI: 10.1016/0096-0551(95)00008-9
Roberto Ierusalimschy, Noemi Rodriguez
{"title":"Side-effect free functions in object-oriented languages","authors":"Roberto Ierusalimschy,&nbsp;Noemi Rodriguez","doi":"10.1016/0096-0551(95)00008-9","DOIUrl":"10.1016/0096-0551(95)00008-9","url":null,"abstract":"<div><p>This paper presents a method for statically verifying that functions do not produce side-effects, in an object-oriented language. The described model, although not allowing any changes to pre-existing objects during a function call, permits an imperative style of programming, where new objects can be freely created and manipulated.</p></div>","PeriodicalId":100315,"journal":{"name":"Computer Languages","volume":"21 3","pages":"Pages 129-146"},"PeriodicalIF":0.0,"publicationDate":"1995-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0096-0551(95)00008-9","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89645390","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}
引用次数: 8
Contents of volume 21 第21卷内容
Computer Languages Pub Date : 1995-10-01 DOI: 10.1016/0096-0551(95)90001-2
{"title":"Contents of volume 21","authors":"","doi":"10.1016/0096-0551(95)90001-2","DOIUrl":"https://doi.org/10.1016/0096-0551(95)90001-2","url":null,"abstract":"","PeriodicalId":100315,"journal":{"name":"Computer Languages","volume":"21 3","pages":"Pages iii-iv"},"PeriodicalIF":0.0,"publicationDate":"1995-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0096-0551(95)90001-2","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"137350507","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 complete semantics for SMALLTALK-80 SMALLTALK-80的完整语义
Computer Languages Pub Date : 1995-07-01 DOI: 10.1016/0096-0551(95)00002-L
Wolfgang Golubski, Wolfram-M. Lippe
{"title":"A complete semantics for SMALLTALK-80","authors":"Wolfgang Golubski,&nbsp;Wolfram-M. Lippe","doi":"10.1016/0096-0551(95)00002-L","DOIUrl":"10.1016/0096-0551(95)00002-L","url":null,"abstract":"<div><p>In this paper we introduce a formal model of the object-oriented programming language SMALLTALK-80. The model can be useful for different applications in the framework of language design and implementation like compiter or interpreter generation, correctness proofs of the implementations, and standardization of the language.</p></div>","PeriodicalId":100315,"journal":{"name":"Computer Languages","volume":"21 2","pages":"Pages 67-79"},"PeriodicalIF":0.0,"publicationDate":"1995-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0096-0551(95)00002-L","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84417450","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}
引用次数: 4
首页 上一页 下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信