DOCSLIB.ORG

Analysis of Three Formal Methods-Z, B and VDM

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Analysis of Three Formal Methods-Z, B and VDM International Journal of Engineering Research & Technology (IJERT) ISSN: 2278-0181 Vol. 1 Issue 4, June - 2012 Analysis of Three Formal Methods-Z, B and VDM Dr.(Mrs.) Arvinder Kaur Ms.Samridhi Gulati Ms. Sarita Singh Associate Professor, M.Tech. Student M.Tech. Student University School of University School of University School of Information & Communication Information & Communication Information & Communication Technology, Technology, Technology, Guru Gobind Singh Guru Gobind Singh Guru Gobind Singh Indraprastha University, Indraprastha University, Indraprastha University, Dwarka, Sector-16C, Dwarka, Sector-16C, Dwarka, Sector-16C, Delhi, India Delhi, India Delhi, India Abstract Formal methods provide a much needed solid software engineering foundation for the ‘art’ of programming 2. Formal Specification Languages computers. Formal specifications can be used to This section describes an overview of formal provide an unambiguous and consistent supplement to specification languages. natural language descriptions and can be rigorously validated and verified leading to the early detection of The representation used in formal methods is called specification errors. Most of the software is delivered a formal specification language. The language is with some bugs, with lack of complete functionality and “formal” in the sense that it has a formal semantics and sometimes with cost overrun. Formal methods can be a as a result can be used to express specifications in a silver bullet for software industry for solving these clear and unambiguous manner. A formal specification problems. This paper compares and contrasts the language can be used to specify the task at hand in a strengths and weaknesses of the model oriented formal clear and concise manner. As formal methods and specification languages such as Z, B and Vienna formal specification language has sound mathematical Development Method (VDM) basis of various factors. basis, it provides the means of proving that specification is realizable, complete, consistent and unambiguous. Even the most complex systems can be 1. Introduction modeled using relatively simple mathematical objects, Formal methods are mathematically based such as sets, relations and functions [1]. techniques that can be applied throughout the A formal specification language is usually development of a system to precisely describe a system composed of three primary components or in and involve the use of refinement techniques and proof mathematical term we can say that it consists of two obligation at each stage to ensure the correctness, sets syntax and semantics and a set of relation. [1] completeness and consistency of specification. The formal specification languages are based on set theory The specific notation with which specification is and first order predicate calculus, but this mathematical represented is defined by syntactic domain or syntax. background was initially not fully formalized.[1] Formal techniques can have considerably different In this paper we describe formal specification semantic domain. Semantics helps to define a “universe language and different formal specification styles in of objects” that will be used to describe the system. Set Section 2. In Section 3, Z, B and VDM are compared of relations defines the rules that indicate which objects on the basis of factors such as characteristics, properly satisfy the specification. Formal specification concurrency, object oriented concept, tool support, and languages use mathematics as their basis. Most code conversion. Conclusions are presented in Section complex systems can be modelled using simple 4. mathematical objects, such as sets, relations and www.ijert.org 1 International Journal of Engineering Research & Technology (IJERT) ISSN: 2278-0181 Vol. 1 Issue 4, June - 2012 functions. A mathematical statement is unambiguous the Programming Research Group at Oxford University and precise, which provides a way to give convincing [8], whereas the B formal method is the method of arguments to justify ones solutions, and allows proving software development based on B, a tool-supported that an implementation satisfies the mathematical formal method based around an abstract machine specification [1]. notation, used in the development of computer software and was originally developed by Jean-Raymond Abrial in France and the UK [9]. One of the longest- Types of Formal Specification Styles established Formal Methods for the development of computer-based systems is termed as Vienna 2.1 Model Based Languages Development Method (VDM).It was originated at IBM's Vienna Laboratory [10] in the 1970s.The Z, B There are a number of different ways to write a and VDM are model based languages, which usually precise specification. One approach is model based model a system by representing its state as a collection languages. In it the specification is expressed as a of state variables, their values and some operations that system state model. This state model is constructed can change its state. All are based on set theory and using well understood mathematical entities such as mathematical logic. VDM was used in programming sets, relations, sequences and functions. Operations of a language description and compiler design. The main system are specified by defining how they affect the goal was to develop the language's fundamental state of the system model. Operations are also features and to establish some formal semantics. Z described by the predicates given in terms of pre and notation is a strongly typed [11] mathematical, post conditions [2]. specification language. It is not an executable notation; The most widely used notations for developing it cannot be interpreted or compiled into a running model based languages are Vienna Development program. Compared to Z, B is slightly more low level Method (VDM) [4], Zed (Z) [3] and B [5]. and more focused on refinement to code rather than just 2.2 Algebraic Specification formal specification hence it is easier to correctly implement a specification written in B than one in Z. System behaviour is formally specified using a software engineering technique called, algebraic specification. These languages uses methods derived 3.1 Characteristics from abstract algebra or category theory to specify The following table distinguishes Z, B and VDM information systems. For the definition of abstract data based on different characteristics [12], [13], [14] types interface, algebraic approach was originally designed. Type operation is specified in order to define Comparison Z B VDM the type rather than the type representation. Ex Factor LARCH, ASL, OBJ [6]. Formal Model - Model - Model - Method Style Oriented Oriented Oriented 2.3Process Oriented Mathematical Set Theory Set Theory Set Concurrent systems are described using process Basis First order First order Theory oriented formal specification language. A specific predicate predicate First implicit model for concurrency is the basis for these Calculus Calculus order languages. In these languages processes are denoted predicate and built up by expressions and elementary Calculus expressions, respectively, which describe particularly Appearance Key Word Boxes or Keyword simple processes by operations which combine Difference oriented Schemas oriented processes to yield new potentially more complex (eg, PRE, (e.g. pre- processes. Ex Communicating Sequential Processes THEN , , post-, (CSP) [7]. END, invariant INVARIA s) NT) 3. Comparison between Z, B and VDM Structuring Abstract Schema None Z notation is a formal specification language that Machine Calculus works at a high level of abstraction so that even Notation which complex behavior can be described precisely and allows concisely and it was originally proposed by Jean- various Raymond Abrial in 1977 and was developed further at schemas to www.ijert.org 2 International Journal of Engineering Research & Technology (IJERT) ISSN: 2278-0181 Vol. 1 Issue 4, June - 2012 be programming is an approach for developing software combined system based on the concepts of classes and objects. to form [15], [16] new schemas Specification None Before: • Before: of State undecorate hooked Z B VDM Changes d variables variables After: Support object No Support object primed •After: oriented concepts support for oriented concepts variables unhooke such as object such as d polymorphism, oriented polymorphism, variables inheritance and concept inheritance and Identification Input and Inputs: No of Inputs and output variable explicit encapsulation encapsulation Outputs parameters names way of are given ending in specifyin Using Object Using by an “?” g Z. VDM++. operation • Outputs: header: variable Output<-- names Table 3. Comparison on the basis of Object Oriented Operation_ ending in Concept Name(Inpu “!” ts) 3.4 Tool Support Table 1. Comparison on the basis of Characteristics There are variety of robust commercially available tools that provide support for writing specification, proof obligation, refinement, syntax checking, type checking, editing, creating, proving theorems and many others. The table given below describes different types 3.2 Concurrency Concurrency is a property used in distributed system of tools and their features supported by Z, B and VDM. that enables software systems to be served in large- [17], [18], [19], [20], [21]. scale distributed systems. This property allows several computations to execute simultaneously, and Z B VDM potentially interact with each other. Z Word AtlierB SpecBox Z B VDM Z/Eves ProB Overture
Load more

