[Lecture Notes in Computer Science] Foundations of Software Technology and Theoretical Computer Science Volume 1346 || Model checking
โ Scribed by Ramesh, S.; Sivakumar, G
- Book ID
- 115538320
- Publisher
- Springer Berlin Heidelberg
- Year
- 1997
- Tongue
- German
- Weight
- 190 KB
- Edition
- 1997
- Category
- Article
- ISBN-13
- 9783540638766
No coin nor oath required. For personal study only.
โฆ Synopsis
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. 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. S. Ramesh, G. Sivakumar, Eds. Fsttcs'97--spine. The Proceedings Of The Seventeenth Annual Conference On Foundations Of Software Technology And Theoretical Computer Science. Includes Bibliographical References And Index.
๐ SIMILAR VOLUMES
This book constitutes the refereed proceedings of the 27th International Conference on the Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2007, held in New Delhi, India, in December 2007. The 40 revised full papers presented together with five invited papers were careful
Sanjiv Kapoor, Sanjiva Prasad (eds.) Includes Bibliographical References And Index.
This book constitutes the refereed proceedings of the 27th International Conference on the Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2007, held in New Delhi, India, in December 2007. The 40 revised full papers presented together with five invited papers were careful