![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
ACM Letters on Programming Languages and Systems (LOPLAS), Volume 1
Volume 1, Number 1, March 1992
- Preston Briggs, Keith D. Cooper, Linda Torczon:
Coloring Register Pairs. 3-13 - Michael G. Burke, Jong-Deok Choi:
Precise and Efficient Integration of Interprocedural Alias Information into Data-Flow Analysis. 14-21 - Keith D. Cooper, Mary W. Hall
, Linda Torczon:
Unexpected Side Effects of Inline Substitution: A Case Study. 22-32 - Vincent Dornic, Pierre Jouvelot, David K. Gifford:
Polymorphic Time Systems for Estimating Program Complexity. 33-45 - Ralph E. Johnson:
Reducing the Latency of a Real-Time Garbage Collector. 46-58 - Bruce McKenney, Boleslaw K. Szymanski
:
Generating Parallel Code for SIMD Machines. 59-73 - Robert H. B. Netzer, Barton P. Miller:
What Are Race Conditions? Some Issues and Formalizations. 74-88 - Ambuj K. Singh:
On Reasoning With the Global Time Assumption. 89-103
Volume 1, Number 2, June 1992
- Johnathan M. Asuru:
Optimization of Array Subscript Range Checks. 109-118 - Suzanne W. Dietrich:
Shortest Path by Approximation in Logic Programs. 119-137 - David Goldberg
:
The Design of Floating-Point Data Types. 138-151 - Carl McConnell, Ralph E. Johnson:
Using Static Single Assignment Form in a Code Optimizer. 152-160 - David Tarditi, Peter Lee, Anurag Acharya:
No Assembly Required: Compiling Standard ML to C. 161-177 - Michael Weiss:
The Transitive Closure of Control Dependence: The Iterated Join. 178-190
Volume 1, Number 3, September 1992
- Olivier Danvy
, John Hatcliff:
CPS-Transformation After Strictness Analysis. 195-212 - Christopher W. Fraser, David R. Hanson, Todd A. Proebsting:
Engineering a Simple, Efficient Code-Generator Generator. 213-226 - Mary W. Hall
, Ken Kennedy:
Efficient Call Graph Analysis. 227-242 - Joseph Hummel, Laurie J. Hendren, Alexandru Nicolau:
Abstract Description of Pointer Data Structures: An Approach for Improving the Analysis and Optimization of Imperative Programs. 243-260 - William W. Pugh:
Definitions of Dependence Distance. 261-265 - Balkrishna Ramkumar:
Distributed Last Call Optimization for Portable Parallel Logic Programming. 266-283 - Kenneth Walker, Ralph E. Griswold:
The Maintenance of Intermediate Values in Goal-Directed Evaluation. 284-298
Volume 1, Number 4, December 1992
- Peter Fritzson, Nahid Shahmehri, Mariam Kamkar, Tibor Gyimóthy
:
Generalized Algorithmic Debugging and Testing. 303-322 - William Landi:
Undecidability of Static Analysis. 323-337 - Kelvin D. Nilsen, William J. Schmidt:
Cost-Effective Object Space Management for Hardware-Assisted Real-Time Garbage Collection. 338-354 - Amitabh Srivastava:
Unreachable Procedures in Object-Oriented Programming. 355-364
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.