Recommended publications
  • Formal Specification Methods What Are Formal Methods? Objectives Of
    ICS 221 Winter 2001 Formal Specification Methods What Are Formal Methods? ! Use of formal notations … Formal Specification Methods ! first-order logic, state machines, etc. ! … in software system descriptions … ! system models, constraints, specifications, designs, etc. David S. Rosenblum ! … for a broad range of effects … ICS 221 ! correctness, reliability, safety, security, etc. Winter 2001 ! … and varying levels of use ! guidance, documentation, rigor, mechanisms Formal method = specification language + formal reasoning Objectives of Formal Methods Why Use Formal Methods? ! Verification ! Formal methods have the potential to ! “Are we building the system right?” improve both software quality and development productivity ! Formal consistency between specificand (the thing being specified) and specification ! Circumvent problems in traditional practices ! Promote insight and understanding ! Validation ! Enhance early error detection ! “Are we building the right system?” ! Develop safe, reliable, secure software-intensive ! Testing for satisfaction of ultimate customer intent systems ! Documentation ! Facilitate verifiability of implementation ! Enable powerful analyses ! Communication among stakeholders ! simulation, animation, proof, execution, transformation ! Gain competitive advantage Why Choose Not to Use Desirable Properties of Formal Formal Methods? Specifications ! Emerging technology with unclear payoff ! Unambiguous ! Lack of experience and evidence of success ! Exactly one specificand (set) satisfies it ! Lack of automated
    [Show full text]
  • Certification of a Tool Chain for Deductive Program Verification Paolo Herms
    Certification of a Tool Chain for Deductive Program Verification Paolo Herms To cite this version: Paolo Herms. Certification of a Tool Chain for Deductive Program Verification. Other [cs.OH]. Université Paris Sud - Paris XI, 2013. English. NNT : 2013PA112006. tel-00789543 HAL Id: tel-00789543 https://tel.archives-ouvertes.fr/tel-00789543 Submitted on 18 Feb 2013 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. UNIVERSITÉ DE PARIS-SUD École doctorale d’Informatique THÈSE présentée pour obtenir le Grade de Docteur en Sciences de l’Université Paris-Sud Discipline : Informatique PAR Paolo HERMS −! − SUJET : Certification of a Tool Chain for Deductive Program Verification soutenue le 14 janvier 2013 devant la commission d’examen MM. Roberto Di Cosmo Président du Jury Xavier Leroy Rapporteur Gilles Barthe Rapporteur Emmanuel Ledinot Examinateur Burkhart Wolff Examinateur Claude Marché Directeur de Thèse Benjamin Monate Co-directeur de Thèse Jean-François Monin Invité Résumé Cette thèse s’inscrit dans le domaine de la vérification du logiciel. Le but de la vérification du logiciel est d’assurer qu’une implémentation, un programme, répond aux exigences, satis- fait sa spécification. Cela est particulièrement important pour le logiciel critique, tel que des systèmes de contrôle d’avions, trains ou centrales électriques, où un mauvais fonctionnement pendant l’opération aurait des conséquences catastrophiques.
    [Show full text]
  • Implementing a Transformation from BPMN to CSP+T with ATL: Lessons Learnt
    Implementing a Transformation from BPMN to CSP+T with ATL: Lessons Learnt Aleksander González1, Luis E. Mendoza1, Manuel I. Capel2 and María A. Pérez1 1 Processes and Systems Department, Simón Bolivar University PO Box 89000, Caracas, 1080-A, Venezuela 2 Software Engineering Department, University of Granada Aynadamar Campus, 18071, Granada, Spain Abstract. Among the challenges to face in order to promote the use of tech- niques of formal verification in organizational environments, there is the possi- bility of offering the integration of features provided by a Model Transforma- tion Language (MTL) as part of a tool very used by business analysts, and from which formal specifications of a model can be generated. This article presents the use of MTL ATLAS Transformation Language (ATL) as a transformation artefact within the domains of Business Process Modelling Notation (BPMN) and Communicating Sequential Processes + Time (CSP+T). It discusses the main difficulties encountered and the lessons learnt when building BTRANSFORMER; a tool developed for the Eclipse platform, which allows us to generate a formal specification in the CSP+T notation from a business process model designed with BPMN. This learning is valid for those who are interested in formalizing a Business Process Modelling Language (BPML) by means of a process calculus or another formal notation. 1 Introduction Business Processes (BP) must be properly and formally specified in order to be able to verify properties, such as scope, structure, performance, capacity, structural consis- tency and concurrency, i.e., those properties of BP which can provide support to the critical success factors of any organization. Formal specification languages and proc- ess algebras, which allow for the exhaustive verification of BP behaviour [17], are used to carry out the formalization of models obtained from Business Process Model- ling (BPM).
    [Show full text]
  • Behavioral Verification of Distributed Concurrent Systems with BOBJ
    Behavioral Verification of Distributed Concurrent Systems with BOBJ Joseph Goguen Kai Lin Dept. Computer Science & Engineering San Diego Supercomputer Center University of California at San Diego [email protected] [email protected] Abstract grams [4]), whereas design level verification is easier and more likely to uncover subtle bugs, because it does not re- Following condensed introductions to classical and behav- quire dealing with the arbitrary complexities of program- ioral algebraic specification, this paper discusses the veri- ming language semantics. fication of behavioral properties using BOBJ, especially its These points are illustrated by our proof of the alternat- implementation of conditional circular coinductive rewrit- ing bit protocol in Section 4. There are actually many dif- ing with case analysis. This formal method is then applied ferent ways to specify the alternating bit protocol, some of to proving correctness of the alternating bit protocol, in one which are rather trivial to verify, but our specification with of its less trivial versions. We have tried to minimize mathe- fair lossy channels is not one of them. The proof shows that matics in the exposition, in part by giving concrete illustra- this specification is a behavioral refinement of another be- tions using the BOBJ system. havioral specification having perfect channels, and that the latter is behaviorally equivalent to perfect transmission (we thank Prof. Dorel Lucanu for this interpretation). 1. Introduction Many important contemporary computer systems are distributed and concurrent, and are designed within the ob- Faced with increasingly complex software and hardware ject paradigm. It is a difficult challenge for formal meth- systems, including distributed concurrent systems, where ods to handle all the features involved within a uniform the interactions among components can be very subtle, de- framework.
    [Show full text]
  • 1 an Introduction to Formal Modeling in Requirements Engineering
    University of Toronto Department of Computer Science University of Toronto Department of Computer Science Outline An Introduction to ‹ Why do we need Formal Methods in RE? you are here! Formal Modeling ‹ What do formal methods have to offer? ‹ A survey of existing techniques in Requirements Engineering ‹ Example modeling language: SCR ƒ The language ƒ Case study Prof Steve Easterbrook ƒ Advantages and disadvantages Dept of Computer Science, ‹ Example analysis technique: Model Checking University of Toronto, Canada ƒ How it works ƒ Case Study [email protected] ƒ Advantages and disadvantages http://www.cs.toronto.edu/~sme ‹ Where next? © 2001, Steve Easterbrook 1 © 2000-2002, Steve Easterbrook 2 University of Toronto Department of Computer Science University of Toronto Department of Computer Science What are Formal Methods? Example formal system: Propositional Logic ‹ First Order Propositional Logic provides: ‹ Broad View (Leveson) ƒ a set of primitives for building expressions: ƒ application of discrete mathematics to software engineering variables, numeric constants, brackets ƒ involves modeling and analysis ƒ a set of logical connectives: ƒ with an underlying mathematically-precise notation and (Ÿ), or (⁄), not (ÿ), implies (Æ), logical equality (≡) ƒ the quantifiers: ‹ Narrow View (Wing) " - “for all” $ - “there exists” ƒ Use of a formal language ƒ a set of deduction rules ÿ a set of strings over some well-defined alphabet, with rules for distinguishing which strings belong to the language ‹ ƒ Formal reasoning about formulae in the language Expressions in FOPL ÿ E.g. formal proofs: use axioms and proof rules to demonstrate that some formula ƒ expressions can be true or false is in the language (x>y Ÿ y>z) Æ x>z x+1 < x-1 x=y y=x ≡ "x ($y (y=x+z)) x,y,z ((x>y y>z)) x>z) ‹ For requirements modeling… " Ÿ Æ x>3 ⁄ x<-6 ƒ A notation is formal if: ‹ Open vs.
    [Show full text]
  • Seamless Interactive Program Verification
    Seamless Interactive Program Verification Sarah Grebing1, Jonas Klamroth2, and Mattias Ulbrich1 1 Karlsruhe Institute of Technology, Karlsruhe, Germany 2 FZI Research Center for Information Technology, Karlsruhe, Germany Abstract. Deductive program verification has made considerable progress in recent years. Automation is the goal, but it is apparent that there will always be challenges that cannot be verified fully automatically, but require some form of user input. We present a novel user interaction concept that allows the user to interact with the verification system on different abstraction levels and on different verification/proof artifacts. The elements of the concept are based on the findings of qualitative user studies we conducted amongst users of interactive deductive program verification systems. Moreover, the concept implements state-of-the-art user interaction principles. We prototypically implemented our concept as an interactive verification tool for Dafny programs. Deductive program verification tasks lead to challenging logical reasoning tasks. Recent and ongoing progress of satisfiability modulo theories (SMT) solvers allow these tasks to be more and more automated. As program verification is an undecidable problem, one can always find verification tasks which cannot be verified automatically – in practice, many real-world verification tasks require user guidance such that automatic reasoning engines can find a proof. With rising success of automatic verification engines, programs that require inspection become more and more sophisticated. They are likely to operate on complex data structures or make use of advanced features like concurrency. This complexity contributes to the fact that guiding the verification tool is a non-trivial, iterative process which, in addition, requires knowledge about internals of the verification tool.
    [Show full text]
  • Scrum Goes Formal: Agile Methods for Safety-Critical Systems
    Scrum Goes Formal: Agile Methods for Safety-Critical Systems Sune Wolff Terma A/S Terma Defense and Security Hovmarken 4, 8520 Lystrup, Denmark Email: [email protected] Abstract—Formal methods have had a relative low penetra- Formal methods are perceived as being mystical and only tion in industry but have the potential for much wider use. The used by a selected few computer scientists or mathemati- use of agile methods has been highly limited in development cians, and that the learning curve is too steep to be useful by of safety-critical systems due to the lack of formal evaluation techniques and rigorous planning. A combination of formal more “ordinary” people for developing non-critical systems. methods and agile development processes can potentially widen In order to change these prejudices, and eventually ensuring the use of formal methods in industry as well as enabling the a broader industrial usage of formal methods, a wider use of agile methods in development of safety-critical systems. range of engineers must be “exposed” to formal methods This paper describes a way to add the use of formal methods to to discover the benefits first-hand. the agile development process Scrum. Experiences from using a variant of the strategy in an industrial case are summarised. In a highly competitive industry companies strive to deliver faster better and cheaper software solutions. A broad spectrum of agile methods, ranging from individual methods Keywords-Scrum; formal methods; combined method like eXtreme Programming and test driven development to management-oriented process frameworks like Scrum [3] I. INTRODUCTION have emerged as a means to achieve this.
    [Show full text]
  • Certified Reasoning on Real Numbers and Objects in Co-Inductive Type
    Universita` degli Studi di Udine Dipartimento di Matematica e Informatica Dottorato di Ricerca in Informatica Institut National Polytechnique de Lorraine Ecole´ Nationale Superieure´ des Mines, Nancy Laboratoire Lorraine de Recherche en Informatique et ses Applications Doctorat de Recherche en Informatique Ph.D. Thesis Certified Reasoning on Real Numbers and Objects in Co-inductive Type Theory Candidate: Supervisors: Alberto Ciaffaglione Furio Honsell Pietro Di Gianantonio Claude Kirchner Luigi Liquori °c 2003, Alberto Ciaffaglione Author’s e-mail: ciaff[email protected], Alberto.Ciaff[email protected] Author’s address: Dipartimento di Matematica e Informatica Universit`adegli Studi di Udine via delle Scienze, 206 33100 Udine (Italia) Abstract In this thesis we adopt Formal Methods based on Type Theory for reasoning on the semantics of computer programs. The ultimate goal is their certification, that is, to prove that a fragment of software meets its formal specification. Application areas of our research are the representation of and computation on the Real Numbers and the Object-oriented Languages based on Objects. In our investigation, Coinductive specification and proof principles play an essential role. In the first part of the thesis we deal with Constructive Real Numbers. We construct the reals using streams, i.e. infinite sequences, of signed digits. We work with constructive logic, that is, we develop “algorithmic” mathematics. We implement the Real Numbers in Coq using streams, which are managed using coinductive judgments and corecursive algorithms. Then we introduce a constructive axiomatization and we use it for proving the adequacy of our construction. In the second part of the thesis we approach Object-based Calculi with side-effects, in order to address important properties, such as Type Soundness, formally.
    [Show full text]
  • Formal Specification and Verification Stephan Merz
    Formal specification and verification Stephan Merz To cite this version: Stephan Merz. Formal specification and verification. Dahlia Malkhi. Concurrency: the Works of Leslie Lamport, 29, Association for Computing Machinery, pp.103-129, 2019, ACM Books, 10.1145/3335772.3335780. hal-02387780 HAL Id: hal-02387780 https://hal.inria.fr/hal-02387780 Submitted on 2 Dec 2019 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Formal specification and verification Stephan Merz University of Lorraine, CNRS, Inria, LORIA, Nancy, France 1. Introduction Beyond his seminal contributions to the theory and the design of concurrent and distributed algorithms, Leslie Lamport has throughout his career worked on methods and formalisms for rigorously establishing the correctness of algorithms. Commenting on his first article about a method for proving the correctness of multi-process programs [32] on the website providing access to his collected writings [47], Lamport recalls that this interest originated in his submitting a flawed mutual-exclusion algorithm in the early 1970s. As a trained mathematician, Lamport is perfectly familiar with mathematical set theory, the standard formal foundation of classical mathematics. His career in industrial research environments and the fact that his main interest has been in algorithms, not formalisms, has certainly contributed to his designing reasoning methods that combine pragmatism and mathematical elegance.
    [Show full text]
  • Formal Software Engineering the B Method for Correct-By-Construction Software
    Formal Software Engineering The B Method for correct-by-construction software J. Christian Attiogbé November 2012 J. Christian Attiogbé (November 2012) Formal Software Engineering 1 / 135 Agenda The B Method: an introduction Introduction: what it is? A quick overview Example of specification Light Control in a Room How to develop using B System Analysis Structuration: Abstract Machines Modeling Data Modeling Data Operations Refinements Implementation J. Christian Attiogbé (November 2012) Formal Software Engineering 2 / 135 Agenda Examples of development Exemples GCD (PGCD), euclidian division, Sorting Basic concepts of the method Modeling the static part (data) Modeling the dynamic part(operations) Proof of consistency Refinement Proofs of refinement Case studies (with AtelierB, Rodin) J. Christian Attiogbé (November 2012) Formal Software Engineering 3 / 135 Introduction to B B Method (..1996) A Method to specify, design and build sequential software. (1998..) Event B ... distributed, concurrent systems. (...) still evolving, with more sophisticated tools (aka Rodin) ;-( J. Christian Attiogbé (November 2012) Formal Software Engineering 4 / 135 Introduction to B Examples of application in railways systems Figure: Synchronisation of platform screen doors - Paris Metro J. Christian Attiogbé (November 2012) Formal Software Engineering 5 / 135 Introduction to B Industrial Applications Applications in Transportation Systems (Alsthom>Siemens) braking systems, platform screen doors(line 13, Paris metro), KVS, Calcutta Metro (India), Cairo INSEE (french
    [Show full text]
  • Overview of Formal Methods in Software Engineering
    Overview of formal methods in software engineering IOANA RODHE, MARTIN KARRESAND FOI, Swedish Defence Research Agency, is a mainly assignment-funded agency under the Ministry of Defence. The core activities are research, method and technology development, as well as studies conducted in the interests of Swedish defence and the safety and security of society. The organisation employs approximately 1000 personnel of whom about 800 are scientists. This makes FOI Sweden’s largest research institute. FOI gives its customers access to leading-edge expertise in a large number of fi elds such as security policy studies, defence and security related analyses, the assessment of various types of threat, systems for control and management of crises, protection against and management of hazardous substances, IT security and the potential offered by new sensors. FOI Swedish Defence Research Agency Phone: +46 8 555 030 00 www.foi.se FOI-R--4156--SE SE-164 90 Stockholm Fax: +46 8 555 031 00 ISSN 1650-1942 December 2015 Ioana Rodhe, Martin Karresand Overview of formal methods in software engineering Bild/cover: Martin Karresand FOI-R--4156--SE Titel Översikt över formella metoder i programvaruutveckling Title Overview of formal methods in software engineering Report no FOI-R--4156--SE Month December Year 2015 Pages 50 ISSN ISSN-1650-1942 Customer The Swedish Armed Forces Project no E36077 Approved by Christian Jönsson Division Information- and Aeronautical Systems FOI Research area Armed Forces R&T area Command and control FOI Swedish Defence Research Agency This work is protected under the Act on Copyright in Literary and Artistic Works (SFS 1960:729).
    [Show full text]
  • Mechanized Support for the Formal Specification, Verification and Deployment of Component-Based Applications Nuno Gaspar
    Mechanized support for the formal specification, verification and deployment of component-based applications Nuno Gaspar To cite this version: Nuno Gaspar. Mechanized support for the formal specification, verification and deployment of component-based applications. Other [cs.OH]. Université Nice Sophia Antipolis, 2014. English. NNT : 2014NICE4127. tel-01114217v1 HAL Id: tel-01114217 https://hal.inria.fr/tel-01114217v1 Submitted on 8 Feb 2015 (v1), last revised 10 Apr 2015 (v2) HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. UNIVERSITÉ DE NICE-SOPHIA ANTIPOLIS École Doctorale STIC Sciences et Technologies de l’Information et de la Communication THÈSE pour l’obtention du titre de Docteur en Sciences Mention Informatique présentée et soutenue par Nuno Gaspar Mechanized support for the formal specification, verification and deployment of component-based applications Thèse dirigée par Eric Madelaine et co-encadrée par Ludovic Henrio Soutenue le 16 Décembre 2014 Jury Rapporteurs Frédéric Loulergue LIFO, Université d’Orléans Alan Schmitt INRIA Bretagne Atlantique Examinateurs Luis Barbosa Universidade do Minho Yves Bertot INRIA Sophia Antipolis Directeur de thèse Eric Madelaine INRIA Sophia Antipolis Co-encadrant de thèse Ludovic Henrio CNRS ii iii E assim foi.
    [Show full text]