Skip to main content
SpringerLink
Log in

Foundations of Software Technology and Theoretical Computer Science

Sixth Conference, New Delhi, India, December 18-20, 1986. Proceedings

  • Conference proceedings
  • © 1986

Overview

Editors:
  1. Kesav V. Nori
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 241)

Included in the following conference series:

Conference proceedings info: FSTTCS 1986.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (31 papers)

  1. Front Matter

    Download chapter PDF

  2. Software Development Graphs a unifying concept for software development?

    • Dines Bjørner
    Pages 1-9

  3. Concurrent runtime checking of annotated Ada programs

    • David S. Rosenblum, Sriram Sankar, David C. Luckham
    Pages 10-35

  4. Recovery of noncurrent variables in source-level debugging of optimized code

    • Amitabh Srivastava
    Pages 36-56

  5. Automatic retargetable code generation: A new technique

    • Sanjeev Kumar, V. M. Malhotra
    Pages 57-80

  6. An implementation of OBJ2: An object-oriented language for abstract program specification

    • S. Sridhar
    Pages 81-95

  7. Explicit representation of terms defined by counter examples

    • J. -L. Lassez, K. Marriott
    Pages 96-107

  8. A framework for intelligent backtracking in logic programs

    • Vipin Kumar, Yow-Jian Lin
    Pages 108-123

  9. A generalization of Backus' FP

    • Y. V. Srinivas, Rajeev Sangal
    Pages 124-143

  10. Shortest-path motion

    • Christos H. Papadimitriou
    Pages 144-153

  11. Via assignment in single row routing

    • Jayaram Bhasker, Sartaj Sahni
    Pages 154-176

  12. Average-case analysis of the Modified Harmonic algorithm

    • Prakash Ramanan, Kazuhiro Tsuga
    Pages 177-192

  13. Covering minima and lattice point free convex bodies

    • Ravi Kannan, László Lovász
    Pages 193-213

  14. Binary decompositions and acyclic schemes

    • V. S. Lakshmanan, C. E. Veni Madhavan
    Pages 214-238

  15. Thin homogeneous sets of factors

    • D. Beauquier
    Pages 239-251

  16. Irreducible polynomials over finite fields

    • Joachim von zur Gathen
    Pages 252-262

  17. Basis reduction and evidence for transcendence of certain numbers

    • Ravi Kannan, Lyle A. McGeoch
    Pages 263-269

  18. A characterization of asynchronous message-passing

    • S. R. Goregaokar, S. Arun-Kumar
    Pages 270-287

  19. Modular synthesis of deadlock-free control structures

    • Ajoy Kumar Datta, S. Ghosh
    Pages 288-318

  20. Distributed resource sharing in computer networks

    • Inder S. Gopal, Parviz Kermani
    Pages 319-329
Back to top

Other volumes

  1. Foundations of Software Technology and Theoretical Computer Science

Keywords

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation