Foundations of Software Technology and Theoretical Computer Science 17th Conference, Kharagpur, India, December 18-20, 1997. Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Ramesh, S. (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Sivakumar, G. (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1997.
• Έκδοση: 1st ed. 1997.
• Σειρά: Lecture Notes in Computer Science, 1346
• Θέματα: Computers.; Software engineering.; Programming languages (Electronic computers).; Computer science-Mathematics.; Computer programming.; Artificial intelligence.; Theory of Computation.; Software Engineering/Programming and Operating Systems.; Programming Languages, Compilers, Interpreters.; Discrete Mathematics in Computer Science.; Programming Techniques.; Artificial Intelligence.

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 C...

Πίνακας περιεχομένων:

• QSM: A general purpose shared-memory model for parallel computation
• Approximating geometric domains through topological triangulations
• Solving some discrepancy problems in NC
• Graph editing to bipartite interval graphs: Exact and asymptotic bounds
• Model checking
• Recursion versus iteration at higher-orders
• Compilation and equivalence of imperative objects
• On the expressive power of rewriting
• Mechanizing verification of arithmetic circuits: SRT division
• On the complexity of parallel implementation of logic programs
• An abductive semantics for disjunctive logic programs and its proof procedure
• Assumption-commitment in automata
• Compositional design of multitolerant repetitive byzantine agreement
• Algorithmic issues in coding theory
• Sharper results on the expressive power of generalized quantifiers
• Improved lowness results for solvable black-box group problems
• On resource-bounded measure and pseudorandomness
• Verification of open systems
• Hoare-Style compositional proof systems for reactive shared variable concurrency
• A simple characterization of stuttering bisimulation
• General refinement for high level petri nets
• Polynomial-Time Many-One reductions for Petri nets
• Computing reachability properties hidden in finite net unfoldings.