LEADER 06163nam 22007095 450 001 996465775203316 005 20200705124647.0 010 $a3-540-48211-3 024 7 $a10.1007/3-540-57529-4 035 $a(CKB)1000000000234062 035 $a(SSID)ssj0000323285 035 $a(PQKBManifestationID)11242984 035 $a(PQKBTitleCode)TC0000323285 035 $a(PQKBWorkID)10297145 035 $a(PQKB)11283229 035 $a(DE-He213)978-3-540-48211-6 035 $a(PPN)155175718 035 $a(EXLCZ)991000000000234062 100 $a20121227d1993 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aFoundations of Software Technology and Theoretical Computer Science$b[electronic resource] $e13th Conference, Bombay, India, December 15-17, 1993. Proceedings /$fedited by Rudrapatna K. Shyamasundar 205 $a1st ed. 1993. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1993. 215 $a1 online resource (CDLXXVI, 462 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v761 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-57529-4 327 $aSome 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. 330 $aFor 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. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v761 606 $aComputers 606 $aSoftware engineering 606 $aComputer logic 606 $aProgramming languages (Electronic computers) 606 $aMathematical logic 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aSoftware Engineering/Programming and Operating Systems$3https://scigraph.springernature.com/ontologies/product-market-codes/I14002 606 $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X 606 $aComputation by Abstract Devices$3https://scigraph.springernature.com/ontologies/product-market-codes/I16013 606 $aProgramming Languages, Compilers, Interpreters$3https://scigraph.springernature.com/ontologies/product-market-codes/I14037 606 $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048 615 0$aComputers. 615 0$aSoftware engineering. 615 0$aComputer logic. 615 0$aProgramming languages (Electronic computers). 615 0$aMathematical logic. 615 14$aTheory of Computation. 615 24$aSoftware Engineering/Programming and Operating Systems. 615 24$aLogics and Meanings of Programs. 615 24$aComputation by Abstract Devices. 615 24$aProgramming Languages, Compilers, Interpreters. 615 24$aMathematical Logic and Formal Languages. 676 $a004.0151 702 $aShyamasundar$b Rudrapatna K$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996465775203316 996 $aFoundations of software technology and theoretical computer science$9383921 997 $aUNISA