Foundations of Software Technology and Theoretical Computer Science

13th Conference, Bombay, India, December 15-17, 1993. Proceedings

Rudrapatna K. Shyamasundar (Herausgeber)

Buch | Softcover

CDLXXVI, 462 Seiten

1993
Springer Berlin (Verlag)
978-3-540-57529-0 (ISBN)

Infos

For more than a decade, Foundations of Software Technologyand Theoretical Computer Science Conferences have beenproviding an annual forum for the presentation of newresearch results in India and abroad. This year, 119 papersfrom 20 countries were submitted. Each paper was reviewed byat least three reviewers, and 33 papers were selected forpresentation and included in this volume, grouped into partson type theory, parallel algorithms, term rewriting, logicand constraint logic programming, computational geometry andcomplexity, software technology, concurrency, distributedalgorithms, and algorithms and learning theory. Alsoincluded in the volume are the five invited papers presentedat theconference.

Inhalt

Some observations about the nature of computer science.- Essential intersection type assignment.- Label-selective ?-calculus syntax and confluence.- Conventional and uniqueness typing in graph rewrite systems.- A meta-language for typed object-oriented languages.- Preemption in concurrent systems.- Local versus non-local computation of length of digitized curves.- Data-independences of parallel random access machines.- Proving termination of logic programs by transforming them into equivalent term rewriting systems.- Completeness of hierarchical combinations of term rewriting systems.- Higher-order and semantic unification.- A conservative extension of first-order logic and its applications to theorem proving.- Well-founded Ordered Search (extended abstract).- A real-time interval logic and its decision procedure.- On the semantics of optimization predicates in CLP languages.- Incremental algorithms for constraint solving and entailment over rational trees.- Proximity problems and the Voronoi diagram on a rectilinear plane with rectangular obstacles.- Feasibility of design in stereolithography.- Compact location problems.- On some communication complexity problems related to threshold functions.- Recursiveness over the complex numbers is time-bounded.- A lower bound for solvability of polynomial equations.- Reuse of proofs in software verification.- Induce-statements and induce-expressions: Constructs for inductive programming.- A graphic language based on timing diagrams.- Software technology: Integrating theory and practice.- Generating degrees of belief from statistical information: An overview.- Complexity results for 1-safe nets.- Some results about logical descriptions of non deterministic behaviours.- Order structures and generalisations of Szpilrajn's theorem.-ICSP and its relationship with ACSP and CSP.- On reduction-based process semantics.- Keeping track of the latest gossip: Bounded time-stamps suffice.- Time optimal self-stabilizing spanning tree algorithms.- Efficient algorithm to sort linear combinations of arrays.- A simple file structure for the weighted dictionary problem.- Searching, sorting and randomised algorithms for Central Elements and ideal counting in posets.- Learning classes of Regular and Linear Languages in Valiant's learnability framework.

Produkt-Details

• Erscheint lt. Verlag: 23.11.1993
• Reihe/Serie: Lecture Notes in Computer Science
• Zusatzinfo: CDLXXVI, 462 p.
• Verlagsort: Berlin
• Sprache: englisch
• Maße: 155 x 235 mm
• Gewicht: 626 g
• Themenwelt: Mathematik / Informatik ► Informatik ► Software Entwicklung
• Themenwelt: Informatik ► Theorie / Studium ► Compilerbau
• Schlagworte: algorithm • Algorithmen • algorithms • Algorthmische Geometrie • Complexity • Computational Geometry • Concurrency • Informatik • Komplexität • Logic • Nebenläufigkeit • programming • Software • Typentheorie • Type Theory
• ISBN-10: 3-540-57529-4 / 3540575294
• ISBN-13: 978-3-540-57529-0 / 9783540575290
• Zustand: Neuware