| 000 -LEADER |
|---|
| fixed length control field |
04926nam a22005895i 4500 |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| ISBN |
9783540475071 |
| -- |
978-3-540-47507-1 |
| 082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER |
|---|
| Classification number |
005.1015113 |
| 245 10 - TITLE STATEMENT |
|---|
| Title |
Foundations of Software Technology and Theoretical Computer Science |
| Sub Title |
12th Conference New Delhi, India, December 18–20, 1992 Proceedings / |
| Statement of responsibility, etc |
edited by Rudrapatna Shyamasundar. |
| 260 #1 - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) |
|---|
| Place of publication |
Berlin, Heidelberg : |
| Name of publisher |
Springer Berlin Heidelberg, |
| Year of publication |
1992. |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Number of Pages |
XV, 409 p. |
| Other physical details |
online resource. |
| 490 1# - SERIES STATEMENT |
|---|
| Series statement |
Lecture Notes in Computer Science, |
| 505 0# - FORMATTED CONTENTS NOTE |
|---|
| Formatted contents note |
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. |
| 520 ## - SUMMARY, ETC. |
|---|
| Summary, etc |
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. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical Term |
Computer science. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical Term |
Logic design. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical Term |
Computer graphics. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical Term |
Combinatorics. |
| 650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical Term |
Computer Science. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical Term |
Logics and Meanings of Programs. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical Term |
Computation by Abstract Devices. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical Term |
Programming Languages, Compilers, Interpreters. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical Term |
Mathematical Logic and Formal Languages. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical Term |
Combinatorics. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical Term |
Computer Graphics. |
| 700 1# - ADDED ENTRY--PERSONAL NAME |
|---|
| Personal name |
Shyamasundar, Rudrapatna. |
| 856 40 - ELECTRONIC LOCATION AND ACCESS |
|---|
| Uniform Resource Identifier |
http://dx.doi.org/10.1007/3-540-56287-7 |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) |
|---|
| Koha item type |
E-BOOKS |
| 264 #1 - |
|---|
| -- |
Berlin, Heidelberg : |
| -- |
Springer Berlin Heidelberg, |
| -- |
1992. |
| 336 ## - |
|---|
| -- |
text |
| -- |
txt |
| -- |
rdacontent |
| 337 ## - |
|---|
| -- |
computer |
| -- |
c |
| -- |
rdamedia |
| 338 ## - |
|---|
| -- |
online resource |
| -- |
cr |
| -- |
rdacarrier |
| 347 ## - |
|---|
| -- |
text file |
| -- |
PDF |
| -- |
rda |
| 830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE |
|---|
| -- |
0302-9743 ; |
