Volume 16,
Number 1,
January 1994
Volume 16,
Number 2,
March 1994
Volume 16,
Number 3,
May 1994
- Shlomit S. Pinter, Ron Y. Pinter:
Program Optimization and Parallelization Using Idioms.
305-327 BibTeX
- Adrienne Bloss:
Path Analysis and the Optimization of Nonstrict Functional Programs.
328-369 BibTeX
- Rajiv Gupta, Mary Lou Soffa, Denise Ombres:
Efficient Register Allocation via Coloring Using Clique Separators.
370-386 BibTeX
- Max Copperman:
Debugging Optimized Code Without Being Misled.
387-427 BibTeX
,
a 8 pages appendix (PostScript) is available
- Preston Briggs, Keith D. Cooper, Linda Torczon:
Improvements to Graph Coloring Register Allocation.
428-455 BibTeX
- Suresh Jagannathan:
Metalevel Building Blocks for Modular Systems.
456-492 BibTeX
- Richard Kennaway, Jan Willem Klop, M. Ronan Sleep, Fer-Jan de Vries:
On the Adequacy of Graph Rewriting for Simulating Term Rewriting.
493-523 BibTeX
- Lawrence A. Crowl, Thomas J. LeBlanc:
Parallel Programming with Control Abstraction.
524-576 BibTeX
- Ian T. Foster, Stephen Taylor:
A Compiler Approach to Scalable Concurrent-Program Design.
577-604 BibTeX
- Bijan Arbab, Daniel M. Berry:
Some Comments on ``A Denotational Semantics for Prolog''.
605-606 BibTeX
- Kim Marriott, Harald Søndergaard, Neil D. Jones:
Denotational Abstract Interpretation of Logic Programs.
607-648 BibTeX
- Michael Codish, Moreno Falaschi, Kim Marriott:
Suspension Analyses for Concurrent Logic Programs.
649-686 BibTeX
- Krzysztof R. Apt, Alessandro Pellegrini:
On the Occur-Check-Free Prolog Programs.
687-726 BibTeX
,
preliminary version:
PLILP 1992:
69-86
- David Garlan, Charles W. Krueger, Barbara Staudt Lerner:
TransformGen: Automating the Maintenance of Structure-Oriented Environments.
727-774 BibTeX
- Lin Yu, Daniel J. Rosenkrantz:
A Linear-Time Scheme for Version Reconstruction.
775-797 BibTeX
- Josyula R. Rao:
Reasoning about Probabilistic Parallel Programs.
798-842 BibTeX
- Orna Grumberg, David E. Long:
Model Checking and Modular Verification.
843-871 BibTeX
- Leslie Lamport:
The Temporal Logic of Actions.
872-923 BibTeX
- Manfred Broy, Greg Nelson:
Adding Fair Choice to Dijkstra's Calculus.
924-938 BibTeX
- Yehuda Afek, Danny Dolev, Eli Gafni, Michael Merritt, Nir Shavit:
A Bounded First-In, First-Enabled Solution to the l-Exclusion Problem.
939-953 BibTeX
- Yuh-Jzer Joung, Scott A. Smolka:
Coordinating First-Order Multiparty Interactions.
954-985 BibTeX
- Michael K. Reiter, Kenneth P. Birman:
How to Securely Replicate Services.
986-1009 BibTeX
- Jan Heering, Paul Klint, J. Rekers:
Lazy and Incremental Program Generation.
1010-1023 BibTeX
- Mikkel Thorup:
Controlled Grammatic Ambiguity.
1024-1050 BibTeX
,
a 26 pages appendix (PostScript) is available
- Joseph Bates, Alon Lavie:
Recognizing Substrings of LR(k) Languages in Linear Time.
1051-1077 BibTeX
Volume 16,
Number 4,
July 1994
- Annalisa Bossi, Sandro Etalle:
Transforming Acyclic Programs.
1081-1096 BibTeX
- Jong-Deok Choi, Jeanne Ferrante:
Static Slicing in the Presence of Goto Statements.
1096-1113 BibTeX
- Michael Wolfe:
The Definition of Dependence Distance.
1114-1116 BibTeX
- Jens Knoop, Oliver Rüthing, Bernhard Steffen:
Optimal Code Motion: Theory and Practice.
1117-1155 BibTeX
- Stefan Freudenberger, Thomas R. Gross, P. Geoffrey Lowney:
Avoidance and Supression of Compensation Code in a Trace Scheduling Compiler.
1156-1214 BibTeX
- John Hannan:
Operational Semantics-Directed Compilers and Machine Architectures.
1215-1247 BibTeX
- William Pugh, David Wonnacott:
Static Analysis of Upper and Lower Bounds on Dependences and Parallelism.
1248-1278 BibTeX
- Hassan Aït-Kaci, Andreas Podelski:
Functions as Passive Constraints in LIFE.
1279-1318 BibTeX
- Thomas Ball, James R. Larus:
Optimally Profiling and Tracing Programs.
1319-1360 BibTeX
- Antonio Brogi, Paolo Mancarella, Dino Pedreschi, Franco Turini:
Modular Logic Programming.
1361-1398 BibTeX
,
a 6 pages appendix (PostScript) with proofs is available
Volume 16,
Number 5,
September 1994
Short Communications
Articles
Volume 16,
Number 6,
November 1994
Short Communications
Articles
Copyright © Sun May 17 00:30:20 2009
by Michael Ley (ley@uni-trier.de)
