Formal Methods and Software Engineering : 17th International Conference on Formal Engineering Methods, ICFEM 2015, Paris, France, November 3-5, 2015, Proceedings / edited by Michael Butler, Sylvain Conchon, Fatiha Zaïdi
Edition
1st ed. 2015
Published
Cham : Springer International Publishing : Imprint : Springer, 2015
Intro; Preface; Organization; Invited Talks; Can Java Ever Be Safe? The hiJaC Project Abstract; Specification and Analysis of SoC Flows (Abstract); Algorithmic Analysis for Asynchronous Programs; Contents; Domain-Specific Languages with Scala; 1 Introduction; 2 External DSLs; 2.1 The Parser Library Approach; 2.2 The Parser Tool Approach; 3 Internal DSLs; 3.1 Annotations; 3.2 Shallow Embedding; 3.3 Deep Embedding; 4 Discussion; 5 Conclusions; References; Formal Verification of Programs Computing the Floating-Point Average; 1 Introduction; 2 Basics About Floating-Point Arithmetic
3 Methodology and Desired Specification3.1 Methodology; 3.2 Desired Specification; 4 Formal Proof of the Algorithms; 4.1 The average1 Function; 4.2 The average3 Function; 4.3 The average2 Function; 4.4 Putting All Parts Together: The Average Functions; 5 Specifications and Formal Verification of the Programs; 5.1 Absolute Value; 5.2 Accurate Average; 5.3 Correct Average; 6 Conclusion and Perspectives; References; Formalization and Verification of Declarative Cloud Orchestration; 1 Introduction; 2 TOSCA: Topology and Orchestration Specification for Cloud Application
3 Model of Automation of Topologies4 CafeOBJ Specification of Model; 5 Verification of Setup Operation; 5.1 Proof Score for Condition (1); 5.2 Cyclic Dependency; 5.3 Proof Score for Condition (2); 5.4 Proof Scores for Condition (3), (4), (5) and (6); 6 Related Work and Conclusion; References; Consistency Verification of Specification Rules; 1 Introduction; 2 Background; 2.1 Constraints Satisfiability; 2.2 Rules Consistency; 3 Relationship Between MISes and MUSes; 4 An Efficient Algorithm for Enumerating MUSes; 4.1 The MARCO algorithm; 4.2 The MUSesHunter Algorithm
4.3 Comparing MARCO and MUSesHunter5 Empirical Analysis; 5.1 MUSesHunter vs. MARCO; 5.2 MISes Finder; 6 Conclusion; References; Applying Automata Learning to Embedded Control Software; 1 Introduction; 2 Engine Status Manager; 2.1 ESRA; 2.2 ESM and Connected Components; 2.3 Rational Rose RealTime; 2.4 The ESM State Diagram; 3 Learning the ESM; 3.1 Experimental Set-Up; 3.2 Test Selection Strategies; 3.3 Results; 4 Verification; 4.1 Approach; 4.2 Model Transformations; 4.3 Results; 5 Conclusions and Future Work; References
A 3-Valued Contraction Model Checking Game: Deciding on the World of Partial Information1 Introduction; 2 Computation Tree Logic and Kripke Structures; 2.1 Kripke Modal Transition System; 2.2 KMTS as a Set of Kripke Structures; 3 Semantics of CTL with Respect to KMTS; 4 KMTS Operations; 4.1 Dealing with Sets of KMTSs; 4.2 Tree Partition Set; 5 The Contraction Model Checking; 6 Conclusions; References; Supporting Requirements Analysis Using Pattern-Based Formal Specification Construction; 1 Introduction; 2 Major Ideas of PBFSRA; 2.1 Principle of PBFSRA; 2.2 Procedure of Applying PBFSRA
Summary
This book constitutes the refereed proceedings of the 17th International Conference on Formal Engineering Methods, ICFEM 2015, held in Paris, France, in November 2015. The 27 revised full papers presented were carefully reviewed and selected from 82 submissions. The papers cover a wide range of topics in the area of formal methods and software engineering and are devoted to advancing the state of the art of applying formal methods in practice. They focus in particular on combinations of conceptual and methodological aspects with their formal foundation and tool support
