Skip to main content
SpringerLink
Log in

Foundations of Software Technology and Theoretical Computer Science

Fifth Conference, New Delhi, India, December 16-18, 1985. Proceedings

  • Conference proceedings
  • © 1985

Overview

Editors:
  1. S. N. Maheshwari
    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 206)

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 (29 papers)

  1. Front Matter

    Download chapter PDF

  2. The mathematics of programming

    • C. A. R. Hoare
    Pages 1-18

  3. Concurrent programming using actors: Exploiting large-scale parallelism

    • Gul Agha, Carl Hewitt
    Pages 19-41

  4. A new class of high level programs for distributed computing systems

    • S. Ramesh, S. L. Mehndiratta
    Pages 42-72

  5. A class of termination detection algorithms for distributed computations

    • Devendra Kumar
    Pages 73-100

  6. New protocols for the election of a leader in a ring

    • A. Marchetti-Spaccamela
    Pages 101-115

  7. Program simplification via symbolic interpretation

    • Carlo Ghezzi, Dino Mandrioli, Antonio Tecchio
    Pages 116-128

  8. PROLOG-based inductive theorem proving

    • Jieh Hsiang, Mandayam Srivas
    Pages 129-149

  9. On the calling behaviour of procedures

    • Dieter Armbruster
    Pages 150-161

  10. Approximation algorithms for planar matching

    • Shankar M. Venkatesan
    Pages 162-175

  11. Geometric optimization and the polynomial hierarchy

    • Chanderjit Bajaj
    Pages 176-195

  12. Deriving object octree from images

    • Jack Veenstra, Narendra Ahuja
    Pages 196-211

  13. Deduction with relation matching

    • Zohar Manna, Richard Waldinger
    Pages 212-224

  14. Recursively defined domains and their induction principles

    • Finn V. Jensen, Kim G. Larsen
    Pages 225-245

  15. Large database specifications from small views

    • S. Khosla, T. S. E. Maibaum, M. Sadler
    Pages 246-271

  16. A decision method for temporal logic based on resolution

    • G. Venkatesh
    Pages 272-289

  17. A generalization of the Parikh vector for finite and infinite words

    • Rani Siromoney, V. Rajkumar Dare
    Pages 290-302

  18. The implication problem for functional and multivalued dependencies : An algebraic approach

    • V. S. Lakshmanan, C. E. Veni Madhavan
    Pages 303-328

  19. A simple characterization of database serializability

    • K. Vidyasankar
    Pages 329-345

  20. Who needs to verify programs if you can test them

    • Ashok Chandra
    Pages 346-346
Back to top

Keywords

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation