Foundations of software technology and theoretical computer science : 12th conference, New Delhi, India, December 18-20, 1992 : proceedings : FST and TCS 12
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 f...
Gardado en:
| Autor Corporativo: | |
|---|---|
| Outros autores: | |
| Formato: | Livre numérique |
| Idioma: | Anglais |
| Publicado: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Series: | Lecture notes in computer science
652 |
| Sujets: | |
| Acceso en liña: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Foundations of software technology and theoretical computer science, 12th conference, New Delhi, India, December 18-20, 1992, proceedings, R. Shyamasundar (ed.), Berlin, Springer-Verlag, 1992, 1 vol. (XIII-403 p.), Lecture notes in computer science, 3-540-56287-7 • Foundations of Software Technology and Theoretical Computer Science, Texte imprimé, 9783662184080 |
Table des matières:
- 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.