+612 9045 4394
 
CHECKOUT
Foundations of Software Technology and Theoretical Computer Science : 16th Conference, Hyderabad, India, December 18 - 20, 1996, Proceedings - Vijay Chandru

Foundations of Software Technology and Theoretical Computer Science

16th Conference, Hyderabad, India, December 18 - 20, 1996, Proceedings

By: Vijay Chandru (Editor), V. Vinay (Editor)

Paperback

Published: 27th November 1996
Ships: 5 to 9 business days
5 to 9 business days
$135.51
or 4 easy payments of $33.88 with Learn more

This book constitutes the refereed proceedings of the 16th International Conference on Foundations of Software Technology and Theoretical Computer Science, FST&TCS '96, held in Hyderabad, India, in December 1996.
The volume presents 28 revised full papers selected from a total of 98 submissions; also included are four invited contributions. The papers are organized in topical sections on computational geometry, process algebras, program semantics, algorithms, rewriting and equational-temporal logics, complexity theory, and type theory.

Circuit Complexity before the Dawn of the New Millenniump. 1
A Lambda Calculus with Letrecs and Barriersp. 19
Tablesp. 37
Mechanized Formal Methods: Progress and Prospectsp. 43
The Parameter Space of the d-step Conjecturep. 52
On the Complexity of Approximating Euclidean Traveling Salesman Tours and Minimum Spanning Treesp. 64
Efficient Computation of Rectilinear Geodesic Voronoi Neighbor in Presence of Obstaclesp. 76
Weak Bisimulation and Model Checking for Basic Parallel Processesp. 88
Testing Processes for Efficiencyp. 100
Regularity is Decidable for Normed PA Processes in Polynomial Timep. 111
Dynamic Maintenance of Shortest Path Trees in Simple Polygonsp. 123
Close Approximations of Minimum Rectangular Coveringsp. 135
A New Competitive Algorithm for Agent Searching in Unknown Streetsp. 147
On the Design of Hybrid Control Systems Using Automata Modelsp. 156
Constraint Retraction in FDp. 168
Winskel is (Almost) Right: Towards a Mechanized Semantics Textbooksp. 180
An Optimal Deterministic Algorithm for Online b-Matchingp. 193
Tight Bounds for Prefetching and Buffer Management Algorithms for Parallel I/O Systemsp. 200
Complexity of the Gravitational Method for Linear Programmingp. 212
Optimal and Information Theoretic Syntactic Pattern Recognition Involving Traditional and Transposition Errorsp. 224
Minimal Relative Normalization in Orthogonal Expression Reduction Systemsp. 238
Trace Consistency and Inevitabilityp. 250
Finite State Implementations of Knowledge-Based Programsp. 262
Higher-Order Proof by Consistencyp. 274
Advocating Ownershipp. 286
Non-cancellative Boolean Circuits: A Generalization of Monotone Boolean Circuitsp. 298
Limitations of the QRQW and EREW PRAM Modelsp. 310
Pinpointing Computation with Modular Queries in the Boolean Hierarchyp. 322
Characterization of Principal Type of Normal Forms in an Intersection Type Systemp. 335
Correcting Type Errors in the Curry Systemp. 347
Immediate Fixpoints and Their Use in Groundness Analysisp. 359
Graph Types for Monadic Mobile Processesp. 371
Author Indexp. 387
Table of Contents provided by Blackwell. All Rights Reserved.

ISBN: 9783540620341
ISBN-10: 3540620346
Series: Lecture Notes in Computer Science
Audience: General
Format: Paperback
Language: English
Number Of Pages: 395
Published: 27th November 1996
Publisher: Springer-Verlag Berlin and Heidelberg Gmbh & Co. Kg
Country of Publication: DE
Dimensions (cm): 23.39 x 15.6  x 2.13
Weight (kg): 0.57