Del 1346 - Lecture Notes in Computer Science

Foundations of Software Technology and Theoretical Computer Science

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

Häftad, Engelska, 1997

Av S. Ramesh, G. Sivakumar

709 kr

Beställningsvara. Skickas inom 10-15 vardagar

Fri frakt för medlemmar vid köp för minst 249 kr.

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.

Produktinformation

Utgivningsdatum1997-11-28
Mått155 x 235 x 20 mm
Vikt552 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor351
Upplaga1997
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540638766

Tillhör följande kategorier

Systemvetenskap och AI inom Data och it
Programvaruutveckling inom Data och it
Diskret matematik inom Naturvetenskap och teknik
Programmeringsböcker inom Data och it
Artificiell intelligens inom Data och it

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.