Foundations of Software Technology and Theoretical Computer Science: 13th Conference, Bombay, India, December 15-17, 1993. ProceedingsRudrapatna K. Shyamasundar Springer Science & Business Media, 1993 M11 23 - 462 páginas For more than a decade, Foundations of Software Technology and Theoretical Computer Science Conferences have been providing an annual forum for the presentation of new research results in India and abroad. This year, 119 papers from 20 countries were submitted. Each paper was reviewed by at least three reviewers, and 33 papers were selected for presentation and included in this volume, grouped into parts on type theory, parallel algorithms, term rewriting, logic and constraint logic programming, computational geometry and complexity, software technology, concurrency, distributed algorithms, and algorithms and learning theory. Also included in the volume are the five invited papers presented at theconference. |
Contenido
Some Observations About the Nature of Computer Science | 1 |
Essential Intersection Type Assignment | 13 |
LabelSelective ACalculus Syntax and Confluence | 24 |
Extended abstract | 41 |
A met alanguage for typed objectoriented languages | 52 |
Preemption in Concurrent Systems | 72 |
Local Versus Nonlocal Computation of Length of Digitized Curves | 94 |
DataIndependences of Parallel Random Access Machines | 104 |
Recursiveness over the Complex Numbers is TimeBounded | 260 |
A lower bound for solvability of polynomial equations | 268 |
Reuse of Proofs in Software Verification | 284 |
Constructs for Inductive Programming | 294 |
A graphic language based on timing diagrams | 306 |
Software Technology Integrating Theory and Practice | 317 |
An Overview | 318 |
Complexity Results for 1safe Nets | 326 |
Proving termination of logic programs by transforming them into equivalent term rewriting systems | 114 |
Completeness of Hierarchical Combinations of Term Rewriting Systems | 125 |
HigherOrder and Semantic Unification | 139 |
A Conservative Extension of Firstorder Logic and Its Applications to Theorem Proving | 151 |
WeilFounded Ordered Search Extended Abstract | 161 |
A RealTime Interval Logic and Its Decision Procedure | 173 |
On the Semantics of Optimization Predicates in CLP languages | 193 |
Incremental Algorithms for Constraint Solving and Entailment over Rational Trees | 205 |
Proximity Problems and the Voronoi Diagram on a Rectilinear Plane with Rectangular Obstacles Extended Abstract | 218 |
Feasibility of Design in Stereolithography | 228 |
Compact Location Problems Extended Abstract | 238 |
On Some Communication Complexity Problems Related to Threshold Functions | 248 |
Some results about logical descriptions of non deterministic behaviours | 338 |
Order Structures and Generalisations of Szpilrajns Theorem | 348 |
ICSP and Its Relationship with ACSP and CSP | 358 |
On ReductionBased Process Semantics | 373 |
Bounded TimeStamps Suffice | 388 |
Time Optimal SelfStabilizing Spanning Tree Algorithms | 400 |
Efficient Algorithm to Sort Linear Combinations of Arrays | 411 |
A SIMPLE FILE STRUCTURE FOR THE WEIGHTED DICTIONARY PROBLEM | 419 |
Searching Sorting and Randomised Algorithms for Central Elements and Ideal Counting in Posets | 436 |
Learning Classes of Regular and Linear Languages in Valiants Learnability Framework | 444 |
Otras ediciones - Ver todas
Foundations of Software Technology and Theoretical Computer Science: 13th ... Rudrapatna Shyamasundar Vista de fragmentos - 1993 |
Foundations of Software Technology and Theoretical Computer Science: 13th ... Rudrapatna K. Shyamasundar Sin vista previa disponible - 2014 |
Términos y frases comunes
A-calculus ACSP algebraic algorithm application branch and bound calculus Chronogram complexity Computer Science concurrent consider constraint construction constructor contains Context corresponding defined Definition denote derivation disequation DSPACE elements equations equivalence ESTEREL example extension finite first-order first-order logic formula given goal graph ICSP ideal path induction innermost normalizing input integer interval labels Lambda Calculus language Lemma linear LNCS logic programs lower bound node NP-complete operational semantics operations optimal output overloaded function pair paper Petri nets polynomial poset predicate preemption problem Proc procedure processor proof Proposition prove PSPACE-complete R₁ reachability recursive reduction relation result reuse RTFIL rules satisfied scl(f semantics sequence stereolithography structure violation subgoals subset symbols Term Rewriting Systems termination tessellation Theorem theory tion transition tree type assignment Univ variables Voronoi diagram weight well-founded semantics