%A Gary Lindstrom %T Backtracking in a generalized control setting %J ACM Transactions on Programming Languages and Systems %K toplas %V 1 %N 1 %D July 1979 %P 8-26 %A Robert B.K. Dewar %A Arthur Grand %A Ssu-Cheng Liu %A Edmond Schonberg %T Programming by refinement, as exemplified by the SETL representation sublanguage %J ACM Transactions on Programming Languages and Systems %K toplas %V 1 %N 1 %D July 1979 %P 27-49 %A Richard L. Sites %T The compilation of loop induction expressions %J ACM Transactions on Programming Languages and Systems %K toplas %V 1 %N 1 %D July 1979 %P 50-57 %A Carlo Ghezzi %A Dino Mandrioli %T Incremental parsing %J ACM Transactions on Programming Languages and Systems %K toplas %V 1 %N 1 %D July 1979 %P 58-70 %A Edward L. Robertson %T Code generation and storage allocation for machines with span-dependent instructions %J ACM Transactions on Programming Languages and Systems %K toplas %V 1 %N 1 %D July 1979 %P 71-83 %A Leslie Lamport %T A new approach to proving the correctness of multiprocess programs %J ACM Transactions on Programming Languages and Systems %K toplas %V 1 %N 1 %D July 1979 %P 84-97 %A Robert L. Constable %A James E. Donahue %T A hierarchical approach to formal semantics with application to the definition of PL/CS %J ACM Transactions on Programming Languages and Systems %K toplas %V 1 %N 1 %D July 1979 %P 98-114 %A David S. Wise %T Morris's garbage compaction algorithm restores reference counts %J ACM Transactions on Programming Languages and Systems %K toplas %V 1 %N 1 %D July 1979 %P 115-120 %A Thomas Lengauer %A Robert Endre Tarjan %T A fast algorithm for finding dominators in a flowgraph %J ACM Transactions on Programming Languages and Systems %K toplas %V 1 %N 1 %D July 1979 %P 121-141 %A Ken Kennedy %T A deterministic attribute grammar evaluator based on dynamic sequencing %J ACM Transactions on Programming Languages and Systems %K toplas %V 1 %N 1 %D July 1979 %P 142-160 %A Kenneth E. Iverson %T Operators %J ACM Transactions on Programming Languages and Systems %K toplas %V 1 %N 2 %D October 1979 %P 161-176 %A R.H. Perrott %T A language for array and vector processors %J ACM Transactions on Programming Languages and Systems %K toplas %V 1 %N 2 %D October 1979 %P 177-195 %A N.S. Prywes %A A. Pnueli %A S. Shastry %T Use of a nonprocedural specification language and associated program generator in software development %J ACM Transactions on Programming Languages and Systems %K toplas %V 1 %N 2 %D October 1979 %P 196-217 %A Richard B. Kieburtz %A Abraham Silberschatz %T Comments on "Communicating sequential processes" %J ACM Transactions on Programming Languages and Systems %K toplas %V 1 %N 2 %D October 1979 %P 218-225 %A David C. Luckham %A Norihasa Suzuki %T Verification of array, record and pointer operations in Pascal %J ACM Transactions on Programming Languages and Systems %K toplas %V 1 %N 2 %D October 1979 %P 226-244 %A Greg Nelson %A Derek C. Oppen %T Simplification by cooperating decision procedures %J ACM Transactions on Programming Languages and Systems %K toplas %V 1 %N 2 %D October 1979 %P 245-257 %A David Gries %T Is sometime better than alway ? %J ACM Transactions on Programming Languages and Systems %K toplas %V 1 %N 2 %D October 1979 %P 268-265 %A Daniel G. Bobrow %A Douglas W. Clark %T Compact encodings of list structure %J ACM Transactions on Programming Languages and Systems %K toplas %V 1 %N 2 %D October 1979 %P 266-286 %A Eric Beyer %A Peter Buneman %T A space efficient dynamic allocation algorithm for queueing messages %J ACM Transactions on Programming Languages and Systems %K toplas %V 1 %N 2 %D October 1979 %P 287-294 %A Kuo-Chung Tai %T Noncanonical SLR(1) grammars %J ACM Transactions on Programming Languages and Systems %K toplas %V 1 %N 2 %D October 1979 %P 295-320 %A David Harel %T And/Or programs: a new approach to structured programming %J ACM Transactions on Programming Languages and Systems %K toplas %V 2 %N 1 %D January 1980 %P 1-17 %A Ajit B. Pai %A Richard B. Kieburtz %T Global context recovery: a new strategy for syntactic error recovery by table-driven parsers %J ACM Transactions on Programming Languages and Systems %K toplas %V 2 %N 1 %D January 1980 %P 18-41 %A Nissim Francez %T Distributed termination %J ACM Transactions on Programming Languages and Systems %K toplas %V 2 %N 1 %D January 1980 %P 42-55 %A Gregory R. Andrews %A Richard P. Reitman %T An axiomatic approach to information flow in programs %J ACM Transactions on Programming Languages and Systems %K toplas %V 2 %N 1 %D January 1980 %P 56-76 %A Christos H. Papadimitriou %A Philip A. Bernstein %T On the performance of balanced hashing functions when the keys are not equiprobable %J ACM Transactions on Programming Languages and Systems %K toplas %V 2 %N 1 %D January 1980 %P 77-89 %A Zohar Manna %A Richard Waldinger %T A deductive approach to program synthesis %J ACM Transactions on Programming Languages and Systems %K toplas %V 2 %N 1 %D January 1980 %P 90-121 %A D.B. Arnold %A M.R. Sleep %T Uniform random generation of balanced parenthesis strings %J ACM Transactions on Programming Languages and Systems %K toplas %V 2 %N 1 %D January 1980 %P 122-128 %A Douglas Comer %T A note on median split trees %J ACM Transactions on Programming Languages and Systems %K toplas %V 2 %N 1 %D January 1980 %P 129-133 %A Peter J.L. Wallis %T External representations of objects of user-defined type %J ACM Transactions on Programming Languages and Systems %K toplas %V 2 %N 2 %D April 1980 %P 137-152 %A Ralph E. Griswold %A David R. Hanson %T An alternative to the use of patterns in string processing %J ACM Transactions on Programming Languages and Systems %K toplas %V 2 %N 2 %D April 1980 %P 153-172 %A R.G.G. Cattell %T Automatic derivation of code generators from machine descriptions %J ACM Transactions on Programming Languages and Systems %K toplas %V 2 %N 2 %D April 1980 %P 173-190 %A Jack W. Davidson %A Cristopher W. Fraser %T The design and application of a retargetable peephole optimizer %J ACM Transactions on Programming Languages and Systems %K toplas %V 2 %N 2 %D April 1980 %P 191-202 %A Charles N. Fischer %T On parsing and compiling arithmetic expressions on vector computers %J ACM Transactions on Programming Languages and Systems %K toplas %V 2 %N 2 %D April 1980 %P 203-224 %A D.C. Luckham %A W. Polak %T Ada exception handling: an axiomatic approach %J ACM Transactions on Programming Languages and Systems %K toplas %V 2 %N 2 %D April 1980 %P 225-233 %A Arthur J. Bernstein %T Output guards and nondeterminism in "Communicating sequential processes" %J ACM Transactions on Programming Languages and Systems %K toplas %V 2 %N 2 %D April 1980 %P 234-238 %A Pering-Yi Ma %A T.G. Lewis %T Design of a machine-independent optimizing system for emulator development %J ACM Transactions on Programming Languages and Systems %K toplas %V 2 %N 2 %D April 1980 %P 239-262 %A Daniel G. Bobrow %T Managing reentrant structures using reference counts %J ACM Transactions on Programming Languages and Systems %K toplas %V 2 %N 3 %D July 1980 %P 269-273 %A Bruce Leverett %A Thomas G. Szymanski %T Chaining span-dependent jump instructions %J ACM Transactions on Programming Languages and Systems %K toplas %V 2 %N 3 %D July 1980 %P 274-289 %A Hanan Samet %T A coroutine approach to parsing %J ACM Transactions on Programming Languages and Systems %K toplas %V 2 %N 3 %D July 1980 %P 290-306 %A W.E. Howden %T Applicability of software validation techniques to scientific programs %J ACM Transactions on Programming Languages and Systems %K toplas %V 2 %N 3 %D July 1980 %P 307-320 %A Manfred Broy %T Derivation of invariant assertions during program development by transformation %J ACM Transactions on Programming Languages and Systems %K toplas %V 2 %N 3 %D July 1980 %P 321-337 %A Edmund Melson Clarke,\ Jr. %T Synthesis of resource invariants for concurrent programs %J ACM Transactions on Programming Languages and Systems %K toplas %V 2 %N 3 %D July 1980 %P 338-358 %A Krzysztof R. Apt %A Nissim Francez %A Willem P. de\ Roever %T A proof system for communicating sequential processes %J ACM Transactions on Programming Languages and Systems %K toplas %V 2 %N 3 %D July 1980 %P 359-385 %A Marco A. Casanova %A Philip A. Bernstein %T A formal system for reasoning about programs accessing a relational database %J ACM Transactions on Programming Languages and Systems %K toplas %V 2 %N 3 %D July 1980 %P 386-414 %A S.L. Graham %A M.A. Harrison %A W.L. Ruzzo %T An improved context-free recognizer %J ACM Transactions on Programming Languages and Systems %K toplas %V 2 %N 3 %D July 1980 %P 415-462 %A Derek C. Oppen %T Prettyprinting %J ACM Transactions on Programming Languages and Systems %K toplas %V 2 %N 4 %D October 1980 %P 465-483 %A J.T. Schwartz %T Ultracomputers %J ACM Transactions on Programming Languages and Systems %K toplas %V 2 %N 4 %D October 1980 %P 484-521 %A George W. Ernst %A William F. Ogden %T Specification of abstract data types in MODULA %J ACM Transactions on Programming Languages and Systems %K toplas %V 2 %N 4 %D October 1980 %P 522-543 %A Carl E. Landwehr %T An abstract type for statistics collection in SIMULA %J ACM Transactions on Programming Languages and Systems %K toplas %V 2 %N 4 %D October 1980 %P 544-563 %A David Gries %A Gary Levin %T Assignment and procedure call proof rules %J ACM Transactions on Programming Languages and Systems %K toplas %V 2 %N 4 %D October 1980 %P 564-579 %A B.M.E. Moret %A M.G. Thomason %A R.C. Gonzalez %T The activity of a variable and its relation to decision trees %J ACM Transactions on Programming Languages and Systems %K toplas %V 2 %N 4 %D October 1980 %P 580-595 %A J. Steensgaard-Madsen %T A statement-oriented approach to data abstraction %J ACM Transactions on Programming Languages and Systems %K toplas %V 3 %N 1 %D January 1981 %P 1-10 %A F. Andre %A J.P. Banatre %A J.P. Routeau %T A multiprocessing approach to compile-time symbol resolution %J ACM Transactions on Programming Languages and Systems %K toplas %V 3 %N 1 %D January 1981 %P 11-23 %A Otto C. Juelich %A Clinton R. Foulk %T Compilation of acyclic smooth programs for parallel execution %J ACM Transactions on Programming Languages and Systems %K toplas %V 3 %N 1 %D January 1981 %P 24-48 %A Dale H. Grit %A Rex L. Page %T Deleting irrelevant tasks in an expression-oriented multiprocessor system %J ACM Transactions on Programming Languages and Systems %K toplas %V 3 %N 1 %D January 1981 %P 49-59 %A Bent Bruun Kristensen %A Ole Lehrmann Madsen %T Methods for computing LALR(k) lookahead %J ACM Transactions on Programming Languages and Systems %K toplas %V 3 %N 1 %D January 1981 %P 60-82 %A Wilf R. Lalonde %A Jim des\ Rivieres %T Handling operator precedence in arithmetic expressions with tree transformations %J ACM Transactions on Programming Languages and Systems %K toplas %V 3 %N 1 %D January 1981 %P 83-103 %A Jayadev Misra %T An exercise in program explanation %J ACM Transactions on Programming Languages and Systems %K toplas %V 3 %N 1 %D January 1981 %P 104-109 %A Christopher W. Fraser %A A.A. Lopez %T Editing data structures %J ACM Transactions on Programming Languages and Systems %K toplas %V 3 %N 2 %D April 1981 %P 115-125 %A Edmond Schonberg %A Jacob T. Schwartz %A Micha Sharir %T An automatic technique for selection of data representations in SETL programs %J ACM Transactions on Programming Languages and Systems %K toplas %V 3 %N 2 %D April 1981 %P 126-143 %A Ralph E. Griswold %A David R. Hanson %A John T. Korb %T Generators in Icon %J ACM Transactions on Programming Languages and Systems %K toplas %V 3 %N 2 %D April 1981 %P 144-161 %A David R. Hanson %T ALGORITHM 568 PDS - a portable directory system %J ACM Transactions on Programming Languages and Systems %K toplas %V 3 %N 2 %D April 1981 %P 162-167 %A Wilf E. LaLonde %T The construction of stack-controlling LR parsers for regular right part grammars %J ACM Transactions on Programming Languages and Systems %K toplas %V 3 %N 2 %D April 1981 %P 168-206 %A John Gannon %A Paul McMullin %A Richard Hamlet %T Data-abstraction implementation, specification, and testing %J ACM Transactions on Programming Languages and Systems %K toplas %V 3 %N 3 %D July 1981 %P 211-223 %A Jan van\ den\ Bos %A Rinus Plasmeijer %A Jan Stroet %T Process communication based on input specifications %J ACM Transactions on Programming Languages and Systems %K toplas %V 3 %N 3 %D July 1981 %P 224-250 %A Martin Rem %T Associons: a program notation with tuples instead of variables %J ACM Transactions on Programming Languages and Systems %K toplas %V 3 %N 3 %D July 1981 %P 251-262 %A Gary Lindstrom %A Mary Lou Soffa %T Referencing and retention in block-structured coroutines %J ACM Transactions on Programming Languages and Systems %K toplas %V 3 %N 3 %D July 1981 %P 263-292 %A J.A. Barnden %T Nonsequentiality and concrete activity phases in discrete-event simulation languages %J ACM Transactions on Programming Languages and Systems %K toplas %V 3 %N 3 %D July 1981 %P 293-317 %A S.O. Anderson %A R.C. Backhouse %T Locally least-cost recovery in Earley's algorithm %J ACM Transactions on Programming Languages and Systems %K toplas %V 3 %N 3 %D July 1981 %P 318-347 %A Alan Borning %T The programming language aspects of ThingLab, a constraint-oriented simulation laboratory %J ACM Transactions on Programming Languages and Systems %K toplas %V 3 %N 4 %D October 1981 %P 353-387 %A Mehdi Jazayeri %A Diane Pozefsky %T Space-efficient storage management in an attribute grammar evaluator %J ACM Transactions on Programming Languages and Systems %K toplas %V 3 %N 4 %D October 1981 %P 388-404 %A Gregory R. Andrews %T Synchronizing resources %J ACM Transactions on Programming Languages and Systems %K toplas %V 3 %N 4 %D October 1981 %P 405-430 %A Krzysztof R. Apt %T Ten years of Hoare's logic: a survey - part I %J ACM Transactions on Programming Languages and Systems %K toplas %V 3 %N 4 %D October 1981 %P 431-483 %A Irene Greif %A Albert R. Meyer %T Specifying the semantics of "while" programs: a tutorial and critique of a paper by Hoare and Lauer %J ACM Transactions on Programming Languages and Systems %K toplas %V 3 %N 4 %D October 1981 %P 484-507 %A Wilfred J. Hansen %T A cost model for the internal organization of B+-tree nodes %J ACM Transactions on Programming Languages and Systems %K toplas %V 3 %N 4 %D October 1981 %P 508-532 %A Martin S. Feather %T A system for assisting program transformation %J ACM Transactions on Programming Languages and Systems %K toplas %V 4 %N 1 %D January 1982 %P 1-20 %A Andrew S. Tanenbaum %A Hans van\ Staveren %A John W. Stevenson %T Using peephole optimization on intermediate code %J ACM Transactions on Programming Languages and Systems %K toplas %V 4 %N 1 %D January 1982 %P 21-36 %A Jayadev Misra %A K.M. Chandy %T Termination detection of diffusing computations in communicating sequential processes %J ACM Transactions on Programming Languages and Systems %K toplas %V 4 %N 1 %D January 1982 %P 37-43 %A James R. McGraw %T The VAL language: description and analysis %J ACM Transactions on Programming Languages and Systems %K toplas %V 4 %N 1 %D January 1982 %P 44-82 %A Christoph M. Hoffmann %A Michael J. O'Donnell %T Programming with equations %J ACM Transactions on Programming Languages and Systems %K toplas %V 4 %N 1 %D January 1982 %P 83-112 %A M. Howard Williams %T A flexible notation for syntactic definitions %J ACM Transactions on Programming Languages and Systems %K toplas %V 4 %N 1 %D January 1982 %P 113-119 %A Fred B. Schneider %T Synchronization in distributed programs %J ACM Transactions on Programming Languages and Systems %K toplas %V 4 %N 2 %D April 1982 %P 125-148 %A R.C. Holt %A J.R. Cordy %A D.B. Wortman %T An introduction to S/SL: syntax/semantic language %J ACM Transactions on Programming Languages and Systems %K toplas %V 4 %N 2 %D April 1982 %P 149-178 %A Eljas Soisalon-Soininen %T Inessential error entries and their use in LR parser optimization %J ACM Transactions on Programming Languages and Systems %K toplas %V 4 %N 2 %D April 1982 %P 179-195 %A Micha Sharir %T Some observations concerning formal differentiation of set theoretic expressions %J ACM Transactions on Programming Languages and Systems %K toplas %V 4 %N 2 %D April 1982 %P 196-225 %A C.S. Wetherell %T Error data values in the data-flow language VAL %J ACM Transactions on Programming Languages and Systems %K toplas %V 4 %N 2 %D April 1982 %P 226-238 %A Richard J. Fateman %T High-level language implications of the proposed IEEE floating-point standard %J ACM Transactions on Programming Languages and Systems %K toplas %V 4 %N 2 %D April 1982 %P 239-257 %A Alberto Martelli %A Ugo Montanari %T An efficient unification algorithm %J ACM Transactions on Programming Languages and Systems %K toplas %V 4 %N 2 %D April 1982 %P 258-282 %A E.A. Ashcroft %A W.W. Wadge %T R for semantics %J ACM Transactions on Programming Languages and Systems %K toplas %V 4 %N 2 %D April 1982 %P 283-294 %A J. Arsac %A Y. Kodratoff %T Some techniques for recursion removal from recursive functions %J ACM Transactions on Programming Languages and Systems %K toplas %V 4 %N 2 %D April 1982 %P 295-322 %A John Hennessy %T Symbolic debugging of optimized code %J ACM Transactions on Programming Languages and Systems %K toplas %V 4 %N 3 %D July 1982 %P 323-344 %A Paolo Sipala %T Compact storage of binary trees %J ACM Transactions on Programming Languages and Systems %K toplas %V 4 %N 3 %D July 1982 %P 345-361 %A Manfred Broy %A Peter Pepper %T Combining algebraic and algorithmic reasoning: an approach to the Schorr-Waite algorithm %J ACM Transactions on Programming Languages and Systems %K toplas %V 4 %N 3 %D July 1982 %P 362-381 %A Leslie Lamport %A Robert Shostak %A Marshall Pease %T The Byzantine generals problem %J ACM Transactions on Programming Languages and Systems %K toplas %V 4 %N 3 %D July 1982 %P 382-401 %A Robert Paige %A Shaye Koenig %T Finite differencing of computable expressions %J ACM Transactions on Programming Languages and Systems %K toplas %V 4 %N 3 %D July 1982 %P 402-454 %A Susan Owicki %A Leslie Lamport %T Proving liveness properties of concurrent programs %J ACM Transactions on Programming Languages and Systems %K toplas %V 4 %N 3 %D July 1982 %P 455-495 %A Mitchell Wand %T Deriving target code as a representation of continuation semantics %J ACM Transactions on Programming Languages and Systems %K toplas %V 4 %N 3 %D July 1982 %P 496-517 %A M. Herlihy %A B. Liskov %T A value transmission method for abstract data types %J ACM Transactions on Programming Languages and Systems %K toplas %V 4 %N 4 %D October 1982 %P 527-551 %A Richard C. Holt %A David B. Wortman %T A model for implementing EUCLID modules and prototypes %J ACM Transactions on Programming Languages and Systems %K toplas %V 4 %N 4 %D October 1982 %P 552-562 %A Ralph E. Griswold %T The evaluation of expressions in Icon %J ACM Transactions on Programming Languages and Systems %K toplas %V 4 %N 4 %D October 1982 %P 563-584 %A J. Bergeron %A A. Dubuque %T A structured APL system %J ACM Transactions on Programming Languages and Systems %K toplas %V 4 %N 4 %D October 1982 %P 585-600 %A T.P. Baker %T A one-pass algorithm for overload resolution in Ada %J ACM Transactions on Programming Languages and Systems %K toplas %V 4 %N 4 %D October 1982 %P 601-614 %A Frank DeRemer %A Thomas Pennello %T Efficient computation of LALR(1) look-ahead sets %J ACM Transactions on Programming Languages and Systems %K toplas %V 4 %N 4 %D October 1982 %P 615-649 %A Robert B.K. Dewar %A Micha Sharir %A Elia Weixelbaum %T Transformational derivation of a garbage collection algorithm %J ACM Transactions on Programming Languages and Systems %K toplas %V 4 %N 4 %D October 1982 %P 650-667 %A H.J. Boom %T A weaker precondition for loops %J ACM Transactions on Programming Languages and Systems %K toplas %V 4 %N 4 %D October 1982 %P 668-677 %A J. Misra %A K.M. Chandy %T A distributed graph algorithm: knot detection %J ACM Transactions on Programming Languages and Systems %K toplas %V 4 %N 4 %D October 1982 %P 678-686 %A William R. Mallgren %T Formal specification of graphic data types %J ACM Transactions on Programming Languages and Systems %K toplas %V 4 %N 4 %D October 1982 %P 687-710 %A J.W. Thatcher %A E.G. Wagner %A J.B. Wright %T Data type specification: parameterization and the power of specification techniques %J ACM Transactions on Programming Languages and Systems %K toplas %V 4 %N 4 %D October 1982 %P 711-732 %A John H. Williams %T On the development of the algebra of functional programs %J ACM Transactions on Programming Languages and Systems %K toplas %V 4 %N 4 %D October 1982 %P 733-757 %A Gary L. Peterson %T An O(n log n) unidirectional algorithm for the circular extrema problem %J ACM Transactions on Programming Languages and Systems %K toplas %V 4 %N 4 %D October 1982 %P 758-762 %A Philip Merlin %A Gregor V. Bochmann %T On the construction of submodule specifications and communication protocols %J ACM Transactions on Programming Languages and Systems %K toplas %V 5 %N 1 %D January 1983 %P 1-25 %A Stefan M. Freudenberger %A Jacob T. Schwartz %T Experience with the SETL optimizer %J ACM Transactions on Programming Languages and Systems %K toplas %V 5 %N 1 %D January 1983 %P 26-45 %A Gary L. Peterson %T Concurrent reading while writing %J ACM Transactions on Programming Languages and Systems %K toplas %V 5 %N 1 %D January 1983 %P 46-55 %A Gary L. Peterson %T A new solution to Lamport's concurrent programming problem using small shared variables %J ACM Transactions on Programming Languages and Systems %K toplas %V 5 %N 1 %D January 1983 %P 56-65 %A R.G. Gallager %A P.A. Humblet %A P.M. Spira %T A distributed algorithm for minimum-weight spanning trees %J ACM Transactions on Programming Languages and Systems %K toplas %V 5 %N 1 %D January 1983 %P 66-77 %A Richard B. Kieburtz %A Abraham Silberschatz %T Access-right expressions %J ACM Transactions on Programming Languages and Systems %K toplas %V 5 %N 1 %D January 1983 %P 78-96 %A Samuel Kamin %T Final data types and their specification %J ACM Transactions on Programming Languages and Systems %K toplas %V 5 %N 1 %D January 1983 %P 97-121 %A Steven P. Reiss %T Generation of compiler symbol processing mechanisms from specifications %J ACM Transactions on Programming Languages and Systems %K toplas %V 5 %N 2 %D April 1983 %P 127-163 %A Allan Gottlieb %A B.D. Lubachevsky %A Larry Rudolph %T Basic techniques for the efficient coordination of very large numbers of cooperating sequential processors %J ACM Transactions on Programming Languages and Systems %K toplas %V 5 %N 2 %D April 1983 %P 164-189 %A Leslie Lamport %T Specifying concurrent program modules %J ACM Transactions on Programming Languages and Systems %K toplas %V 5 %N 2 %D April 1983 %P 190-222 %A G.N. Buckley %A A. Silberschatz %T An effective implementation for the generalized input-output construct of CSP %J ACM Transactions on Programming Languages and Systems %K toplas %V 5 %N 2 %D April 1983 %P 223-235 %A B. Maher %A D.H. Sleeman %T Automatic program improvement: variable usage transformations %J ACM Transactions on Programming Languages and Systems %K toplas %V 5 %N 2 %D April 1983 %P 236-264 %A Norman H. Cohen %T Eliminating redundant recursive calls %J ACM Transactions on Programming Languages and Systems %K toplas %V 5 %N 3 %D July 1983 %P 265-299 %A Eliezer Dekel %A Sartaj Sahni %T Parallel generation of postfix and tree forms %J ACM Transactions on Programming Languages and Systems %K toplas %V 5 %N 3 %D July 1983 %P 300-317 %A Harald Ganzinger %T Parameterized specifications: parameter passing and implementation with respect to observability %J ACM Transactions on Programming Languages and Systems %K toplas %V 5 %N 3 %D July 1983 %P 318-354 %A Sergiu Hart %A Micha Sharir %A Amir Pnueli %T Termination of probabilistic concurrent programs %J ACM Transactions on Programming Languages and Systems %K toplas %V 5 %N 3 %D July 1983 %P 356-380 %A Barbara Liskov %A Robert Scheifler %T Guardians and actions: linguistic support for robust, distributed programs %J ACM Transactions on Programming Languages and Systems %K toplas %V 5 %N 3 %D July 1983 %P 381-404 %A Richard J. Lipton %A Jacobo Valdes %A Gopalakrishnan Vijayan %A Stephen C. North %A Robert Sedgewick %T VLSI layout as programming %J ACM Transactions on Programming Languages and Systems %K toplas %V 5 %N 3 %D July 1983 %P 405-421 %A John Hennessy %A Thomas Gross %T Postpass code optimization of pipeline constraints %J ACM Transactions on Programming Languages and Systems %K toplas %V 5 %N 3 %D July 1983 %P 422-448 %A Thomas Reps %A Tim Teitelbaum %A Alan Demers %T Incremental context-dependent analysis for language-based editors %J ACM Transactions on Programming Languages and Systems %K toplas %V 5 %N 3 %D July 1983 %P 449-477 %A Robert Giegerich %T A formal framework for the derivation of machine-specific optimizers %J ACM Transactions on Programming Languages and Systems %K toplas %V 5 %N 3 %D July 1983 %P 478-498 %A Richard C. Waters %T User format control in a LISP prettyprinter %J ACM Transactions on Programming Languages and Systems %K toplas %V 5 %N 4 %D October 1983 %P 513-531 %A Jacques Cohen %A Alexandru Nicolau %T Comparison of compacting algorithms for garbage collection %J ACM Transactions on Programming Languages and Systems %K toplas %V 5 %N 4 %D October 1983 %P 532-553 %A Ravi Sethi %T Control flow aspects of semantics-directed compiling %J ACM Transactions on Programming Languages and Systems %K toplas %V 5 %N 4 %D October 1983 %P 554-595 %A C.B. Jones %T Tentative steps toward a development method for interfering programs %J ACM Transactions on Programming Languages and Systems %K toplas %V 5 %N 4 %D October 1983 %P 596-619 %A Marty Ossefort %T Correctness proofs of communicating processes: three illustrative examples from the literature %J ACM Transactions on Programming Languages and Systems %K toplas %V 5 %N 4 %D October 1983 %P 620-640 %A Elaine J. Weyuker %T Assessing test data adequacy through program inference %J ACM Transactions on Programming Languages and Systems %K toplas %V 5 %N 4 %D October 1983 %P 641-655 %A Seppo Sippu %A Iljas Soisalon-Soininen %T A syntax-error-handling technique and its experimental analysis %J ACM Transactions on Programming Languages and Systems %K toplas %V 5 %N 4 %D October 1983 %P 656-679 %A James E. Archer,\ Jr. %A Richard Conway %A Fred B. Schneider %T User recovery and reversal in interactive systems %J ACM Transactions on Programming Languages and Systems %K toplas %V 6 %N 1 %D January 1984 %P 1-19 %A Robert D. Cameron %A M. Robert Ito %T Grammar-based definition of metaprogramming systems %J ACM Transactions on Programming Languages and Systems %K toplas %V 6 %N 1 %D January 1984 %P 20-54 %A L. Colussi %T Recursion as an effective step in program development %J ACM Transactions on Programming Languages and Systems %K toplas %V 6 %N 1 %D January 1984 %P 55-67 %A Zohar Manna %A Pierre Wolper %T Synthesis of communicating processes from temporal logic specifications %J ACM Transactions on Programming Languages and Systems %K toplas %V 6 %N 1 %D January 1984 %P 68-93 %A Robert L. Constable %A Daniel R. Zlatin %T The type theory of PL/CV3 %J ACM Transactions on Programming Languages and Systems %K toplas %V 6 %N 1 %D January 1984 %P 94-117 %A Aire Kaufman %T Tailored-list and recombination-delaying buddy systems %J ACM Transactions on Programming Languages and Systems %K toplas %V 6 %N 1 %D January 1984 %P 118-125 %A William F. Appelbe %A A.P. Ravn %T Encapsulation constructs in systems programming languages %J ACM Transactions on Programming Languages and Systems %K toplas %V 6 %N 2 %D April 1984 %P 129-158 %A F. Warren Burton %T Annotations to control parallelism and reduction order in the distributed evaluation of functional programs %J ACM Transactions on Programming Languages and Systems %K toplas %V 6 %N 2 %D April 1984 %P 159-174 %A M. Elizabeth C. Hull %A R.M. McKeag %T Communicating sequential processes for centralized and distributed operating system design %J ACM Transactions on Programming Languages and Systems %K toplas %V 6 %N 2 %D April 1984 %P 175-191 %A Roland Backhouse %T Global data flow analysis problems arising in locally least-cost error recovery %J ACM Transactions on Programming Languages and Systems %K toplas %V 6 %N 2 %D April 1984 %P 192-214 %A John H. Reif %A Paul G. Spirakis %T Real-time synchronization of interprocess communications %J ACM Transactions on Programming Languages and Systems %K toplas %V 6 %N 2 %D April 1984 %P 215-238 %A Richard Alan Karp %T Proving failure-free properties of concurrent systems using temporal logic %J ACM Transactions on Programming Languages and Systems %K toplas %V 6 %N 2 %D April 1984 %P 239-253 %A Leslie Lamport %T Using time instead of timeout for fault-tolerant distributed systems %J ACM Transactions on Programming Languages and Systems %K toplas %V 6 %N 2 %D April 1984 %P 254-280 %A Leslie Lamport %A Fred B. Schneider %T The "Hoare logic" of CSP, and all that %J ACM Transactions on Programming Languages and Systems %K toplas %V 6 %N 2 %D April 1984 %P 281-296 %A Timothy A. Budd %T An APL compiler for a vector processor %J ACM Transactions on Programming Languages and Systems %K toplas %V 6 %N 3 %D July 1984 %P 297-313 %A Richard F. Hobson %T A directly executable encoding for APL %J ACM Transactions on Programming Languages and Systems %K toplas %V 6 %N 3 %D July 1984 %P 314-332 %A Mordechai Ben-Ari %T Algorithms for on-the-fly garbage collection %J ACM Transactions on Programming Languages and Systems %K toplas %V 6 %N 3 %D July 1984 %P 333-344 %A Takuya Katayama %T Translation of attribute grammars into procedures %J ACM Transactions on Programming Languages and Systems %K toplas %V 6 %N 3 %D July 1984 %P 345-369 %A Krzysztof R. Apt %A Nissim Francez %T Modeling the distributed termination convention in CSP %J ACM Transactions on Programming Languages and Systems %K toplas %V 6 %N 3 %D July 1984 %P 370-379 %A E. Korach %A D. Rotem %A N. Santoro %T Distributed algorithms for finding centers and medians in networks %J ACM Transactions on Programming Languages and Systems %K toplas %V 6 %N 3 %D July 1984 %P 380-401 %A Richard D. Schlichting %A Fred B. Schneider %T Using message passing for distributed programming: proof rules and disciplines %J ACM Transactions on Programming Languages and Systems %K toplas %V 6 %N 3 %D July 1984 %P 402-431 %A Robert I. Winner %T Unassigned objects %J ACM Transactions on Programming Languages and Systems %K toplas %V 6 %N 4 %D October 1984 %P 449-467 %A Franco Turini %T Magma2: a language oriented toward experiments in control %J ACM Transactions on Programming Languages and Systems %K toplas %V 6 %N 4 %D October 1984 %P 468-486 %A R.S. Bird %T The promotion and accumulation strategies in transformational programming %J ACM Transactions on Programming Languages and Systems %K toplas %V 6 %N 4 %D October 1984 %P 487-504 %A Jack W. Davidson %A Christopher W. Fraser %T Code selection through object code optimization %J ACM Transactions on Programming Languages and Systems %K toplas %V 6 %N 4 %D October 1984 %P 505-526 %A M.V.S. Ramanath %A Marvin Solomon %T Jump optimization in linear time %J ACM Transactions on Programming Languages and Systems %K toplas %V 6 %N 4 %D October 1984 %P 527-545 %A Peter Dencker %A Karl Durre %A Johannes Heuft %T Optimization of parser tables for portable compilers %J ACM Transactions on Programming Languages and Systems %K toplas %V 6 %N 4 %D October 1984 %P 546-572 %A Naftaly H. Minsky %T Selective and locally controlled transport of privileges %J ACM Transactions on Programming Languages and Systems %K toplas %V 6 %N 4 %D October 1984 %P 573-602 %A Michael Georgeff %T Transformations and reduction strategies for typed lambda expressions %J ACM Transactions on Programming Languages and Systems %K toplas %V 6 %N 4 %D October 1984 %P 603-631 %A K.M. Chandy %A J. Misra %T The drinking philosophers problem %J ACM Transactions on Programming Languages and Systems %K toplas %V 6 %N 4 %D October 1984 %P 632-646 %A N. Soundarajan %T Axiomatic semantics of communicating sequential processes %J ACM Transactions on Programming Languages and Systems %K toplas %V 6 %N 4 %D October 1984 %P 647-662 %A David Barstow %T On convergence toward a database of program transformations %J ACM Transactions on Programming Languages and Systems %K toplas %V 7 %N 1 %D January 1985 %P 1-9 %A Pamela Zave %T A distributed alternative to finite-state-machine specifications %J ACM Transactions on Programming Languages and Systems %K toplas %V 7 %N 1 %D January 1985 %P 10-36 %A Jean-Francois Bergeretti %A Bernard A. Carre %T Information-flow and data-flow analysis of while-programs %J ACM Transactions on Programming Languages and Systems %K toplas %V 7 %N 1 %D January 1985 %P 37-61 %A David R. Fuchs %A Donald E. Knuth %T Optimal prepaging and font caching %J ACM Transactions on Programming Languages and Systems %K toplas %V 7 %N 1 %D January 1985 %P 62-79 %A David Gelernter %T Generative communication in Linda %J ACM Transactions on Programming Languages and Systems %K toplas %V 7 %N 1 %D January 1985 %P 80-112 %A Joseph L. Bates %A Robert L. Constable %T Proofs as programs %J ACM Transactions on Programming Languages and Systems %K toplas %V 7 %N 1 %D January 1985 %P 113-136 %A Douglas D. Dunlop %A Victor R. Basili %T Generalizing specifications for uniformly implemented loops %J ACM Transactions on Programming Languages and Systems %K toplas %V 7 %N 1 %D January 1985 %P 137-158 %A Joseph C.H. Park %A K.M. Choe %A C.H. Chang %T A new analysis of LALR formalisms %J ACM Transactions on Programming Languages and Systems %K toplas %V 7 %N 1 %D January 1985 %P 159-175 %A Jan Heering %A Paul Klint %T Towards monolingual programming environments %J ACM Transactions on Programming Languages and Systems %K toplas %V 7 %N 2 %D April 1985 %P 183-213 %A Shaula Yemini %A Daniel M. Berry %T A modular verifiable exception-handling mechanism %J ACM Transactions on Programming Languages and Systems %K toplas %V 7 %N 2 %D April 1985 %P 214-243 %A William Weihi %A Barbara Liskov %T Implementation of resilient, atomic data types %J ACM Transactions on Programming Languages and Systems %K toplas %V 7 %N 2 %D April 1985 %P 244-269 %A George J. Milne %T CIRCAL and the representation of communication, concurrency and time %J ACM Transactions on Programming Languages and Systems %K toplas %V 7 %N 2 %D April 1985 %P 270-298 %A David A. Schmidt %T Detecting global variables in denotational specifications %J ACM Transactions on Programming Languages and Systems %K toplas %V 7 %N 2 %D April 1985 %P 299-310 %A Keshav Pingali %A Arvind %T Efficient demand driven evaluation, part 1 %J ACM Transactions on Programming Languages and Systems %K toplas %V 7 %N 2 %D April 1985 %P 311-333 %A Giuseppina C. Gini %A Maria L. Gini %T Dealing with world-model-based programs %J ACM Transactions on Programming Languages and Systems %K toplas %V 7 %N 2 %D April 1985 %P 334-347 %A Ilan Bar-On %A Uzi Vishkin %T Optimal parallel generation of a computation tree form %J ACM Transactions on Programming Languages and Systems %K toplas %V 7 %N 2 %D April 1985 %P 348-357 %A Flemming Nielson %T Program transformations in a denotational setting %J ACM Transactions on Programming Languages and Systems %K toplas %V 7 %N 3 %D July 1985 %P 359-379 %A George S. Avrunin %A Jack C. Wileden %T Describing and analyzing distributed software systems designs %J ACM Transactions on Programming Languages and Systems %K toplas %V 7 %N 3 %D July 1985 %P 380-403 %A David R. Jefferson %T Virtual time %J ACM Transactions on Programming Languages and Systems %K toplas %V 7 %N 3 %D July 1985 %P 404-425 %A James Donahue %A Alan Demers %T Data types are values %J ACM Transactions on Programming Languages and Systems %K toplas %V 7 %N 3 %D July 1985 %P 426-445 %A Nachum Dershowitz %T Program abstraction and instantiation %J ACM Transactions on Programming Languages and Systems %K toplas %V 7 %N 3 %D July 1985 %P 446-477 %A Helmut Richter %T Noncorrecting syntax error recovery %J ACM Transactions on Programming Languages and Systems %K toplas %V 7 %N 3 %D July 1985 %P 478-489 %A R.S. Bird %T Addendum to "The promotion and accumulation strategies in transformational programming" %J ACM Transactions on Programming Languages and Systems %K toplas %V 7 %N 3 %D July 1985 %P 490-492 %A Robert H. Halstead,\ Jr. %T Multilisp: a language for concurrent symbolic computation %J ACM Transactions on Programming Languages and Systems %K toplas %V 7 %N 4 %D October 1985 %P 501-538 %A Malcolm P. Atkinson %A Ronald Morrison %T Procedures as persistent data objects %J ACM Transactions on Programming Languages and Systems %K toplas %V 7 %N 4 %D October 1985 %P 539-559 %A Mahadevan Ganapathi %A Charles N. Fischer %T Affix grammar driven code generation %J ACM Transactions on Programming Languages and Systems %K toplas %V 7 %N 4 %D October 1985 %P 560-599 %A Robert P. Nix %T Editing by example %J ACM Transactions on Programming Languages and Systems %K toplas %V 7 %N 4 %D October 1985 %P 600-621 %A Nissim Francez %A Shaula A. Yemini %T Symmetric intertask communication %J ACM Transactions on Programming Languages and Systems %K toplas %V 7 %N 4 %D October 1985 %P 622-636 %A Hans-Juergen Boehm %T Side effects and aliasing can have simple axiomatic descriptions %J ACM Transactions on Programming Languages and Systems %K toplas %V 7 %N 4 %D October 1985 %P 637-655 %A Arie de\ Bruin %A Wim Bohm %T The denotational semantics of dynamics networks of processes %J ACM Transactions on Programming Languages and Systems %K toplas %V 7 %N 4 %D October 1985 %P 656-679 %A Keith L. Clark %A Steve Gregory %T PARLOG: parallel programming in logic %J ACM Transactions on Programming Languages and Systems %K toplas %V 8 %N 1 %D January 1986 %P 1-49 %A George B. Leeman,\ Jr. %T A formal approach to undo operations in programming languages %J ACM Transactions on Programming Languages and Systems %K toplas %V 8 %N 1 %D January 1986 %P 50-87 %A Robert M. Keller %A M. Ronan Sleep %T Applicative caching %J ACM Transactions on Programming Languages and Systems %K toplas %V 8 %N 1 %D January 1986 %P 88-108 %A Keshav Pingali %A Arvind %T Efficient demand driven evaluation, part 2 %J ACM Transactions on Programming Languages and Systems %K toplas %V 8 %N 1 %D January 1986 %P 109-139 %A Keshav Pingali %A Arvind %T Clarification of "Feeding inputs on demand" in "Efficient demand driven evaluation, part 1" %J ACM Transactions on Programming Languages and Systems %K toplas %V 8 %N 1 %D January 1986 %P 140-141 %A J. Misra %T Axioms for memory access in asynchronous hardware systems %J ACM Transactions on Programming Languages and Systems %K toplas %V 8 %N 1 %D January 1986 %P 142-153 %A Mohamed G. Gouda %A Chung-Kou Chang %T Proving liveness for networks of communicating finite state machines %J ACM Transactions on Programming Languages and Systems %K toplas %V 8 %N 1 %D January 1986 %P 154-182 %A Laurian M. Chirica %A David F. Martin %T Toward compiler implementation correctness proofs %J ACM Transactions on Programming Languages and Systems %K toplas %V 8 %N 2 %D April 1986 %P 185-214 %A C.R. Spooner %T The ML approach to the readable all-purpose language %J ACM Transactions on Programming Languages and Systems %K toplas %V 8 %N 2 %D April 1986 %P 215-243 %A E.M. Clarke %A E.A. Emerson %A A.P. Sistla %T Automatic verification of finite-state concurrent systems using temporal logic specifications %J ACM Transactions on Programming Languages and Systems %K toplas %V 8 %N 2 %D April 1986 %P 245-263 %A Thomas J. Sager %T A short proof of a conjecture of de Remer and Pennello %J ACM Transactions on Programming Languages and Systems %K toplas %V 8 %N 2 %D April 1986 %P 264-271 %A Walter F. Tichy %T Smart recompilation %J ACM Transactions on Programming Languages and Systems %K toplas %V 8 %N 3 %D July 1986 %P 273-291 %A Valentin F. Turchin %T The concept of a supercompiler %J ACM Transactions on Programming Languages and Systems %K toplas %V 8 %N 3 %D July 1986 %P 292-325 %A Mani Chandy %A Jayadev Misra %T An example of stepwise refinement of distributed programs: quiescence detection %J ACM Transactions on Programming Languages and Systems %K toplas %V 8 %N 3 %D July 1986 %P 326-343 %A Matthew Hennessy %T Proving systolic systems correct %J ACM Transactions on Programming Languages and Systems %K toplas %V 8 %N 3 %D July 1986 %P 344-387 %A Krzysztof R. Apt %T Correctness proofs of distributed termination algorithms %J ACM Transactions on Programming Languages and Systems %K toplas %V 8 %N 3 %D July 1986 %P 388-405 %A Daniel Swinehart %A Polle Zellweger %A Richard Beach %A Robert Hagmann %T A structural view of the Cedar programming environment %J ACM Transactions on Programming Languages and Systems %K toplas %V 8 %N 4 %D October 1986 %P 419-490 %A Keith Cooper %A Ken Kennedy %A Linda Torczon %T The impact of interprocedure analysis and optimization in the R^n programming environment %J ACM Transactions on Programming Languages and Systems %K toplas %V 8 %N 4 %D October 1986 %P 491-523 %A Mark Moriconi %A Dwight Hare %T The PegaSys system: pictures as fomal documentation of large programs %J ACM Transactions on Programming Languages and Systems %K toplas %V 8 %N 4 %D October 1986 %P 524-546 %A Rolf Bahlke %A Gregor Snelting %T The PSG system: from formal language definitions to interactive programming environments %J ACM Transactions on Programming Languages and Systems %K toplas %V 8 %N 4 %D October 1986 %P 547-576 %A Susan Horwitz %A Tim Teitelbaum %T Generating editing environments based on relations and attributes %J ACM Transactions on Programming Languages and Systems %K toplas %V 8 %N 4 %D October 1986 %P 577-608 %A Jeannette M. Wing %T Writing Larch interface language specifications %J ACM Transactions on Programming Languages and Systems %K toplas %V 9 %N 1 %D January 1987 %P 1-24 %A Scott D. Carson %A Paul F. Reynolds,\ Jr. %T The geometry of semaphore programs %J ACM Transactions on Programming Languages and Systems %K toplas %V 9 %N 1 %D January 1987 %P 25-53 %A Manfred Broy %A Martin Wirsing %A Peter Pepper %T On the algebraic definition of programming languages %J ACM Transactions on Programming Languages and Systems %K toplas %V 9 %N 1 %D January 1987 %P 54-99 %A Stefan Sokolowski %T Soundness of Hoare's logic: an automated proof using LCF %J ACM Transactions on Programming Languages and Systems %K toplas %V 9 %N 1 %D January 1987 %P 100-120 %A Jacques Cohen %A Timothy J. Hickey %T Parsing and compiling using Prolog %J ACM Transactions on Programming Languages and Systems %K toplas %V 9 %N 2 %D April 1987 %P 125-163 %A Michael G. Burke %A Gerald A. Fisher %T A practical method for LR and LL syntactic error diagnosis %J ACM Transactions on Programming Languages and Systems %K toplas %V 9 %N 2 %D April 1987 %P 164-197 %A Martin S. Feather %T Language support for the specification and development of composite systems %J ACM Transactions on Programming Languages and Systems %K toplas %V 9 %N 2 %D April 1987 %P 198-234 %A Raphael Finkel %A Udi Manber %T DIB - a distributed implementation of backtracking %J ACM Transactions on Programming Languages and Systems %K toplas %V 9 %N 2 %D April 1987 %P 235-256 %K Crystal %A Robert A. Mueller %A Joseph Varghese %T Retargetable microcode synthesis %J ACM Transactions on Programming Languages and Systems %K toplas %V 9 %N 2 %D April 1987 %P 257-276 %A Christopher W. Fraser %A Eugene W. Myers %T An editor for revision control %J ACM Transactions on Programming Languages and Systems %K toplas %V 9 %N 2 %D April 1987 %P 277-295 %A David Alex Lamb %T IDL: sharing intermediate representations %J ACM Transactions on Programming Languages and Systems %K toplas %V 9 %N 3 %D July 1987 %P 297-318 %A Jeanne Ferrante %A Karl J. Ottenstein %A Joe D. Warren %T The program dependence graph and its use in optimization %J ACM Transactions on Programming Languages and Systems %K toplas %V 9 %N 3 %D July 1987 %P 319-349 %A Arthur Charlesworth %T The multiway rendezvoud %J ACM Transactions on Programming Languages and Systems %K toplas %V 9 %N 3 %D July 1987 %P 350-366 %A R.C. Holt %T Data descriptors: a compile-time model of data and addressing %J ACM Transactions on Programming Languages and Systems %K toplas %V 9 %N 3 %D July 1987 %P 367-389 %A Shaula Yemini %A Daniel M. Berry %T An axiomatic treatment of exception handling in an expression-oriented language %J ACM Transactions on Programming Languages and Systems %K toplas %V 9 %N 3 %D July 1987 %P 390-407 %A Thomas Reps %A Alan Demers %T Sublinear-space evaluation algorithms for attribute grammars %J ACM Transactions on Programming Languages and Systems %K toplas %V 9 %N 3 %D July 1987 %P 408-440 %A Debasish Banerjee %T A methodology for synthesis of recursive functional programs %J ACM Transactions on Programming Languages and Systems %K toplas %V 9 %N 3 %D July 1987 %P 441-462