| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNISA996465833503316 |
|
|
Titolo |
Recent Trends in Algebraic Development Techniques [[electronic resource] ] : 14th International Workshop, WADT '99, Chateau de Bonas, September 15-18, 1999 Selected Papers / / edited by Didier Bert, Christine Choppy, Peter Mosses |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 2000.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (X, 490 p.) |
|
|
|
|
|
|
Collana |
|
Lecture Notes in Computer Science, , 0302-9743 ; ; 1827 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Software engineering |
Programming languages (Electronic computers) |
Computer programming |
Computer logic |
Software Engineering/Programming and Operating Systems |
Programming Languages, Compilers, Interpreters |
Programming Techniques |
Software Engineering |
Logics and Meanings of Programs |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Bibliographic Level Mode of Issuance: Monograph |
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references. |
|
|
|
|
|
|
Nota di contenuto |
|
Invited Topics -- A Type-Theoretic Memory Model for Verification of Sequential Java Programs -- From States to Histories -- Principles and Pragmatics of Subtyping in PVS -- Casl: Language, Methodology and Tools -- Extending Casl by Late Binding -- Towards an Evolutionary Formal Software-Development Using CASL -- Development of Parsing Tools for CASL Using Generic Language Technology -- Using CASL to Specify the Requirements and the Design: A Problem Specific Approach -- Subsorted Partial Higher-Order Logic as an Extension of CASL -- Specifying Real Numbers in CASL -- Foundations -- Specification Refinement with System F – The Higher-Order Case -- Guarded Algebras: Disguising Partiality so You Won’t Know Whether Its There -- A General Completeness Result in Refinement -- An Institution of |
|
|
|
|
|
|
|
|
|
|
Hybrid Systems -- Realization of Probabilistic Automata: Categorical Approach -- Specifications in an Arbitrary Institution with Symbols -- A General Algebraic Framework for Studying Modular Systems -- Specification of Processes and Interactions -- History Preserving Bisimulation for Contextual Nets -- A Model for Interaction of Agents and Environments -- Algebra-Coalgebra Structures and Bialgebras -- A Uniform Model Theory for the Specification of Data and Process Types -- Other Topics -- Relating Abstract Datatypes and Z-Schemata -- Algebraic Specification of Operator-Based Multimedia Scenarios -- Higher-Order Logic and Theorem Proving for Structured Specifications -- Extraction of Structured Programs from Specification Proofs -- Towards a Verification Logic for Rewriting Logic -- The Rôle of Normalisation in Testing from Structured Algebraic Specifications. |
|
|
|
|
|
| |