Foundations of Software Technology and Theoretical Computer Science: 17th Conference, Kharagpur, India, December 18-20, 1997. Proceedings, المجلد 17Springer Science & Business Media, 28/11/1997 - 343 من الصفحات 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. |
المحتوى
A general purpose sharedmemory model for parallel computation | 1 |
Approximating geometric domains through yopological yriangulations | 6 |
Solving some discrepancy problems in NC | 22 |
Exact and asymptotic bounds | 37 |
Model checking | 54 |
Recursion versus iteration at higherorders | 57 |
Compilation and equivalence of imperative objects | 74 |
On the expressive power of rewriting | 88 |
Algorithmic issues in coding theory | 184 |
Sharper results on the expressive power of generalized quantifiers | 200 |
Improved lowness results for solvable blackbox group problems | 220 |
On resourcebounded measure and pseudorandomness | 235 |
Verification of open systems | 250 |
Hoarestyle compositional proof systems for reactive shared variable concurrency | 267 |
A simple characterization of stuttering bisimulation | 284 |
General refinement for high level petri nets | 297 |
SRT Division | 103 |
On the complexity of parallel implementation of logic programs | 123 |
An abductive semantics for disjunctive logic programs and its proof procedure | 138 |
AssumptionCommitment in automata | 153 |
Compositional design of multitolerant repetitive byzantine agreement | 169 |
Polynomialtime manyone reductions for Petri nets | 312 |
Computing reachability properties hidden in finite net Unfoldings | 327 |
343 | |
طبعات أخرى - عرض جميع المقتطفات
عبارات ومصطلحات مألوفة
abductive abstract machine algorithm arity automata automaton bd(X bisimulation boolean Byzantine failures Byzantine faults canonical generator set circuit complexity Computer Science configuration consider construction corresponding deadlock defined definition denote disjunctive programs divisor environment equivalence example execution expressive power finite set finite unfolding formula functional program given Hence IEEE implementation induction infinite input integer interval graph iteration labelled language left-linear Lemma linear loc(a logic programs M-net method model checking module N₁ node nondeterministic normal CTRSS operation oracle output P₁ parallel partial remainder Petri nets pointer machine polynomial problem Proc procedure proof prove PSPACE quantifiers queries quotient digit reachability recursive reduction refined relation rewriting systems satisfies semantics sequence shift solvable groups structure t₁ temporal logic Term Rewriting Systems Theorem theory transition tree triangles TRSS upper bound variables verification well-founded
مقاطع مشهورة
الصفحة 282 - FS de Boer, JN Kok, C. Palamidessi, and JJMM Rutten. The failure of failures: Towards a paradigm for asynchronous communication. In Proceedings of Concur '91, Lecture Notes in Computer Science, Vol.