TOPLAS 1994

63 papers

1. A Behavioral Notion of Subtyping · Barbara Liskov, Jeannette M. Wing
2. A Bounded First-In, First-Enabled Solution to the l-Exclusion Problem · Yehuda Afek, Danny Dolev, Eli Gafni, Michael Merritt, Nir Shavit
3. A Compiler Approach to Scalable Concurrent-Program Design · Ian T. Foster, Stephen Taylor
4. A Generalized Theory of Bit Vector Data Flow Analysis · Uday P. Khedker, Dhananjay M. Dhamdhere
5. A Linear-Time Scheme for Version Reconstruction · Lin Yu, Daniel J. Rosenkrantz
6. A Unified Model of Pointwise Equivalence of Procedural Computations · David G. Von Bank, Charles M. Shub, Robert W. Sebesta
7. Adding Fair Choice to Dijkstra's Calculus · Manfred Broy, Greg Nelson
8. An Old-Fashined Recipe for Real-Time · Martín Abadi, Leslie Lamport
9. Automatic Isolation of Compiler Errors · David B. Whalley
10. Avoidance and Suppression of Compensation Code in a Trace Scheduling Compiler · Stefan M. Freudenberger, Thomas R. Gross, P. Geoffrey Lowney
11. Axiomatic Bootstrapping: A Guide for Compiler Hackers · Andrew W. Appel
12. Cliché-Based Program Editors · Richard C. Waters
13. Composing First-Class Transactions · Nicholas Haines, Darrell Kindred, J. Gregory Morrisett, Scott Nettles, Jeannette M. Wing
14. Compositional Specification and Verification of Distributed Systems · Bengt Jonsson
15. Controlled Grammatic Ambiguity · Mikkel Thorup
16. Coordinating First-Order Multiparty Interactions · Yuh-Jzer Joung, Scott A. Smolka
17. Debugging Optimized Code Without Being Misled · Max Copperman
18. Decompilation: The Enumeration of Types and Grammars · Peter T. Breuer, Jonathan P. Bowen
19. Denotational Abstract Interpretation of Logic Programs · Kim Marriott, Harald Søndergaard, Neil D. Jones
20. Determinacy Testing for Nondeterminate Logic Programming Languages · Evan Tick, Mark Korsloot
21. Efficient Computation of Interprocedural Definition-Use Chains · Mary Jean Harrold, Mary Lou Soffa
22. Efficient Counting Program Events with Support for On-Line Queries · Thomas Ball
23. Efficient Register Allocation via Coloring Using Clique Separators · Rajiv Gupta, Mary Lou Soffa, Denise Ombres
24. Experimental Evaluation of a Generic Abstract Interpretation Algorithm for PROLOG · Baudouin Le Charlier, Pascal Van Hentenryck
25. Extending Attribute Grammars to Support Programming-in-the-Large · Josephine Micallef, Gail E. Kaiser
26. Fixpoint Computation for Polyvariant Static Analyses of Higher-Order Applicative Programs · J. Michael Ashley, Charles Consel
27. Functions as Passive Constraints in LIFE · Hassan Aït-Kaci, Andreas Podelski
28. How to Securely Replicate Services · Michael K. Reiter, Kenneth P. Birman
29. Improvements to Graph Coloring Register Allocation · Preston Briggs, Keith D. Cooper, Linda Torczon
30. Improving the Ratio of Memory Operations to Floating-Point Operations in Loops · Steve Carr, Ken Kennedy
31. Lazy and Incremental Program Generation · Jan Heering, Paul Klint, J. Rekers
32. Live-Structure Dataflow Analysis for Prolog · Anne Mulkers, William H. Winsborough, Maurice Bruynooghe
33. Metalevel Building Blocks for Modular Systems · Suresh Jagannathan
34. Model Checking and Abstraction · Edmund M. Clarke, Orna Grumberg, David E. Long
35. Model Checking and Modular Verification · Orna Grumberg, David E. Long
36. Modular Logic Programming · Antonio Brogi, Paolo Mancarella, Dino Pedreschi, Franco Turini
37. On the Adequacy of Graph Rewriting for Simulating Term Rewriting · Richard Kennaway, Jan Willem Klop, M. Ronan Sleep, Fer-Jan de Vries
38. On the Occur-Check-Free Prolog Programs · Krzysztof R. Apt, Alessandro Pellegrini
39. Operational Semantics-Directed Compilers and Machine Architectures · John Hannan
40. Optimal Code Motion: Theory and Practice · Jens Knoop, Oliver Rüthing, Bernhard Steffen
41. Optimally Profiling and Tracing Programs · Thomas Ball, James R. Larus
42. Parallel Programming with Control Abstraction · Lawrence A. Crowl, Thomas J. LeBlanc
43. Path Analysis and the Optimization of Nonstrict Functional Programs · Adrienne G. Bloss
44. Polymorphic Type Inference and Abstract Data Types · Konstantin Läufer, Martin Odersky
45. Powerlist: A Structure for Parallel Recursion · Jayadev Misra
46. Program Optimization and Parallelization Using Idioms · Shlomit S. Pinter, Ron Y. Pinter
47. Reasoning about Probabilistic Parallel Programs · Josyula R. Rao
48. Recognizing Substrings of LR(k) Languages in Linear Time · Joseph Bates, Alon Lavie
49. Single-Pass Generation of Static Single-Assignment Form for Structured Languages · Marc M. Brandis, Hanspeter Mössenböck
50. Software Merge: Semantics of Combining Changes to Programs · Valdis Berzins
51. Some Comments on "A Denotational Semantics for Prolog" · Bijan Arbab, Daniel M. Berry
52. Static Analysis of Upper and Lower Bounds on Dependences and Parallelism · William W. Pugh, David Wonnacott
53. Static Slicing in the Presence of Goto Statements · Jong-Deok Choi, Jeanne Ferrante
54. Strictness Optimization for Graph Reduction Machines (Why id Might Not Be Strict) · Marcel Beemster
55. Suspension Analyses for Concurrent Logic Programs · Michael Codish, Moreno Falaschi, Kim Marriott
56. The Definition of Dependence Distance · Michael Wolfe
57. The POLYLITH Software Bus · James M. Purtilo
58. The Temporal Logic of Actions · Leslie Lamport
59. The Undecidability of Aliasing · G. Ramalingam
60. Time-Constrained Buffer Specifications in CSP+T and Timed CSP · John J. Zic
61. TransformGen: Automating the Maintenance of Structure-Oriented Environments · David Garlan, Charles W. Krueger, Barbara Staudt Lerner
62. Transforming Acyclic Programs · Annalisa Bossi, Sandro Etalle
63. Two Issues in Parallel Language Design · A. P. Wim Böhm, R. R. Oldehoeft