When

26st NOV 2018

Starting at : 08:00 pm

Where

SALVADOR, BA - BR

UFBA

IMPORTANT DATES

July 20th, 2018

Paper Submission Deadline

August 28th, 2018

Paper Acceptance Notification

September 11th, 2018

Paper Camera-ready Version

XXI SBMF 2018

ETMF = 26/NOV - 27/NOV (Salvador-BA, BRAZIL)
SBMF = 28/NOV - 30/NOV (Salvador-BA, BRAZIL)

SBMF is a Brazilian symposium dedicated to the study and the application of Formal Methods in the development of software systems. This symposium also has established itself in the national scientific calendar as an important scientific-technical event in the software area. Its first edition took place in 1998, going for its 21st edition in 2018.

The SBMF event is devoted to the dissemination of the development and use of formal methods for the construction and verification of computer systems, aiming to promote opportunities for researchers with interests in formal methods to discuss recent advances in the area.

Registration

Online registration is performed via Brazilian Computer Society's web-based registration system (ECOS). From here, you can access the ECOS main web page. From 22nd November 2018 on, credit card will be the only online payment method available. On-site registration and payment (in cash) will be available from 26th November 2018 on; however, for the sake of planning, we would appreciate early registration of the attendees.

REGISTRATION FEES

To promote the research and application of formal methods in Brazil, the SBC Special Commission of Formal Methods (CEMF – Comissão Especial de Métodos Formais) is proud to announce a grant for attendees affiliated to Brazilian Institutions, no matter their nationality.

