Integrated Formal Methods Third International Conference, IFM 2002, Turku, Finland, May 15-18, 2002. Proceedings. /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Butler, Michael (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Petre, Luigia (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Sere, Kaisa (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2002.
• Έκδοση: 1st ed. 2002.
• Σειρά: Lecture Notes in Computer Science, 2335
• Θέματα: Programming languages (Electronic computers).; Computer logic.; Computers.; Software engineering.; Computer programming.; Programming Languages, Compilers, Interpreters.; Logics and Meanings of Programs.; Theory of Computation.; Software Engineering.; Programming Techniques.

 The third in a series of international conferences on Integrated Formal Methods, IFM 2002, was held in Turku, Finland, May 15-17, 2002. Turku, situated in the south western corner of the country, is the former capital of Finland. The ? conference was organized jointly by Abo Akademi University and Turku Centre for Computer Science. The theme of IFM 1999 was the integration of state and behavioral based formalisms. For IFM 2000 this was widened to include all aspects pertaining to the integration of formal methods and formal notations. One of the goals of IFM 2002 was to further investigate these themes. Moreover, IFM 2002 explored the relations between formal methods and graphical notations, especially the industrialstandardlanguageforsoftwaredesign,theUni?edModelingLanguage (UML). The themes of IFM 2002 re?ect what we believe is a growing trend in the Formal Methods and Software Engineering research communities. Over the last threedecades,computerscientistshavedevelopedarangeofformalismsfocusing on particular aspects of behavior or analysis, such as sequential program str- tures,concurrentprogramstructures,dataandinformationstructures,temporal reasoning, deductive proof, and model checking. Much e?ort is now being - voted to integrating these methods in order to combine their advantages and ensure they scale up to industrial needs. Graphical notations are now widely used in software engineering and there is growing recognition of the importance ofprovidingthesewiththeformalunderpinningsandformalanalysiscapabilities found in formal methods. 

 Invited Talk: Eran Gery -- Rhapsody: A Complete Life-Cycle Model-Based Development System -- Integration, Simulation, Animation -- An Integrated Semantics for UML Class, Object and State Diagrams Based on Graph Transformation -- Stochastic Process Algebras Meet Eden -- From Specifcation to Verifcation -- From Implicit Specifications to Explicit Designs in Reactive System Development -- Basic-REAL: Integrated Approach for Design, Specification and Verification of Distributed Systems -- Assume-Guarantee Algorithms for Automatic Detection of Software Failures -- Statecharts and B: Integration and Translation -- Contributions for Modelling UML State-Charts in B -- Translating Statecharts to B -- Invited Talk: Shmuel Katz -- A Framework for Translating Models and Specifications -- Model Checkers and Theorem Provers -- Model Checking Object-Z Using ASM -- Formalization of Cadence SPW Fixed-Point Arithmetic in HOL -- Formally Linking MDG and HOL Based on a Verified MDG System -- Links between Object-Z and CSP -- Refinement in Object-Z and CSP -- Combining Specification Techniques for Processes, Data and Time -- An Integration of Real-Time Object-Z and CSP for Specifying Concurrent Real-Time Systems -- Invited Talk: Stuart Kent -- Model Driven Engineering -- Combining Graphical and Formal Approaches -- The Design of a Tool-Supported Graphical Notation for Timed CSP -- Combining Graphical and Formal Development of Open Distributed Systems -- Translations between Textual Transition Systems and Petri Nets -- Refinement and Proof -- Specification and Proof of Liveness Properties under Fairness Assumptions in B Event Systems -- Minimally and Maximally Abstract Retrenchments.