Abstract is missing.
- Software Development Graphs. A Unifying Concept for Software Development?Dines Bjørner. 1-9
- Concurrent Runtime Checking of Annotated Ada ProgramsDavid S. Rosenblum, Sriram Sankar, David C. Luckham. 10-35
- Recovery of Noncurrent Variables in Source-Level Debugging of Optimized CodeAmitabh Srivastava. 36-56
- Automatic Retargetable Code Generation: A New TechniqueVishv M. Malhotra, Sanjeev Kumar. 57-80
- An Implementation of OBJ2: An Object-Oriented Language for Abstract Program SpecificationS. Sridhar. 81-95
- Explicit Representation of Terms Defined by Counter ExamplesJean-Louis Lassez, Kim Marriott. 96-107
- A Framework for Intelligent Backtracking in Logic ProgramsVipin Kumar, Yow-Jian Lin. 108-123
- A Generalization of Backus FPYellamraju V. Srinivas, Rajeev Sangal. 124-143
- Shortest-Path MotionChristos H. Papadimitriou. 144-153
- Via Assignment in Single Row RoutingJayaram Bhaskar, Sartaj Sahni. 154-176
- Average-Case Analysis of the Modified Marmonic AlgorithmPrakash V. Ramanan, Kazuhiro Tsuga. 177-192
- Covering Minima and Lattice Point Free Convex BodiesRavi Kannan, László Lovász. 193-213
- Binary Decompositions and Acyclic SchemesV. S. Lakshmanan, C. E. Veni Madhavan. 214-238
- Thin Homogeneous Sets of FactorsDanièle Beauquier. 239-251
- Irreducible Polynomials over Finite FieldsJoachim von zur Gathen. 252-262
- Basis Reduction and Evidence for Transcendence of Certain NumbersRavi Kannan. 263-269
- A Characterization of Asynchronous Message-PassingS. R. Goregaokar, S. Arun-Kumar. 270-287
- Modular Synthesis of Deadlock-Free Control StructuresAjoy Kumar Datta, Sukumar Ghosh. 288-318
- Distributed Resource Sharing in Computer NetworksInder S. Gopal, Parviz Kermani. 319-329
- On Proving Communication Closedness of Distributed LayersRob Gerth, Liuba Shrira. 330-343
- A Distributed Algorithm for Edge-Disjoint Path ProblemHrushikesha Mohanty, G. P. Bhattacharjee. 344-361
- Scheduling of Hard Real-Time SystemsAbha Moitra. 362-381
- A Polynomial Approximation Scheme for Machine Scheduling on Uniform Processors: Using the Dual Approximation ApproachDorit S. Hochbaum, David B. Shmoys. 382-393
- Connectivity Algorithms Using Rubber-bandsLászló Lovász. 394-411
- On Simple and Creative Sets in NPSteven Homer. 412-425
- Complexity of Sufficient-CompletenessDeepak Kapur, Paliath Narendran, Hantao Zhang. 426-442
- Sampling a Population with a Semi-Random SourceUmesh V. Vazirani, Vijay V. Vazirani. 443-452
- An Optimal Parallel Algorithm for Dynamic Expression Evaluation and Its ApplicationsAlan Gibbons, Wojciech Rytter. 453-469
- Extension of the Parallel Nested Dissection Algorithm to Path Algebra ProblemsVictor Y. Pan, John H. Reif. 470-487
- On Synthesizing Systolic Arrays from Recurrence Equations with Linear DependenciesSanjay V. Rajopadhye, S. Purushothaman, Richard Fujimoto. 488-503
- An Efficient Parallel Algorithm for Term MatchingRakesh M. Verma, Krishnaprasad Thirunarayan, I. V. Ramakrishnan. 504-518