Foundations of software technology and theoretical computer science : 12th conference, New Delhi, India, December 18-20, 1992 : proceedings / R. Shyamasundar (ed.).Material type: TextSeries: Serienbezeichnung | Lecture notes in computer science ; 652.Publisher: Berlin ; New York : Springer-Verlag, ©1992Description: 1 online resource (xiii, 403 pages) : illustrationsContent type: text Media type: computer Carrier type: online resourceISBN: 9783540475071; 3540475079Subject(s): Computer software -- Congresses | Computer science -- Congresses | Logiciels -- Congrès | Informatique -- Congrès | Computer science | Computer software | Informatik | Informatica | Programmatuurtechniek | Informatique -- Congrès | Delhi <1992>Genre/Form: Electronic books. | Conference papers and proceedings. Additional physical formats: Print version:: Foundations of software technology and theoretical computer science.DDC classification: 005 LOC classification: QA76.751 | .F68 1992Other 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 author index.
Use copy Restrictions unspecified star MiAaHDL
Electronic reproduction. [Place of publication not identified] : HathiTrust Digital Library, 2012. 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 2012 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 academic computerscience forum for the presentation of new results in the topics of current research in India and abroad. This year, there was a total of 125 papers from 14 countries. Each paper was reviewed by at least three reviewers; based on these reviews, the programme committee selected 28 papers at a meeting held in July 1992 at the Tata Institute of Fundamental Research, Bombay. The selected papers are included in this volume, together with three invited papers: "Games and full completeness for multiplicative linear logic" by S. Abramsky, "Recent developments inalgorithms for the maximum-flow problem" by K. Melhorn, and "System specification and refinement in temporal logic" by A. Pnueli
Print version record.
System specification and refinement in temporal logic -- Fixed points of Büchi automata -- An automata-theoretic decision procedure for Future Interval Logic -- Improving the results of static analyses of programs by local decreasing iterations -- Implicit point location in arrangements of line segments, with an application to motion planning -- An optimal algorithm for the intersection radius of a set of convex polygons -- C-sensitive triangulations approximate the minmax length triangulation -- Superpolynomial circuits, almost sparse oracles and the exponential hierarchy -- Structural average case complexity -- On bounded truth-table, conjunctive, and randomized reductions to sparse sets -- One-way functions and isomorphism conjecture -- Solving the Lagrangian dual when the number of constraints is fixed -- Superfiniteness of query answers in deductive databases: An automata-theoretic approach -- Proving polynomials positive -- An abstract interpretation scheme for groundness, freeness, and sharing analysis of logic programs -- Polymorphic typing by abstract interpretation -- The Gallina specification language: A case study -- Verification of large software systems -- Detection of unstable predicates in distributed programs -- Fast sequential and randomised parallel algorithms for rigidity and approximate min k-cut -- Approximation through local optimality: Designing networks with small degree -- Games and full Completeness for multiplicative Linear Logic -- Real-time calculi and expansion theorems -- Branching bisimulation for context-free processes -- CCS, locations and asynchronous transition systems -- Reasoning about safety and liveness properties for probabilistic processes -- String matching under a general matching relation -- On the complexity of Certified Write All Algorithms -- Selection from read-only memory and sorting with optimum data movement -- Some observations on 2-way probabilistic finite automata -- Recent developments in algorithms for the maximum-flow problem.