Foundations of software technology and theoretical computer science : 13th conference, Bombay, India, December 15-17, 1993 : proceedings / R. Shyamasundar (ed.).Material type: TextSeries: Serienbezeichnung | Lecture notes in computer science ; 761.Publisher: Berlin ; New York : Springer-Verlag, ©1993Description: 1 online resource (xiv, 453 pages) : illustrationsContent type: text Media type: computer Carrier type: online resourceISBN: 9783540482116; 3540482113Other title: FST and TCS '13Subject(s): Computer software -- Congresses | Computer science -- Congresses | Informatique -- Congrès | Logiciels -- Congrès | Computer science | Computer software | Informatik | Informatica | Programmatuurtechniek | Informatique -- Congrès | Bombay <1993>Genre/Form: Electronic books. | Conference papers and proceedings. Additional physical formats: Print version:: Foundations of software technology and theoretical computer science.DDC classification: 004 LOC classification: QA76.751 | .F69 1993Other classification: 54.10 | 54.50 Online resources: Click here to access online
|Item type||Current library||Collection||Call number||Status||Date due||Barcode||Item holds|
Includes bibliographical references and index.
Use copy Restrictions unspecified star MiAaHDL
Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002. MiAaHDL
digitized 2010 HathiTrust Digital Library committed to preserve pda MiAaHDL
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.
Online resource; title from PDF title page (SpringerLink, viewed Oct. 8, 2013).
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.