TAPSOFT '91 : proceedings of the International Joint Conference on Theory and Practice of Software Development, Brighton, UK, April 8 12, 1991 Vol. 2, Advances in Distributed Computing (ADC) and Colloquium on Combining Paradigms for Software Development (CCPSD)
TAPSOFT '91 is the Fourth International Joint Conference on Theory and Practice of Software Development. It was held in Brighton, April 8-12, 1991, and was organized by the Department of Computing, Imperial College, London. The proceedings of TAPSOFT '91 are organized into three parts: - A...
Sparad:
| Institutionell upphovsman: | |
|---|---|
| Övriga upphovsmän: | , |
| Materialtyp: | Livre numérique |
| Språk: | Anglais |
| Publicerad: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serie: | Lecture notes in computer science
494 |
| Ämnen: | |
| Länkar: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Anmärkning: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • TAPSOFT'91, Vol. 2, Advances in Distributed Computing (ADC) and Colloquium on Combining Paradigms for Software Development (CCPSD), proceedings of the International Joint Conference on Theory and Practice of Software Development, Brighton, UK, April 8-12, 1991, S. Abramsky, T.S.E. Maibaum, (eds.), 1991, Berlin, Springer, 1 vol. (VIII-482 p.), Lecture notes in computer science, 3-540-53981-6 • TAPSOFT '91: Proceedings of the International Joint Conference on Theory and Practice of Software Development, Brighton, UK, April 8-12, 1991, Texte imprimé, 9783540539810 • TAPSOFT '91: Proceedings of the International Joint Conference on Theory and Practice of Software Development, Brighton, UK, April 8-12, 1991, Texte imprimé, 9783662164686 |
Innehållsförteckning:
- CCS for OO and LP
- An extended expansion theorem
- Concurrent abstract machines
- Knowledge and probability in distributed systems: Abstract
- Verification methods for finite systems
- Interactive interworking for interoperating systems
- Formal specification of object systems
- On the relationship between algebraic module specifications and program modules
- Testing against formal specifications: A theoretical view
- Construction and reuse of formal program developments
- A theory of program modifications
- Proving termination of logic programs by exploiting term properties
- Parametric order-sorted types in logic programming
- Exploiting non-determinism through laziness in guarded functional languages
- Non-standard interpretations of LOTOS specifications
- A new technique for strictness analysis
- Using higher order logic for modelling real-time protocols
- Combining interaction and automation in process algebra verification
- Refining interfaces of communicating systems
- Structuring specifications in-the-large and in-the-small: Higher-order functions, dependent types and inheritance in SPECTRAL
- Actor-oriented system specification with dynamic logic
- Towards a formally based component description language
- On addition schemes
- Efficient code motion and an adaption to strength reduction
- On narrowing strategies for partial non-strict functions
- From reduction machines to narrowing machines
- The evaluation transformer model of reduction and its correctness.