Buch, Englisch, Band 1346, 351 Seiten, Paperback, Format (B × H): 155 mm x 235 mm, Gewicht: 1130 g
17th Conference, Kharagpur, India, December 18-20, 1997. Proceedings
Buch, Englisch, Band 1346, 351 Seiten, Paperback, Format (B × H): 155 mm x 235 mm, Gewicht: 1130 g
Reihe: Lecture Notes in Computer Science
ISBN: 978-3-540-63876-6
Verlag: Springer Berlin Heidelberg
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.
Zielgruppe
Research
Autoren/Hrsg.
Fachgebiete
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Software Engineering
- Technische Wissenschaften Elektronik | Nachrichtentechnik Elektronik Robotik
- Mathematik | Informatik EDV | Informatik Informatik Logik, formale Sprachen, Automaten
- Mathematik | Informatik EDV | Informatik Informatik Künstliche Intelligenz Wissensbasierte Systeme, Expertensysteme
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Programmierung: Methoden und Allgemeines
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Prozedurale Programmierung
Weitere Infos & Material
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.
