## Foundations of Software Technology and Theoretical Computer Science: 17th Conference, Kharagpur, India, December 18-20, 1997. Proceedings, Volume 17This 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. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

A general purpose sharedmemory model for parallel computation | 1 |

Approximating geometric domains through yopological yriangulations | 6 |

Solving some discrepancy problems in NC | 22 |

Exact and asymptotic bounds | 37 |

Model checking | 54 |

Recursion versus iteration at higherorders | 57 |

Compilation and equivalence of imperative objects | 74 |

On the expressive power of rewriting | 88 |

Algorithmic issues in coding theory | 184 |

Sharper results on the expressive power of generalized quantifiers | 200 |

Improved lowness results for solvable blackbox group problems | 220 |

On resourcebounded measure and pseudorandomness | 235 |

Verification of open systems | 250 |

Hoarestyle compositional proof systems for reactive shared variable concurrency | 267 |

A simple characterization of stuttering bisimulation | 284 |

General refinement for high level petri nets | 297 |

SRT Division | 103 |

On the complexity of parallel implementation of logic programs | 123 |

An abductive semantics for disjunctive logic programs and its proof procedure | 138 |

AssumptionCommitment in automata | 153 |

Compositional design of multitolerant repetitive byzantine agreement | 169 |

Polynomialtime manyone reductions for Petri nets | 312 |

Computing reachability properties hidden in finite net Unfoldings | 327 |

343 | |

### Other editions - View all

Foundations of Software Technology and Theoretical Computer Science: 17th ... S. Ramesh,G. Sivakumar No preview available - 2003 |

Foundations of Software Technology and Theoretical Computer Science S. Ramesh,G. Sivakumar No preview available - 2014 |

### Common terms and phrases

abstract action algorithm allows applications approximation assume assumption bound branching called canonical checking circuit closed complexity component Computer Computer Science condition configuration consider construction contains correctness corresponding defined definition denote describe digit disjunctive edge editions element environment equivalence example execution exists expressive extended fact finite formula function give given graph Hence holds implementation infinite input iteration labelled language least Lemma linear logic machine marking method node normal Note object Observe obtained operation parallel partial path places polynomial possible present problem Proc procedure proof prove quantifiers queries quotient reachability reasoning reduction refined relation represented respect rewriting rule satisfies selection semantics sequence shift specification structure term Theorem theory tolerance transition tree triangles variables verification

### Popular passages

Page 282 - FS de Boer, JN Kok, C. Palamidessi, and JJMM Rutten. The failure of failures: Towards a paradigm for asynchronous communication. In Proceedings of Concur '91, Lecture Notes in Computer Science, Vol.