| 1997 |
20 | | Steven S. Muchnick:
Advanced Compiler Design and Implementation
Morgan Kaufmann 1997 |
| 1988 |
19 | | Robert B. Garner,
A. Agrawal,
F. Briggs,
Eric W. Brown,
D. Hough,
B. Joy,
S. Kleiman,
Steven S. Muchnick,
Masood Namjoo,
David A. Patterson,
Joan M. Pendleton,
R. Tuck:
The Scalable Processor Architecture (SPARC).
COMPCON 1988: 278-283 |
18 | | Steven S. Muchnick,
C. Aoki,
V. Ghodsi,
M. Helft,
M. Lee,
R. Tuck,
D. Weaver,
A. Wu:
Optimizing Compilers for the SPARC Architecture: An Overview.
COMPCON 1988: 284-288 |
| 1986 |
17 | | Evan Adams,
Wayne Gramlich,
Steven S. Muchnick,
Soren Tirfing:
SunPro: Engineering a Pratical Program Development Environment.
Advanced Programming Environments 1986: 86-96 |
16 | | Steven S. Muchnick,
Phillip B. Gibbons:
Efficient instruction scheduling for a pipelined architecture (with retrospective)
Best of PLDI 1986: 167-174 |
15 | | Phillip B. Gibbons,
Steven S. Muchnick:
Efficient instruction scheduling for a pipelined architecture.
SIGPLAN Symposium on Compiler Construction 1986: 11-16 |
14 | | Evan Adams,
Steven S. Muchnick:
Dbxtool: A Window-Based Symbolic Debugger for Sun Workstations.
Softw., Pract. Exper. 16(7): 653-669 (1986) |
| 1982 |
13 | | Neil D. Jones,
Steven S. Muchnick:
A Flexible Approach to Interprocedural Data Flow Analysis and Programs with Recursive Data Structures.
POPL 1982: 66-74 |
12 | | Steven S. Muchnick,
Neil D. Jones:
A Fixed-Program Machine for Combinator Expression Evaluation.
Symposium on LISP and Functional Programming 1982: 11-20 |
| 1980 |
11 | | Neil D. Jones,
Steven S. Muchnick:
Complexity of Flow Analysis, Inductive Assertion Synthesis and a Language Due to Dijkstra
FOCS 1980: 185-190 |
10 | | Steven S. Muchnick,
Uwe F. Pleban:
A Semantic Comparison of LISP and Scheme.
LISP Conference 1980: 56-64 |
| 1979 |
9 | | Neil D. Jones,
Steven S. Muchnick:
Flow Analysis and Optimization of Lisp-Like Structures.
POPL 1979: 244-256 |
| 1978 |
8 | | Neil D. Jones,
Steven S. Muchnick:
TEMPO: A Unified Treatment of Binding Time and Parameter Passing Concepts in Programming Languages
Springer 1978 |
7 | | Neil D. Jones,
Steven S. Muchnick:
The Complexity of Finite Memory Programs with Recursion.
J. ACM 25(2): 312-321 (1978) |
| 1977 |
6 | | Neil D. Jones,
Steven S. Muchnick:
Even Simple Programs Are Hard To Analyze.
J. ACM 24(2): 338-350 (1977) |
| 1976 |
5 | | Neil D. Jones,
Steven S. Muchnick:
Binding Time Optimization in Programming Languages: Some Thoughts Toward the Design of an Ideal Language.
POPL 1976: 77-94 |
4 | | Steven S. Muchnick:
Computational Complexity of Multiple Recursive Achemata.
SIAM J. Comput. 5(3): 427-451 (1976) |
| 1975 |
3 | | Neil D. Jones,
Steven S. Muchnick:
Even Simple Programs are Hard to Analyze.
POPL 1975: 106-118 |
| 1972 |
2 | | Robert L. Constable,
Steven S. Muchnick:
Subrecursive Program Schemata I & II: I. Undecidable Equivalence Problems; II. Decidable Equivalence Problems
STOC 1972: 1-17 |
1 | | Robert L. Constable,
Steven S. Muchnick:
Subrecursive Program Schemata I & II: I. Undecidable Equivalence problems; II. Decidable Equivalence Problems.
J. Comput. Syst. Sci. 6(6): 480-537 (1972) |