The CEMF grant applies to all categories, but it is limited to attendees affiliated to institutions, organisations and companies located in Brazil. To qualify for the discount it is necessary to fill in a request, which needs to be uploaded during registration.

  • If you are entitled to the CEMF Grant, click here to obtain information concerning registration fees.
  • If you are not entitled to the CEMF Grant, click here to obtain information concerning registration fees.
  • INVITATION LETTERS

    Invitation letters to participate in ETMF or/and SBMF 2018 will be issued only to attendees who have already paid the registration fee in full. In order to issue the invitation letter, we need the following information. Please, send the request to the general chair directly (see Contact below).

  • Full name (as written in the passport)
  • Affiliation
  • Mailing address
  • Telephone number
  • Birth date and place of birth
  • Passport number and issuing country
  • Passport issue date and expiration date
  • Name of the accepted paper (if this is the case)
  • Female/Male
  • CANCELLATION POLICY

    Registrations may only be cancelled until 9th November 2018. In such cases, only 50% of the registration fee will be refunded. The remaining 50% will not be refunded because they will cover administrative costs.

    CONTACT

    If you have any questions or face any problems, please do not hesitate to contact the general chair directly: Adolfo Duran (adolfo@ufba.br)

    PROGRAM

    Please notice that the program may be subject to changes.

    Wednesday, 28th November

    08:30 – 09:00

     Opening Session

    09:00 – 10:30

    Keynote #1: Prof. Alexandre Mota (UFPE, Brazil)
    The pragmatic dimension of Formal Methods: Tools

    10:30 - 11:00

    Coffee Break

    11:00 – 12:30

    SBMF Technical Session #1 - Semantics and Language

    • A Type-Directed Algorithm to Generate Well-Typed Featherweight Java Programs
      Samuel Feitosa, Rodrigo Geraldo Ribeiro and Andre Rauber Du Bois
    • TeSSLa: Temporal Stream-based Specification Language
      Lukas Convent, Sebastian Hungerecker, Martin Leucker, Torben Scheffel, Malte Schmitz and Daniel Thoma
    • Timed Scenarios: Consistency, Equivalence and Optimization
      Neda Saeedloei and Feliks Kluzniak

    12:30 – 14:30

    Lunch Break

    14:30 -16:00

    Discussion Panel: “Can we rely on a software-defined society? The role of Formal Methods
    Panel Chair:
    Profa. Simone Carvalheiro (UFPel, Brazil)

    Panelists:
    Prof. Volker Stolz (University of Applied Sciences, Norway)
    Prof. Leo Freitas (Newcastle University, UK)
    Prof. Osman Hasan (National University of Science and Technology, Pakistan)
    Prof. Jim Davies (University of Oxford, UK)
    Prof. Phillip Wadler (University of Edinburgh, UK)

    16:00 - 16:30

    Coffee Break

    16:30 –18:30

    CEMF Meeting

    Thursday, 29th November

    09:00 – 10:30

    Keynote #2: Prof. José Meseguer (University of Illinois, USA)
    Formal Design of Cloud Computing Systems in Maude

    10:30 - 11:00

    Coffee Break

    11:00 – 12:30

    SBMF Technical Session #2- Verification I

    • Source Code Analysis with a Temporal Extension of First-Order Logic
      David Come, Julien Brunel and David Doose
    • Constraint Reusing and k-induction for Three-Valued Bounded Model Checking
      Nils Timm, Stefan Gruner and Matthias Harvey
    • Safe and Constructive Design with UML Components
      Flávia Falcão, Lucas Lima and Augusto Sampaio

    12:30 - 14:30

    Lunch Break

    14:30 - 16:00

    Keynote #3: Prof. Jim Davies (Oxford University, UK)

    16:00 - 16:30

    Coffee Break

    16:30 - 18:00

    SBMF Technical Session #3- Formal Methods Integration

    • The Scallina Grammar - Towards a Scala Extraction for Coq
       Youssef El Bakouny and Dani Mezher
    • Automatic Test Case Generation for Concurrent Features from Natural Language Descriptions
      Rafaela Almeida, Sidney Nogueira and Augusto Sampaio
    • Formal modelling of environment restrictions from natural-language requirements 
      Tainã Santos, Gustavo Carvalho and Augusto Sampaio

    20:00 –23:00

    Conference Dinner

    Friday, 30th November

    09:00 – 10:30

    Keynote #4: Prof. Mohammad Mousavi (University of Leicester, UK)

    10:30 - 11:00

    Coffee Break

    11:00 – 12:30

    SBMF Technical Session #4 - Verification II

    • Formal Verification of n-bit ALU using Theorem Proving
      Sumayya Shiraz and Osman Hasan
    • Programming Language Foundations in Agda
      Philip Wadler
    • Analysing RoboChart with Probabilities
      Madiel Conserva Filho, Rafael Marinho, Alexandre Mota and Jim   Woodcock

    12:30 - 14:30

    Lunch Break

    14:30 - 16:00

    Keynote #5

    16:00 - 16:30

    Coffee Break

    16:30 - 18:00

    SBMF Technical Session #5 - Formal Methods Application

    • VDM at large: Modelling the EMV(R) 2nd Generation Kernel
      Leo Freitas
    • A Methodology for Protocol Verification applied to EMV 1
      Leo Freitas, Paolo Modesti and Martin Emms

    KEYNOTE SPEAKERS

    img
    Prof. Jose Meseguer

    University of Illinois at Urbana-Champaign, USA

    information
    img
    Prof. Alexandre Mota

    Federal University of Pernambuco, Brazil

    information
    img
    Prof. Jim Davies

    University of Oxford, UK

    information

    SPEAKERS

    img
    Mohammad Mousavi

    University of Leicester, UK

    information

    ORGANISATION

    GENERAL CHAIR

    Adolfo Duran

    UFBA, Brazil

    PROGRAM COMMITTEE CHAIRS

    Mohammad Mousavi

    University of Leicester, UK

    Tiago Massoni

    UFCG, Brazil

    PROGRAM COMMITTEE

    Adenilso Simão

    ICMC/USP, Brazil

    Alexandre Mota

    UFPE, Brazil

    Aline Andrade

    UFBA. Brazil

    Álvaro Moreira

    UFRGS, Brazil

    Ana Cavalcanti

    University of York, UK

    Ana de Melo

    USP, Brazil

    Ana Sokolova

    Salzburg, AT

    Anamaria Moreira

    UFRJ, Brazil

    Andrea Corradini

    Universita’ di Pisa, Italy

    Arend Rensink

    University of Twente, Netherlands

    Arnaldo Moura

    UNICAMP, Brazil

    Augusto Sampaio

    UFPE, Brazil

    Christiano Braga

    UFF, Brazil

    Clare Dixon

    University of Liverpool, UK

    Daltro Nunes

    UFRGS, Brazil

    David Deharbe

    ClearSy, France

    David Naumann

    Stevens Institute of Technology, USA

    Ewen Denney

    RIACS/NASA, USA

    Fernando Orejas

    UPC, Spain

    Harsh Beohar

    University of Duisburg, DE

    Hossein Hojjat

    RIT, USA

    Ilaria Castellani

    INRIA, FR

    Jan Friso Groote

    TU Eindhoven, NL

    Jan Oliver Ringert

    University of Leicester, UK

    Jim Davies

    University of Oxford, UK

    Jim Woodcock

    University of York, UK

    José Fiadeiro

    Royal Holloway, University of London, UK

    José Oliveira

    Universidade do Minho, Portugal

    Juliano Iyoda

    UFPE, Brazil

    Leila Ribeiro

    UFRGS, Brazil

    Leila Silva

    UFS, Brazil

    Luciana Foss

    UFPel, Brazil

    Luis Barbosa

    Universidade do Minho, Portugal

    Marcel Oliveira

    UFRN, Brazil

    Marcelo Maia

    UFU, Brazil

    Márcio Cornélio

    UFPE, Brazil

    Matteo Cimini

    University of Massachusetts Lowell, USA

    Michael Butler

    University of Southampton, UK

    Michael Leuschel

    Universität Düsseldorf, Germany

    Mohammad Mousavi

    University of Leicester, UK

    Narciso Marti-Oliet

    Universidad Complutense de Madrid, Spain

    Neeraj Singh

    McMaster University, Canada

    Patrícia Machado

    UFCG, Brazil

    Pedro D'Argenio

    University of Cordoba, AR

    Rachid Echahed

    CNRS at University of Grenoble, France

    Reiko Heckel

    University of Leicester, UK

    Robert Hierons

    Brunel University London,UK

    Rodrigo Machado

    UFRGS, Brazil

    Rohit Gheyi

    UFCG, Brazil

    Rolf Hennicker

    Ludwig-Maximilians-Universität München, Germany

    Sérgio Campos

    UFMG, Brazil

    Simone Cavalheiro

    UFPel, Brazil

    Sofiene Tahar

    Concordia University, Canada

    Stefan Hallerstede

    Aarhus University, Denmark

    Thierry Lecomte

    ClearSy, France

    Tiago Massoni

    UFCG, Brazil

    STEERING COMMITTEE

    Bill Roscoe

    University of Oxford, UK

    Leila Ribeiro

    UFRGS, Brazil

    Márcio Cornélio

    UFPE, Brazil

    Simone Cavalheiro

    UFPel, Brazil

    José Fiadeiro

    University of London, England

    Tiago Massoni

    UFCG, Brazil

    Mohammad Mousavi

    University of Leicester, UK

    Contact us

    DROP US A LINE

    Would you like to contact us?
    Visit Us

    Salvador, Bahia, BRAZIL

    Call Us

    +55 71 32836135

    © 2018 All rights reserved W3layouts

    img

    Jose Meseguer

    Formal Design of Cloud Computing Systems in Maude

    Computer Science Department University of Illinois at Urbana-Champaign, USA

    Abstract. Cloud computing systems are complex distributed systems whose design is challenging for two main reasons: (1) since they are distributed systems, a correct design is very hard to achieve by testing alone; and (2) cloud computing applications have high performance requirements such as low latency and high throughput; but this is hard to measure before implementation and hard to compare between different implementations. I will report on our experience on using formal specification in Maude and formal model checking analysis to quickly explore the design space of a cloud computing system to achieve a high quality design that: (1) has verified correctness guarantees; (2) has better performance properties than other design alternatives so explored; (3) can be achieved before any actual implementation; and (4) can be used for both rapid prototyping and for automatically code generation.

    Biographical sketch. Jose Meseguer received his Ph.D. in Mathematics from the University of Zaragoza, Spain. He is Professor of Computer Science at the University of Illinois at Urbana-Champaign (UIUC). Prior to moving to UIUC he was a Principal Scientist as the Stanford Research Institute (SRI), after having held postdoctoral positions at the University of California at Berkeley and IBM Research. He was also an Initiator Member of Stanford University's Center for the Study of Language and Information (CSLI).

    Meseguer has made fundamental contributions in the frontier between mathematical logic, executable formal specification and verification, declarative programming languages, programming methodology, programming language semantics, concurrency, and security. His work in all these areas, comprising over 375 publications, is very highly cited. His contributions to security include fundamental concepts such as nointerference, browser security verification, new algorithms and verification techniques to defend systems against Denial of Service (DoS) attacks, and new symbolic techniques to analyze cryptographic protocols modulo complex algebraic properties that have been embodied in the Maude-NPA Protocol Analyzer. He is the creator of rewriting logic, a very flexible computational logic to specify concurrent systems. The 2012 rewriting logic bibliography has over 1,000 publications. The Maude rewriting logic language is one of the most advanced and efficient executable formal specification languages worldwide. It supports a wide range of formal analyses, including symbolic simulation, search, model checking, and theorem proving. It is also an advanced declarative concurrent language with sophisticated object-oriented features and powerful module composition and reflective meta-programming capabilities. He, his collaborators, and other researchers have used Maude and its tool environment to build sophisticated systems and tools, and to specify and analyze many systems, including cryptographic protocols, network protocols, cloud computing systems, web browsers, cyber-physical systems, models of cell biology, executable formal semantics of programming and software modeling languages, formal analyzers for conventional code, theorem provers, and tools for interoperating different formal systems. He has given numerous invited lectures at international scientific meetings and has taught advanced courses on his research at leading American, British, German, Spanish, Italian, and Japanese universities and research centers. He has also served in numerous program committees of international scientific conferences and as editor of various scientific journals.

    CALL FOR PAPERS

    CALL FOR PAPERS

    21st Brazilian Symposium On Formal Methods (SBMF)
    Supported by the Brazilian Computer Society (SBC)
    Salvador-BA, Brazil
    26 to 30 of November 2018

    IMPORTANT DATES


    Paper Submission (EXTENDED) Deadline: **July 20th, 2018**
    Paper Acceptance Notification: August 28th, 2018
    Paper Camera-ready Version: September 11th, 2018

    INTRODUCTION

    SBMF 2018 is the twenty-first of a series of events devoted to the development, dissemination, and use of formal methods for the construction of high-quality computational systems. It is now a well-established event, with an international reputation.

    In 2018, SBMF will take place in Salvador, the capital of the Bahia state, northeast of Brazil. It is the 3rd city by population in Brazil, with over 2.9 million inhabitants, and it is the second most popular destination in Brazil for tourists.

    SCOPE AND TOPICS

    • The aim of SBMF is to provide a venue for the presentation and discussion of high-quality work in formal methods. The topics include (not limited to):
    • techniques and methodologies, such as method integration; software and hardware co-design; model-driven engineering; formal aspects of popular methodologies; formal design; development methodologies with formal foundations; software evolution based on formal methods;
    • specification and modeling languages, such as well-founded specification and design languages; formal aspects of popular languages; logic and semantics for programming and specification languages; code generation; formal methods of programming paradigms (such as objects, aspects, and component), formal methods for real-time, hybrid, and safety-critical systems, formal models of service-oriented, cloud-based, and cyber-physical systems;
    • theoretical foundations, such as domain theory; type systems and category theory; computational complexity of methods and models; computational models; term rewriting; models of concurrency, security and mobility;
    • verification and validation, such as abstraction, modularization and refinement techniques; program and test synthesis; correctness by construction; model checking; theorem proving; static analysis; formal techniques for software testing; software certification; formal techniques for software inspection;
    • Experience reports regarding teaching formal methods;
    • applications, such as experience reports on the use of formal methods; industrial case studies; tool support.

    PAPER SUBMISSION

    Papers should present unpublished and original work that has a clear contribution to the state of the art on the theory and practice of formal methods. They should not be simultaneously submitted elsewhere.

    Papers will be judged by at least three reviewers on the basis of originality, relevance, technical soundness and presentation quality, and should contain sound theoretical or practical results. Industry papers should emphasize practical application of formal methods or report on open challenges.

    Contributions should be written in English and be prepared using Springer’s Lecture Notes in Computer Science (LNCS) format. Papers may not exceed 16 pages (including figures, references, and appendix). Accepted papers will be published, after the conference, in a volume of LNCS. Also, a special issue of Science of Computer Programming (Elsevier) is going to be published for the very best papers.

    Every accepted paper MUST have at least one author registered in the symposium by the time the camera-ready copy is submitted; the registered author is also expected to attend the symposium and present the paper.

    Papers can be submitted via the following link: https://easychair.org/conferences/?conf=sbmf2018

    ABOUT SALVADOR

    Salvador's importance dates back to Brazilian colonization, as it was established as the country's first capital (founded in 1549). Its center is a living museum of 17th- and 18th-century architecture and gold-laden churches. Aside from the many attractions within Salvador (Pelourinho, Modelo Public Market, Lacerda elevator, Church of Nosso Senhor do Bonfim), gorgeous coastline lies right outside the city – a suitable introduction to the tropical splendor of the state of Bahia.

    Salvador presents a vibrant musical scene and popular Carnival celebrations, being considered one of the birthplaces of Brazilian culture.

    img

    Alexandre Mota

    Alexandre Mota received his PhD degree in Computer Science from Universidade Federal de Pernambuco. The Brazilian Computer Society (SBC) awarded his PhD thesis. Since 2001 he is a professor of the Informatics Center (CIn) at Universidade Federal de Pernambuco. He holds a scholarship as Technological Productive Researcher from CNPq (the Brazilian National Research Agency), since 2012.

    His research interests include the process algebra CSP, testing and model checking, theorem proving, formal modelling and refinement, dependability, and Experimental Software Engineering, based on tests and probabilistic simulations.

    From 2005 to 2009 he has collaborated as a researcher in a research project between CIn and Motorola Mobility, focused on testing mobile phones (Stress and GUI-­‐based testing). From 2011 to 2014 he was a deputy (Brazilian side) of the COMPASS Project (Comprehensive Modelling for Advanced Systems of Systems), financed by the European Community FP7. And since 2006 he has been collaborating with Embraer, focusing on safety assessment and model-based testing. He is now coordinating as well as collaborating as a researcher in a new research project initiative between CIn and Motorola Mobility towards smartphone testing that started since 2015.

    Title: The pragmatic dimension of Formal Methods: Tools Abstract: Formal methods are mathematically based languages, tools and techniques for the specification, development and verification of systems. To become practical, formal methods are supported by software tools: static analysers, model checkers, theorem provers, proof checkers, etc. Based on these tools and on the reuse principle of Software Engineering, during the years we have created several solutions that were applied from INPE (National Institute for Space Research) to Embraer. But the formal tools we have used to base our own work were developed as any software system, that is, ad hoc (and sometimes, semi-formally). In this talk we present these works and also some reasons formal tools are not developed formally and what we should do in the future to better convince others (and ourselves) to use formal methods to develop our own tools.

    img

    Jim Davies

    Jim Davies is Professor of Software Engineering at the University of Oxford, and a group leader within the Oxford Big Data Institute. He is leading a national programme of infrastructure development - the NIHR Health Informatics Collaborative - aimed at improving the quality and availability of routinely-collected data for translational research. He was Chief Technology Officer of Genomics England Limited from 2013 to 2017. His research interests include model-driven engineering, process modelling, and health data science.


    Title: Formal methods in health data science

    Progress in the field of human health is increasingly reliant upon the acquisition, processing, and analysis of large volumes of complex, heterogeneous data. This represents a significant research challenge. The validity of our results, the correctness of our processing, and the safety of our applications all rely upon an adequate understanding of the data: its intended interpretation, and the context in which it is acquired. Interpretations may vary, context is infinite, and both may change over time.

    Formal methods have an important role to play in addressing this challenge. In particular, set-theoretic notions of abstract data types and data refinement support the development of tools and theories for capturing our understanding of data and ensuring it is correctly reflected in any acquisition, processing, and analysis. In this talk, we will introduce a theory of real-world data semantics, and explain how it has been applied in the design and delivery of national programmes in health science.

    img

    MOHAMMAD MOUSAVI

    Mohammad got his Ph.D. in Computer Science from Eindhoven University of Technology, The Netherlands in 2005. Since then he held positions at Reykjavik University (postdoctoral researcher), Eindhoven University of Technology (assistant and associate professor), Delft University of Technology (guest faculty member), Halmstad University (professor of Computer Systems Engineering), and Chalmers / University of Gothenburg (guest professor of Software Engineering). Mohammad's main research area is in model-based testing, particularly applied to software product lines and cyber-physical systems.


    Title: Conformance Testing as a Tool for Designing Connected Vehicle Functions

    Abstract: Connected and Autonomosu Vehicles (CAV) are taking a central position in the landscape of intelligent mobility and their rigorous verification and validation is one of the main challenges in their public deployment and social acceptance. Conformance testing is a rigorous verification technique that has been widely tried in various critical applications. In this talk, we examin the adaptations and extensions of conformance testing techniques that make them suitable for application in the CAV domain. We present how the extended techniques can be used in the design of connected vehicle functions and verify various design decisions.

    Accepted Papers

    Source Code Analysis with a Temporal Extension of First-Order Logic

    David Come, Julien Brunel and David Doose

    A Type-Directed Algorithm to Generate Well-Typed Featherweight Java Programs

    Samuel Feitosa, Rodrigo Geraldo Ribeiro and Andre Rauber Du Bois

    Programming Language Foundations in Agda

    Philip Wadler

    Formal Verification of n-bit ALU using Theorem Proving

    Sumayya Shiraz and Osman Hasan

    The Scallina Grammar - Towards a Scala Extraction for Coq

    Youssef El Bakouny and Dany Mezher.

    VDM at large: Modelling the EMV(R) 2nd Generation Kernel

    Leo Freitas

    Constraint Reusing and k-induction for Three-Valued Bounded Model Checking

    Nils Timm, Stefan Gruner and Matthias Harvey

    TeSSLa: Temporal Stream-based Specification Language

    Lukas Convent, Sebastian Hungerecker, Martin Leucker, Torben Scheffel, Malte Schmitz and Daniel Thoma

    Automatic Test Case Generation for Concurrent Features from Natural Language Descriptions

    Rafaela Almeida, Sidney Nogueira and Augusto Sampaio

    A Methodology for Protocol Verification applied to EMV

    Leo Freitas, Paolo Modesti and Martin Emms

    Analysing RoboChart with Probabilities

    Madiel Conserva Filho, Rafael Marinho, Alexandre Mota and Jim Woodcock

    Timed Scenarios: Consistency, Equivalence and Optimization

    Neda Saeedloei and Feliks Kluzniak

    Safe and Constructive Design with UML Components

    Flávia Falcão, Lucas Lima and Augusto Sampaio

    Formal modelling of environment restrictions from natural-language requirements

    Tainã Santos, Gustavo Carvalho and Augusto Sampaio

    History

    In 2018, SBMF reaches the 21st edition of a well established meeting for both the Brazilian and the international researchers on Formal Methods. SBMF started as the Workshop on Formal Methods (WMF) in 1998 and became the Brazilian Symposium on Formal Methods (SBMF) in 2004.


    Edition City Year Proceedings Special Edition
    XX SBMF Recife - PE 2017 LNCS 10623
    XIX SBMF Natal - RN 2016 LNCS 10090
    XVIII SBMF Belo Horizonte - MG 2015 LNCS 9526
    XVII SBMF Maceió - AL 2014 LNCS 8941
    XVI SBMF Brasília - DF 2013 LNCS 8195 SCP - Volumes 107 and 108
    XV SBMF Natal - RN 2012 LNCS 7498 SCP - Volumes 107 and 108
    XIV SBMF São Paulo - SP 2011 LNCS 7021 SCP - Volume 92, Part B
    XIII SBMF Natal - RN 2010 LNCS 6527
    XII SBMF Gramado - RS 2009 LNCS 5902
    XI SBMF Salvador - BA 2008 SCP - Volume 77 Issue 4
    X SBMF Ouro Preto - MG 2007 ENTCS Vol 240
    IX SBMF Natal - RN 2006 ENTCS Vol 195
    VIII SBMF Porto Alegre - RS 2005 ENTCS Vol 184
    VII SBMF Recife - PE 2004 ENTCS Vol 130
    VI WMF Campina Grande - PB 2003 ENTCS Vol 95
    V WMF Gramado - RS 2002 Repository
    IV WMF Rio de Janeiro - RJ 2001
    III WMF João Pessoa - PB 2000
    II WMF Florianópolis - SC 1999
    I WMF Porto Alegre - RS 1998

    Registration Fees

    The following table presents the "only SBMF 2018", "only ETMF 2018" and "SBMF 2018 + ETMF 2018" registration fees. It is important to note that these values consider the CEMF discount.

    REGISTRATION INFORMATION

    • The registration payment will be blocked while the request is being analysed. When approved, the attendee shall proceed with the payment in order to conclude the registration process.
    • Moreover, attendees (affiliated to institutions, organisations and companies located in Brazil) that are not members of the SBC, but are willing to become, can register to the event and subscribe to the SBC membership simultaneously. In this case (COMBO option), the corresponding SBC membership fee (i.e., undergraduate student = R$ 20.00, graduate student = R$ 80.00, or professional = R$ 210.00) is added to the registration fee. It is important to note that in such a situation the attendee will already benefit from the discount prices exclusive for SBC members.
    • Attendees (affiliated to institutions, organisations and companies located in Brazil), whose SBC membership expires within the next 90 days, can also renew the association and register for the event simultaneously. In such cases, one needs to choose the COMBO option.

    Student confirmation: when registering, students need to provide proof of enrollment. If also applying to the CEMF Grant, both documents (discount request and enrollment proof) need to be uploaded as a single file.
    Authors of accepted papers: at least one author of each accepted paper shall register to the conference.
    Benefits of each category:

    • Students (only SBMF, only ETMF, SBMF + ETMF): conference kit + coffee break
    • Professional (only ETMF): conference kit + coffee break
    • Professional (only SBMF, SBMF + ETMF): conference kit + coffee break + social dinner + SBMF proceedings

    Optional:

    • Extra copies of the SBMF proceedings may be purchased individually for R$ 200.00 (upon availability).
    • Extra vouchers for the social dinner may be purchased individually for R$ 200.00 (upon availability).

    REGISTRATION LINK

    • CEMF discount (affiliated to institutions, organisations and companies located in Brazil): application form (EN | BR)
    • Registration system 1: ECOS-1 (applying for the CEMF grant - affiliated to institutions located in Brazil)

    Note: when creating a user account (required step for proceeding with the registration), the registration system checks whether the attendee institution/university is one from the SBC database. If this is not the case, one will see the following error message: "Please select a valid institution name". In such a situation, we kindly ask the attendee to send us an email (see Contact below) with the institution/university name to be added to the base.


    Registration Fees

    The following table presents the "only SBMF 2018", "only ETMF 2018" and "SBMF 2018 + ETMF 2018" registration fees. It is important to note that these values DO NOT consider the CEMF discount

    REGISTRATION INFORMATION

    • The registration payment will be blocked while the request is being analysed. When approved, the attendee shall proceed with the payment in order to conclude the registration process.

      Student confirmation: when registering, students need to provide proof of enrollment.
      Authors of accepted papers: at least one author of each accepted paper shall register to the conference.
      Benefits of each category:

      • Students (only SBMF, only ETMF, SBMF + ETMF): conference kit + coffee break
      • Professional (only ETMF): conference kit + coffee break
      • Professional (only SBMF, SBMF + ETMF): conference kit + coffee break + social dinner + SBMF proceedings

    Optional:

    • Extra copies of the SBMF proceedings may be purchased individually for R$ 200.00 (upon availability).
    • Extra vouchers for the social dinner may be purchased individually for R$ 200.00 (upon availability).

    REGISTRATION LINK

    • Registration system: ECOS-2 (not applying for the CEMF grant)

    Note: when creating a user account (required step for proceeding with the registration), the registration system checks whether the attendee institution/university is one from the SBC database. If this is not the case, one will see the following error message: "Please select a valid institution name". In such a situation, we kindly ask the attendee to send us an email (see Contact below) with the institution/university name to be added to the base.

    III ETMF 2018 - 26 E 27 DE NOVEMBRO DE 2018 - SALVADOR, BA, BRASIL

    EVENTO SATÉLITE DO SIMPÓSIO BRASILEIRO DE MÉTODOS FORMAIS (SBMF)

    A Terceira Escola de Informática Teórica e Métodos Formais (ETMF 2018) é uma promoção conjunta da Universidade Federal da Bahia (UFBA) e Universidade Federal de Pernambuco (UFPE). A escola é um evento satélite do Simpósio Brasileiro de Métodos formais e visa congregar estudantes e pesquisadores para divulgar e promover aspectos teóricos da computação, particularmente:

  • qualificar a formação de estudantes e profissionais nas áreas que compõem a informática teórica;
  • prover um fórum onde possam ser apresentados os trabalhos em andamento nessas áreas, recebendo retorno de outros pesquisadores.
  • Programa

    Segunda-feira 26/11
    08:30 - 09:00 Credenciamento
    09:00 - 10:30 Minicurso 1 (Parte 1) - Thierry Lecomte
    10:30 - 11:00 Intervalo
    11:00 - 12:30 Minicurso 2 (Parte 1) - Gustavo Carvalho
    14:00 - 15:30 Minicurso 1 (Parte 2) - Thierry Lecomte
    15:30 - 16:00 Intervalo
    16:00 - 17:30 Minicurso 2 (Parte 2) - Gustavo Carvalho

    Terça-feira 27/11
    08:30 - 09:00 Credenciamento
    09:00 - 10:30 Minicurso 3 (Parte 1) - Mohammad Reza Mousavi
    10:30 - 11:00 Intervalo
    11:00 - 12:30 Minicurso 4 (Parte 1) - Marlo Souza
    14:00 - 15:30 Minicurso 3 (Parte 2) - Mohammad Reza Mousavi
    15:30 - 16:00 Intervalo
    16:00 - 17:30 Minicurso 4 (Parte 2) - Marlo Souza

    Minicursos


    MINICURSO 01: O sistema de provas Atelier B e suas melhorias
    Palestrante: Thierry Lecomte (ClearSy Systems Engineering)
    Resumo: Um desenvolvimento formal exige que diferentes aspectos sejam verificados usando provas matemáticas. O Atelier B produz automaticamente várias obrigações de prova (POs). Para ajudar o usuário a provar estas obrigações, o Atelier B incluiu um provador de teoremas desde o seu início. Esse provador de teorema "histórico" é um mecanismo de inferência e um banco de dados de regras (extensível). O sistema foi certificado no domínio ferroviário por revisão de especialistas. A arquitetura do provador de teoremas é construída de tal forma que pode ser usada interativa ou automaticamente em diferentes níveis. Durante este tutorial “mão na massa", serão apresentados o sistema de provas Atelier B, baseado neste provador de teoremas, bem como algumas capacidades de interação, além de experimentação com vários exemplos significativos. Uma atenção especial será dada aos mecanismos de automação e extensão que permitem facilitar o trabalho de prova e reduzir o tempo para concluir a demonstração de obrigações de prova.

     

    MINICURSO 02: Reasoning with the Coq proof assistant
    Palestrante: Gustavo Carvalho, CIn-UFPE, Brazil
    Resumo: Coq é um provador de teoremas interativo para auxiliar no desenvolvimento de provas verificadas por máquinas. Entre suas muitas aplicações, ele pode ser usado para certificar propriedades de linguagens de programação e para provar a correção de algoritmos. Neste breve curso, abordaremos os conceitos básicos do Coq: definições indutivas, programação funcional com o Coq e a linguagem de táticas.

     

    MINICURSO 03: Model-Based Testing: From Theory to Practice and Back 
    Palestrante: Mohammad Reza Mousavi,  University of Leicester, UK 

    Resumo: Teste e depuração respondem por mais da metade dos custos de desenvolvimento de software e estão se tornando sérios gargalos no processo de desenvolvimento de software. O problema é intensificado para sistemas embarcados e ciber-físicos devido à complexa interação entre software, hardware e o mundo físico. No estado atual da prática, os sistemas embarcados e ciber-físicos são frequentemente testados muito tarde no processo, ou testados de menos, de maneira ad-hoc e não-estruturada. Uma solução promissora para estes problemas está nos processos automatizados de Testes Baseados em Modelos (MBT), que fornecem uma abordagem estruturada para testes de modelos comportamentais de alto nível. Neste tutorial, começaremos com os princípios básicos de testes de software e sistema. Em seguida, apresentaremos os fundamentos de testes baseados em modelos e uma visão geral dos modelos e ferramentas atualmente disponíveis. A parte avançada do tutorial se concentrará em duas áreas de pesquisa em evolução: a primeira diz respeito ao teste de linhas de produtos de software, que envolve lidar com a grande variabilidade e formas eficazes de tratá-las. A segunda área envolve testes de sistemas ciberfísicos, onde não apenas o comportamento discreto do sistema de computador precisa ser testado, mas também sua interação com o comportamento contínuo dos componentes físicos precisa ser levada em conta.


    MINICURSO 04: Completeza e Complexidade de sistemas dedutivos para Lógicas Modais, Multimodais e de Descrição
    Palestrante: Marlo Souza, UFBA, Brazil
    Resumo: Lógicas Modais são uma família de lógicas não verifuncionais que possuem um operador de qualificação de informação, como 'é necessário que', 'é desejável que', ou 'sabe-se que'. Tais lógicas vêm recebendo crescente atenção de áreas como a Filosofia, a Ciência da Computação e a Inteligência Artificial dada a flexibilidade, expressividade e interessantes propriedades computacionais que possuem, sendo aplicadas como linguagens que fundamentam teorias e sistemas de Especificação e Verificação Formal, Representação do Conhecimento e Sistemas Cognitivos. Enquanto para algumas lógicas modais, sistemas de dedutivos com complexidade computacional conhecida são facilmente obtidos através de resultados canônicos da teoria da correspondência, tais resultados já não fornecem ferramentas necessárias para contemplar a diversidade de lógicas modais propostas na literatura atual. Particularmente, tais resultados não podem ser aplicados para analisar lógicas  modais com aplicações interessantes na Ciência da Computação e Inteligência Artificial, como lógicas de preferências bem-fundadas usadas em raciocínio não-monotônico, ou lógicas de descrição  usadas em representação de conhecimento. Prover, então, sistemas dedutivos completos para tais lógicas e analisar sua complexidade computacional se torna um problema não trivial. Este tutorial almeja explorar resultados clássicos da teoria de correspondência para lógicas modais proposicionais, como modelos canônicos, exemplos de axiomas não canônicos e combinação de lógicas modais  para prover resultados de completeza e complexidade de lógicas modais, multimodais e de descrição bem conhecidas.