Volume 16, Number 1, January 1994

• 
  Evan Tick, Mark Korsloot: Determinacy Testing for Nondeterminate Logic Programming Languages. 3-34
• 
  Baudouin Le Charlier, Pascal Van Hentenryck: Experimental Evaluation of a Generic Abstract Interpretation Algorithm for PROLOG. 35-101
• 
  Richard C. Waters: Cliché-Based Program Editors. 102-150
• 
  James M. Purtilo: The POLYLITH Software Bus. 151-174

Volume 16, Number 2, March 1994

• 
  Mary Jean Harrold, Mary Lou Soffa: Efficient Computation of Interprocedural Definition-Use Chains. 175-204
• 
  Anne Mulkers, William H. Winsborough, Maurice Bruynooghe: Live-Structure Dataflow Analysis for Prolog. 205-258
• 
  Bengt Jonsson: Compositional Specification and Verification of Distributed Systems. 259-303

Volume 16, Number 3, May 1994

• 
  Shlomit S. Pinter, Ron Y. Pinter: Program Optimization and Parallelization Using Idioms. 305-327
• 
  Adrienne Bloss: Path Analysis and the Optimization of Nonstrict Functional Programs. 328-369
• 
  Rajiv Gupta, Mary Lou Soffa, Denise Ombres: Efficient Register Allocation via Coloring Using Clique Separators. 370-386
• 
  Max Copperman: Debugging Optimized Code Without Being Misled. 387-427
• 
  Preston Briggs, Keith D. Cooper, Linda Torczon: Improvements to Graph Coloring Register Allocation. 428-455
• 
  Suresh Jagannathan: Metalevel Building Blocks for Modular Systems. 456-492
• 
  Richard Kennaway, Jan Willem Klop, M. Ronan Sleep, Fer-Jan de Vries: On the Adequacy of Graph Rewriting for Simulating Term Rewriting. 493-523
• 
  Lawrence A. Crowl, Thomas J. LeBlanc: Parallel Programming with Control Abstraction. 524-576
• 
  Ian T. Foster, Stephen Taylor: A Compiler Approach to Scalable Concurrent-Program Design. 577-604
• 
  Bijan Arbab, Daniel M. Berry: Some Comments on ``A Denotational Semantics for Prolog''. 605-606
• 
  Kim Marriott, Harald Søndergaard, Neil D. Jones: Denotational Abstract Interpretation of Logic Programs. 607-648
• 
  Michael Codish, Moreno Falaschi, Kim Marriott: Suspension Analyses for Concurrent Logic Programs. 649-686
• 
  Krzysztof R. Apt, Alessandro Pellegrini: On the Occur-Check-Free Prolog Programs. 687-726, (preliminary version: PLILP 1992: 69-86)
• 
  David Garlan, Charles W. Krueger, Barbara Staudt Lerner: TransformGen: Automating the Maintenance of Structure-Oriented Environments. 727-774
• 
  Lin Yu, Daniel J. Rosenkrantz: A Linear-Time Scheme for Version Reconstruction. 775-797
• 
  Josyula R. Rao: Reasoning about Probabilistic Parallel Programs. 798-842
• 
  Orna Grumberg, David E. Long: Model Checking and Modular Verification. 843-871
• 
  Leslie Lamport: The Temporal Logic of Actions. 872-923
• 
  Manfred Broy, Greg Nelson: Adding Fair Choice to Dijkstra's Calculus. 924-938
• 
  Yehuda Afek, Danny Dolev, Eli Gafni, Michael Merritt, Nir Shavit: A Bounded First-In, First-Enabled Solution to the l-Exclusion Problem. 939-953
• 
  Yuh-Jzer Joung, Scott A. Smolka: Coordinating First-Order Multiparty Interactions. 954-985
• 
  Michael K. Reiter, Kenneth P. Birman: How to Securely Replicate Services. 986-1009
• 
  Jan Heering, Paul Klint, J. Rekers: Lazy and Incremental Program Generation. 1010-1023
• 
  Mikkel Thorup: Controlled Grammatic Ambiguity. 1024-1050
• 
  Joseph Bates, Alon Lavie: Recognizing Substrings of LR(k) Languages in Linear Time. 1051-1077

