{"title":"A Language for Specifying Hyperdocuments","authors":"E. Doberkat","doi":"10.17877/DE290R-14179","DOIUrl":"https://doi.org/10.17877/DE290R-14179","url":null,"abstract":"","PeriodicalId":167132,"journal":{"name":"Softw. Concepts Tools","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121059538","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}
Pub Date : 1996-03-27DOI: 10.1007/3-540-61042-1_37
R. Alur, G. Holzmann, D. Peled
{"title":"An Analyzer for Message Sequence Charts","authors":"R. Alur, G. Holzmann, D. Peled","doi":"10.1007/3-540-61042-1_37","DOIUrl":"https://doi.org/10.1007/3-540-61042-1_37","url":null,"abstract":"","PeriodicalId":167132,"journal":{"name":"Softw. Concepts Tools","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124356813","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}
Pub Date : 1996-03-27DOI: 10.1007/3-540-61042-1_43
G. Lowe
{"title":"Breaking and Fixing the Needham-Schroeder Public-Key Protocol Using FDR","authors":"G. Lowe","doi":"10.1007/3-540-61042-1_43","DOIUrl":"https://doi.org/10.1007/3-540-61042-1_43","url":null,"abstract":"","PeriodicalId":167132,"journal":{"name":"Softw. Concepts Tools","volume":"44 7","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120991209","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}
Pub Date : 1995-01-08DOI: 10.7146/BRICS.V2I8.19511
Ole I. Hougaard, M. I. Schwartzbach, Hosein Askari
Type inference is generally thought of as being an exclusive property of the functional programming paradigm. We argue that such a feature may be of significant benefit for also standard imperative languages. We present a working tool (available by WWW) providing these benefits for a full version of Turbo Pascal. It has the form of a preprocessor that analyzes programs in which the type annotations are only partial or even absent. The resulting program has full type annotations, will be accepted by the standard Turbo Pascal compiler, and has polymorphic use of procedures resolved by means of code expansion. Keywords: imperative languages, type inference.
{"title":"Type Inference for Turbo Pascal","authors":"Ole I. Hougaard, M. I. Schwartzbach, Hosein Askari","doi":"10.7146/BRICS.V2I8.19511","DOIUrl":"https://doi.org/10.7146/BRICS.V2I8.19511","url":null,"abstract":"Type inference is generally thought of as being an exclusive property of the functional programming paradigm. We argue that such a feature may be of significant benefit for also standard imperative languages. We present a working tool (available by WWW) providing these benefits for a full version of Turbo Pascal. It has the form of a preprocessor that analyzes programs in which the type annotations are only partial or even absent. The resulting program has full type annotations, will be accepted by the standard Turbo Pascal compiler, and has polymorphic use of procedures resolved by means of code expansion. Keywords: imperative languages, type inference.","PeriodicalId":167132,"journal":{"name":"Softw. Concepts Tools","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-01-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129842952","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}
Pub Date : 1994-10-24DOI: 10.1007/3-540-58555-9_83
R. Back, K. Sere
{"title":"From Action Systems to Modular Systems","authors":"R. Back, K. Sere","doi":"10.1007/3-540-58555-9_83","DOIUrl":"https://doi.org/10.1007/3-540-58555-9_83","url":null,"abstract":"","PeriodicalId":167132,"journal":{"name":"Softw. Concepts Tools","volume":"239 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123072088","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}
The Programmers’ Playground is a software library and run-time system for creating distributed multimedia applications from collections of reusable software modules. This paper presents the design and implementation of EUPHORIA, Playground’s user interface management system. Implemented as a Playground module, EUPHORIA allows end-users to create direct manipulation graphical user interfaces (GUIs) exclusively through the use of a graphics editor. No programming is required. At run-time, attributes of the GUI state can be exposed and connected to external Playground modules, allowing the user to visualize and directly manipulate state information in remote Playground modules. Features of EUPHORIA include real-time direct manipulation graphics, constraint-based editing and visualization, imaginary alignment objects, user-definable types, and user-definable widgets with alternative representations.
{"title":"EUPHORIA: End-User Construction of Direct Manipulation User Interfaces for Distributed Applications","authors":"P. McCartney, K. Goldman, David Saff","doi":"10.7936/K7PZ572S","DOIUrl":"https://doi.org/10.7936/K7PZ572S","url":null,"abstract":"The Programmers’ Playground is a software library and run-time system for creating distributed multimedia applications from collections of reusable software modules. This paper presents the design and implementation of EUPHORIA, Playground’s user interface management system. Implemented as a Playground module, EUPHORIA allows end-users to create direct manipulation graphical user interfaces (GUIs) exclusively through the use of a graphics editor. No programming is required. At run-time, attributes of the GUI state can be exposed and connected to external Playground modules, allowing the user to visualize and directly manipulate state information in remote Playground modules. Features of EUPHORIA include real-time direct manipulation graphics, constraint-based editing and visualization, imaginary alignment objects, user-definable types, and user-definable widgets with alternative representations.","PeriodicalId":167132,"journal":{"name":"Softw. Concepts Tools","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115518420","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}
Visual programming is the specification of computational processes using diagrams and icons. Traditional computation models such as Turing machines and lambda-calculus, which are based on one-dimensional text strings, are not suitable for visual programming languages. We propose a two-dimensional computation model that requires no text. We also prove that the model is computationallhy complete, i.e., that the model has the same computational power as Turing machines.
{"title":"Completeness of a Visual Computation Model","authors":"T. Brown, T. Kimura","doi":"10.7936/K7TX3CQ3","DOIUrl":"https://doi.org/10.7936/K7TX3CQ3","url":null,"abstract":"Visual programming is the specification of computational processes using diagrams and icons. Traditional computation models such as Turing machines and lambda-calculus, which are based on one-dimensional text strings, are not suitable for visual programming languages. We propose a two-dimensional computation model that requires no text. We also prove that the model is computationallhy complete, i.e., that the model has the same computational power as Turing machines.","PeriodicalId":167132,"journal":{"name":"Softw. Concepts Tools","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127471284","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}
Pub Date : 1900-01-01DOI: 10.3929/ethz-a-006650217
M. Franz
A technique is described by which dynamically_loadable modules may add methods to existing classes at run_time. This leads to increased flexibility for structuring large extensible software_systems. Through the use of a doubly_indirect dispatch scheme, efficient method activation can be provided without the need to enumerate the set of methods applicable to a particular class at compile time. As a consequence, separately_compiled client modules are not invalidated when methods are added to an imported class. This reduces the number of recompilations and increases development efficiency. The new mechanism has been incorporated into a variant of the Oberon System. The paper proposes a set of syntactic extensions to the Oberon language and discusses implementation options.
{"title":"Protocol Extension: A Technique for Structuring Large Extensible Software-Systems","authors":"M. Franz","doi":"10.3929/ethz-a-006650217","DOIUrl":"https://doi.org/10.3929/ethz-a-006650217","url":null,"abstract":"A technique is described by which dynamically_loadable modules may add methods to existing classes at run_time. This leads to increased flexibility for structuring large extensible software_systems. Through the use of a doubly_indirect dispatch scheme, efficient method activation can be provided without the need to enumerate the set of methods applicable to a particular class at compile time. As a consequence, separately_compiled client modules are not invalidated when methods are added to an imported class. This reduces the number of recompilations and increases development efficiency. The new mechanism has been incorporated into a variant of the Oberon System. The paper proposes a set of syntactic extensions to the Oberon language and discusses implementation options.","PeriodicalId":167132,"journal":{"name":"Softw. Concepts Tools","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125807134","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：