Foundations of software technology and theoretical computer science : sixth conference, New Delhi, India, December 18-20, 1986 : proceedings : FST and TCS 6
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
241 |
| 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, sixth conference, New Delhi, India, December 18-20, 1986, proceedings, FST and TCS 6, Berlin, Springer-Verlag, 1986, 1 vol. (XII-518 p.), Lecture notes in computer science, 3-540-17179-7 • Foundations of Software Technology and Theoretical Computer Science, Texte imprimé, 9783662196922 |
Table des matières:
- Software Development Graphs a unifying concept for software development?
- Concurrent runtime checking of annotated Ada programs
- Recovery of noncurrent variables in source-level debugging of optimized code
- Automatic retargetable code generation: A new technique
- An implementation of OBJ2: An object-oriented language for abstract program specification
- Explicit representation of terms defined by counter examples
- A framework for intelligent backtracking in logic programs
- A generalization of Backus' FP
- Shortest-path motion
- Via assignment in single row routing
- Average-case analysis of the Modified Harmonic algorithm
- Covering minima and lattice point free convex bodies
- Binary decompositions and acyclic schemes
- Thin homogeneous sets of factors
- Irreducible polynomials over finite fields
- Basis reduction and evidence for transcendence of certain numbers
- A characterization of asynchronous message-passing
- Modular synthesis of deadlock-free control structures
- Distributed resource sharing in computer networks
- On proving communication closedness of distributed layers
- A distributed algorithm for edge-disjoint path problem
- Scheduling of hard real-time systems
- A polynomial approximation scheme for machine scheduling on uniform processors: Using the dual approximation approach
- Connectivity algorithms using rubber bands
- On simple and creative sets in NP
- Complexity of sufficient-completeness
- Sampling a population with a semi-random source
- An optimal parallel algorithm for dynamic expression evaluation and its applications
- Extension of the parallel nested dissection algorithm to path algebra problems
- On synthesizing systolic arrays from Recurrence Equations with Linear Dependencies
- An efficient parallel algorithm for term matching.