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

SPECIFYING RESTRICTIONS ON imperative programming-languages FOR USE IN A DISTRIBUTED EMBEDDED ENVIRONMENT

SOFTWARE ENGINEERING JOURNAL 1990年第2期5卷 93-104页

作者： HUTCHEON, AD WELLINGS, AJ UNIV YORK DEPT COMP SCIYORK YO1 5DDN YORKSHIREENGLAND

Very few programming languages provide direct support for programming distributed embedded systems. However, as such systems become more widespread, many languages, particularly concurrent languages like Ada and Modula, will be employed for this purpose. Restrictions should be placed on the use of these languages, so that processes executing on one machine do not have access to the memory space of processes executing on another. Furthermore, if the reuse of software modules is to become a reality, then it should be possible to implement components of a system in different *** this paper we present a language-independent specification of how the use of a common class of imperative programming languages can be restricted for a distributed environment. A simple formal model, in Z, of imperative programming languages is developed, and restrictions are specified. The model is then instantiated for the languages Ada, Modula and C. It gives good results for Ada and Modula, but cannot be elegantly applied to C because the language lacks both a module and process facility. A distributed Ada programming environment based on the model is described briefly.

关键词： parallel programming programming support specification languages language-independent specification imperative programming languages Software engineering techniques programming environments distributed Ada programming environment C formal model High level languages distributed embedded environment Z Modula restrictions

来源：评论

学校读者我要写书评

暂无评论

On the computational complexity of imperative programming languages

引用

THEORETICAL COMPUTER SCIENCE 2004年第1-2期318卷 139-161页

作者： Kristiansen, L Niggl, KH Tech Univ Ilmenau Inst Theoret & Tech Informat D-98693 Ilmenau Germany Univ Oslo Fac Engn Oslo Norway

Two restricted imperative programming languages are considered: One is a slight modification of a loop language studied intensively in the literature, the other is a stack programming language over an arbitrary but fixed alphabet, supporting a suitable loop concept over stacks. The paper presents a purely syntactical method for analysing the impact of nesting loops on the running time. This gives rise to a uniform measure mu on both loop and stack programs, that is, a function that assigns to each such program P a natural number mu(P) computable from the syntax of P. It is shown that stack programs of mu-measure n compute exactly those functions computed by a Turing machine whose running time lies in Grzegorczyk class epsilon(ndivided by2). In particular, stack programs of mu-measure 0 compute precisely the polynomial-time computable functions. Furthermore, it is shown that loop programs of mu-measure n compute exactly the functions in epsilon(ndivided by2). In particular, loop programs of mu-measure 0 compute precisely the linear-space computable functions. (C) 2003 Elsevier B.V. All rights reserved.

关键词： implicit computational complexity imperative programming languages subrecursion theory Grzegorczyk hierarchy polynomial-time computability

来源：评论

学校读者我要写书评

暂无评论

DESIGNING programming-languages FOR THE ANALYZABILITY OF POINTER DATA-STRUCTURES

引用

COMPUTER languages 1993年第2期19卷 119-134页

作者： HENDREN, LJ GAO, GR School of Computer Science McGill University 3480 University Street Montreal Quebec Canada H3A 2A7

In this paper we propose a programming language mechanism and associated compiler techniques which significantly enhance the analyzability of pointer-based data structures frequently used in non-scientific programs. Our approach is based on exploiting two important properties of pointer data structures: structural inductivity and speculative traversability. Structural inductivity facilitates the application of a static interference analysis method for such pointer data structures based on path matrices, and speculative traversability is utilized by a novel loop unrolling technique for while loops that exploit fine-grain parallelism by speculatively traversing such data structures. The effectiveness of this approach is demonstrated by applying it to a collection of loops found in typical non-scientific C programs.

关键词： ANALYZABILITY imperative programming languages POINTER DATA STRUCTURES LOOP UNROLLING SPECULATIVE TRAVERSABILITY

来源：评论

学校读者我要写书评

暂无评论

Certifying polynomial time and linear/polynomial space for imperative programs

引用

SIAM JOURNAL ON COMPUTING 2006年第5期35卷 1122-1147页

作者： Niggl, KH Wunderlich, H Tech Univ Ilmenau Inst Theoret Informat D-98684 Ilmenau Germany

