000 03940nam a22005895i 4500
001 978-3-540-44616-3
003 DE-He213
005 20240423132503.0
007 cr nn 008mamaa
008 121227s2000 gw | s |||| 0|eng d
020 _a9783540446163
_9978-3-540-44616-3
024 7 _a10.1007/b75154
_2doi
050 4 _aQA76.758
072 7 _aUMZ
_2bicssc
072 7 _aCOM051230
_2bisacsh
072 7 _aUMZ
_2thema
082 0 4 _a005.1
_223
245 1 0 _aRecent Trends in Algebraic Development Techniques
_h[electronic resource] :
_b14th International Workshop, WADT '99, Chateau de Bonas, September 15-18, 1999 Selected Papers /
_cedited by Didier Bert, Christine Choppy, Peter Mosses.
250 _a1st ed. 2000.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2000.
300 _aX, 490 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v1827
505 0 _aInvited 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.
650 0 _aSoftware engineering.
650 0 _aCompilers (Computer programs).
650 0 _aComputer programming.
650 0 _aComputer science.
650 1 4 _aSoftware Engineering.
650 2 4 _aCompilers and Interpreters.
650 2 4 _aProgramming Techniques.
650 2 4 _aComputer Science Logic and Foundations of Programming.
700 1 _aBert, Didier.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aChoppy, Christine.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aMosses, Peter.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540678984
776 0 8 _iPrinted edition:
_z9783662163283
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v1827
856 4 0 _uhttps://doi.org/10.1007/b75154
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c188291
_d188291