LEADER 06392nam 22007215 450 001 9910144902403321 005 20200702090839.0 010 $a3-540-69661-X 024 7 $a10.1007/BFb0000458 035 $a(CKB)1000000000234766 035 $a(SSID)ssj0000321128 035 $a(PQKBManifestationID)11256247 035 $a(PQKBTitleCode)TC0000321128 035 $a(PQKBWorkID)10263827 035 $a(PQKB)10249453 035 $a(DE-He213)978-3-540-69661-2 035 $a(PPN)155233211 035 $a(EXLCZ)991000000000234766 100 $a20121227d1997 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAlgebraic Methodology and Software Technology$b[electronic resource] $e6th International Conference, AMAST '97, Sydney, Australia, Dezember 13-17, 1997. Proceedings /$fedited by Michael Johnson 205 $a1st ed. 1997. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1997. 215 $a1 online resource (X, 602 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v1349 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-63888-1 327 $aSoftware configuration with information systems -- Head-tactics simplification -- Iteration 2-theories: Extended Abstract -- Model checking and fault tolerance -- Deadlock analysis for a fault-tolerant system -- From sequential to multi-threaded Java: An event-based operational semantics -- Permissive subsorted partial logic in CASL -- Specification of timing constraints within the circal process algebra -- On the specification and verification of performance properties for a timed process algebra -- Abstract interpretation of algebraic polynomial systems (Extended abstract) -- Modular refinement and model building -- A linear temporal logic approach to objects with transactions -- Software design, specification, and verification: Lessons learned from the Rether case study -- Refinement rules for real-time multi-tasking programs -- Rigorous object-oriented modeling: Integrating formal and informal notations -- Completeness in abstract interpretation: A domain perspective -- Floating point verification in HOL light: The exponential function -- Verification of distributed real-time and fault-tolerant protocols -- Invariants, bisimulations and the correctness of coalgebraic refinements -- On bisimulation, fault-monotonicity and provable fault-tolerance -- Span(Graph): A categorical algebra of transition systems -- Representing place/transition nets in Span(Graph) -- Invariants of parameterized binary tree networks as greatest fixpoints -- Modelling specification construction by successive approximations -- On partial validation of logic programs -- Preservation and reflection in specification -- Case studies in using a meta-method for formal method integration -- The update calculus -- Selective attribute elimination for categorical data specifications -- ATM switch design: Parametric high-level modeling and formal verification -- The hidden function question revisited -- Synchronization of logics with mixed rules: Completeness preservation -- Symbolic bisimulation for Full LOTOS -- Algebraic composition and refinement of proofs -- Ensuring streams flow -- Extending process languages with time -- Parametric analysis of computer systems -- CAMILA: Prototyping and refinement of constructive specifications -- PAMELA+PVS -- The circal system -- A refinement-type checker for standard ML -- Recording HOL proofs in a structured browsable format -- Analysing multi-agent system traces with IDaF -- DOVE: A tool for design oriented verification and evaluation -- The B method and the B toolkit -- An algebraic language processing environment -- The Cogito development system. 330 $aThis book constitutes the refereed proceedings of the 6th International Conference on Algebraic Methodology and Software Engineering, AMAST'97, held in Sydney, Australia, in December 1997. The volume presents 48 revised full papers selected from an unusually high number of submissions. One of the outstanding features of AMAST is its mix of serious mathematical development of formal methods in software engineering with practical concerns, tools, case studies, and industrial development. The volume addresses all current aspects of formal methods in software engineering and programming methodology, with a certain emphasis on algebraic and logical foundations. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v1349 606 $aSoftware engineering 606 $aComputers 606 $aComputer logic 606 $aSpecial purpose computers 606 $aMathematical logic 606 $aSoftware Engineering/Programming and Operating Systems$3https://scigraph.springernature.com/ontologies/product-market-codes/I14002 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aSoftware Engineering$3https://scigraph.springernature.com/ontologies/product-market-codes/I14029 606 $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X 606 $aSpecial Purpose and Application-Based Systems$3https://scigraph.springernature.com/ontologies/product-market-codes/I13030 606 $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048 615 0$aSoftware engineering. 615 0$aComputers. 615 0$aComputer logic. 615 0$aSpecial purpose computers. 615 0$aMathematical logic. 615 14$aSoftware Engineering/Programming and Operating Systems. 615 24$aTheory of Computation. 615 24$aSoftware Engineering. 615 24$aLogics and Meanings of Programs. 615 24$aSpecial Purpose and Application-Based Systems. 615 24$aMathematical Logic and Formal Languages. 676 $a005.1/01/512 702 $aJohnson$b Michael$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aInternational Conference on Algebraic Methodology and Software Technology$d(6th :$f1997 :$eSydney, Australia) 906 $aBOOK 912 $a9910144902403321 996 $aAlgebraic Methodology and Software Technology$9774301 997 $aUNINA