In earlier work of Kristiansen and Niggl the polynomial-time computable functions were characterized by stack programs of mu-measure 0, and the linear-space computable functions by loop programs of mu-measure 0. Until recently, an open problem was how to extend these characterizations to programs with user-friendly basic instructions, such as assignment statements, and with mixed data structures. It is shown how to strengthen the above characterizations to imperative programs built from arbitrary basic instructions by sequencing and by if-then-else and for-do statements. These programs operate on variables, each of which may represent any data structure such as stacks, registers, trees, or graphs. The paper presents a new method of certifying "polynomial size boundedness" of such imperative programs under the natural assumption that the basic instructions used are polynomially size bounded, too. The certificate for a program P with variables among X-1,...,X-n will be an (n+1) x (n+1) matrix M(P) over the finite set {0, 1,infinity}. It is shown that certified string programs (i.e., stack programs, but with any polynomial-time computable basic instructions) exactly compute the functions in FPTIME. Accordingly, certified general loop programs (using any linear-space computable basic instructions) exactly compute the functions in FLINSPACE. Furthermore, it is shown that certified power string programs (i.e., string programs, but built from polynomial-space computable basic instructions and extended by power loop statements) exactly compute the polynomial-space computable functions in FPSPACE. In addition, examples of certified "natural" (implementations of) algorithms, such as insertion-sort or binary addition and multiplication, are given.

关键词： polynomial time linear space polynomial space static program analysis property testing implicit computational complexity imperative programming languages

来源：评论

学校读者我要写书评

暂无评论

FUNCTIONAL SYSTEM SPECIFICATION

引用

SOFTWARE ENGINEERING JOURNAL 1988年第4期3卷 127-133页

作者： JOOSTEN, S UNIV TWENTE DEPT INFORMAT7500 AE ENSCHEDENETHERLANDS

This paper deals with executable descriptions of systems. The prime motivation of the paper is to show that functional programming languages are useful in software engineering practice. All kinds of systems, either with or without a state, can be modelled in a simple way. In this paper an attempt is made to devise executable models that are amenable to mathematical proofs. Apart from testing, proving is a viable technique for establishing correctness of algorithms. There exists a clear link to systems theory. Some restrictions have to be imposed on systems theory to obtain executability, but these restrictions are fewer than assumed normally when systems are described in imperative programming languages. As a consequence, an executable specification language is obtained. The well known ‘functional specs’ can be written in a purely functional programming language. This renders the phrase ‘functional specification’ doubly appropriate.

关键词： software engineering specification language specification languages executable descriptions systems theory imperative programming languages Software engineering techniques High level languages correctness functional programming languages mathematical proofs executable models

来源：评论

学校读者我要写书评

暂无评论

THE USE OF FUNCTIONAL ANNOTATIONS IN VERIFYING imperative PROGRAMS

引用

SOFTWARE ENGINEERING JOURNAL 1990年第5期5卷 280-288页

作者： NICHOLL, R CLINT, M GRAY, D NICHOLL, T UNIV WESTERN ONTARIO DEPT COMP SCILONDON N6A 3K7ONTARIOCANADA QUEENS UNIV BELFAST DEPT COMP SCIBELFAST BT7 1NNANTRIMNORTH IRELAND

Functional programming languages [1–3] have been advocated as a means for writing more reliable programs, although imperative programming languages permit more efficient execution on conventional computer hardware. This paper advocates a means of using a functional notation to annotate imperative programs, and presents a method for verifying that the annotated sections of code achieve the results specified in the annotation. Examples are given to show how the method is used. These demonstrate that this approach to program correctness leads to verification conditions which are briefer, but more numerous, than those which result from verifying more conventionally annotated programs. One motivation for the work is pedagogical, in that it is hoped that the techniques described can be used, in the spirit of Backhouse [4], to make clearer to novice programmers the underlying functional purpose of sections of less transparent imperative code. A goal of the paper is to provide a technique to facilitate the activity of operational decomposition in a formal method (such as VDM [5]), in which refinements of specifications to implementations are made.

关键词： program verification conventional computer hardware formal method formal specification operational decomposition functional programming functional notation imperative programming languages Software engineering techniques specifications annotated sections verification conditions programming and algorithm theory imperative programs reliable programs program correctness

来源：评论

学校读者我要写书评

暂无评论

HIERARCHICAL EMULATION OF WELL-CODED PROGRAMS THROUGH THE USE OF STREAMS OF INSTRUCTIONS BUFFERED IN ON-CHIP ASSOCIATIVE MEMORIES AND DISTRIBUTED CONTROL

MICROPROCESSING AND MICROPROGRAMMING

引用

MICROPROCESSING AND MICROprogramming 1984年第3期13卷 153-170页

作者： SUK, D CARLSTEDT, G CHALMERS UNIV TECHNOL DEPT COMP TECHNOLS-41296 GOTHENBURGSWEDEN HYLAB S-41679 GOTHENBURGSWEDEN

