|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNISA996465488403316 |
|
|
Titolo |
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 / / Wolfgang Thomas, editor |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin : , : Springer-Verlag, , [1999] |
|
©1999 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 1999.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (X, 330 p.) |
|
|
|
|
|
|
Collana |
|
Lecture notes in computer science ; ; 1578 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Computer software |
System analysis |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Bibliographic Level Mode of Issuance: Monograph |
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references and index. |
|
|
|
|
|
|
Nota di contenuto |
|
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. |
|
|
|
|
|
|
|