Foundations of software science and computation structures : Second International Conference, FOSSACS 99, held as part of the joint European Conferences on Theory and Practice of Software, ETAPS 99, Amsterdam, The Netherlands,March 22 28, 1999 : proceedings
Αποθηκεύτηκε σε:
| Συλλογικό Έργο: | , |
|---|---|
| Άλλοι συγγραφείς: | |
| Μορφή: | Livre numérique |
| Γλώσσα: | Anglais |
| Έκδοση: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Σειρά: | Lecture notes in computer science
1578 |
| Θέματα: | |
| Διαθέσιμο Online: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Σημείωση: |
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 science and computation structures, Second International Conference, FOSSACS '99 held as part of the joint European Conferences on Theory and Practice of Software, ETAPS '99, Amsterdam, The Netherland, March 22-28 1999, proceedings, Wolfgang Thomas (ed.), 1999, Berlin, Springer, 1 vol. (X-321 p.), Lecture notes in computer science, 3-540-65719-3 • Foundations of Software Science and Computation Structures, Texte imprimé, 9783662167014 |
Πίνακας περιεχομένων:
- Security Protocols and Specifications
- An Automata-Theoretic Approach to Interprocedural Data-Flow Analysis
- Reasoning about Concurrent Systems Using Types
- Testing Hennessy-Milner Logic with Recursion
- A Strong Logic Programming View for Static Embedded Implications
- Unfolding and Event Structure Semantics for Graph Grammars
- Expanding the Cube
- An Algebraic Characterization of Typability in ML with Subtyping
- Static Analysis of Processes for No Read-Up and No Write-Down
- A WP-calculus for OO
- The Recognizability Problem for Tree Automata with Comparisons between Brothers
- A Theory of May Testing for Asynchronous Languages
- A Nondeterministic Polynomial-Time Unification Algorithm for Bags, Sets and Trees
- Categorical Models of Explicit Substitutions
- Equational Properties of Mobile Ambients
- Model Checking Logics for Communicating Sequential Agents
- A Complete Coinductive Logical System for Bisimulation Equivalence on Circular Objects
- String Languages Generated by Total Deterministic Macro Tree Transducers
- Matching Specifications for Message Sequence Charts
- Probabilistic Temporal Logics via the Modal Mu-Calculus
- A ?-calculus Process Semantics of Concurrent Idealised ALGOL.