Skip to main content
Springer Nature Link
Log in

Foundations of Software Technology and Theoretical Computer Science

17th Conference, Kharagpur, India, December 18-20, 1997. Proceedings

  • Conference proceedings
  • © 1997

Overview

Editors:
  1. S. Ramesh
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. G Sivakumar
    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 1346)

Included in the following conference series:

Conference proceedings info: FSTTCS 1997.

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

About this book

This book constitutes the refereed proceedings of the 17th International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'97. The 18 revised full papers presented were selected from a total of 68 submissions. Also included are five invited papers by Ed Clarke, Deepak Kapur, Madhu Sudan, Vijaya Ramachandran, and Moshe Vardi. Among the topics addressed are concurrency, Petri nets, graph computations, program verification, model checking, recursion theory, rewriting, and error-correcting codes.

Keywords

Table of contents (23 papers)

  1. Front Matter

    Download chapter PDF

  2. QSM: A general purpose shared-memory model for parallel computation

    • Vijaya Ramachandran
    Pages 1-5

  3. Approximating geometric domains through topological triangulations

    • Tamal K. Dey, Arunabha Roy, Nimish R. Shah
    Pages 6-21

  4. Solving some discrepancy problems in NC

    • Sanjeev Mahajan, Edgar A. Ramos, K. V. Subrahmanyam
    Pages 22-36

  5. Graph editing to bipartite interval graphs: Exact and asymptotic bounds

    • K. Cirino, S. Muthukrishnan, N. S. Narayanaswamy, H. Ramesh
    Pages 37-53

  6. Model checking

    • Edmund M. Clarke
    Pages 54-56

  7. Recursion versus iteration at higher-orders

    • A. J. Kfoury
    Pages 57-73

  8. Compilation and equivalence of imperative objects

    • A. D. Gordon, P. D. Hankin, S. B. Lassen
    Pages 74-87

  9. On the expressive power of rewriting

    • Massimo Marchiori
    Pages 88-102

  10. Mechanizing verification of arithmetic circuits: SRT division

    • Deepak Kapur, M. Subramaniam
    Pages 103-122

  11. On the complexity of parallel implementation of logic programs

    • E. Pontelli, D. Ranjan, G. Gupta
    Pages 123-137

  12. An abductive semantics for disjunctive logic programs and its proof procedure

    • Jia -Huai You, Li Yan Yuan, Randy Goebel
    Pages 138-152

  13. Assumption-commitment in automata

    • Swarup Mohalik, R. Ramanujam
    Pages 153-168

  14. Compositional design of multitolerant repetitive byzantine agreement

    • Sandeep S. Kulkarni, Anish Arora
    Pages 169-183

  15. Algorithmic issues in coding theory

    • Madhu Sudan
    Pages 184-199

  16. Sharper results on the expressive power of generalized quantifiers

    • Anil Seth
    Pages 200-219

  17. Improved lowness results for solvable black-box group problems

    • N. V. Vinodchandran
    Pages 220-234

  18. On resource-bounded measure and pseudorandomness

    • V. Arvind, J. Köbler
    Pages 235-249

  19. Verification of open systems

    • Moshe Y. Vardi
    Pages 250-266

  20. Hoare-Style compositional proof systems for reactive shared variable concurrency

    • F. S. de Boer, U. Hannemann, W. -P. de Roever
    Pages 267-283
Back to top

Other volumes

  1. Foundations of Software Technology and Theoretical Computer Science

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation