Foundations of Software Technology and Theoretical Computer Science 13th Conference, Bombay, India, December 15-17, 1993. Proceedings - neues Buch

EAN (ISBN-13): 9783540575290
ISBN (ISBN-10): 3540575294
Gebundene Ausgabe
Taschenbuch
Erscheinungsjahr: 1993
Herausgeber: Springer Berlin
455 Seiten
Gewicht: 0,713 kg

Buch in der Datenbank seit 2007-10-26T12:10:35+02:00 (Vienna)
Detailseite zuletzt geändert am 2024-02-02T15:38:38+01:00 (Vienna)
ISBN/EAN: 9783540575290

ISBN - alternative Schreibweisen:
3-540-57529-4, 978-3-540-57529-0
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: shyam
Titel des Buches: bombay, foundations software technology and theoretical computer science, foundation, lecture notes computer science, proceedings all india, 1993

---

Daten vom Verlag:

Autor/in: Rudrapatna K. Shyamasundar
Titel: Lecture Notes in Computer Science; Foundations of Software Technology and Theoretical Computer Science - 13th Conference, Bombay, India, December 15-17, 1993. Proceedings
Verlag: Springer; Springer Berlin
462 Seiten
Erscheinungsjahr: 1993-11-23
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
Available
CDLXXVI, 462 p.

BC; Hardcover, Softcover / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; Algorithmen; Algorthmische Geometrie; Computational Geometry; Concurrency; Komplexität; Type Theory; Typentheorie; algorithm; algorithms; complexity; logic; programming; Theory of Computation; Software Engineering; Computer Science Logic and Foundations of Programming; Compilers and Interpreters; Formal Languages and Automata Theory; Software Engineering; Compiler und Übersetzer; EA

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.