DOCSLIB.ORG

PART I. Council A

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
PART I. Council A Tab13b_TC-2 report.doc TC-2 Software Theory and Practice Report to Council and TA London, February-March 2007 Period covered: September 2006 - February 2007 Robert Meersman (BE) and Judith Bishop (ZA)/Stefan Biffl (AT) Chair and Secretary (2006/2007), IFIP TC-2 PART I. Council a. Meetings held and scheduled. TC-2 held its annual meeting on June 10-11, 2006 in Como, Italy (reported earlier). The membership (see Annexure 1) stands at 46 (cf 43 in 2006). The next annual TC2 meeting is June 17-18, 2007, in Sofia, Bulgaria. b. Changes in membership and officers Robert Meersman (BE) was re-elected to serve as TC2 Chair for a second term (2007-9) Judith Bishop (ZA) resigned at the end of 2006 as Vice Chair and TC Secretary. New Vice Chair: Bashar Nuseibeh (GB) <[email protected]> New TC Secretary: Stefan Biffl (AT) [email protected] as proposed by TC2 Chair and approved by TC2 membership. TC2 Membership: • New delegates/members: RS Nenad Stefanovic <[email protected]> JP Masami Hagiya <[email protected]> WG 2.2 I. Walukiewicz (F) new vice chair WG 2.4 Welf Löwe (SWE) WG 2.5 Shigeo Kawata WG 2.6 Thomas Risse WG 2.7 Simone Barbosa WG 2.7 Gerrit van der Veer WG 2.13 Brian Fitzgerald • Membership ended or delegates resigned JP Kakehi Katsuhiko c. Working groups WG2.1 Report submitted by Lambert Meertens 1. Changes in membership and officers: There were no changes during this period. 2. Last meeting The 62th meeting of WG 2.1 was held 11 − 15 December 2006 in Namur, Belgium. It was hosted by Michel Sintzoff and Charles Pecheur of the Université catholique de Louvain, and attended by - 1 - 1 Tab13b_TC-2 report.doc 11 members and 12 observers, of which 5 were local observers. There were 22 technical presentations. The informal minutes, including abstracts of most of the talks and links to on-line working documents, are available on web page www.comlab.ox.ac.uk/oucl/work/jeremy.gibbons/wg21/meeting62/minutes.html 3. Next meetings Meeting #63: 10 − 14 September 2007, Kyoto, Japan. 4. Recent events: None 5. Upcoming event: None 6. Status of the group, general points, other activities The possibility of a joint WG2.1/WG2.8/WG2.11 Working Conference on Domain-Specific Languages, to be held in the middle of 2008, is being explored. WG2.2 Report submitted by Davide Sangiorgi The last meeting of IFIP WG 2.2 took place during the period 11—13 September 2006 in Udine, Italy. It was a special meeting, as it celebrated the 40th Anniversary Meeting of the WG. The meeting was organized by our member Furio Honsell with the help of Marino Miculan, at the University of Udine. Both the organization and the talks were excellent. Furio Honsell, presently rector of the University of Udine, has provided funding for the meeting. Five invited speakers retraced the development of the ideas at various stages in the history of programming language semantics and implementation or expressed a position on what concepts are central to this field. These talks were given by Hans Langmaack, Gordon Plotkin, Dana Scott, Leslie Lamport, and Manfred Paul. Three more invited talks were given by members of WG2.2. For the rest, the program comprised 17 presentations by members of the group. These invited talks and ordinary presentations also contributed to a general perspective of the field by surveying wide areas of work or by reporting on works accomplished over long periods. For some titles and abstracts of presentations, see http://www.cs.unibo.it/~sangio/IFIP/talks_Udine06.html 24 out of 29 members were present at the meeting: Given the exceptional event, in this case participation to the meeting was open. We therefore had a number of external participants (overall about 80 people registered) The Chairman proposed the nomination of a vice-chairman, as exists in several other working groups, and suggested for this I. Walukiewicz (F). This proposal was approved by the WG, during its administrative sessions. The WG has been asked by the organizers of the International Conference FSEN'07 (Fundamentals of Software Engineering, April 17-19, 2007) to be held in Teheran, to grant the co-sponsorship of the IFIP WG2.2 to this conference. The WG has accepted; the co-sponsorship has been approved by IFIP TC2. The WG involvement in the conferences concerns PC members, invited speakers, and tutorial sessions. Planned events and activities: The next meeting of the WG will take place in Nancy, France, in September. The precise dates are still under discussion. It will be organised by our member Stephan Merz. - 2 - 2 Tab13b_TC-2 report.doc The WG has co-sponsorship for the conference FSEN (Fundamentals of Software Engineering)to be held in Teheran, April 17-19, 2007, as discussed above. WG2.3 Report submitted by Pamela Zave Meeting #46 took place in Sydney, Australia, 8-12 January 2007. The host was Prof. Annabelle McIver of Macquarie University. Facilities for the meeting were graciously provided by the University of Sydney. There were 18 participants, including 11 members and 7 observers. 5 other members had originally planned to attend, but were forced by circumstances to revise their plans. No observers were eligible for membership at this meeting. Discussion topics and abstracts are available on the Web site: http://research.microsoft.com/~leino/IFIP-WG2.3/ We regret to note the passing of long-time member Douglas Ross. The International Conference on Tests and Proofs was held in Zurich, Switzerland, 12-14 February 2007. This event was organized by member Bertrand Meyer, endorsed by WG 2.3, and sponsored by IFIP. For further information see: http://tap.ethz.ch/ Meeting #47 will be held in Santa Fe, New Mexico, 8-12 October 2007. The host will be Robert Balzer of Teknowledge. WG2.4 Report submitted by Erhard Ploedereder Since the report to TC2 at its Como meeting, WG 2.4 met in Glasgow (UK) for a week-long meeting (July 16-21). There were 21 attendees, among them 4 members. While a slight improvement over the previous meeting, attendance levels are still not back to our normal number of about 30 participants. Nevertheless discussions of the presentations were lively and focused mostly on language capabilities and their implementation. Welf Löwe, Vaxjö University, Sweden, was proposed as a new member. Our next meeting is scheduled at the UCLA conference center at Lake Arrowhead, California, May 6-11, 2007. For the Lake Arrowhead meeting an increased number of invitations were sent out to prospective new members. This time they were personally contacted by members to familiarize them with the group and the meaning of the invitation extended to them. Early registration results indicate that the next meeting will have 30 participants or more. We experienced a veritable avalanche of offers to host upcoming meetings. A place in Northern Italy, two locations in Germany, offers from Sweden, Qatar, USA, Canada and South Africa provide a wealth of opportunities to chose from. Following traditions, the next meeting will be either in Europe or some “remote” country. 4th IFIP WG2.4 Summer School, South Africa 26-30 March 2007. Attendance stands at 88, from 9 African countries, the Netherlands and Italy. The School is being run by Judith Bishop through the University of Pretoria under the auspices of WG2.4. IFIP has not provided any funding this time. Scholarships for students and airfares for speakers have been the responsibility of Microsoft Research and local Research organizations. There is no profit sharing with IFIP, but the day fee at 2 euros per day will be paid to IFIP. WG2.5 Report submitted by Ron Boisvert Leadership Chair Dr. Ronald F. Boisvert, NIST, Gaithersburg, MD, USA - 3 - 3 Tab13b_TC-2 report.doc Vice-Chair Professor Michael Thuné, University of Uppsala, Sweden Secretary Professor Wayne Enright, University of Toronto, Canada Membership The Working Group currently has 34 full members representing 13 countries. The Working Group has an additional 12 affiliate members. (Affiliates are former WG 2.5 full members who are interested in working group activities, but are unable to regularly attend meetings or commit large amount of time to working group projects. They maintain email contact, and attend Working Group meetings when possible. They are considered members of the Working Group by IFIP.) The newest member of WG 2.5 is Professor Shigeo Kawata Utsunomiya University Japan He was approved by WG 2.5 in July 2006. Aims and Scope WG 2.5 recently re-evaluated its statement of aims and scope with an eye to updating its viewpoint in light of current trends in the field. The result of this process was a re-affirmation of the basic aim of the group, i.e., to improve the quality of scientific computation by promoting the development and availability of sound numerical software. However, it was felt that a re-statement and clarification of the objectives that lie within its scope was needed. In July 2006, the group approved a modified scope statement, which is included in Appendix 1 of this report. An important feature of this new statement is an expanded (one-page) rationale for each of the topic areas identified in the scope statement. This rationale is also attached. Business Meetings The working group holds yearly meetings. These are typically comprised of a two-day business meeting and an associated two-day workshop. The workshop provides an opportunity for the working group to interact with researchers in the local region on issues of mutual interest.
Load more

