000 03611nam a22005175i 4500
001 978-3-540-44880-8
003 DE-He213
005 20160624101954.0
007 cr nn 008mamaa
008 121227s2003 gw | s |||| 0|eng d
020 _a9783540448808
_9978-3-540-44880-8
024 7 _a10.1007/3-540-44880-2
_2doi
050 4 _aQA76.758
072 7 _aUMZ
_2bicssc
072 7 _aCOM051230
_2bisacsh
082 0 4 _a005.1
_223
245 1 0 _aZB 2003: Formal Specification and Development in Z and B
_h[electronic resource] :
_bThird International Conference of B and Z Users Turku, Finland, June 4–6, 2003 Proceedings /
_cedited by Didier Bert, Jonathan P. Bowen, Steve King, Marina Waldén.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2003.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2003.
300 _aXIV, 554 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,
_x0302-9743 ;
_v2651
505 0 _aAlloy: A Logical Modelling Language -- An Outline Pattern Language for Z: Five Illustrations and Two Tables -- Patterns to Guide Practical Refactoring: Examples Targetting Promotion in Z -- Reuse of Specification Patterns with the B Method -- Composing Specifications Using Communication -- When Concurrent Control Meets Functional Requirements, or Z + Petri-Nets -- How to Diagnose a Modern Car with a Formal B Model? -- Parallel Hardware Design in B -- Operation Refinement and Monotonicity in the Schema Calculus -- Using Coupled Simulations in Non-atomic Refinement -- An Analysis of Forward Simulation Data Refinement -- B#: Toward a Synthesis between Z and B -- Introducing Backward Refinement into B -- Expression Transformers in B-GSL -- Probabilistic Termination in B -- Probabilistic Invariants for Probabilistic Machines -- Proving Temporal Properties of Z Specifications Using Abstraction -- Compositional Verification for Object-Z -- Timed CSP and Object-Z -- Object Orientation without Extending Z -- Comparison of Formalisation Approaches of UML Class Constructs in Z and Object-Z -- Towards Practical Proofs of Class Correctness -- Automatically Generating Information from a Z Specification to Support the Classification Tree Method -- Refinement Preserves PLTL Properties -- Proving Event Ordering Properties for Information Systems -- ZML: XML Support for Standard Z -- Formal Derivation of Spanning Trees Algorithms -- Using B Refinement to Analyse Compensating Business Processes -- A Formal Specification in B of a Medical Decision Support System -- Extending B with Control Flow Breaks -- Towards Dynamic Population Management of Abstract Machines in the B Method.
650 0 _aComputer science.
650 0 _aSoftware engineering.
650 0 _aLogic design.
650 1 4 _aComputer Science.
650 2 4 _aSoftware Engineering.
650 2 4 _aLogics and Meanings of Programs.
650 2 4 _aMathematical Logic and Formal Languages.
700 1 _aBert, Didier.
_eeditor.
700 1 _aBowen, Jonathan P.
_eeditor.
700 1 _aKing, Steve.
_eeditor.
700 1 _aWaldén, Marina.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540402534
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v2651
856 4 0 _uhttp://dx.doi.org/10.1007/3-540-44880-2
942 _2EBK5061
_cEBK
999 _c34355
_d34355