Algebraic methodology and software technology : 4th international conference, AMAST '95, Montreal, Canada, July 3-7, 1995 : proceedings
This volume constitutes the proceedings of the 4th International Conference on Algebraic Methodology and Software Technology, held in Montreal, Canada in July 1995. It includes full papers or extended abstracts of the invited talks, refereed selected contributions, and research prototype tools. The...
Bewaard in:
| Coauteur: | |
|---|---|
| Andere auteurs: | , |
| Formaat: | Livre numérique |
| Taal: | Anglais |
| Gepubliceerd in: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Reeks: | Lecture notes in computer science
936 |
| Onderwerpen: | |
| Online toegang: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Opmerking: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Algebraic methodology and software technology, 4th international conference, AMAST '95, Montreal, Canada, July 3-7, 1995, proceedings, V.S. Alagar, Maurice Nivat (eds.), Berlin, Springer, 1995, 1 vol. (XIV-591 p.), Lecture notes in computer science, 3-540-60043-4 • Algebraic Methodology and Software Technology, Texte imprimé, 9783662187876 |
Inhoudsopgave:
- Equational logic as a tool
- Teaching mathematics to software engineers
- The role of education and training in the industrial application of formal methods
- Information algebras
- Verification of logic programs with delay declarations
- An introduction to category-based equational logic
- Knowledge based computation
- Order-sorted algebraic specifications with higher-order functions
- Proving the correctness of behavioural implementations
- On the decidability of process equivalences for the ?-calculus
- Detecting isomorphisms of modular specifications with diagrams
- Higher-order narrowing with convergent systems
- Context-free event domains are recognizable
- Encoding natural semantics in Coq
- Mongruences and cofree coalgebras
- Semantic typing for parametric algebraic specifications
- Causality and true concurrency: A data-flow analysis of the Pi-Calculus
- Verification in continuous time by discrete reasoning
- Dynamic matrices and the cost analysis of concurrent programs
- Petri nets, traces, and local model checking
- An algebraic framework for developing and maintaining real-time systems
- Logical foundations for compositional verification and development of concurrent programs in UNITY
- CPO models for infinite term rewriting
- Completeness results for two-sorted metric temporal logics
- On mechanizing proofs within a complete proof system for Unity
- Automated reasoning about parallel algorithms using powerlists
- Representing, verifying and applying software development steps using the PVS system
- An algebraic development technique for information systems
- A framework for machine-assisted user interface verification
- Specification of the Unix file system: A comparative case study
- A Calculus of Countable Broadcasting Systems
- Symbolic timing devices.-An algebraic construction of the well-founded model
- Confluence in concurrent constraint programming
- A generic algebra for data collections based on constructive logic
- Partial order programming (Revisited)
- SPIKE: a system for automatic inductive proofs
- SEAMLESS: Knowledge based evolutionary system synthesis
- An object-oriented front-end for deductive databases
- The SuRE programming framework
- A declarative system for multi-database interoperability
- The METAGEN system.