Recommended publications
  • 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.
    [Show full text]
  • The Humble Humorous Researcher: a Tribute to Michel Sintzoff
    The Humble Humorous Researcher A Tribute to Michel Sintzoff Axel van Lamsweerde 1 Many of us lost a close colleague on November 28, 2010. More than that: we lost a friend. One that we used to meet regularly, all over the world, always listening to us, making interesting comments and suggestions on our work, joking on every occasion and making us discover how much fun our business is. Rather than reviewing his work in detail, this note puts more focus on Michel’s rich personality, with the hope that it will bring back fond memories among those who were lucky enough to share some good times with him. The style is intended to be personal and informal. Michel would have hated anything different, to be sure. Born in 1938 in Brussels, Michel completed his master’s degree in Mathematics at the Université catholique de Louvain (UCL) in 1962. After two years of civil service as a maths teacher in Katanga (Congo), he entered the MBLE Research Laboratory in Brussels in 1964 (MBLE stands for “ Manufacture Belge de Lampes et matériel Electrique”). This was a branch of Philips Research Labs specifically dedicated to background research in applied mathematics and computing science. After 18 years of research in programming languages, formal semantics, program analysis and concurrency at MBLE, he joined the newly founded department of Computing Science at UCL in 1982 with new interests in diverse areas such as proof systems, control theory and dynamical systems. Michel contributed to the PhD work of dozens of people in Belgium and France, as supervisor or contributor, without ever having been interested in getting a PhD himself.
    [Show full text]
  • Scaling Functional Synthesis and Repair
    Scaling Functional Synthesis and Repair Thèse N° 8716 Présentée le 11 janvier 2019 à la Faculté informatique et communications Laboratoire d’analyse et de raisonnement automatisés Programme doctoral en informatique et communications pour l’obtention du grade de Docteur ès Sciences par EMMANOUIL KOUKOUTOS Acceptée sur proposition du jury Prof. C. Koch, président du jury Prof. V. Kuncak, directeur de thèse Prof. S. Khurshid, rapporteur Prof. D. Marinov, rapporteur Prof. M. Odersky, rapporteur 2019 Acknowledgements First and foremost, I would like to thank my advisor Viktor Kuncak, for accepting me into his lab, and generously providing his guidance, knowledge, encouragement and support during my PhD studies. This thesis would not have been possible without him. Second, I would like to thank my thesis committee members Christoph Koch, Martin Odersky, Darko Marinov and Sarfraz Khurshid, for taking the time to evaluate my thesis, and for their valuable and extensive comments on it, which helped it improve greatly to its current form. Third, I would like to thank my colleagues Etienne Kneuss, Mukund Ragothaman, Ravishadran Kandhadai Madhavan, Régis Blanc, Mikael Mayer, Nicolas Voirol, Romain Edelmann, Eva Darulova, Andreas Pavlogiannis, Georg Schmid, Jad Hamsa, Romain Ruetschi, and Sarah Sallinger, for our collaboration, exchange of ideas, and the welcoming and creative atmosphere they maintained in the lab. A special thanks goes to Etienne for our great collaboration, and his guidance and patience when he was helping me acclimate during my first months in the lab. Also, I would like to thank Fabien Salvi, Yvette Gallay and Sylvie Jankow, for helping all of us to work unobstructed with their technical and administrative support.
    [Show full text]
  • An Extension of Isabelle/UTP with Simpl-Like Control Flow
    USIMPL: An Extension of Isabelle/UTP with Simpl-like Control Flow Joshua Alexander Bockenek Thesis submitted to the Faculty of the Virginia Polytechnic Institute and State University in partial fulfillment of the requirements for the degree of Masters of Science in Computer Engineering Binoy Ravindran, Chair Peter Lammich Robert P. Broadwater December 8, 2017 Blacksburg, Virginia Keywords: Formal Verification, Formal Methods, Isabelle, Unifying Theories of Programming, Verification Condition Generation © 2018, Joshua Alexander Bockenek USIMPL: An Extension of Isabelle/UTP with Simpl-like Control Flow Joshua Alexander Bockenek (ABSTRACT) Writing bug-free code is fraught with difficulty, and existing tools for the formal verification of programs do not scale well to large, complicated codebases such as that of systems software. This thesis presents USIMPL, a component of the Orca project for formal verification that builds on Foster’s Isabelle/UTP with features of Schirmer’s Simpl in order to achieve a modular, scalable framework for deductive proofs of program correctness utilizing Hoare logic and Hoare-style algebraic laws of programming. This work is supported in part by the Office of Naval Research (ONR) under grants N00014- 17-1-2297 and N00014-16-1-2818, and the Naval Sea Systems Command (NAVSEA)/the Naval Engineering Education Consortium (NEEC) under grant N00174-16-C-0018. Any opinions, findings, and conclusions or recommendations expressed in this thesis are those of the author and do not necessarily reflect the views of ONR or NAVSEA/NEEC. USIMPL: An Extension of Isabelle/UTP with Simpl-like Control Flow Joshua Alexander Bockenek (GENERAL AUDIENCE ABSTRACT) Writing bug-free code is fraught with difficulty, and existing tools for the formal verification of programs do not scale well to large, complicated codebases such as that of systems software (OSes, compilers, and similar programs that have a high level of complexity but work on a lower level than typical user applications such as text editors, image viewers, and the like).
    [Show full text]
  • (Pdf) of the School of Squiggol: a History of the Bird−Meertens
    The School of Squiggol A History of the Bird{Meertens Formalism Jeremy Gibbons University of Oxford Abstract. The Bird{Meertens Formalism, colloquially known as \Squig- gol", is a calculus for program transformation by equational reasoning in a function style, developed by Richard Bird and Lambert Meertens and other members of IFIP Working Group 2.1 for about two decades from the mid 1970s. One particular characteristic of the development of the Formalism is fluctuating emphasis on novel `squiggly' notation: sometimes favouring notational exploration in the quest for conciseness and precision, and sometimes reverting to simpler and more rigid nota- tional conventions in the interests of accessibility. This paper explores that historical ebb and flow. 1 Introduction In 1962, IFIP formed Working Group 2.1 to design a successor to the seminal algorithmic language Algol 60 [4]. WG2.1 eventually produced the specification for Algol 68 [63, 64]|a sophisticated language, presented using an elaborate two- level description notation, which received a mixed reception. WG2.1 continues to this day; technically, it retains responsibility for the Algol languages, but practi- cally it takes on a broader remit under the current name Algorithmic Languages and Calculi. Over the years, the Group has been through periods of focus and periods of diversity. But after the Algol 68 project, the period of sharpest focus covered the two decades from the mid 1970s to the early 1990s, when what later became known as the Bird{Meertens Formalism (BMF) drew the whole group together again. It is the story of those years that is the subject of this paper.
    [Show full text]
  • The Design Philosophy of Distributed Programming Systems: the Mozart Experience
    The Design Philosophy of Distributed Programming Systems: the Mozart Experience Per Brand A dissertation submitted to the Royal Institute of Technology in partial fulfillment of the requirements for the degree of Doctor of Philosophy June 2005 The Royal Institute of Technology School of Information and Communication Technology Department of Electronics and Computer Systems Stockholm, Sweden TRITA-IMIT-LECS AVH 05:04 ISSN 1651-4076 ISRN KTH/IMIT/LECS/AVH-05/04–SE and ISRN SICS-D–37–SE SICS Dissertation Series 37 ISSN 1101-1335 c Per Brand, 2005 Abstract Distributed programming is usually considered both difficult and inherently different from concurrent centralized programming. It is thought that the distributed program- ming systems that we ultimately deploy, in the future, when we’ve worked out all the details, will require a very different programming model and will even need to be evaluated by new criteria. The Mozart Programming System, described in this thesis, demonstrates that this need not be the case. It is shown that, with a good system design, distributed pro- gramming can be seen as an extended form of concurrent programming. This is from the programmer’s point-of-view; under the hood the design and implementation will necessarily be more complex. We relate the Mozart system with the classical trans- parencies of distributed systems. We show that some of these are inherently on the application level, while as Mozart demonstrates, others can and should be dealt with on the language/system level. The extensions to the programming model, given the right concurrent programming base, are mainly concerned with non-functional properties of programs.
    [Show full text]
  • Front Matter
    Cambridge University Press 978-1-107-03660-4 — Systematic Program Design Yanhong Annie Liu Frontmatter More Information Systematic Program Design From Clarity to Efficiency A systematic program design method can help developers ensure the correctness and per- formance of programs while minimizing the development cost. This book describes a method that starts with a clear specification of a computation and derives an efficient im- plementation by step-wise program analysis and transformations. The method applies to problems specified in imperative, database, functional, logic, and object-oriented program- ming languages with different data, control, and module abstractions. Designed for courses or self-study, this book includes numerous exercises and examples that require minimal computer science background, making it accessible to novices. Expe- rienced practitioners and researchers will appreciate the detailed examples in a wide range of application areas including hardware design, image processing, access control, query optimization, and program analysis. The last section of the book points out directions for future studies. Yanhong Annie Liu is a Professor of Computer Science at Stony Brook University. She received her BS from Peking University, MEng from Tsinghua University, and PhD from Cornell University. Her primary research has focused on general and systematic methods for program development, algorithm design, and problem solving. She has published in many top journals and conferences, served more than fifty conference chair or committee roles, and been awarded more than twenty research grants in her areas of expertise. She has taught more than twenty different courses in a wide range of Computer Science areas and presented close to a hundred research talks and invited talks at international confer- ences, universities, and research institutes.
    [Show full text]
  • The ALGOL 68 Story a Personal Account by a Member of the Design Team Professor John E
    ACS Bulletin, November 1978, Page 4-6 The ALGOL 68 Story A personal account by a member of the design team Professor John E. Peck, University of British Colombia, Vancouver, Canada Early Years My early years were spent in South Africa. I got my B.Sc. at the University of Natal in mathematics and physics and soon after that my M.Sc. in mathematics. My first job was a daily analysis of superphosphate at a chemical factory near Durban belonging to the ICI group, and then I taught mathematics to engineers at the University of Natal. In 1946 I took up a scholarship and went to Yale University for graduate studies, where I obtained a Ph.D. in 1950 with a thesis on topological semigroups. I taught a year at Brown University and then for three years back at the University of Natal. We then decided to emigrate to Canada where I spent a year at the University of New Brunswick, four years at McGill University, ten years at Calgary and the remaining years at the University of British Columbia. Up to the year 1959 I had thought little about computing, my professional activities being in the realm of pure mathematics where the activity of greatest importance was the proving of useless theorems. In the spring of 1959 an invitation was circulated in the Mathematics department at McGill, where I was working, to learn computer programming on the Datatron. My colleagues all looked down their noses at the thought of such a mundane exercise, for wasn't it clear that all that needed to be known about computing was the mathematical theory of switching circuits.
    [Show full text]
  • E Bibliography
    E Bibliography This bibliography has two parts: works by other authors; works by the author of the present book. See also, in the chapter on inheritance methodology (page 868), a list of references on classification in the biological sciences. E.1 WORKS BY OTHER AUTHORS [Abrial 1980] Jean-Raymond Abrial: The Specification Language Z: Syntax and "Semantics", Oxford University Computing Laboratory, Programming Research Group Technical Report, Oxford, April 1980. [Abrial 1980a] Jean-Raymond Abrial, Stephen A.Schuman and Bertrand Meyer: A Specification Language, in On the Construction of Programs, eds. R. McNaughten and R.C. McKeag, Cambridge University Press, 1980. [Ada 95-Web] Ada 95 Reference Manual: Language and Standard Library, on-line at http://lglwww.epfl.ch/Ada/LRM/9X/ rm9x/rm9x-toc.html. [ADB 1995] Matisse 2.3 Tutorial, Report DE/95/03/0022-M2DOC-TUA, ADB S.A., Paris, January 1995. [Agha 1986] Gul Agha: ACTORS: A Model of Concurrent Computation in Distributed Systems; MIT Press, Cambridge (Mass.), 1986. [Agha 1988] Gul Agha, Peter Wegner and Akinori Yonezawa (eds.): Proceeding of the ACM SIGPLAN Workshop on Object- Based Concurrent Programming, San Diego, 26-27 September, 1988; in ACM SIGPLAN Notices, vol. 24, no. 4, 1988. [Agha 1990] Gul Agha: Concurrent Object-Oriented Programming, in Communications of the ACM, vol. 33, no. 9, September 1990, pages 125-141. [Agha 1991] Gul Agha, Carl Hewitt, Peter Wegner and Akinori Yonezawa (eds.): Proceedings of the ECOOP-OOPSLA Workshop on Object-Based Concurrent Programming, Ottawa, 21-22 October 1990; in OOPS Messenger (ACM), vol. 2, no. 2, April 1991. [Agha 1993] Gul Agha, Peter Wegner and Akinori Yonezawa (eds.): Research Directions in Concurrent Object-Oriented Programming, MIT Press, Cambridge (Mass.), 1993.
    [Show full text]
  • Acta Informatica
    A Complete Bibliography of Publications in Acta Informatica Nelson H. F. Beebe University of Utah Department of Mathematics, 110 LCB 155 S 1400 E RM 233 Salt Lake City, UT 84112-0090 USA Tel: +1 801 581 5254 FAX: +1 801 581 4148 E-mail: [email protected], [email protected], [email protected] (Internet) WWW URL: http://www.math.utah.edu/~beebe/ 14 May 2021 Version 1.41 Title word cross-reference #SAT [1268]. (n; k) [370]. (N − 1) [1203]. + [1117, 903]. 0 [349, 852]. 1 [32, 939, 293, 778, 516, 916, 607, 563, 548, 946, 231, 852, 578]. 1; 1 [488]. 2 [1234, 1246, 737, 714, 715, 313, 788, 92, 166, 202]. 2:5n [535]. 3 ∗ ∗ [1234, 313, 92, 202]. 7 [1141]. [466]. α − β [235]. α2 [1355]. B [515]. B [442]. B+ [680]. mod5 [1141]. P [1090]. QH [1090]. D [1209, 401, 136, 1078, 1017, 1185]. DTIMEF(F) =?DSPACEF(F) [1014]. 8 [832]. K [305, 401, 130, 1445, 467, 1078, 618, 252, 1343, 1187, 851, 1293, 157, 326, 338, 972, 961, 1043, 280, 359, 852]. Ks;t [1201]. L [820, 875]. LR [318]. X LU [659]. M [1021, 41, 561]. M [1521]. MTL0;1 [1406]. µ [731, 885]. N 2 [1203, 467, 140, 12, 852]. : [832]. ν2 [1355]. O(1) [669]. O(n) [136]. O(n ) [1486]. O(V 5=3E2=3) [321]. P [1183, 1184, 1226, 1379, 1146]. P = NP [399, 399]. P5 [1276]. π [1580, 1206, 1001, 1210, 1299, 912, 1198]. q [1442]. 1 2 R(1) [1390]. S [892]. Sometime = always + recursionalways [596].
    [Show full text]
  • Models of Computation Texts in Theoretical Computer Science
    Texts in Theoretical Computer Science. An EATCS Series Roberto Bruni Ugo Montanari Models of Computation Texts in Theoretical Computer Science. An EATCS Series Series editors Monika Henzinger, Faculty of Science, Universität Wien, Vienna, Austria Juraj Hromkovič, Department of Computer Science, ETH Zentrum, Zürich, Switzerland Mogens Nielsen, Department of Computer Science, Aarhus Universitet, Aarhus, Denmark Grzegorz Rozenberg, Leiden Center of Advanced Computer Science, Leiden, The Netherlands Arto Salomaa, Turku Centre of Computer Science, Turku, Finland More information about this series at http://www.springer.com/series/3214 Roberto Bruni • Ugo Montanari Models of Computation 123 Roberto Bruni Ugo Montanari Dipartimento di Informatica Dipartimento di Informatica Università di Pisa Università di Pisa Pisa Pisa Italy Italy ISSN 1862-4499 Texts in Theoretical Computer Science. An EATCS Series ISBN 978-3-319-42898-7 ISBN 978-3-319-42900-7 (eBook) DOI 10.1007/978-3-319-42900-7 Library of Congress Control Number: 2017937525 © Springer International Publishing Switzerland 2017 This work is subject to copyright. All rights are reserved by the Publisher, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission or information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed. The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use.
    [Show full text]
  • Simplifying the Analysis of C++ Programs
    SIMPLIFYING THE ANALYSIS OF C++ PROGRAMS A Dissertation by YURIY SOLODKYY Submitted to the Office of Graduate and Professional Studies of Texas A&M University in partial fulfillment of the requirements for the degree of DOCTOR OF PHILOSOPHY Chair of Committee, Bjarne Stroustrup Committee Members, Jaakko J¨arvi Lawrence Rauchwerger Sergiy Butenko Head of Department, Duncan M. (Hank) Walker August 2013 Major Subject: Computer Science and Engineering Copyright 2013 Yuriy Solodkyy ABSTRACT Based on our experience of working with different C++ front ends, this thesis identifies numerous problems that complicate the analysis of C++ programs along the entire spectrum of analysis applications. We utilize library, language, and tool extensions to address these problems and offer solutions to many of them. In particular, we present efficient, expressive and non-intrusive means of dealing with abstract syntax trees of a program, which together render the visitor design pattern obsolete. We further extend C++ with open multi-methods to deal with the broader expression problem. Finally, we offer two techniques, one based on refining the type system of a language and the other on abstract interpretation, both of which allow developers to statically ensure or verify various run-time properties of their programs without having to deal with the full language semantics or even the abstract syntax tree of a program. Together, the solutions presented in this thesis make ensuring properties of interest about C++ programs available to average language users. ii ACKNOWLEDGEMENTS Knowledge is in the end based on acknowledgement. Ludwig Wittgenstein This Ph.D. thesis would not have been possible without direct or indirect support of many indi- viduals who I was fortunate enough to meet through life and be friends with.
    [Show full text]