Programming Languages and System Architectures: International Conference, Zürich, Switzerland, March 2-4, 1994 : ProceedingsJürg Gutknecht Springer-Verlag, 1994 - 344 lappuses "Programming languages and system architectures are at the frontiers of two different worlds. The conference on which this book is based was an adventure in a land where the two worlds - the formal world of algorithms and the physical world of electronic circuits - interact. The participants explored this land under the guidance of internationally renowned researchers such as Butler W. Lampson, Susan Graham, Jan L.A. van de Snepscheut, and C.A.R. Hoare, all of whom gave invited papers. The volume includes these papers together with sixteen session papers. Subjects of special interest include: programing language design and history, programming environments, programming methods, operating systems, compiler construction, and innovative system architectures."--PUBLISHER'S WEBSITE. |
No grāmatas satura
1.–3. rezultāts no 54.
109. lappuse
... shows typical HIL for this code . With this representation , there is no visible loop invariant code . The code generated for the SPARC is shown in Figure 3c . An inspection of this code reveals that the computation of limit's address ...
... shows typical HIL for this code . With this representation , there is no visible loop invariant code . The code generated for the SPARC is shown in Figure 3c . An inspection of this code reveals that the computation of limit's address ...
122. lappuse
... shows the performance difference in machine - independent IVE and machine - dependent IVE . For all but the ... show , in general , that any single code improvement will affect only a subset of the programs to which it is applied . For ...
... shows the performance difference in machine - independent IVE and machine - dependent IVE . For all but the ... show , in general , that any single code improvement will affect only a subset of the programs to which it is applied . For ...
137. lappuse
... shows how conven- tional common subexpression elimination may be used to eliminate some type tests . However , we show that this method falls short of detecting some obvious redundancies , demonstrating the need for a more careful ...
... shows how conven- tional common subexpression elimination may be used to eliminate some type tests . However , we show that this method falls short of detecting some obvious redundancies , demonstrating the need for a more careful ...
Saturs
Invited Papers | 1 |
Languages and Interactive Software Development | 21 |
Mechanized Support for Stepwise Refinement | 35 |
Autortiesības | |
14 citas sadaļas nav parādītas.
Citi izdevumi - Skatīt visu
Programming Languages and System Architectures: International Conference ... Jürg Gutknecht Ierobežota priekšskatīšana - 1994 |
Bieži izmantoti vārdi un frāzes
abstract abstract machine algebraic algorithm analysis application architecture assignment bandwidth basic block cache calorimeter cell CGLoader code improvements compiler components Computer Science Concurrent constant propagation coroutine declared defined dependence graph dependence-conscious colouring dynamic ETH Zürich example execution expression exprocedure FIFO Figure FPGA function Gbops global hardware implementation inheritance inline input instruction INTEGER interface live ranges load loop machine-independent manifest type memory messages method Modula-2 module type mss.n multiparadigm multiplexed Niklaus Wirth node Oberon Oberon thread Oberon-2 object object-oriented Object-Oriented Programming OPAL operating system optimization paradigm parallel parameters performance pointer primitives problem programming language properties provides queue reference register allocation representation result routine run-time Sather scheduling Section semantics sequence shared heap SIGPLAN specification stack static structure subclassing subtyping target machine type extension type guard vector virtual processors