FM'99 - Formal Methods
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
38Th Meeting Held in Ghent, Belgium Friday 19 November 2004
Formal Methods Europe Minutes of the 38th meeting Held in Ghent, Belgium Friday 19 November 2004 Present at the meeting were: • Raymond Boute • Neville Dean • Steve Dunne • John Fitzgerald (Chairman) • Valerie Harvey • Franz Lichtenberger • Dino Mandrioli • José Oliveira • Nico Plat (Secretary) • Kees Pronk (Treasurer) • Ken Robinson • Simão Melo de Sousa • Marcel Verhoef Apologies had been received from: Eerke Boiten, Jonathan Bowen, Ana Cavalcante, Tim Denvir, Alessandro Fantechi, Stefania Gnesi, Shmuel Katz, Steve King, Jan Tretmans, Teemu Tynjala, Jim Woodcock. 1 Welcome John Fitzgerald welcomed all those present at the meeting. He thanked Raymond Boute for his work organising the meeting. He briefly introduced FME and its aims for those normally not present at an FME meeting. 2 Agree upon agenda Item 5 (FME logo) was deleted. A report on ISOLA by Marcel Verhoef was added to the agenda. 3 Minutes of the meeting held in Newcastle upon Tyne on 6 September 2004 The minutes of the meeting were approved without modification. 4 Action list Action 34/7: Done, see item 10 of these minutes. Action closed. Action 37/1: Done. The paper is now available at www.fmeurope.org under the “Formal methods” -> “Education” section. Action closed. Action 37/2: Done but no response received as yet. Action closed. Action 37/3: Done, action closed. Jonathan Bowen had reported by e-mail that that there is no real progress and that he is very busy with other commitments at the moment. If a good EC call presents itself that would be motivational. Jonathan would prefer, however, that someone else would take a more leading role in reviving it, with Jonathan as a backup. -
Journal of Applied Logic
JOURNAL OF APPLIED LOGIC AUTHOR INFORMATION PACK TABLE OF CONTENTS XXX . • Description p.1 • Impact Factor p.1 • Abstracting and Indexing p.1 • Editorial Board p.1 • Guide for Authors p.5 ISSN: 1570-8683 DESCRIPTION . This journal welcomes papers in the areas of logic which can be applied in other disciplines as well as application papers in those disciplines, the unifying theme being logics arising from modelling the human agent. For a list of areas covered see the Editorial Board. The editors keep close contact with the various application areas, with The International Federation of Compuational Logic and with the book series Studies in Logic and Practical Reasoning. Benefits to authors We also provide many author benefits, such as free PDFs, a liberal copyright policy, special discounts on Elsevier publications and much more. Please click here for more information on our author services. Please see our Guide for Authors for information on article submission. This journal has an Open Archive. All published items, including research articles, have unrestricted access and will remain permanently free to read and download 48 months after publication. All papers in the Archive are subject to Elsevier's user license. If you require any further information or help, please visit our Support Center IMPACT FACTOR . 2016: 0.838 © Clarivate Analytics Journal Citation Reports 2017 ABSTRACTING AND INDEXING . Zentralblatt MATH Scopus EDITORIAL BOARD . Executive Editors Dov M. Gabbay, King's College London, London, UK Sarit Kraus, Bar-llan University, -
Fiendish Designs
Fiendish Designs A Software Engineering Odyssey © Tim Denvir 2011 1 Preface These are notes, incomplete but extensive, for a book which I hope will give a personal view of the first forty years or so of Software Engineering. Whether the book will ever see the light of day, I am not sure. These notes have come, I realise, to be a memoir of my working life in SE. I want to capture not only the evolution of the technical discipline which is software engineering, but also the climate of social practice in the industry, which has changed hugely over time. To what extent, if at all, others will find this interesting, I have very little idea. I mention other, real people by name here and there. If anyone prefers me not to refer to them, or wishes to offer corrections on any item, they can email me (see Contact on Home Page). Introduction Everybody today encounters computers. There are computers inside petrol pumps, in cash tills, behind the dashboard instruments in modern cars, and in libraries, doctors’ surgeries and beside the dentist’s chair. A large proportion of people have personal computers in their homes and may use them at work, without having to be specialists in computing. Most people have at least some idea that computers contain software, lists of instructions which drive the computer and enable it to perform different tasks. The term “software engineering” wasn’t coined until 1968, at a NATO-funded conference, but the activity that it stands for had been carried out for at least ten years before that. -
PDF (Dissertation.Pdf)
Kind Theory Thesis by Joseph R. Kiniry In Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy California Institute of Technology Pasadena, California 2002 (Defended 10 May 2002) ii © 2002 Joseph R. Kiniry All Rights Reserved iii Preface This thesis describes a theory for representing, manipulating, and reasoning about structured pieces of knowledge in open collaborative systems. The theory's design is motivated by both its general model as well as its target user commu- nity. Its model is structured information, with emphasis on classification, relative structure, equivalence, and interpretation. Its user community is meant to be non-mathematicians and non-computer scientists that might use the theory via computational tool support once inte- grated with modern design and development tools. This thesis discusses a new logic called kind theory that meets these challenges. The core of the work is based in logic, type theory, and universal algebras. The theory is shown to be efficiently implementable, and several parts of a full realization have already been constructed and are reviewed. Additionally, several software engineering concepts, tools, and technologies have been con- structed that take advantage of this theoretical framework. These constructs are discussed as well, from the perspectives of general software engineering and applied formal methods. iv Acknowledgements I am grateful to my initial primary adviser, Prof. K. Mani Chandy, for bringing me to Caltech and his willingness to let me explore many unfamiliar research fields of my own choosing. I am also appreciative of my second adviser, Prof. Jason Hickey, for his support, encouragement, feedback, and patience through the later years of my work. -
On a New Notion of Partial Refinement
On a New Notion of Partial Refinement Emil Sekerinski Tian Zhang McMaster University McMaster University Hamilton, Canada Hamilton, Canada [email protected] [email protected] Formal specification techniques allow expressing idealized specifications, which abstract from re- strictions that may arise in implementations. However, partial implementations are universal in soft- ware development due to practical limitations. Our goal is to contribute to a method of program refinement that allows for partial implementations. For programs with a normal and an exceptional exit, we propose a new notion of partial refinement which allows an implementation to terminate ex- ceptionally if the desired results cannot be achieved, provided the initial state is maintained. Partial refinement leads to a systematic method of developing programs with exception handling. 1 Introduction In software development, specifications are meant to be concise by stating abstractly only the intention of a program rather than elaborating on a possible implementation. However, practical restrictions can prevent idealized specifications from being fully implemented. In general, there are three sources of partiality in implementations: there may be inherent limitations of the implementation, some features may intentionally not (yet) be implemented, or there may be a genuine fault. As an example of inherent limitations of an implementation, consider a class for the analysis of a collection of integers. The operations are initialization, inserting an integer, and summing all its elements. Assume that int is a type for machine-representable integers, bounded by MIN and MAX, and machine arithmetic is bounded, i.e. an overflow caused by arithmetic operations on int is detected and raises an exception, as available in x86 assembly language [11] and .NET [20]. -
Lecture Notes in Computer Science 5014 Commenced Publication in 1973 Founding and Former Series Editors: Gerhard Goos, Juris Hartmanis, and Jan Van Leeuwen
Lecture Notes in Computer Science 5014 Commenced Publication in 1973 Founding and Former Series Editors: Gerhard Goos, Juris Hartmanis, and Jan van Leeuwen Editorial Board David Hutchison Lancaster University, UK Takeo Kanade Carnegie Mellon University, Pittsburgh, PA, USA Josef Kittler University of Surrey, Guildford, UK Jon M. Kleinberg Cornell University, Ithaca, NY, USA Alfred Kobsa University of California, Irvine, CA, USA Friedemann Mattern ETH Zurich, Switzerland John C. Mitchell Stanford University, CA, USA Moni Naor Weizmann Institute of Science, Rehovot, Israel Oscar Nierstrasz University of Bern, Switzerland C. Pandu Rangan Indian Institute of Technology, Madras, India Bernhard Steffen University of Dortmund, Germany Madhu Sudan Massachusetts Institute of Technology, MA, USA Demetri Terzopoulos University of California, Los Angeles, CA, USA Doug Tygar University of California, Berkeley, CA, USA Gerhard Weikum Max-Planck Institute of Computer Science, Saarbruecken, Germany Jorge Cuellar Tom Maibaum Kaisa Sere (Eds.) FM 2008: Formal Methods 15th International Symposium on Formal Methods Turku, Finland, May 26-30, 2008 Proceedings 13 Volume Editors Jorge Cuellar Siemens Corporate Technology Otto-Hahn-Ring 6 81730 München, Germany E-mail: [email protected] Tom Maibaum McMaster University Software Quality Research Laboratory and Department of Computing and Software 1280 Main St West, Hamilton, ON L8S 4K1, Canada E-mail: [email protected] Kaisa Sere Åbo Akademi University Department of Information Technology 20520 Turku, Finland E-mail: kaisa.sere@abo.fi Library of Congress Control Number: 2008927062 CR Subject Classification (1998): D.2, F.3, D.3, D.1, J.1, K.6, F.4 LNCS Sublibrary: SL 2 – Programming and Software Engineering ISSN 0302-9743 ISBN-10 3-540-68235-X Springer Berlin Heidelberg New York ISBN-13 978-3-540-68235-6 Springer Berlin Heidelberg New York This work is subject to copyright. -
Formal Methods: from Academia to Industrial Practice a Travel Guide
Formal Methods: From Academia to Industrial Practice A Travel Guide Marieke Huisman Department of Computer Science (FMT), UT, P.O. Box 217, 7500 AE Enschede, The Netherlands Dilian Gurov KTH Royal Institute of Technology, Lindstedtsvägen 3, SE-100 44 Stockholm, Sweden Alexander Malkis Department of Informatics (I4), TUM, Boltzmannstr. 3, 85748 Garching, Germany 17 February 2020 Abstract For many decades, formal methods are considered to be the way for- ward to help the software industry to make more reliable and trustworthy software. However, despite this strong belief and many individual success stories, no real change in industrial software development seems to be oc- curring. In fact, the software industry itself is moving forward rapidly, and the gap between what formal methods can achieve and the daily software- development practice does not appear to be getting smaller (and might even be growing). In the past, many recommendations have already been made on how to develop formal-methods research in order to close this gap. This paper investigates why the gap nevertheless still exists and provides its own re- commendations on what can be done by the formal-methods–research com- munity to bridge it. Our recommendations do not focus on open research questions. In fact, formal-methods tools and techniques are already of high quality and can address many non-trivial problems; we do give some tech- nical recommendations on how tools and techniques can be made more ac- cessible. To a greater extent, we focus on the human aspect: how to achieve impact, how to change the way of thinking of the various stakeholders about this issue, and in particular, as a research community, how to alter our be- haviour, and instead of competing, collaborate to address this issue. -
Specifications for Intelligent Software Synthesis
Czech Technical University in Prague Faculty of Electrical Engineering Department of Computer Science Specifications for Intelligent Software Synthesis Doctoral Thesis Ing. Josef Kufner Prague, January 2020 Ph.D. Programme: Electrical Engineering and Information Technology Branch of study: Artificial Intelligence and Biocybernetics Supervisor: Ing. Radek Mařík, CSc. Abstract Abstrakt To relieve programmers of repetitive and tir- Implementace jednoduchých, avšak příliš ing work on simple, yet too diverse, entities různorodých, entit ve webových aplikacích je in web applications, this thesis searches for únavná úloha, jejíž řešení se pokusíme au- an assistive framework, where machines aid tomatizovat. Tato práce směřuje k vytvoření the programmers with implementing such en- asistivní technologie, kdy počítače programá- tities. The first question to answer is how to torům s implementací pomáhají, ale nesnaží se tell the computer what we want without spec- je plně nahradit. První otázkou je, jak počítači ifying all the details; otherwise, we could just sdělit, co po něm chceme tak, aby taková spe- implement the application instead. The sec- cifikace byla jednodušší, než kdybychom to ond question is how to effectively reason about sami naprogramovali. Druhá otázka cílí na the software so that we can analyze what we možnosti uvažování o programech – jak ana- have and infer what we miss. The proposed lyzovat to, co máme a jak odvozovat, co nám solution introduces Smalldb state machines as chybí. V rámci navrhovaného řešení předsta- a formal model that describes the behavior of víme Smalldb, které formálně popisuje chování the entities in a web application. Such a model entit webové aplikace pomocí konečných auto- is not designed to cover every aspect of the ap- matů, avšak nesnaží se zachytit každý aspekt plication; instead, it leaves well-defined gaps takové aplikace. -
Formal Methods Specification and Verification Guidebook for Software and Computer Systems Volume I: Planning and Technology Insertion
OFFICE OF SAFETY AND MISSION ASSURANCE NASA-GB-002-95 RELEASE 1.0 FORMAL METHODS SPECIFICATION AND VERIFICATION GUIDEBOOK FOR SOFTWARE AND COMPUTER SYSTEMS VOLUME I: PLANNING AND TECHNOLOGY INSERTION JULY 1995 NATIONAL AERONAUTICS AND SPACE ADMINISTRATION WASHINGTON, DC 20546 NASA-GB-002-95 Release 1.0 FORMAL METHODS SPECIFICATION AND VERIFICATION GUIDEBOOK FOR SOFTWARE AND COMPUTER SYSTEMS VOLUME I: PLANNING AND TECHNOLOGY INSERTION FOREWORD The Formal Methods Specification and Verification Guidebook for Software and Computer Systems describes a set of techniques called Formal Methods (FM), and outlines their use in the specification and verification of computer systems and software. Development of increasingly complex systems has created a need for improved specification and verification techniques. NASA's Safety and Mission Quality Office has supported the investigation of techniques such as FM, which are now an accepted method for enhancing the quality of aerospace applications. The guidebook provides information for managers and practitioners who are interested in integrating FM into an existing systems development process. Information includes technical and administrative considerations that must be addressed when establishing the use of FM on a specific project. The guidebook is intended to aid decision makers in the successful application of FM to the development of high- quality systems at reasonable cost. This is the first volume of a planned two- volume set. The current volume focuses on administrative and planning considerations for the successful application of FM. Volume II will contain more technical information for the FM practitioner, and will be released at a later date. Major contributors to the guidebook include, from the Jet Propulsion Laboratory: Rick Covington (editor), John Kelly (task lead), and Robyn Lutz; from Johnson Space Center: David Hamilton (Loral) and Dan Bowman (Loral); from Langley Research Center: Ben DiVito (VIGYAN) and Judith Crow (SRI International); and from NASA HQ Code Q: Alice Robinson. -
Winter 1998 ISSN 1361-3103
S~ies I Vol. 3, No. 4, ·Wihter 199B-FAGS Europe 1 r FACS. FORMAL METHODS EUROPE Europe ~ ~ The Newsletter of the BCS Formal Aspects of Computing Science Special Interest Group and Formal Methods Europe. Series I Vol. 3, No. 4, Winter 1998 ISSN 1361-3103 1 Editorial Apologies to all our readers for the interruption in publication. Hopefully, we are now back on track, with a new editorial team taking over from the next issue. However, this, along with various problems in staging events last year, has really brought home to FACS committee how overstretched we are at times, and how much in need of new active committee members. The will is there, but often the time is not... So please, if YOU can help FACS make a good start into the next 20 years, get in touch with us and make an offer of help! Our main needs are for: event organizers; newsletter contributors; and above all, thinkers and 2 FACS Europe - Series 1 Vol. 3, No. 4, Winter 1998 movers with good ideas and time/energy to bring them through to effect. We tend to work mainly bye-mail, and meet a couple of times a year face to face. 1.1 FACS is 20! The theme for this issue is '20 Years of BCS-FACS'. We have two special pieces: a guest piece from a long-time contributor from earlier years, F X Reid, and also a parting (alas!) piece from Dan Simpson, who is resigning from the committee after many long years of much appreciated support. -
On Software Certification: We Need Product-Focused Approaches
On Software Certification: We Need Product-Focused Approaches Alan Wassyng, Tom Maibaum, and Mark Lawford Software Quality Research Laboratory Department of Computing and Software McMaster University, Hamilton, Canada L8S 4K1 [email protected], [email protected], [email protected] Abstract. In this paper we begin by examining the “certification” of a consumer product, a baby walker, that is product-focused, i.e., the certifi- cation process requires the performance of precisely defined tests on the product with measurable outcomes. We then review current practices in software certification and contrast the software regime’s process-oriented approach to certification with the product-oriented approach typically used in other engineering disciplines. We make the case that product- focused certification is required to produce reliable software intensive systems. These techniques will have to be domain and even product specific to succeed. 1 Introduction This paper deals briefly with the current state of software certification, why it is generally ill-conceived and some reasons for how (and why) we landed in this mess, and suggestions for improving the situation. 2 Motivation A certification story: Let us start the discussion with an item that has little to do with software, but is typical of engineered artifacts - a baby walker. Consider a typical baby walker, as shown in Figure 1. In recent years, there has been considerable concern regarding the safety and effectiveness of baby walkers. In reaction to this concern, we can now consider a certification process we may wish to advocate in order that we may regulate the sale of particular baby walkers. So, what should be the overall thrust of such a certification process? Well, humbly we may suggest that we model the process on certification processes that are common in our domain (software). -
Documentation, Written in Java, Scheme, XML and Javadoc
An Architecture for Task Execution in Adverse Environments Filip MILETIC´ An Architecture for Task Execution in Adverse Environments Proefschrift ter verkrijging van de graad van doctor aan de Technische Universiteit Delft, op gezag van de Rector Magnificus prof. dr. ir. J. T. Fokkema, voorzitter van het College voor Promoties, in het openbaar te verdedigen op maandag 4 juni 2007 om 12.30 uur, door Filip MILETIC´ Electrical Engineer van de Universiteit van Belgrado, Servi¨e geboren te Kruˇsevac, Servi¨e. Dit proefschrift is goedgekeurd door de promotor: Prof. dr. ir. P. M. Dewilde Samenstelling promotiecommissie: Rector Magnificus voorzitter Prof. dr. ir. P. M. Dewilde Technische Universiteit Delft, promotor Prof. dr. M. Prokin Universiteit van Belgrado Prof. dr. ir. A. J. van der Veen Technische Universiteit Delft Prof. dr. ir. F. C. A. Groen Universiteit van Amsterdam Prof. dr. ir. I. G. M. M. Niemegeers Technische Universiteit Delft dr. drs. L. J. M. Rothkrantz Technische Universiteit Delft dr. K. Nieuwenhuis DECIS Prof. dr. K. G. W. Goossens Technische Universiteit Delft, reservelid Copyright c 2007 by Filip Mileti´c All rights reserved. No part of the material protected by this copyright notice may be reproduced or utilized in any form or by any means, electronic or mechanical, including photocopying, recording or by any information storage and retrieval system, without the prior permission of the author. ISBN: 978-90-9021920-2 To Milan Contents 1 Introduction 1 1.1 OutlineofThisChapter ........................ 2 1.2 Background............................... 2 1.3 Properties................................ 8 1.4 ProblemStatement........................... 11 1.5 Contributions.............................. 12 1.6 OutlineofTheThesis ......................... 14 2 Toolkit 17 2.1 Introduction..............................