Volume 21,
Number 1,
January 1999
Volume 21,
Number 2,
March 1999
Volume 21,
Number 3,
May 1999
- Michael J. Butler, Pieter H. Hartel:
Reasoning about Grover's quantum search algorithm using probabilistic wp.
417-429
Electronic Edition (ACM DL) BibTeX
- Gudjon Gudjonsson, William H. Winsborough:
Compile-time memory reuse in logic programming languages through update in place.
430-501
Electronic Edition (ACM DL) BibTeX
- Leslie Lamport, Lawrence C. Paulson:
Should your specification language be typed.
502-526
Electronic Edition (ACM DL) BibTeX
- J. Gregory Morrisett, David Walker, Karl Crary, Neal Glew:
From system F to typed assembly language.
527-568
Electronic Edition (ACM DL) BibTeX
- Seif Haridi, Peter Van Roy, Per Brand, Michael Mehl, Ralf Scheidhauer, Gert Smolka:
Efficient logic variables for distributed computing.
569-626
Electronic Edition (ACM DL) BibTeX
- Robert Kennedy, Sun Chan, Shin-Ming Liu, Raymond Lo, Peng Tu, Fred C. Chow:
Partial redundancy elimination in SSA form.
627-676
Electronic Edition (ACM DL) BibTeX
- Joseph M. Morris, Alexander Bunkenburg:
Specificational functions.
677-701
Electronic Edition (ACM DL) BibTeX
Volume 21,
Number 4,
July 1999
- Somnath Ghosh, Margaret Martonosi, Sharad Malik:
Cache miss equations: a compiler framework for analyzing and tuning memory behavior.
703-746
Electronic Edition (ACM DL) BibTeX
- Tevfik Bultan, Richard Gerber, William Pugh:
Model-checking concurrent systems with unbounded integer variables: symbolic representations, approximations, and experimental results.
747-789
Electronic Edition (ACM DL) BibTeX
- Matthias Blume:
Dependency analysis for Standard ML.
790-812
Electronic Edition (ACM DL) BibTeX
- Matthias Blume, Andrew W. Appel:
Hierarchical modularity.
813-847
Electronic Edition (ACM DL) BibTeX
- Michael Hind, Michael G. Burke, Paul R. Carini, Jong-Deok Choi:
Interprocedural pointer alias analysis.
848-894
Electronic Edition (ACM DL) BibTeX
Volume 21,
Number 5,
September 1999
Volume 21,
Number 6,
November 1999
Copyright © Sun May 17 00:30:21 2009
by Michael Ley (ley@uni-trier.de)