LEADER 05797nam 22008055 450 001 9910484039803321 005 20251226195909.0 010 $a1-280-38968-0 010 $a9786613567604 010 $a3-642-16265-7 024 7 $a10.1007/978-3-642-16265-7 035 $a(CKB)2650000000000172 035 $a(SSID)ssj0000446556 035 $a(PQKBManifestationID)11291906 035 $a(PQKBTitleCode)TC0000446556 035 $a(PQKBWorkID)10496172 035 $a(PQKB)10368649 035 $a(DE-He213)978-3-642-16265-7 035 $a(MiAaPQ)EBC3065920 035 $a(PPN)149029845 035 $a(BIP)32335813 035 $a(EXLCZ)992650000000000172 100 $a20101001d2010 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aIntegrated Formal Methods $e8th International Conference, IFM 2010, Nancy, France, October 11-14, 2010, Proceedings /$fedited by Dominique Méry, Stephan Merz 205 $a1st ed. 2010. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2010. 215 $a1 online resource (X, 337 p. 110 illus.) 225 1 $aProgramming and Software Engineering,$x2945-9168 ;$v6396 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-642-16264-9 320 $aIncludes bibliographical references and index. 327 $aOn Model Checking Techniques for Randomized Distributed Systems -- Collaborative Modelling and Co-simulation in the Development of Dependable Embedded Systems -- Programming with Miracles -- An Event-B Approach to Data Sharing Agreements -- A Logical Framework to Deal with Variability -- Adding Change Impact Analysis to the Formal Verification of C Programs -- Creating Sequential Programs from Event-B Models -- Symbolic Model-Checking of Optimistic Replication Algorithms -- From Operating-System Correctness to Pervasively Verified Applications -- A Compositional Method for Deciding Equivalence and Termination of Nondeterministic Programs -- Verification Architectures: Compositional Reasoning for Real-Time Systems -- Automatic Verification of Parametric Specifications with Complex Topologies -- Satisfaction Meets Expectations -- Showing Full Semantics Preservation in Model Transformation - A Comparison of Techniques -- Specification and Verification of Model Transformations Using UML-RSDS -- Multiformalism and Transformation Inheritance for Dependability Analysis of Critical Systems -- Translating Pi-Calculus into LOTOS NT -- Systematic Translation Rules from astd to Event-B -- A CSP Approach to Control in Event-B -- Towards Probabilistic Modelling in Event-B -- Safe Commits for Transactional Featherweight Java -- Certified Absence of Dangling Pointers in a Language with Explicit Deallocation -- Integrating Implicit Induction Proofs into Certified Proof Environments. 330 $aThisvolumecontainstheproceedingsofIFM2010,the8thInternationalConf- ence on Integrated Formal Methods. The conference took place October 12-14, 2010,atthe INRIA researchcenterandthe LORIAlaboratoryinNancy,France. Previous editions were held in York, Dagstuhl, Turku, Canterbury, Eindhoven, Oxford, and Dusseldorf ¨ . The IFM conference series seeks to promote research into the combination of di'erent formal methods, including the combination of formal with semiformal methods, for system development. Such combinations are useful in order to apprehend di'erent aspects of systems, including fu- tional correctness, security, performance, and fault-tolerance. The conference provides a forum for discussing recent advances in the state of the art and for disseminating the results among the academic and industrial community. IFM2010received59submissions,coveringthespectrumofintegratedformal methods and ranging from formal and semiformal notations, semantics, re?- ment, veri'cation, and model transformations to type systems, logics, tools, and case studies. Each submission was reviewed by at least three members of the Program Committee. The committee decided to accept 20 papers. The conf- ence programalso included invited talks by Christel Baier, John Fitzgerald, and Rajeev Joshi. The conference was preceded by a day dedicated to the Wo- shop on Formal Methods for Web Data Trust and Security (WTS 2010)and two tutorials, one on the veri'cation of C# programs using Spec# and Boogie 2, + by Rosemary Monahan, and the other on the TLA proof system, by Denis Cousineau and Stephan Merz. 410 0$aProgramming and Software Engineering,$x2945-9168 ;$v6396 606 $aSoftware engineering 606 $aComputer science 606 $aCompilers (Computer programs) 606 $aMachine theory 606 $aComputer programming 606 $aSoftware Engineering 606 $aComputer Science Logic and Foundations of Programming 606 $aCompilers and Interpreters 606 $aFormal Languages and Automata Theory 606 $aProgramming Techniques 615 0$aSoftware engineering. 615 0$aComputer science. 615 0$aCompilers (Computer programs). 615 0$aMachine theory. 615 0$aComputer programming. 615 14$aSoftware Engineering. 615 24$aComputer Science Logic and Foundations of Programming. 615 24$aCompilers and Interpreters. 615 24$aFormal Languages and Automata Theory. 615 24$aProgramming Techniques. 676 $a005.1 701 $aMery$b Dominique$01358349 701 $aMerz$b Stephan$0503992 712 12$aInternational Conference on Integrated Formal Methods. 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910484039803321 996 $aIntegrated formal methods$94204142 997 $aUNINA