Due to the rapid development of the VLSI technology, it is feasible to place the cache memory on the processor chip. This paper proposes an associative sequencer containing an on-chip cache memory. The sequencer emulates operations by streams of instructions and is hence called ‘associative stream emulator’. The associative cache memory stores emulation streams for operations belonging to several lexical levels. This includes also microinstruction streams. The individual instructions in the streams are frequency coded. This leads to code compaction, which increases the effective instruction transfer rate on the memory-processor bus enhancing by that the performance. A possible emulator architecture and its instruction stream processing principles are described. The structure of the associative cache cell is outlined. The operations on the cache memory are explained. Statistical measurement and their results are shown. These results prove that in order to obtain a reasonable performance it is enough with 50–150 cells in the cache memory.

关键词： VLSI emulation instruction sets instruction streams imperative programming languages dynamic microprogramming program behaviour frequency coding caching associative search LRU

来源：评论

学校读者我要写书评

暂无评论

Control structures in programs and computational complexity

引用

ANNALS OF PURE AND APPLIED LOGIC 2005年第1-3期133卷 247-273页

作者： Niggl, KH Tech Univ Ilmenau Inst Theoret & Tech Informat D-98693 Ilmenau Germany

A key problem in implicit complexity is to analyse the impact on program run times of nesting control structures, such as recursion in all finite types in functional languages or for-do statements in imperative languages. Three types of programs are studied. One type of program can only use ground type recursion. Another is concerned with imperative programs: ordinary loop programs and stack programs. Programs of the third type can use higher type recursion on notation as in functional programming languages. The present approach to analysing run time yields various characterisations of FPTIME and all Grzegorczyk classes at and above the FLINSPACE level. Central to this approach is the distinction between "top recursion" and "side recursion". Top recursions are the only form of recursion which can cause an increase in complexity. Counting the depth of nested top recursions leads to several versions of "the mu-measure". In this way, various recent solutions of key problems in implicit complexity are integrated into a uniform approach. (c) 2004 Elsevier B.V. All rights reserved.

关键词： implicit computational complexity imperative programming languages Grzegorczyk hierarchy higher type recursion Lambda calculus polynomial time

来源：评论

学校读者我要写书评

暂无评论

Correctness of data representations involving heap data structures

引用

SCIENCE OF COMPUTER programming 2004年第1-3期50卷 129-160页

作者： Reddy, US Yang, H Univ Birmingham Sch Comp Sci Birmingham B15 2TT W Midlands England Korea Adv Inst Sci & Technol Micros Res Ctr Taejon 305701 South Korea

While the semantics of local variables in programming languages is by now well-understood, the semantics of pointer-addressed heap variables is still an outstanding issue. In particular, the commonly. assumed relational reasoning principles or data representations have not been validated in a semantic model of heap variables. In this paper, we define a parametricity semantics for a Pascal-like language with pointers and heap variables which gives such reasoning principles. It turns out that the correspondences between data representations cannot simply be relations between states, but more intricate correspondences that also need to keep track of visible locations whose pointers can be stored and leaked. (C) 2004 Elsevier B.V. All rights reserved.

关键词： denotational semantics relational parametricity separation logic imperative programming languages

来源：评论

学校读者我要写书评

暂无评论

A step towards genuine declarative language-integrated queries

A step towards genuine declarative language-integrated queri...

引用

3rd International Conference on Innovative Network Systems and Applications (iNetSApp) held in conjunction with Federated Conference on Computer Science and Information Systems (FedCSIS)

作者： Adamus, Radoslaw Kowalski, Tomasz Marek Wislicki, Jacek Lodz Univ Technol Inst Appl Comp Sci Ul Stefanowskiego 18-22 PL-90924 Lodz Poland

ISBN: (纸本)9788360810668

Native functional-style querying extensions for programming languages (e. g., LINQ or Java 8 streams) are widely considered as declarative. However, their very limited degree of optimisation when dealing with local collection processing contradicts this statement. We show that developers constructing complex LINQ queries or combining queries expose themselves to the risk of severe performance deterioration. For an inexperienced programmer, a way of getting an appropriate query form can be too complicated. Also, a manual query transformation is justified by the need of improving performance, but achieved at the expense of reflecting an actual business goal. As a result, benefits from a declarative form and an increased level of abstraction are lost. In this paper, we claim that moving of selected methods for automated optimisation elaborated for declarative query languages to the level of imperative programming languages is possible and desired. We propose an optimisation method for collection-processing constructs based on higher-order functions through factoring out of free expressions in order to avoid unnecessary multiple calculations. We have implemented and verified this idea as a simple proof-of-concept LINQ optimiser library.

关键词： query languages query processing LINQ optimiser library automated optimisation method complex LINQ queries genuine declarative language-integrated query higher-order functions imperative programming languages local collection processing manual query transformation native functional-style querying extensions Computer languages Optimization programming Query processing Reactive power Syntactics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：