Volume 16, Number 4, July 1994

• 
  Annalisa Bossi, Sandro Etalle: Transforming Acyclic Programs. 1081-1096
• 
  Jong-Deok Choi, Jeanne Ferrante: Static Slicing in the Presence of Goto Statements. 1096-1113
• 
  Michael Wolfe: The Definition of Dependence Distance. 1114-1116
• 
  Jens Knoop, Oliver Rüthing, Bernhard Steffen: Optimal Code Motion: Theory and Practice. 1117-1155
• 
  Stefan M. Freudenberger, Thomas R. Gross, P. Geoffrey Lowney: Avoidance and Supression of Compensation Code in a Trace Scheduling Compiler. 1156-1214
• 
  John Hannan: Operational Semantics-Directed Compilers and Machine Architectures. 1215-1247
• 
  William Pugh, David Wonnacott: Static Analysis of Upper and Lower Bounds on Dependences and Parallelism. 1248-1278
• 
  Hassan Aït-Kaci, Andreas Podelski: Functions as Passive Constraints in LIFE. 1279-1318
• 
  Thomas Ball, James R. Larus: Optimally Profiling and Tracing Programs. 1319-1360
• 
  Antonio Brogi, Paolo Mancarella, Dino Pedreschi, Franco Turini: Modular Logic Programming. 1361-1398

Volume 16, Number 5, September 1994

• 
  Thomas Ball: Efficient Counting Program Events with Support for On-Line Queries. 1399-1410
• 
  Konstantin Läufer, Martin Odersky: Polymorphic Type Inference and Abstract Data Types. 1411-1430
• 
  J. Michael Ashley, Charles Consel: Fixpoint Computation for Polyvariant Static Analyses of Higher-Order Applicative Programs. 1431-1448
• 
  Marcel Beemster: Strictness Optimization for Graph Reduction Machines (Why id Might Not Be Strict). 1449-1466
• 
  G. Ramalingam: The Undecidability of Aliasing. 1467-1471

• 
  Uday P. Khedker, Dhananjay M. Dhamdhere: A Generalized Theory of Bit Vector Data Flow Analysis. 1472-1511
• 
  Edmund M. Clarke, Orna Grumberg, David E. Long: Model Checking and Abstraction. 1512-1542
• 
  Martín Abadi, Leslie Lamport: An Old-Fashined Recipe for Real-Time. 1543-1571
• 
  Josephine Micallef, Gail E. Kaiser: Extending Attribute Grammars to Support Programming-in-the-Large. 1572-1612
• 
  Peter T. Breuer, Jonathan P. Bowen: Decompilation: The Enumeration of Types and Grammars. 1613-1647
• 
  David B. Whalley: Automatic Isolation of Compiler Errors. 1648-1659

Volume 16, Number 6, November 1994

• 
  John J. Zic: Time-Constrained Buffer Specifications in CSP+T and Timed CSP. 1661-1674
• 
  A. P. Wim Böhm, R. R. Oldehoeft: Two Issues in Parallel Language Design. 1675-1683
• 
  Marc M. Brandis, Hanspeter Mössenböck: Single-Pass Generation of Static Single-Assignment Form for Structured Languages. 1684-1698
• 
  Andrew W. Appel: Axiomatic Bootstrapping: A Guide for Compiler Hackers. 1699-1718
• 
  Nicholas Haines, Darrell Kindred, J. Gregory Morrisett, Scott Nettles, Jeannette M. Wing: Composing First-Class Transactions. 1719-1736

• 
  Jayadev Misra: Powerlist: A Structure for Parallel Recursion. 1737-1767
• 
  Steve Carr, Ken Kennedy: Improving the Ratio of Memory Operations to Floating-Point Operations in Loops. 1768-1810
• 
  Barbara Liskov, Jeannette M. Wing: A Behavioral Notion of Subtyping. 1811-1841
• 
  David G. Von Bank, Charles M. Shub, Robert W. Sebesta: A Unified Model of Pointwise Equivalence of Procedural Computations. 1842-1874
• 
  Valdis Berzins: Software Merge: Semantics of Combining Changes to Programs. 1875-1903

last updated on Sat May 18 06:48:35 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page