On a New Notion of Partial Refinement
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Verification and Formal Methods
Verification and Formal Methods: Practice and Experience J. C. P. Woodcock University of York, UK and P. G. Larsen Engineering College of Aarhus, Denmark and J. C. Bicarregui STFC Rutherford Appleton Laboratory, UK and J. S. Fitzgerald Newcastle University, UK We describe the state of the art in the industrial use of formal verification technology. We report on a new survey of the use of formal methods in industry, and compare it with the most significant surveys carried out over the last 20 years. We review the literature on formal methods, and present a series of industrial projects undetaken over the last two decades. We draw some observations from these surveys and records of experience. Based on this, we discuss the issues surrounding the industrial adoption of formal methods. Finally, we look to the future and describe the development of a Verified Software Repository, part of the worldwide Verified Software Initiative. We introduce the initial projects being used to populate the repository, and describe the challenges they address. Categories and Subject Descriptors: D.2.4 [Software/Program Verification]: Assertion check- ers, Class invariants, Correctness proofs, Formal methods, Model checking, Programming by contract; F.3.1 [Specifying and Verifying and Reasoning about Programs]: Assertions, Invariants, Logics of programs, Mechanical verification, Pre- and post-conditions, Specification techniques; F.4.1 [Mathematical Logic]: Mechanical theorem proving; I.2.2 [Automatic Pro- gramming]: Program verification. Additional Key Words and Phrases: Experimental software engineering, formal methods surveys, Grand Challenges, Verified Software Initiative, Verified Software Repository. 1. INTRODUCTION Formal verification, for both hardware and software, has been a topic of great sig- nificance for at least forty years. -
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, -
August 2018 FACS a C T S
Issue 2018-1 August 2018 FACS A C T S The Newsletter of the Formal Aspects of Computing Science (FACS) Specialist Group ISSN 0950-1231 FACS FACTS Issue 2018-1 August 2018 About FACS FACTS FACS FACTS (ISSN: 0950-1231) is the newsletter of the BCS Specialist Group on Formal Aspects of Computing Science (FACS). FACS FACTS is distributed in electronic form to all FACS members. Submissions to FACS FACTS are always welcome. Please visit the newsletter area of the BCS FACS website for further details at: http://www.bcs.org/category/12461 Back issues of FACS FACTS are available for download from: http://www.bcs.org/content/conWebDoc/33135 The FACS FACTS Team Newsletter Editors Tim Denvir [email protected] Brian Monahan [email protected] Editorial Team Jonathan Bowen, John Cooke, Tim Denvir, Brian Monahan, Margaret West. Contributors to this issue Jonathan Bowen, John Cooke, Tim Denvir, Sofia Meacham. Brian Monahan, Bill Stoddart, Botond Virginas, Margaret West BCS-FACS websites BCS: http://www.bcs-facs.org LinkedIn: http://www.linkedin.com/groups?gid=2427579 Facebook: http://www.facebook.com/pages/BCS-FACS/120243984688255 Wikipedia: http://en.wikipedia.org/wiki/BCS-FACS If you have any questions about BCS-FACS, please send these to Paul Boca [email protected] 2 FACS FACTS Issue 2018-1 August 2018 Editorial Dear readers, welcome to our first issue of FACS FACTS for 2018. This year, 2018, marks the 40th anniversary of FACS. At least one editor recalls an article by Dan Simpson, member of the editorial team at the time, FACS at 10 in 1988. -
4Th International Symposium on Unifying Theories of Programming
Website Call for Papers http://utp12.lri.fr/ Interest in the fundamental problem of the combination of formal notations and theories of programming has grown consistently in recent Chairs years. The theories define, in various different ways, many common Marie-Claude Gaudel ([email protected]) notions, such as abstraction, refinement, choice, termination, feasibility, Burkhart Wolff ([email protected]) concurrency and communication. Despite these differences, such theories may be unified in a way which greatly facilitates their study and Organisation Chair comparison. Moreover, such a unification offers a means of combining different languages describing various facets and artifacts of software Abderrahmane Feliachi ([email protected]) development in a seamless, logically consistent way. Hoare and He's Unifying Theories of Programming (UTP) is widely acknowledged one Invited Speakers of the most significant such unification approaches to have emerged in the last 15 years. Jim Woodcock, University of York, UK. Based on their pioneering work, the aims of the UTP Symposium Jeremy Gibbons, series are to continue reaffirming the significance of the ongoing UTP University of Oxford, UK. project and to stimulate efforts to advance it by providing a focus for the sharing of results by those already actively contributing, and to raise Important Dates awareness of the benefits of such unifying theoretical frameworks among the wider computer science and software engineering Paper submission: March 31, 2012 communities. Notification: May 14, 2012 Camera-ready: June 4, 2012 To this end the Symposium welcomes contributions on all the themes Symposium: August 27-28, 2012 that can be related to the Unifying Theories of Programming. -
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. -
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. -
\Chapter{Phoenix Foundation}
Making Smartcards Secure Susan Stepney Logica UK Ltd. ([email protected]) In the early 1990s, platform seven (at that time part of the National Westminster Bank) started developing an innovative Smartcard-based electronic cash system, Mondex. A Smartcard is a credit-card-sized plastic card with a computer chip, which allows it to be programmed for various applications. Mondex is an application designed to work like electronic cash, which, unlike say an electronic cheque, has no third party authentication or authorisation involved in a transaction. The cost of third party clearing of an electronic transaction cannot be brought much below tens of pence, which makes it infeasible for low value cash-like transactions, such as buying a pint of milk or a newspaper, or use in vending machines, or in public telephone boxes. Mondex was designed to solve this problem, by having no third party involvement, and no per-transaction cost. Once the issuing bank has loaded electronic cash into the system, it has very little further control over it -- just like real cash. Because of this lack of third party control, it is vitally important that the security of the card can not be broken, otherwise computer-literate criminals could “electronically print” money with ease. So platform seven decided to develop the full Mondex product to the very highest standards. There are many standards and guidelines for developing software and systems to high levels of assurance. In the past, these have been mainly the domain of the military and security services, with their interest in safety critical and security critical systems. -
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. -
Transformation Rules for Z
Transformation Rules for Z Mark Utting∗ Petra Maliky Ian Toyn January 7, 2010 Abstract Z is a formal specification language combining typed set theory, predicate calculus, and a schema calculus. This paper describes an extension of Z that allows transformation and reasoning rules to be written in a Z-like notation. This gives a high-level, declarative, way of specifying transformations of Z terms, which makes it easier to build new Z manipulation tools. We describe the syntax and semantics of these rules, plus some example reasoning engines that use sets of rules to manipulate Z terms. The utility of these rules is demonstrated by discussing two sets of rules. One set defines expansion of Z schema expressions. The other set is used by the ZLive animator to preprocess Z expressions into a form more suitable for animation. 1 Introduction The Z notation [23, 30, 15] is a formal specification language that combines typed set theory, predicate calculus, and a schema calculus. It has been widely used for the design and specification of computing systems [12, 5, 24, 7]. For illustration purposes, consider the Z specification of a birthday book derived from [23]|we go through this example in some detail to introduce Z, to point out a few ways in which ISO Standard Z differs from the earlier Z notation, and to illustrate some of the Z transformations that our rules support. section birthdaybook parents standard toolkit This defines a new Z section called birthdaybook. By declaring standard toolkit as a parent, defini- tions for symbols like 7! (partial function) are included for later use. -
Mondex, an Electronic Purse : Specification and Refinement Checks
Mondex, an electronic purse : specification and refinement checks with the Alloy model-finding method Tahina Ramananandro∗ November 6, 2007 Abstract • no money may suddenly appear on a purse without being debited from another purse through an achieved transac- tion. This paper explains how the Alloy model-finding method has been used to check the specification of an electronic purse (also called smart card) system, called the Mondex case In fact, the loss of money is a global property that cannot be study, initially written in Z. After describing the payment considered at the local scale of one purse. protocol between two electronic purses, and presenting an This research led to a formal proof by hand of the Mon- overview of the Alloy model-finding method, this paper dex electronic purse system1 with the Z specification language explains how technical issues about integers and conceptual [Spi92, WD96]. This proof has been published in 2000 by Su- issues about the object layout in Z have been tackled in san Stepney, David Cooper and Jim Woodcock [SCW00]. It has Alloy, giving general methods that can be used in most critically helped the Mondex system be granted ITSEC security case studies with Alloy. This work has also pointed out level 6 out of 6. some significant bugs in the original Z specification such as reasoning bugs in the proofs, and proposes a way to solve them. This proof consists in a specification relying on a refinement relation between two models: Keywords : Alloy, formal methods, model-finding, Mondex electronic purse, refinement, security properties, software • the abstract model, a very simple model with an atomic verification, specification. -
A Calculus of Space, Time, and Causality: Its Algebra, Geometry, Logic
This is a repository copy of A Calculus of Space, Time, and Causality: its Algebra, Geometry, Logic. White Rose Research Online URL for this paper: https://eprints.whiterose.ac.uk/150600/ Proceedings Paper: Hoare, Tony, Struth, Georg and Woodcock, James Charles Paul orcid.org/0000-0001- 7955-2702 (2019) A Calculus of Space, Time, and Causality: its Algebra, Geometry, Logic. In: Ribeiro, Pedro and Augusto Sampaio, (eds.) Unifying Theories of Programming:7th International Symposium, UTP 2019, Dedicated to Tony Hoare on the Occasion of His 85th Birthday, Porto, Portugal, October 8, 2019, Proceedings. Lecture Notes in Computer Science . https://doi.org/10.1007/978-3-030-31038-7 Reuse Items deposited in White Rose Research Online are protected by copyright, with all rights reserved unless indicated otherwise. They may be downloaded and/or printed for private study, or other acts as permitted by national copyright laws. The publisher or other rights holders may allow further reproduction and re-use of the full text version. This is indicated by the licence information on the White Rose Research Online record for the item. Takedown If you consider content in White Rose Research Online to be in breach of UK law, please notify us by emailing [email protected] including the URL of the record and the reason for the withdrawal request. [email protected] https://eprints.whiterose.ac.uk/ A Calculus of Space, Time, and Causality: its Algebra, Geometry, Logic Tony Hoare1, Georg Struth2, and Jim Woodcock3 1 University of Cambridge, [email protected] 2 University of Sheffield, [email protected] 3 University of York, [email protected] Abstract.