{"id":2207,"date":"2019-06-24T15:31:50","date_gmt":"2019-06-24T15:31:50","guid":{"rendered":"http:\/\/formalmethods2019.inesctec.pt\/?page_id=2207"},"modified":"2020-03-25T19:29:53","modified_gmt":"2020-03-25T19:29:53","slug":"accepted-papers","status":"publish","type":"page","link":"http:\/\/formalmethods2019.inesctec.pt\/accepted-papers\/","title":{"rendered":"Accepted Papers"},"content":{"rendered":"

The table below lists all invited talks and papers accepted for presentation at FM’19<\/strong> events.<\/p>\n


\n\n\n\n\n\t\n\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t
Event<\/strong><\/th>Title<\/strong><\/th>Author(s)<\/strong><\/th>\n<\/tr>\n<\/thead>\n
FM 2019<\/strong><\/a><\/td>A Parametric Rely-guarantee Reasoning Framework for Concurrent Reactive Systems<\/td>Yongwang Zhao<\/a>, David Sanan<\/a>, Fuyuan Zhang and Yang Liu<\/a><\/td>\n<\/tr>\n
FM 2019<\/strong><\/a><\/td>A Provably Correct Floating-Point Implementation of a Point-in-Polygon Algorithm<\/td>Mariano Moscato<\/a>, Laura Titolo<\/a>, Marco Antonio Feliu Gabaldon and C\u00e9sar Mu\u00f1oz<\/a><\/td>\n<\/tr>\n
FM 2019<\/strong><\/a><\/td>APML: An Architecture Proof Modelling Language<\/td>Diego Marmsoler<\/a> and Genc Blakqori<\/a><\/td>\n<\/tr>\n
FM 2019<\/strong><\/a><\/td>Abstract Execution<\/td>Dominic Steinh\u00f6fel<\/a> and Reiner H\u00e4hnle<\/a><\/td>\n<\/tr>\n
FM 2019<\/strong><\/a><\/td>Abstraction and Subsumption in Modular Verification of C Programs<\/td>Lennart Beringer<\/a> and Andrew W. Appel<\/a><\/td>\n<\/tr>\n
FM 2019<\/strong><\/a><\/td>Alloy*: a general-purpose higher-order relational constraint solver (Journal First Track)<\/td>Aleksandar Milicevic<\/a>, Joseph P. Near<\/a>, Eunsuk Kang<\/a> and Daniel Jackson<\/a><\/td>\n<\/tr>\n
FM 2019<\/strong><\/a><\/td>An Axiomatic Approach to Liveness for Differential Equations<\/td>Yong Kiam Tan<\/a> and Andr\u00e9 Platzer<\/a><\/td>\n<\/tr>\n
FM 2019<\/strong><\/a><\/td>Circus2CSP: a Tool for Model-Checking Circus using FDR<\/td>Artur Gomes and Andrew Butterfield<\/a><\/td>\n<\/tr>\n
FM 2019<\/strong><\/a><\/td>Compositional verification of concurrent systems combining divbranching and strong bisimulations<\/td>Fr\u00e9d\u00e9ric Lang<\/a>, Radu Mateescu<\/a> and Franco Mazzanti<\/a><\/td>\n<\/tr>\n
FM 2019<\/strong><\/a><\/td>Concolic Testing Heap-Manipulating Programs<\/td>Long Hong Pham<\/a>, Quang Loc Le<\/a>, Quoc-Sang Phan<\/a> and Jun Sun<\/a><\/td>\n<\/tr>\n
FM 2019<\/strong><\/a><\/td>Conditions of contracts for separating responsibilities in heterogeneous systems (Journal First Track)<\/td>Jonas Westman<\/a> and Mattias Nyberg<\/a><\/td>\n<\/tr>\n
FM 2019<\/strong><\/a><\/td>Controlling Large Boolean Networks with Temporary and Permanent Perturbations<\/td>Cui Su<\/a>, Soumya Paul<\/a> and Jun Pang<\/a><\/td>\n<\/tr>\n
FM 2019<\/strong><\/a><\/td>Counterexample-Driven Synthesis for Probabilistic Program Sketches<\/td>Milan Ceska<\/a>, Christian Dehnert, Sebastian Junges<\/a> and Joost-Pieter Katoen<\/a><\/td>\n<\/tr>\n
FM 2019<\/strong><\/a><\/td>Embedding High-Level Formal Specifications into Applications<\/td>Philipp Koerner<\/a>, Jens Bendisposto<\/a>, Jannik Dunkelau, Sebastian Krings<\/a> and Michael Leuschel<\/a><\/td>\n<\/tr>\n
FM 2019<\/strong><\/a><\/td>Equilibria-based Probabilistic Model Checking for Concurrent Stochastic Games<\/td>Marta Kwiatkowska<\/a>, Gethin Norman<\/a>, David Parker<\/a> and Gabriel Santos<\/a><\/td>\n<\/tr>\n
FM 2019<\/strong><\/a><\/td>Formal Methods for Security Functionality and for Secure Functionality (Invited Talk) <\/img><\/a><\/td>Erik Poll<\/a><\/td>\n<\/tr>\n
FM 2019<\/strong><\/a><\/td>Formal Semantics Extraction from Natural Language Specifications for ARM<\/td>Viet Anh Vu<\/a> and Mizuhito Ogawa<\/a><\/td>\n<\/tr>\n
FM 2019<\/strong><\/a><\/td>Formally Verified Roundoff Errors using SMT-based Certificates and Subdivisions<\/td>Joachim Bard<\/a>, Heiko Becker<\/a> and Eva Darulova<\/a><\/td>\n<\/tr>\n
FM 2019<\/strong><\/a><\/td>From LTL to Unambiguous B\u00fcchi Automata via Disambiguation of Alternating Automata<\/td>Simon Jantsch<\/a>, David M\u00fcller, Christel Baier<\/a> and Joachim Klein<\/a><\/td>\n<\/tr>\n
FM 2019<\/strong><\/a><\/td>GOSPEL - Providing OCaml with a Formal Specification Language<\/td>Arthur Chargu\u00e9raud<\/a>, Jean-Christophe Filli\u00e2tre<\/a>, Cl\u00e1udio Louren\u00e7o<\/a> and M\u00e1rio Pereira<\/a><\/td>\n<\/tr>\n
FM 2019<\/strong><\/a><\/td>GR(1)*: GR(1) Specifications Extended with Existential Guarantees<\/td>Gal Amram<\/a>, Shahar Maoz<\/a> and Or Pistiner<\/a><\/td>\n<\/tr>\n
FM 2019<\/strong><\/a><\/td>Generic Partition Refinement and Weighted Tree Automata<\/td>Hans-Peter Deifel<\/a>, Stefan Milius<\/a>, Lutz Schr\u00f6der<\/a> and Thorsten Wi\u00dfmann<\/a><\/td>\n<\/tr>\n
FM 2019<\/strong><\/a><\/td>Gray-box Monitoring of Hyperproperties<\/td>Sandro Stucki<\/a>, C\u00e9sar S\u00e1nchez<\/a>, Gerardo Schneider<\/a> and Borzoo Bonakdarpour<\/a><\/td>\n<\/tr>\n
FM 2019<\/strong><\/a><\/td>How Hard is Finding Shortest Counter-Example Lassos in Model Checking?<\/td>R\u00fcdiger Ehlers<\/a><\/td>\n<\/tr>\n
FM 2019<\/strong><\/a><\/td>IELE: A Rigorously Designed Language and Tool Ecosystem for the Blockchain<\/td>Theodoros Kasampalis<\/a>, Dwight Guth, Brandon Moore<\/a>, Traian Florin Serbanuta<\/a>, Yi Zhang<\/a>, Daniele Filaretti, Virgil Serbanuta, Ralph Johnson and Grigore Ro\u015fu<\/a><\/td>\n<\/tr>\n
FM 2019<\/strong><\/a><\/td>L*-Based Learning of Markov Decision Processes<\/td>Martin Tappler<\/a>, Bernhard K. Aichernig<\/a>, Giovanni Bacci<\/a>, Maria Eichlseder and Kim Guldstrand Larsen<\/a><\/td>\n<\/tr>\n
FM 2019<\/strong><\/a><\/td>Learning Deterministic Variable Automata over Infinite Alphabets<\/td>Sarai Sheinvald<\/a><\/td>\n<\/tr>\n
FM 2019<\/strong><\/a><\/td>Local Consistency Check in Dataflow Models<\/td>Dina Irofti and Paul Dubrulle<\/a><\/td>\n<\/tr>\n
FM 2019<\/strong><\/a><\/td>Mechanically Verifying the Fundamental Liveness Property of the Chord Protocol<\/td>Jean-Paul Bodeveix<\/a>, Julien Brunel<\/a>, David Chemouil<\/a> and Mamoun Filali-Amine<\/a><\/td>\n<\/tr>\n
FM 2019<\/strong><\/a><\/td>On the Nature of Symbolic Execution<\/td>Frank de Boer<\/a> and Marcello Bonsangue<\/a><\/td>\n<\/tr>\n
FM 2019<\/strong><\/a><\/td>Optimization and Synthesis of Railway Signaling Layout from Local Capacity Specifications<\/td>Bj\u00f8rnar Luteberget<\/a>, Christian Johansen<\/a> and Martin Steffen<\/a><\/td>\n<\/tr>\n
FM 2019<\/strong><\/a><\/td>Parallel Composition and Modular Verification of Periodic Components in Differential Dynamic Logic<\/td>Simon Lunel, Stefan Mitsch<\/a>, Beno\u00eet Boyer and Jean-Pierre Talpin<\/a><\/td>\n<\/tr>\n
FM 2019<\/strong><\/a><\/td>Pegasus: A Framework for Sound Continuous Invariant Generation<\/td>Andrew Sogokon<\/a>, Stefan Mitsch<\/a>, Yong Kiam Tan<\/a>, Katherine Cordwell<\/a> and Andr\u00e9 Platzer<\/a><\/td>\n<\/tr>\n
FM 2019<\/strong><\/a><\/td>Quantitative Verification of Numerical Stability for Kalman Filters<\/td>Alexandros Evangelidis<\/a> and David Parker<\/a><\/td>\n<\/tr>\n
FM 2019<\/strong><\/a><\/td>Reasoning Formally about Database Queries and Updates<\/td>Jon Hael Brenas, Rachid Echahed<\/a> and Martin Strecker<\/a><\/td>\n<\/tr>\n
FM 2019<\/strong><\/a><\/td>Service-Oriented Architecture and The Button Problem<\/td>Sung-Shik Jongmans<\/a>, Arjan Lamers<\/a> and Marko Van Eekelen<\/a><\/td>\n<\/tr>\n
FM 2019<\/strong><\/a><\/td>Star-Based Reachability Analysis of Deep Neural Networks<\/td>Hoang-Dung Tran<\/a>, Diego Manzanas Lopez, Patrick Musau, Xiao Dong Yang, Luan Nguyen, Weiming Xiang and Taylor T Johnson<\/a><\/td>\n<\/tr>\n
FM 2019<\/strong><\/a><\/td>Static Analysis for Detecting High-Level Races in RTOS Kernels<\/td>Abhishek Singh, Rekha Rama Pai<\/a>, Deepak D'Souza<\/a> and Meenakshi D'Souza<\/a><\/td>\n<\/tr>\n
FM 2019<\/strong><\/a><\/td>Successes in Deployed Verified Software (and Insights on Key Social Factors) (Invited Talk) <\/img><\/a><\/td>June Andronick<\/a><\/td>\n<\/tr>\n
FM 2019<\/strong><\/a><\/td>The Human in Formal Methods (Invited Talk) <\/img><\/a><\/td>Shriram Krishnamurthi<\/a><\/td>\n<\/tr>\n
FM 2019<\/strong><\/a><\/td>Towards a model-checker for Circus<\/td>Artur Gomes and Andrew Butterfield<\/a><\/td>\n<\/tr>\n
FM 2019<\/strong><\/a><\/td>Unification in Matching Logic<\/td>Andrei Arusoaie<\/a> and Dorel Lucanu<\/a><\/td>\n<\/tr>\n
FM 2019<\/strong><\/a><\/td>Unifying separation logic and region logic to allow interoperability (Journal First Track)<\/td>Yuyan Bao<\/a>, Gary T. Leavens<\/a> and Gidon Ernst<\/a><\/td>\n<\/tr>\n
FM 2019<\/strong><\/a><\/td>Value-dependent information-flow security on weak memory models<\/td>Graeme Smith<\/a>, Nicholas Coughlin<\/a> and Toby Murray<\/td>\n<\/tr>\n
FM 2019<\/strong><\/a><\/td>Verifying Correctness of Persistent Concurrent Data Structures<\/td>John Derrick<\/a>, Simon Doherty<\/a>, Brijesh Dongol<\/a>, Gerhard Schellhorn<\/a> and Heike Wehrheim<\/a><\/td>\n<\/tr>\n
DS 2019<\/strong><\/a><\/td>Automata-Theoretic Protocol Programming (Invited Talk)<\/td>Sung-Shik Jongmans<\/a><\/td>\n<\/tr>\n
DS 2019<\/strong><\/a><\/td>Blockmania QED.<\/td>Maria Anna Schett<\/a><\/td>\n<\/tr>\n
DS 2019<\/strong><\/a><\/td>Data Types in Logic Programming<\/td>Jo\u00e3o Barbosa<\/a><\/td>\n<\/tr>\n
DS 2019<\/strong><\/a><\/td>Delayed Hybrid Systems<\/td>Erzana Berani Abdelwahab<\/a><\/td>\n<\/tr>\n
DS 2019<\/strong><\/a><\/td>Discrete Polymorphism with Gradual Typing<\/td>Pedro Jorge Fernandes \u00c2ngelo<\/a><\/td>\n<\/tr>\n
DS 2019<\/strong><\/a><\/td>Formal Verification of Autonomous Driving Systems<\/td>Yuvaraj Selvaraj<\/a><\/td>\n<\/tr>\n
DS 2019<\/strong><\/a><\/td>Passlab: A Password Security Tool for the Blue Team<\/td>Saul Johnson<\/a><\/td>\n<\/tr>\n
DS 2019<\/strong><\/a><\/td>Provable cyber security for industrial control systems<\/td>Tomas Kulik<\/a><\/td>\n<\/tr>\n
DS 2019<\/strong><\/a><\/td>Robustness Verification of Support Vector Machines<\/td>Marco Zanella<\/a><\/td>\n<\/tr>\n
DS 2019<\/strong><\/a><\/td>Static Analysis of Python Programs<\/td>Rapha\u00ebl Monat<\/a><\/td>\n<\/tr>\n
DS 2019<\/strong><\/a><\/td>Synthesising Monitors for Autonomous Traffic<\/td>Christopher Bischopink<\/a><\/td>\n<\/tr>\n
i-Day 2019<\/strong><\/a><\/td>Adopting Formal Methods in an Industrial Setting: the Railways Case<\/td>Maurice ter Beek<\/a>, Alessandro Fantechi<\/a>, Alessio Ferrari<\/a>, Stefania Gnesi<\/a> and Franco Mazzanti<\/a><\/td>\n<\/tr>\n
i-Day 2019<\/strong><\/a><\/td>Formal Conceptual Modelling: Industrial Application of Event-B to a Wayside Train Monitoring System<\/td>Robert Eschbach<\/a><\/td>\n<\/tr>\n
i-Day 2019<\/strong><\/a><\/td>Formal Methods Applicability on Space Applications Specification and Implementation using MORA-TSP<\/td>Daniel Silveira<\/a>, Andreas Jung, Marcel Verhoef<\/a> and Tiago Jorge<\/a><\/td>\n<\/tr>\n
i-Day 2019<\/strong><\/a><\/td>Formal Models as Executable Prototypes and Interactive Requirements Documents (Invited Talk)<\/td>Michael Leuschel<\/a><\/td>\n<\/tr>\n
i-Day 2019<\/strong><\/a><\/td>On the Role of Formal Methods in Assuring Autonomous Systems That Use Machine Learning (Invited Talk)<\/td>Constance Heitmeyer<\/a><\/td>\n<\/tr>\n
i-Day 2019<\/strong><\/a><\/td>Practical Application of SPARK to OpenUxAS<\/td>M. Anthony Aiello<\/a>, Claire Dross, Patrick Rogers, Laura Humphrey<\/a> and James Hamil<\/td>\n<\/tr>\n
i-Day 2019<\/strong><\/a><\/td>Property-Driven Software Analysis<\/td>Mathieu Comptier, David D\u00e9harbe<\/a>, Paulin Fournier and Julien Molinero-Perez<\/td>\n<\/tr>\n
LOPSTR 2019<\/strong><\/a><\/td>A Certified Functional Nominal C-Unification Algorithm<\/td>Mauricio Ayala-Rincon<\/a>, Maribel Fern\u00e1ndez<\/a>, Gabriel Silva<\/a> and Daniele Nantes-Sobrinho<\/td>\n<\/tr>\n
LOPSTR 2019<\/strong><\/a><\/td>A General Framework for Static Cost Analysis of Parallel Logic Programs<\/td>Maximiliano Klemen<\/a>, Pedro Lopez-Garcia<\/a>, John Gallagher<\/a>, Jose F. Morales<\/a> and Manuel Hermenegildo<\/a><\/td>\n<\/tr>\n
LOPSTR 2019<\/strong><\/a><\/td>A Port Graph Rewriting Approach toRelational Database Modelling<\/td>Janos Varga<\/a>, Maribel Fern\u00e1ndez<\/a> and Bruno Pinaud<\/a><\/td>\n<\/tr>\n
LOPSTR 2019<\/strong><\/a><\/td>An Integrated Approach to Assertion-Based Random Testing in Prolog<\/td>Ignacio Casso<\/a>, Jose F. Morales<\/a> and Manuel Hermenegildo<\/a><\/td>\n<\/tr>\n
LOPSTR 2019<\/strong><\/a><\/td>An Optional Static Type System for Prolog<\/td>Isabel Wingen and Philipp Koerner<\/a><\/td>\n<\/tr>\n
LOPSTR 2019<\/strong><\/a><\/td>Blockchain Superoptimizer<\/td>Julian Nagele<\/a> and Maria Anna Schett<\/a><\/td>\n<\/tr>\n
LOPSTR 2019<\/strong><\/a><\/td>Computing Abstract Distances in Logic Programs<\/td>Ignacio Casso<\/a>, Jose F. Morales<\/a>, Pedro Lopez-Garcia<\/a> and Manuel Hermenegildo<\/a><\/td>\n<\/tr>\n
LOPSTR 2019<\/strong><\/a><\/td>Generalization-driven semantic clone detection in CLP (Extended Abstract)<\/td>Wim Vanhoof<\/a> and Gonzague Yernaux<\/a><\/td>\n<\/tr>\n
LOPSTR 2019<\/strong><\/a><\/td>Horn clauses and tree automata for imperative program verification (Invited Talk) <\/img><\/a><\/td>John Gallagher<\/a><\/td>\n<\/tr>\n
LOPSTR 2019<\/strong><\/a><\/td>Incremental Analysis of Logic Programs with Assertions and Open Predicates<\/td>Isabel Garcia-Contreras<\/a>, Jose F. Morales<\/a> and Manuel Hermenegildo<\/a><\/td>\n<\/tr>\n
LOPSTR 2019<\/strong><\/a><\/td>Logic-Based Synthesis of Fair Voting Rules Using Composable Modules<\/td>Karsten Diekhoff, Michael Kirsten<\/a> and Jonas Kr\u00e4mer<\/td>\n<\/tr>\n
LOPSTR 2019<\/strong><\/a><\/td>Modeling and Reasoning in Event Calculus Using Goal-Directed Constraint Answer Set Programming<\/td>Joaquin Arias<\/a>, Zhuo Chen, Manuel Carro<\/a> and Gopal Gupta<\/a><\/td>\n<\/tr>\n
LOPSTR 2019<\/strong><\/a><\/td>Natural language compositionality in Coq<\/td>Erkki Luuk<\/a><\/td>\n<\/tr>\n
LOPSTR 2019<\/strong><\/a><\/td>On fixpoint\/iteration\/variant induction principles for proving total correctness of programs with denotational semantics<\/td>Patrick Cousot<\/a><\/td>\n<\/tr>\n
LOPSTR 2019<\/strong><\/a><\/td>Reversibilization in Functional and Concurrent Programming (LOPSTR and PPDP Invited Talk) <\/img><\/a><\/td>Germ\u00e1n Vidal<\/a><\/td>\n<\/tr>\n
LOPSTR 2019<\/strong><\/a><\/td>Semi-Inversion of Conditional Constructor Term Rewriting Systems<\/td>Maja Kirkeby<\/a> and Robert Gl\u00fcck<\/a><\/td>\n<\/tr>\n
LOPSTR 2019<\/strong><\/a><\/td>Solving Proximity Constraints<\/td>Temur Kutsia<\/a> and Cleo Pau<\/a><\/td>\n<\/tr>\n
LOPSTR 2019<\/strong><\/a><\/td>Synthesizing Imperative Code from Answer Set Programming Specifications<\/td>Sarat Chandra Varanasi<\/a>, Elmer Salazar, Neeraj Mittal<\/a> and Gopal Gupta<\/a><\/td>\n<\/tr>\n
LOPSTR 2019<\/strong><\/a><\/td>The Prolog debugger and declarative programming<\/td>W\u0142odzimierz Drabent<\/a><\/td>\n<\/tr>\n
LOPSTR 2019<\/strong><\/a><\/td>Trace analysis using an Event-driven Interval Temporal Logic<\/td>Mar\u00eda-Del-Mar Gallardo and Laura Panizo<\/a><\/td>\n<\/tr>\n
MPC 2019<\/strong><\/a><\/td>A Hierarchy of Monadic Effects for Program Verification using Equational Reasoning<\/td>Reynald Affeldt<\/a>, David Nowak<\/a> and Takafumi Saikawa<\/td>\n<\/tr>\n
MPC 2019<\/strong><\/a><\/td>An Analysis of Repeated Graph Search<\/td>Roland Backhouse<\/a><\/td>\n<\/tr>\n
MPC 2019<\/strong><\/a><\/td>Certification of Breadth-First Algorithms by Extraction<\/td>Dominique Larchey-Wendling<\/a> and Ralph Matthes<\/a><\/td>\n<\/tr>\n
MPC 2019<\/strong><\/a><\/td>Completeness and Incompleteness of Synchronous Kleene Algebra<\/td>Jana Wagemaker<\/a>, Tobias Kapp\u00e9<\/a>, Jurriaan Rot, Marcello Bonsangue<\/a> and Alexandra Silva<\/a><\/td>\n<\/tr>\n
MPC 2019<\/strong><\/a><\/td>Cylindric Kleene Lattices for Program Construction<\/td>Brijesh Dongol<\/a>, Ian J. Hayes<\/a>, Larissa Meinicke<\/a> and Georg Struth<\/a><\/td>\n<\/tr>\n
MPC 2019<\/strong><\/a><\/td>En Garde! Unguarded Iteration for Reversible Computation in the Delay Monad<\/td>Niccol\u00f2 Veltri<\/a> and Robin Kaarsgaard<\/a><\/td>\n<\/tr>\n
MPC 2019<\/strong><\/a><\/td>Experiments in Information Flow Analysis (MPC Keynote) <\/img><\/a><\/td>Annabelle McIver<\/a><\/td>\n<\/tr>\n
MPC 2019<\/strong><\/a><\/td>Handling Local State with Global State<\/td>Koen Pauwels<\/a>, Tom Schrijvers<\/a> and Shin-Cheng Mu<\/a><\/td>\n<\/tr>\n
MPC 2019<\/strong><\/a><\/td>How to Calculate with Nondeterministic Functions<\/td>Richard Bird<\/a> and Florian Rabe<\/a><\/td>\n<\/tr>\n
MPC 2019<\/strong><\/a><\/td>Self-Certifying Railroad Diagrams, Or: How to Teach Nondeterministic Finite Automata<\/td>Ralf Hinze<\/a><\/td>\n<\/tr>\n
MPC 2019<\/strong><\/a><\/td>Setoid Type Theory --- A Syntactic Translation<\/td>Thorsten Altenkirch<\/a>, Simon Boulier, Ambrus Kaposi<\/a> and Nicolas Tabareau<\/a><\/td>\n<\/tr>\n
MPC 2019<\/strong><\/a><\/td>Shallow Embedding of Type Theory is Morally Correct<\/td>Ambrus Kaposi<\/a>, Andr\u00e1s Kov\u00e1cs and Nicolai Kraus<\/td>\n<\/tr>\n
MPC 2019<\/strong><\/a><\/td>System F in Agda, for Fun and Profit<\/td>James Chapman<\/a>, Roman Kireev, Chad Nester and Philip Wadler<\/a><\/td>\n<\/tr>\n
MPC 2019<\/strong><\/a><\/td>The Mean-Tempered Keyboard: Coding with Asymmetric Numeral Systems<\/td>Jeremy Gibbons<\/a><\/td>\n<\/tr>\n
MPC 2019<\/strong><\/a><\/td>Unraveling Recursion: Compiling an IR with Recursion to System F<\/td>Roman Kireev, Chad Nester, Michael Peyton Jones<\/a>, Philip Wadler<\/a>, Vasilis Gkoumas and Kenneth MacKenzie<\/td>\n<\/tr>\n
MPC 2019<\/strong><\/a><\/td>Verified Computations in Mathematical Proofs (MPC Keynote)<\/td>Assia Mahboubi<\/a><\/td>\n<\/tr>\n
MPC 2019<\/strong><\/a><\/td>Verified Self-Explaining Computation<\/td>Jan Stolarek<\/a> and James Cheney<\/a><\/td>\n<\/tr>\n
PPDP 2019<\/strong><\/a><\/td>10 Years of the Higher-Order Model Checking Project (PPDP and LOPSTR Invited Talk) <\/img><\/a><\/td>Naoki Kobayashi<\/a><\/td>\n<\/tr>\n
PPDP 2019<\/strong><\/a><\/td>An Adequate While-Language for Hybrid Computation<\/td>Sergey Goncharov<\/a> and Renato Neves<\/a><\/td>\n<\/tr>\n
PPDP 2019<\/strong><\/a><\/td>Crumbling Abstract Machines<\/td>Beniamino Accattoli<\/a>, Andrea Condoluci<\/a>, Giulio Guerrieri<\/a> and Claudio Sacerdoti Coen<\/a><\/td>\n<\/tr>\n
PPDP 2019<\/strong><\/a><\/td>Exception Handling and Classical Logic<\/td>Steffen van Bakel<\/a><\/td>\n<\/tr>\n
PPDP 2019<\/strong><\/a><\/td>Exponential Elimination for Bicartesian Closed Categorical Combinators<\/td>Nachiappan Valliappan<\/a> and Alejandro Russo<\/a><\/td>\n<\/tr>\n
PPDP 2019<\/strong><\/a><\/td>Functional Reactive Programming, restated<\/td>Guerric Chupin<\/a> and Henrik Nilsson<\/a><\/td>\n<\/tr>\n
PPDP 2019<\/strong><\/a><\/td>Functional programming with lambda-tree syntax<\/td>Ulysse G\u00e9rard<\/a>, Dale Miller<\/a> and Gabriel Scherer<\/td>\n<\/tr>\n
PPDP 2019<\/strong><\/a><\/td>Generic Encodings of Constructor Rewriting Systems<\/td>Horatiu Cirstea<\/a> and Pierre-Etienne Moreau<\/a><\/td>\n<\/tr>\n
PPDP 2019<\/strong><\/a><\/td>Inductive Theorem Proving in Non-terminating Rewriting Systems and Its Application to Program Transformation<\/td>Kentaro Kikuchi<\/a>, Takahito Aoto<\/a> and Isao Sasano<\/a><\/td>\n<\/tr>\n
PPDP 2019<\/strong><\/a><\/td>Intrinsically-Typed Mechanized Semantics for Session Types<\/td>Peter Thiemann<\/a><\/td>\n<\/tr>\n
PPDP 2019<\/strong><\/a><\/td>Moderately Complex Paxos Made Simple: High-Level Executable Specification of Distributed Consensus Algorithms<\/td>Y. Annie Liu<\/a>, Saksham Chand and Scott Stoller<\/a><\/td>\n<\/tr>\n
PPDP 2019<\/strong><\/a><\/td>Normalization by Evaluation for Call-by-Push-Value and Polarized Lambda-Calculus<\/td>Andreas Abel<\/a> and Christian Sattler<\/td>\n<\/tr>\n
PPDP 2019<\/strong><\/a><\/td>Property-Based Testing via Proof Reconstruction<\/td>Roberto Blanco, Dale Miller<\/a> and Alberto Momigliano<\/a><\/td>\n<\/tr>\n
PPDP 2019<\/strong><\/a><\/td>Relational Symbolic Execution<\/td>Gian Pietro Farina<\/a>, Stephen Chong<\/a> and Marco Gaboardi<\/a><\/td>\n<\/tr>\n
PPDP 2019<\/strong><\/a><\/td>Semantic Foundations for Gradual Typing (Invited Talk) <\/img><\/a><\/td>Amal Ahmed<\/a><\/td>\n<\/tr>\n
PPDP 2019<\/strong><\/a><\/td>Sharing Equality is Linear<\/td>Beniamino Accattoli<\/a>, Andrea Condoluci<\/a> and Claudio Sacerdoti Coen<\/a><\/td>\n<\/tr>\n
PPDP 2019<\/strong><\/a><\/td>Smart Contracts as Authorized Production Rules<\/td>Ben Lippmeier<\/a>, Amos Robinson<\/a> and Andrae Muys<\/td>\n<\/tr>\n
PPDP 2019<\/strong><\/a><\/td>Spacetime Programming: A Synchronous Language for Composable Search Strategies<\/td>Pierre Talbot<\/a><\/td>\n<\/tr>\n
PPDP 2019<\/strong><\/a><\/td>The PPDP Most Influential Paper 10-Year Award: Foundations of Session Types<\/td>Mariangiola Dezani<\/a><\/td>\n<\/tr>\n
PPDP 2019<\/strong><\/a><\/td>TopHat: A formal foundation for task-oriented programming<\/td>Tim Steenvoorden<\/a>, Nico Naus<\/a> and Markus Klinik<\/a><\/td>\n<\/tr>\n
PPDP 2019<\/strong><\/a><\/td>Type-Driven Verification of Extra-Functional Properties<\/td>Christopher Mark Brown<\/a>, Adam Barwell<\/a>, Yoann Marquer, Celine Minh and Olivier Zendra<\/td>\n<\/tr>\n
PPDP 2019<\/strong><\/a><\/td>Under Control: Compositionally Correct Closure Conversion with Mutable State<\/td>Phillip Mates, Jamie Perconti and Amal Ahmed<\/a><\/td>\n<\/tr>\n
RV 2019<\/strong><\/a><\/td>A Formally Verified Monitor for Metric First-Order Temporal Logic (Regular paper)<\/td>Joshua Schneider<\/a>, David Basin<\/a>, Srdjan Krstic and Dmitriy Traytel<\/a><\/td>\n<\/tr>\n
RV 2019<\/strong><\/a><\/td>Accelerated Learning of Predictive Runtime Monitors for Rare Failure (Regular paper)<\/td>Reza Babaee<\/a>, Vijay Ganesh<\/a> and Sean Sedwards<\/a><\/td>\n<\/tr>\n
RV 2019<\/strong><\/a><\/td>Algorithms for Monitoring Hyperproperties (Tutorial paper)<\/td>Christopher Hahn<\/a><\/td>\n<\/tr>\n
RV 2019<\/strong><\/a><\/td>AllenRV: an extensible monitor for multiple complex specifications with high reactivity (Demo paper)<\/td>Nic Volanschi<\/a> and Bernard Serpette<\/td>\n<\/tr>\n
RV 2019<\/strong><\/a><\/td>An Extension of LTL with Rules and its Application to Runtime Verification (Regular paper)<\/td>Klaus Havelund<\/a> and Doron Peled<\/a><\/td>\n<\/tr>\n
RV 2019<\/strong><\/a><\/td>Assumption-Based Runtime Verification with Partial Observability and Resets (Regular paper)<\/td>Alessandro Cimatti<\/a>, Chun Tian<\/a> and Stefano Tonetta<\/a><\/td>\n<\/tr>\n
RV 2019<\/strong><\/a><\/td>Can we Verify GDPR Compliance? (Invited Talk) <\/img><\/a><\/td>David Basin<\/a><\/td>\n<\/tr>\n
RV 2019<\/strong><\/a><\/td>Challenges and opportunities in design and operation of intelligent cyber-physical system (Invited Talk) <\/img><\/a><\/td>Akshay Rajhans<\/a><\/td>\n<\/tr>\n
RV 2019<\/strong><\/a><\/td>Comparing Controlled System Synthesis and Suppression Enforcement (Regular paper)<\/td>Ian Cassar<\/a>, Luca Aceto<\/a>, Adrian Francalanza<\/a> and Anna Ing\u00f3lfsd\u00f3ttir<\/a><\/td>\n<\/tr>\n
RV 2019<\/strong><\/a><\/td>Decentralized Stream Runtime Verification (Regular paper)<\/td>Luis Miguel Danielsson<\/a> and C\u00e9sar S\u00e1nchez<\/a><\/td>\n<\/tr>\n
RV 2019<\/strong><\/a><\/td>Efficient Detection and Quantification of Timing Leaks with Neural Networks (Regular paper)<\/td>Saeid Tizpaz-Niari<\/a>, Pavol \u010cern\u00fd<\/a>, Sriram Sankaranarayanan<\/a> and Ashutosh Trivedi<\/a><\/td>\n<\/tr>\n
RV 2019<\/strong><\/a><\/td>Explaining Violations of Properties in Control-Flow Temporal Logic (Regular paper)<\/td>Joshua Dawes<\/a> and Giles Reger<\/a><\/td>\n<\/tr>\n
RV 2019<\/strong><\/a><\/td>FastCFI: Real-Time Control Flow Integrity using FPGA without Code Instrumentation (Regular paper)<\/td>Lang Feng, Jeff Huang, Jiang Hu<\/a> and Abhijith Reddy<\/td>\n<\/tr>\n
RV 2019<\/strong><\/a><\/td>Monitorability Over Unreliable Channels (Regular paper)<\/td>Sean Kauffman<\/a>, Klaus Havelund<\/a> and Sebastian Fischmeister<\/a><\/td>\n<\/tr>\n
RV 2019<\/strong><\/a><\/td>Neural Predictive Monitoring (Regular paper)<\/td>Luca Bortolussi, Francesca Cairoli, Nicola Paoletti<\/a>, Scott Smolka<\/a> and Scott Stoller<\/a><\/td>\n<\/tr>\n
RV 2019<\/strong><\/a><\/td>NuRV: a nuXmv Extension for Runtime Verification (RV19-demo)<\/td>Alessandro Cimatti<\/a>, Chun Tian<\/a> and Stefano Tonetta<\/a><\/td>\n<\/tr>\n
RV 2019<\/strong><\/a><\/td>On the Runtime Enforcement of Timed Properties (Tutorial paper)<\/td>Yli\u00e8s Falcone<\/a><\/td>\n<\/tr>\n
RV 2019<\/strong><\/a><\/td>Overhead-aware deployment of runtime monitors (Short paper)<\/td>Teng Zhang, Gregory Eakman, Insup Lee<\/a> and Oleg Sokolsky<\/a><\/td>\n<\/tr>\n
RV 2019<\/strong><\/a><\/td>Predictive Runtime Monitoring for Linear Stochastic Systems and Applications to Geofence Enforcement for UAVs (Regular paper)<\/td>Hansol Yoon<\/a>, Yi Chou, Xin Chen, Eric Frew and Sriram Sankaranarayanan<\/a><\/td>\n<\/tr>\n
RV 2019<\/strong><\/a><\/td>Reactive Control Meets Runtime Verification: A Case Study of Navigation (Short paper)<\/td>Dogan Ulus<\/a> and Calin Belta<\/a><\/td>\n<\/tr>\n
RV 2019<\/strong><\/a><\/td>Robustness of Specifications and its applications to Falsification, Parameter Mining, and Runtime Monitoring with S-TaLiRo (Tutorial paper)<\/td>Georgios Fainekos<\/a>, Bardh Hoxha and Sriram Sankaranarayanan<\/a><\/td>\n<\/tr>\n
RV 2019<\/strong><\/a><\/td>Runtime Verification For Timed Event Streams With Partial Information (Regular paper)<\/td>Martin Leucker<\/a>, C\u00e9sar S\u00e1nchez<\/a>, Torben Scheffel<\/a>, Malte Schmitz<\/a> and Daniel Thoma<\/a><\/td>\n<\/tr>\n
RV 2019<\/strong><\/a><\/td>Shape Expressions for Specifying and Extracting Signal Features (Regular paper)<\/td>Dejan Nickovic<\/a>, Xin Qin<\/a>, Thomas Ferr\u00e8re<\/a>, Cristinel Mateis<\/a> and Jyotirmoy Deshmukh<\/a><\/td>\n<\/tr>\n
RV 2019<\/strong><\/a><\/td>Stream-based Monitoring of Real-time Properties (Tutorial paper)<\/td>Hazem Torfah<\/a><\/td>\n<\/tr>\n
RV 2019<\/strong><\/a><\/td>Timescales: A Benchmark Generator for Metric Temporal Logic (Benchmark paper)<\/td>Dogan Ulus<\/a><\/td>\n<\/tr>\n
RV 2019<\/strong><\/a><\/td>Towards Verified Artificial Intelligence: A Run-Time Verification Perspective (Invited Talk)<\/td>Sanjit A. Seshia<\/a><\/td>\n<\/tr>\n
SAS 2019<\/strong><\/a><\/td>A Change-based Heuristic for Static Analysis with Policy Iteration<\/td>Marcus V\u00f6lker<\/a> and Stefan Kowalewski<\/a><\/td>\n<\/tr>\n
SAS 2019<\/strong><\/a><\/td>A Temporal Logic for Higher-Order Functional Programs<\/td>Yuya Okuyama<\/a>, Takeshi Tsukada<\/a> and Naoki Kobayashi<\/a><\/td>\n<\/tr>\n
SAS 2019<\/strong><\/a><\/td>Abstract Interpretation of Indexed Grammars<\/td>Marco Campion<\/a>, Mila Dalla Preda<\/a> and Roberto Giacobazzi<\/a><\/td>\n<\/tr>\n
SAS 2019<\/strong><\/a><\/td>Abstract Semantic Dependency<\/td>Patrick Cousot<\/a><\/td>\n<\/tr>\n
SAS 2019<\/strong><\/a><\/td>An efficient parametric linear programming solver and application to polyhedral projection<\/td>Hang Yu<\/a>, David Monniaux<\/a> and Michael Perin<\/td>\n<\/tr>\n
SAS 2019<\/strong><\/a><\/td>Analysis of Software Patches using Numerical Abstract Interpretation<\/td>David Delmas<\/a> and Antoine Min\u00e9<\/a><\/td>\n<\/tr>\n
SAS 2019<\/strong><\/a><\/td>Analyzing Deep Neural Networks with Symbolic Propagation: Towards Higher Precision and Faster Verification<\/td>Jianlin Li<\/a>, Jiangchao Liu<\/a>, Pengfei Yang, Liqian Chen<\/a>, Xiaowei Huang<\/a> and Lijun Zhang<\/a><\/td>\n<\/tr>\n
SAS 2019<\/strong><\/a><\/td>Direct Manipulation for Imperative Programs<\/td>Qinheping Hu<\/a>, Roopsha Samanta<\/a>, Rishabh Singh and Loris D'Antoni<\/a><\/td>\n<\/tr>\n
SAS 2019<\/strong><\/a><\/td>Fast and Precise Handling of Positive Weight Cycles for Field-sensitive Pointer Analysis<\/td>Yuxiang Lei<\/a> and Yulei Sui<\/a><\/td>\n<\/tr>\n
SAS 2019<\/strong><\/a><\/td>Language Inclusion Algorithms as Complete Abstract Interpretations<\/td>Pierre Ganty<\/a>, Francesco Ranzato<\/a> and Pedro Valero<\/td>\n<\/tr>\n
SAS 2019<\/strong><\/a><\/td>Learning Verifiers and Verifying Learners (Invited Talk) <\/img><\/a><\/td>Suresh Jagannathan<\/a><\/td>\n<\/tr>\n
SAS 2019<\/strong><\/a><\/td>Multiphase-Linear Ranking Functions and their Relation to Recurrent Sets<\/td>Amir Ben-Amram<\/a>, Jes\u00fas Dom\u00e9nech<\/a> and Samir Genaim<\/a><\/td>\n<\/tr>\n
SAS 2019<\/strong><\/a><\/td>On the Monniaux Problem in Abstract Interpretation<\/td>Nathana\u00ebl Fijalkow, Engel Lefaucheux<\/a>, Pierre Ohlmann, Jo\u00ebl Ouaknine, Amaury Pouly and James Worrell<\/a><\/td>\n<\/tr>\n
SAS 2019<\/strong><\/a><\/td>Per-Dereference Verification of Temporal Heap Safety via Adaptive Context-Sensitive Analysis<\/td>Hua Yan<\/a>, Shiping Chen<\/a>, Yulei Sui<\/a>, Yueqian Zhang<\/a>, Changwei Zou<\/a> and Jingling Xue<\/a><\/td>\n<\/tr>\n
SAS 2019<\/strong><\/a><\/td>Responsibility Analysis by Abstract Interpretation and Applications to Program Security<\/td>Chaoqiang Deng<\/a> and Patrick Cousot<\/a><\/td>\n<\/tr>\n
SAS 2019<\/strong><\/a><\/td>Rethinking Static Analysis by Combining Discrete and Continuous Reasoning (Invited Talk) <\/img><\/a><\/td>Mayur Naik<\/a><\/td>\n<\/tr>\n
SAS 2019<\/strong><\/a><\/td>Revisiting Polyhedral Analysis for Hybrid Systems<\/td>Anna Becchi<\/a> and Enea Zaffanella<\/a><\/td>\n<\/tr>\n
SAS 2019<\/strong><\/a><\/td>Robustness Verification of Support Vector Machines<\/td>Francesco Ranzato<\/a> and Marco Zanella<\/a><\/td>\n<\/tr>\n
SAS 2019<\/strong><\/a><\/td>Sorcar: Property-Driven Algorithms for Learning Conjunctive Invariants<\/td>Daniel Neider<\/a>, Shambwaditya Saha and P. Madhusudan<\/a><\/td>\n<\/tr>\n
SAS 2019<\/strong><\/a><\/td>Static Analysis of Data Science Software (Invited Talk) <\/img><\/a><\/td>Caterina Urban<\/a><\/td>\n<\/tr>\n
SAS 2019<\/strong><\/a><\/td>Syntactic and Semantic Soundness of Structural Dataflow Analysis<\/td>Patrick Cousot<\/a><\/td>\n<\/tr>\n
SAS 2019<\/strong><\/a><\/td>Temporal Verification of Programs via First-Order Fixpoint Logic<\/td>Naoki Kobayashi<\/a>, Takeshi Nishikawa<\/a>, Atsushi Igarashi<\/a> and Hiroshi Unno<\/a><\/td>\n<\/tr>\n
SAS 2019<\/strong><\/a><\/td>Towards Semantic Adversarial Examples (Invited Talk) <\/img><\/a><\/td>Somesh Jha<\/a><\/td>\n<\/tr>\n
SAS 2019<\/strong><\/a><\/td>Verifying Numerical Programs via Iterative Abstract Testing<\/td>Banghu Yin<\/a>, Liqian Chen<\/a>, Jiangchao Liu<\/a>, Ji Wang and Patrick Cousot<\/a><\/td>\n<\/tr>\n
TAP 2019<\/strong><\/a><\/td>BTestBox - A tool for testing B translators and coverage of B models<\/td>Diego de Azevedo Oliveira, Val\u00e9rio Gutemberg Medeiros Jr, David D\u00e9harbe<\/a> and Martin A. Musicante<\/td>\n<\/tr>\n
TAP 2019<\/strong><\/a><\/td>Constraints in Dynamic Symbolic Execution: Bitvectors or Integers?<\/td>Timotej Kapus<\/a>, Martin Nowack<\/a> and Cristian Cadar<\/a><\/td>\n<\/tr>\n
TAP 2019<\/strong><\/a><\/td>Coverage-Based Testing with Symbolic Transition Systems<\/td>Petra van den Bos<\/a> and Jan Tretmans<\/a><\/td>\n<\/tr>\n
TAP 2019<\/strong><\/a><\/td>Extracting Unverified Program Parts from Software Verification Runs (Keynote Talk) <\/img><\/a><\/td>Heike Wehrheim<\/a><\/td>\n<\/tr>\n
TAP 2019<\/strong><\/a><\/td>Fast and Complete Automatic Structural Unit Test Generation combining Genetic Algorithms and Formal Methods<\/td>Eric Lavillonni\u00e8re, David Mentr\u00e9<\/a> and Denis Cousineau<\/a><\/td>\n<\/tr>\n
TAP 2019<\/strong><\/a><\/td>Learning Communicating State Machines<\/td>Alexandre Petrenko<\/a> and Florent Avellaneda<\/td>\n<\/tr>\n
TAP 2019<\/strong><\/a><\/td>Predicting and Testing Latencies with Deep Learning: an IoT Case Study<\/td>Bernhard K. Aichernig<\/a>, Franz Pernkopf, Richard Schumi and Andreas Wurm<\/td>\n<\/tr>\n
TAP 2019<\/strong><\/a><\/td>Property-Based Test Case Generators for Free<\/td>Emanuele De Angelis<\/a>, Fabio Fioravanti<\/a>, Adrian Palacios, Alberto Pettorossi<\/a> and Maurizio Proietti<\/a><\/td>\n<\/tr>\n
TAP 2019<\/strong><\/a><\/td>Proving a Non-Blocking Algorithm for Process Renaming with TLA+<\/td>Aur\u00e9lie Hurault<\/a> and Philippe Queinnec<\/td>\n<\/tr>\n
TAP 2019<\/strong><\/a><\/td>Repairing Timed Automata Clock Guards through Abstraction and Testing<\/td>\u00c9tienne Andr\u00e9<\/a>, Paolo Arcaini<\/a>, Angelo Gargantini<\/a> and Marco Radavelli<\/td>\n<\/tr>\n
TAP 2019<\/strong><\/a><\/td>RoboStar technology - Testing in Robotics Using Process Algebra (Invited Tutorial)<\/td>Ana Cavalcanti<\/a><\/td>\n<\/tr>\n
TAP 2019<\/strong><\/a><\/td>Sail through your C Code with MetAcsl: Specifying, Testing and Proving High-Level Properties<\/td>Virgile Robles<\/a>, Nikolai Kosmatov<\/a>, Virgile Prevosto<\/a>, Louis Rilling and Pascale Le Gall<\/td>\n<\/tr>\n
UTP 2019<\/strong><\/a><\/td>A Calculus of Space, Time and Causality: its Algebra, Geometry, Logic (Invited Talk) <\/img><\/a><\/td>Tony Hoare<\/a>, Georg Struth<\/a> and Jim Woodcock<\/a><\/td>\n<\/tr>\n
UTP 2019<\/strong><\/a><\/td>A Testing Perspective on Algebraic, Denotational, and Operational Semantics<\/td>Bernhard K. Aichernig<\/a><\/td>\n<\/tr>\n
UTP 2019<\/strong><\/a><\/td>Connecting Fixpoints of Computations with Strict Progress<\/td>Walter Guttmann<\/a><\/td>\n<\/tr>\n
UTP 2019<\/strong><\/a><\/td>Developing an algebra for rely\/guarantee concurrency<\/td>Ian J. Hayes<\/a> and Larissa Meinicke<\/a><\/td>\n<\/tr>\n
UTP 2019<\/strong><\/a><\/td>Hybrid Relations in Isabelle\/UTP<\/td>Simon Foster<\/a><\/td>\n<\/tr>\n
UTP 2019<\/strong><\/a><\/td>Probabilistic Semantics for RoboChart: A Weakest Completion Approach<\/td>Jim Woodcock<\/a>, Ana Cavalcanti<\/a>, Simon Foster<\/a>, Alexandre Mota<\/a> and Kangfeng Ye<\/td>\n<\/tr>\n
UTP 2019<\/strong><\/a><\/td>The Inner and Outer Algebras of Unified Concurrency<\/td>Andrew Butterfield<\/a><\/td>\n<\/tr>\n
UTP 2019<\/strong><\/a><\/td>UTP Semantics of a Calculus for Mobile Ad Hoc Networks<\/td>Xi Wu<\/a>, Huibiao Zhu<\/a> and Wanling Xie<\/td>\n<\/tr>\n
UTP 2019<\/strong><\/a><\/td>Unified Graphical Co-Modelling of Cyber-Physical Systems using AADL and Simulink\/Stateflow<\/td>Haolan Zhan, Qianqian Lin, Shuling Wang<\/a>, Jean-Pierre Talpin<\/a>, Xiong Xu and Naijun Zhan<\/a><\/td>\n<\/tr>\n
UTP 2019<\/strong><\/a><\/td>Whither specifications as programs<\/td>David Naumann<\/a> and Minh Ngo<\/td>\n<\/tr>\n
VECoS 2019<\/strong><\/a><\/td>1968 to 2019: Half a Century of Correctness Enhancement (Invited Talk)<\/td>Ali Mili<\/a><\/td>\n<\/tr>\n
VECoS 2019<\/strong><\/a><\/td>Analysing Security Protocols Using Scenario Based Simulation<\/td>Farah Al-Shareefi<\/a>, Alexei Lisitsa<\/a> and Clare Dixon<\/a><\/td>\n<\/tr>\n
VECoS 2019<\/strong><\/a><\/td>Estimating Latency for Synchronous Dataflow Graphs Using Periodic Schedules<\/td>Philippe Glanon<\/a>, Selma Azaiez<\/a> and Chokri Mraidha<\/td>\n<\/tr>\n
VECoS 2019<\/strong><\/a><\/td>Importance-Based Scheduling to Manage Multiple Core Defections in Real-Time Systems<\/td>Yves Mouafo Tchinda<\/a>, Annie Choquet-Geniet and Ga\u00eblle Largeteau-Skapin<\/a><\/td>\n<\/tr>\n
VECoS 2019<\/strong><\/a><\/td>Modeling Concurrent Behaviors as Words<\/td>Jean-Michel Couvreur<\/a>, Xavier Ferry<\/a> and Mouhamadou Sakho<\/td>\n<\/tr>\n
VECoS 2019<\/strong><\/a><\/td>Non-Standard Zeno-Free Simulation Semantics for Hybrid Dynamical Systems<\/td>Ayman Aljarbouh<\/td>\n<\/tr>\n
VECoS 2019<\/strong><\/a><\/td>Running on Fumes -- Preventing Out-of-Gas Vulnerabilities in Ethereum Smart Contracts using Static Resource Analysis<\/td>Elvira Albert<\/a>, Pablo Gordillo<\/a>, Albert Rubio<\/a> and Ilya Sergey<\/a><\/td>\n<\/tr>\n
VECoS 2019<\/strong><\/a><\/td>Static Detection of Event-Driven Races in HTML5-Based Mobile Apps<\/td>Tuong Lau<\/a><\/td>\n<\/tr>\n
VECoS 2019<\/strong><\/a><\/td>Top-down Horn Clause-based Program Analysis in the Ciao Language (Invited Talk) <\/img><\/a><\/td>Jose F. Morales<\/a><\/td>\n<\/tr>\n
MH60<\/strong><\/a><\/td>An an old (but still unsolved?) problem in program specialization<\/td>Wim Vanhoof<\/a><\/td>\n<\/tr>\n
MH60<\/strong><\/a><\/td>Analysis of extra-functional properties in mobile applications<\/td>Mar\u00eda del Mar Gallardo<\/a><\/td>\n<\/tr>\n
MH60<\/strong><\/a><\/td>Random Snapshots<\/td>Manuel Carro<\/a><\/td>\n<\/tr>\n
MH60<\/strong><\/a><\/td>Resource Usage Analysis with CiaoPP<\/td>Pedro Lopez-Garcia<\/a><\/td>\n<\/tr>\n
MH60<\/strong><\/a><\/td>The Futamura projections and parallelization<\/td>John Gallagher<\/a><\/td>\n<\/tr>\n
MH60<\/strong><\/a><\/td>YAP and the Globalized World<\/td>V\u00edtor Santos Costa<\/td>\n<\/tr>\n
SG65<\/strong><\/a><\/td>A Decade of Featured Transition Systems<\/td>Maxime Cordy, Xavier Devroey, Axel Legay<\/a>, Gilles Perrouin, Andreas Classen, Patrick Heymans<\/a>, Pierre-Yves Schobbens<\/a> and Jean-Fran\u00e7ois Raskin<\/td>\n<\/tr>\n
SG65<\/strong><\/a><\/td>A Generic Dynamic Logic with Applications to Interaction-Based Systems<\/td>Rolf Hennicker<\/a> and Martin Wirsing<\/a><\/td>\n<\/tr>\n
SG65<\/strong><\/a><\/td>A Systematic Approach to Programming and Verifying Attribute-Based Communication Systems<\/td>Rocco De Nicola<\/a>, Tan Duong, Omar Inverso and Franco Mazzanti<\/a><\/td>\n<\/tr>\n
SG65<\/strong><\/a><\/td>Ambiguity in Requirements Engineering: Towards a Unifying Framework<\/td>Vincenzo Gervasi<\/a>, Alessio Ferrari<\/a>, Didar Zowghi and Paola Spoletini<\/a><\/td>\n<\/tr>\n
SG65<\/strong><\/a><\/td>An Axiomatization of Strong Distribution Bisimulation for a Language with a Parallel Operator and Probabilistic Choice<\/td>Jan Friso Groote and Erik de Vink<\/a><\/td>\n<\/tr>\n
SG65<\/strong><\/a><\/td>Automata-Based Behavioural Contracts with Action Correlation<\/td>Davide Basile<\/a>, Rosario Pugliese<\/a>, Francesco Tiezzi<\/a>, Pierpaolo Degano<\/a> and Gian Luigi Ferrari<\/a><\/td>\n<\/tr>\n
SG65<\/strong><\/a><\/td>Formal Methods in Designing Critical Cyber-Physical Systems<\/td>Mehrnoosh Askarpour, Carlo Ghezzi<\/a>, Dino Mandrioli<\/a>, Matteo Rossi<\/a> and Christos Tsigkanos<\/td>\n<\/tr>\n
SG65<\/strong><\/a><\/td>Formal Verification of Railway Timetables - Using the UPPAAL Model Checker<\/td>Anne Haxthausen<\/a> and Kristian Hede<\/td>\n<\/tr>\n
SG65<\/strong><\/a><\/td>From Dynamic Programming to Programming Science: Some Recollections in Honour of Stefania Gnesi<\/td>Ugo Montanari<\/a><\/td>\n<\/tr>\n
SG65<\/strong><\/a><\/td>How Formal Methods Can Contribute to 5G Networks<\/td>Mar\u00eda del Mar Gallardo<\/a>, Francisco Luque-Schempp, Pedro Merino-G\u00f3mez and Laura Panizo<\/a><\/td>\n<\/tr>\n
SG65<\/strong><\/a><\/td>Hunting Superfluous Locks with Model Checking<\/td>Viet-Anh Nguyen, Wendelin Serwe, Radu Mateescu<\/a> and Eric Jenn<\/td>\n<\/tr>\n
SG65<\/strong><\/a><\/td>Innovating Medical Image Analysis via Spatial Logics<\/td>Gina Belmonte, Vincenzo Ciancia<\/a>, Diego Latella<\/a> and Mieke Massink<\/a><\/td>\n<\/tr>\n
SG65<\/strong><\/a><\/td>Logical Support for Bike-Sharing System Design<\/td>Ionu\u0163 \u0162u\u0163u, Claudia-Elena Chirita<\/a>, Ant\u00f3nia Lopes<\/a> and Jos\u00e9 Fiadeiro<\/a><\/td>\n<\/tr>\n
SG65<\/strong><\/a><\/td>Looking Inside the Black Box: Core Semantics towards Accountability of Artificial Intelligence<\/td>Roberto Garigliano and Luisa Mich<\/a><\/td>\n<\/tr>\n
SG65<\/strong><\/a><\/td>Modelling of Railway Signalling System Requirements by Controlled Natural Languages: A Case Study<\/td>Gabriele Lenzini<\/a> and Marinella Petrocchi<\/a><\/td>\n<\/tr>\n
SG65<\/strong><\/a><\/td>On the Prediction of Smart Contracts' Behaviours<\/td>Cosimo Laneve<\/a>, Claudio Sacerdoti Coen<\/a> and Adele Veschetti<\/td>\n<\/tr>\n
SG65<\/strong><\/a><\/td>The Legacy of Stefania Gnesi: From Software Engineering to Formal Methods and Tools, and Back<\/td>Maurice ter Beek<\/a>, Alessandro Fantechi<\/a> and Laura Semini<\/a><\/td>\n<\/tr>\n
SG65<\/strong><\/a><\/td>Towards Model Checking Product Lines in the Digital Humanities: An Application to Historical Data<\/td>Ciara Breathnach, Najhan M. Ibrahim, Stuart Clancy and Tiziana Margaria<\/a><\/td>\n<\/tr>\n
AFFORD 2019<\/strong><\/a><\/td>Addressing usability in a formal development environment<\/td>Paolo Arcaini<\/a>, Silvia Bonfanti<\/a>, Angelo Gargantini<\/a>, Elvinia Riccobene<\/a> and Patrizia Scandurra<\/a><\/td>\n<\/tr>\n
AFFORD 2019<\/strong><\/a><\/td>Compiling C and C++ Programs for White-Box Analysis<\/td>Zuzana Baranov\u00e1<\/a> and Petr Ro\u010dkai<\/a><\/td>\n<\/tr>\n
AFFORD 2019<\/strong><\/a><\/td>Experiences on Streamlining Formal Methods Tools (Invited Talk)<\/td>Paolo Masci<\/a><\/td>\n<\/tr>\n
AFFORD 2019<\/strong><\/a><\/td>Formal Modelling and Verification as Rigorous Review Technology: An Inspiration from INSPEX<\/td>Richard Banach<\/a>, Joseph Razavi, Olivier Debicki and Suzanne Lesecq<\/td>\n<\/tr>\n
AFFORD 2019<\/strong><\/a><\/td>Model Checking in a Development Workflow: A Study on a Concurrent C++ Hash Table<\/td>Petr Ro\u010dkai<\/a><\/td>\n<\/tr>\n
AFFORD 2019<\/strong><\/a><\/td>SEB-CG: Code Generation Tool with Algorithmic Refinement Support for Event-B<\/td>Sadegh Dalvandi<\/a> and Michael Butler<\/a><\/td>\n<\/tr>\n
AFFORD 2019<\/strong><\/a><\/td>The Bourgeois Gentleman, Engineering and Formal Methods<\/td>Thierry Lecomte<\/a><\/td>\n<\/tr>\n
DALI 2019<\/strong><\/a><\/td>A Logical Analysis of the Interplay between Social Influence and Friendship Selection<\/td>Sonja Smets<\/a> and Fernando Vel\u00e1zquez-Quesada<\/a><\/td>\n<\/tr>\n
DALI 2019<\/strong><\/a><\/td>A dynamic epistemic logic analysis of the equality negation task<\/td>Eric Goubault, Marijana Lazi\u0107<\/a>, J\u00e9r\u00e9my Ledent<\/a> and Sergio Rajsbaum<\/a><\/td>\n<\/tr>\n
DALI 2019<\/strong><\/a><\/td>A dynamic logic for QASM programs (Short paper)<\/td>Carlos Tavares<\/a><\/td>\n<\/tr>\n
DALI 2019<\/strong><\/a><\/td>A four-valued hybrid logic with non-dual modal operators<\/td>Diana Costa<\/a> and Manuel A. Martins<\/a><\/td>\n<\/tr>\n
DALI 2019<\/strong><\/a><\/td>A labelled sequent calculus for Dynamic Predicate Logic (Short paper)<\/td>Elio La Rosa<\/a><\/td>\n<\/tr>\n
DALI 2019<\/strong><\/a><\/td>Behavioural and Abstractor Specifications for Dynamic Logic with Binders and Silent Transitions<\/td>Rolf Hennicker<\/a>, Alexander Knapp<\/a> and Alexandre Madeira<\/a><\/td>\n<\/tr>\n
DALI 2019<\/strong><\/a><\/td>Dynamic Preference Logic as a Logic of Belief Change<\/td>Marlo Souza<\/a> and Alvaro Moreira<\/td>\n<\/tr>\n
DALI 2019<\/strong><\/a><\/td>Iterative division in the product-free Distributive Full Non-associative Lambek Calculus<\/td>Igor Sedl\u00e1r<\/a><\/td>\n<\/tr>\n
DALI 2019<\/strong><\/a><\/td>Mechanizing Bisimulation Theorems for Relation-Changing Logics in Coq<\/td>Raul Fervari<\/a>, Francisco Trucco and Beta Ziliani<\/a><\/td>\n<\/tr>\n
DALI 2019<\/strong><\/a><\/td>On Free \u03c9-Continuous and Regular Ordered Algebras (Invited Talk)<\/td>Dexter Kozen<\/a><\/td>\n<\/tr>\n
DALI 2019<\/strong><\/a><\/td>On the construction of multi-valued concurrent dynamic logic (Short paper)<\/td>Leandro Gomes<\/a><\/td>\n<\/tr>\n
DALI 2019<\/strong><\/a><\/td>Persuasive Argumentation and Epistemic Attitudes<\/td>Carlo Proietti<\/a> and Antonio Yuste-Ginel<\/a><\/td>\n<\/tr>\n
DALI 2019<\/strong><\/a><\/td>Resource separation in Dynamic Logic of Propositional Assignments<\/td>Joseph Boudou, Andreas Herzig<\/a> and Nicolas Troquard<\/td>\n<\/tr>\n
DALI 2019<\/strong><\/a><\/td>Social consolidations: Rational belief in a many-valued logic of evidence and peerhood (Short paper)<\/td>Yuri David Santos<\/td>\n<\/tr>\n
DALI 2019<\/strong><\/a><\/td>Stit Semantics for Epistemic Notions Based on Information Disclosure in Interactive Settings<\/td>Aldo Iv\u00e1n Ram\u00edrez Abarca and Jan Broersen<\/a><\/td>\n<\/tr>\n
DALI 2019<\/strong><\/a><\/td>The Logic of AGM Learning from Partial Observations<\/td>Alexandru Baltag<\/a>, Ayb\u00fcke \u00d6zg\u00fcn and Ana Lucia Vargas Sandoval<\/td>\n<\/tr>\n
DALI 2019<\/strong><\/a><\/td>The Trace Modality<\/td>Dominic Steinh\u00f6fel<\/a> and Reiner H\u00e4hnle<\/a><\/td>\n<\/tr>\n
DataMod 2019<\/strong><\/a><\/td>'Know Thyself' how personal music tastes shape the Last.fm online social network<\/td>Riccardo Guidotti<\/a> and Giulio Rossetti<\/a><\/td>\n<\/tr>\n
DataMod 2019<\/strong><\/a><\/td>An instrumented mobile language learning application for the analysis of usability and learning<\/td>Aigerim Aibassova, Antonio Cerone<\/a> and Mukhtar Tashkenbayev<\/td>\n<\/tr>\n
DataMod 2019<\/strong><\/a><\/td>An ontology-based approach to support formal verification of concurrent systems<\/td>Natalya Garanina<\/a>, Igor Anureev, Elena Sidorova, Vladimir Zyubin and Sergei Gorlatch<\/a><\/td>\n<\/tr>\n
DataMod 2019<\/strong><\/a><\/td>Analysis and visualization of performance indicators in university admission tests<\/td>Salvatore Rinzivillo<\/a>, Michela Natilli<\/a>, Dino Pedreschi, Daniele Fadda<\/a> and Federica Licari<\/td>\n<\/tr>\n
DataMod 2019<\/strong><\/a><\/td>Anomaly detection from log files using unsupervised deep learning<\/td>Sathya Bursic<\/a>, Alessandro D'Amelio<\/a> and Vittorio Cuculo<\/a><\/td>\n<\/tr>\n
DataMod 2019<\/strong><\/a><\/td>Diagrammatic physical robot models in RoboSim (Invited Talk)<\/td>Ana Cavalcanti<\/a><\/td>\n<\/tr>\n
DataMod 2019<\/strong><\/a><\/td>Gender recognition in the wild and small sample - a dictionary learning approach<\/td>Alessandro D'Amelio<\/a>, Vittorio Cuculo<\/a> and Sathya Bursic<\/a><\/td>\n<\/tr>\n
DataMod 2019<\/strong><\/a><\/td>How to look next? A data-driven approach for scanpath prediction<\/td>Vittorio Cuculo<\/a>, Giuseppe Boccignone<\/a> and Alessandro D'Amelio<\/a><\/td>\n<\/tr>\n
DataMod 2019<\/strong><\/a><\/td>Validation of a simulation algorithm for safety-critical human multitasking<\/td>Giovanna Broccia<\/a>, Paolo Milazzo<\/a>, Carmen Berrocal Montiel and Cristina Belviso<\/td>\n<\/tr>\n
DataMod 2019<\/strong><\/a><\/td>Verification of Data in Space and Time (Invited Talk)<\/td>Mieke Massink<\/a><\/td>\n<\/tr>\n
F-IDE 2019<\/strong><\/a><\/td>A component-based formal language workbench<\/td>Peter Mosses<\/a><\/td>\n<\/tr>\n
F-IDE 2019<\/strong><\/a><\/td>An Integrated Development Environment for the Prototype Verification System<\/td>Paolo Masci<\/a> and C\u00e9sar Mu\u00f1oz<\/a><\/td>\n<\/tr>\n
F-IDE 2019<\/strong><\/a><\/td>Automated deductive verification for Ladder programming<\/td>Denis Cousineau<\/a>, David Mentr\u00e9<\/a> and Hiroaki Inoue<\/td>\n<\/tr>\n
F-IDE 2019<\/strong><\/a><\/td>Deeply Integrating C11 Code Support into Isabelle\/PIDE<\/td>Fr\u00e9d\u00e9ric Tuong<\/a> and Burkhart Wolff<\/a><\/td>\n<\/tr>\n
F-IDE 2019<\/strong><\/a><\/td>Experience Report: Towards Moving Things with Types - Helping Logistics Domain Experts to Control Cyber-Physical Systems with Type-Based Synthesis<\/td>Jan Bessai<\/a>, Moritz Roidl and Anna Vasileva<\/td>\n<\/tr>\n
F-IDE 2019<\/strong><\/a><\/td>Simulation under arbitrary temporal logic constraints<\/td>Julien Brunel<\/a>, David Chemouil<\/a>, Alcino Cunha<\/a> and Nuno Macedo<\/a><\/td>\n<\/tr>\n
F-IDE 2019<\/strong><\/a><\/td>The TLA+ Toolbox<\/td>Markus Kuppe<\/a><\/td>\n<\/tr>\n
F-IDE 2019<\/strong><\/a><\/td>Tool Support for Validation of Formal System Models: Interactive Visualization and Requirements Traceability<\/td>Eduard Kamburjan<\/a> and Jonas Stromberg<\/td>\n<\/tr>\n
F-IDE 2019<\/strong><\/a><\/td>What is KeY's key to software verification (Invited Talk)<\/td>Wolfgang Ahrendt<\/a><\/td>\n<\/tr>\n
FMAS 2019<\/strong><\/a><\/td>A Model Checking Agent-Based Architecture for Representing the Rules of the Road on Autonomous Vehicles<\/td>Gleifer Alves<\/a>, Louise Dennis<\/a> and Michael Fisher<\/a><\/td>\n<\/tr>\n
FMAS 2019<\/strong><\/a><\/td>A Temporal Logic Semantics for Teleo-Reactive Procedures<\/td>Keith Clark, Brijesh Dongol<\/a> and Peter Robinson<\/td>\n<\/tr>\n
FMAS 2019<\/strong><\/a><\/td>CriSGen: Constraint-based Generation of Critical Scenarios for Autonomous Vehicles<\/td>Andreas Nonnengart<\/a>, Matthias Klusch<\/a> and Christian M\u00fcller<\/a><\/td>\n<\/tr>\n
FMAS 2019<\/strong><\/a><\/td>Formal Methods Meet Autonomous Systems: a Journey on a Two-Year Research Collaboration with Industry (Invited Talk)<\/td>Claudio Menghi<\/a><\/td>\n<\/tr>\n
FMAS 2019<\/strong><\/a><\/td>Runtime Reasoning that Really Flies (Invited Talk)<\/td>Kristin Rozier<\/a><\/td>\n<\/tr>\n
FMAS 2019<\/strong><\/a><\/td>Towards a Mission Definition, Verification and Validation Toolchain<\/td>Louis Viard<\/a>, Laurent Ciarletta<\/a> and Pierre-Etienne Moreau<\/a><\/td>\n<\/tr>\n
FMAS 2019<\/strong><\/a><\/td>Verification of Fair Controllers for Urban Traffic Manoeuvres at Intersections<\/td>Maike Schwammberger<\/a> and Christopher Bischopink<\/a><\/td>\n<\/tr>\n
FMBC 2019<\/strong><\/a><\/td>A Distributed Blockchain Model of Selfish Mining<\/td>Dennis Eijkel and Ansgar Fehnker<\/a><\/td>\n<\/tr>\n
FMBC 2019<\/strong><\/a><\/td>Call me Back, I have a Type Invariant<\/td>M. Anthony Aiello<\/a>, Johannes Kanig<\/a> and Taro Kurita<\/a><\/td>\n<\/tr>\n
FMBC 2019<\/strong><\/a><\/td>Deductive Proof of Industrial Smart Contracts Using Why3<\/td>Zeinab Neha\u00ef<\/a> and Fran\u00e7ois Bobot<\/a><\/td>\n<\/tr>\n
FMBC 2019<\/strong><\/a><\/td>Formal specification of a security framework for smart contracts<\/td>Mikhail Mandrykin<\/a>, Jake O'Shannessy, Jacob Payne and Ilya Shchepetkov<\/a><\/td>\n<\/tr>\n
FMBC 2019<\/strong><\/a><\/td>Mi-Cho-Coq, a framework for certifying Tezos Smart Contracts<\/td>Bruno Bernardo<\/a>, Rapha\u00ebl Cauderlier, Zhenlei Hu, Basile Pesin and Julien Tesson<\/a><\/td>\n<\/tr>\n
FMBC 2019<\/strong><\/a><\/td>Smart Contract Interactions in Coq (Short paper)<\/td>Jakob Botsch Nielsen<\/a> and Bas Spitters<\/a><\/td>\n<\/tr>\n
FMBC 2019<\/strong><\/a><\/td>Smart Contracts: Application Scenarios for Deductive Program Verification (Short paper)<\/td>Jonas Schiffl<\/a>, Bernhard Beckert<\/a> and Mattias Ulbrich<\/td>\n<\/tr>\n
FMBC 2019<\/strong><\/a><\/td>Solidity 0.5: when typed does not mean type safe (Lightning Talk)<\/td>Silvia Crafa<\/a> and Matteo Di Pirro<\/a><\/td>\n<\/tr>\n
FMBC 2019<\/strong><\/a><\/td>Statistical Model Checking of RANDAO's Resilience to Pre-computed Reveal Strategies<\/td>Musab A. Alturki<\/a> and Grigore Ro\u015fu<\/a><\/td>\n<\/tr>\n
FMBC 2019<\/strong><\/a><\/td>The Scilla Journey: from Proof General to Thousands of Nodes (Keynote Talk)<\/td>Ilya Sergey<\/a><\/td>\n<\/tr>\n
FMBC 2019<\/strong><\/a><\/td>Towards a Smart Contract Verification Framework in Coq (Lightning Talk)<\/td>Danil Annenkov and Bas Spitters<\/a><\/td>\n<\/tr>\n
FMBC 2019<\/strong><\/a><\/td>Towards a Verified Model of the Algorand Consensus Protocol in Coq (Short paper)<\/td>Musab A. Alturki<\/a>, Jing Chen, Victor Luchangco<\/a>, Brandon Moore<\/a>, Karl Palmskog<\/a>, Lucas Pe\u00f1a and Grigore Ro\u015fu<\/a><\/td>\n<\/tr>\n
FMBC 2019<\/strong><\/a><\/td>Verifying Smart Contracts with Cubicle<\/td>Sylvain Conchon<\/a>, Alexandrina Korneva<\/a> and Fatiha Za\u00efdi<\/td>\n<\/tr>\n
FMIS 2019<\/strong><\/a><\/td>A Survey on Formal Methods for Interactive Systems<\/td>Pascal B\u00e9ger, S\u00e9bastien Leriche and Daniel Prun<\/a><\/td>\n<\/tr>\n
FMIS 2019<\/strong><\/a><\/td>Examples of the application of formal methods to interactive systems (Invited Talk)<\/td>Michael Harrison<\/a><\/td>\n<\/tr>\n
FMIS 2019<\/strong><\/a><\/td>Formal Modelling of Safety-Critical Interactive Devices using Coloured Petri Nets<\/td>Sapna Jaidka, Steve Reeves<\/a> and Judy Bowen<\/a><\/td>\n<\/tr>\n
FMIS 2019<\/strong><\/a><\/td>Fortune Nets: Formal, Petri nets-based, Engineering of Fortunettes<\/td>David Navarre<\/a>, Philippe Palanque<\/a>, Sven Coppers, Kris Luyten<\/a> and Davy Vanacken<\/td>\n<\/tr>\n
FMIS 2019<\/strong><\/a><\/td>Model-Based Testing of Post-WIMP Interactions Using Petri-nets<\/td>Alexandre Canny<\/a>, David Navarre<\/a>, Jos\u00e9 Creissac Campos<\/a> and Philippe Palanque<\/a><\/td>\n<\/tr>\n
FMIS 2019<\/strong><\/a><\/td>Modelling Reasoning with Real-time Maude in the Context of Human Behaviour<\/td>Antonio Cerone<\/a> and Peter Csaba \u00d6lveczky<\/a><\/td>\n<\/tr>\n
FMIS 2019<\/strong><\/a><\/td>Preliminary Thoughts on User Interfaces for Logic-based Medical Image Analysis (Short Paper)<\/td>Vincenzo Ciancia<\/a> and Mieke Massink<\/a><\/td>\n<\/tr>\n
FMIS 2019<\/strong><\/a><\/td>Synthesizing Glue Code for Graphical User Interfaces from Formal Specifications (Short Paper)<\/td>Keerthi Adabala and R\u00fcdiger Ehlers<\/a><\/td>\n<\/tr>\n
FMTea 2019<\/strong><\/a><\/td>Efficient online homologation to prepare students for formal methods courses (Tutorial)<\/td>Bas Luttik<\/a><\/td>\n<\/tr>\n
FMTea 2019<\/strong><\/a><\/td>Is Formal Methods really essential? (Invited Lecture)<\/td>Carroll Morgan<\/a><\/td>\n<\/tr>\n
FMTea 2019<\/strong><\/a><\/td>Logic, Algebra, and Geometry at the Foundation of Computer Science (Tutorial)<\/td>Tony Hoare<\/a>, Alexandra Mendes<\/a> and Jo\u00e3o Ferreira<\/a><\/td>\n<\/tr>\n
FMTea 2019<\/strong><\/a><\/td>Managing Heterogeneity and Bridging the Gap in Teaching Formal Methods<\/td>Pamela Fleischmann, Mitja Kulczynski<\/a>, Dirk Nowotka<\/a> and Thomas Wilke<\/td>\n<\/tr>\n
FMTea 2019<\/strong><\/a><\/td>On Complementing an Undergraduate Software Engineering Course with Formal Methods (Poster)<\/td>Bernd Westphal<\/a><\/td>\n<\/tr>\n
FMTea 2019<\/strong><\/a><\/td>On Teaching Applied Formal Methods in Aerospace Engineering<\/td>Kristin Rozier<\/a><\/td>\n<\/tr>\n
FMTea 2019<\/strong><\/a><\/td>Panel Discussion on Effective Teaching Techniques<\/td>Emil Sekerinski<\/a>, Liam O'Reilly<\/a>, Adrian Johnstone<\/a>, Mitja Kulczynski<\/a>, Andrew Simpson<\/a> and Joao Ferreira<\/td>\n<\/tr>\n
FMTea 2019<\/strong><\/a><\/td>Panel Discussion on Teaching Program Development<\/td>Catherine Dubois<\/a>, Thiago Mendon\u00e7a Ferreira Ramos, Mar\u00eda del Mar Gallardo<\/a>, Kristin Rozier<\/a> and Alexandra Mendes<\/a><\/td>\n<\/tr>\n
FMTea 2019<\/strong><\/a><\/td>Panel Discussion on Teaching Program Verification<\/td>Ana Romero<\/a>, Christophe Garion<\/a>, Sandrine Blazy<\/a> and Catherine Dubois<\/a><\/td>\n<\/tr>\n
FMTea 2019<\/strong><\/a><\/td>Principled and pragmatic specification of programming languages<\/td>Adrian Johnstone<\/a> and Elizabeth Scott<\/a><\/td>\n<\/tr>\n
FMTea 2019<\/strong><\/a><\/td>Teaching Concurrency with the Disappearing Formal Method<\/td>Emil Sekerinski<\/a><\/td>\n<\/tr>\n
FMTea 2019<\/strong><\/a><\/td>Teaching Deductive Verification in Why3 to Undergraduate Students<\/td>Sandrine Blazy<\/a><\/td>\n<\/tr>\n
FMTea 2019<\/strong><\/a><\/td>Teaching Discrete Mathematics to Computer Science Students<\/td>Faron Moller and Liam O'Reilly<\/a><\/td>\n<\/tr>\n
FMTea 2019<\/strong><\/a><\/td>Teaching Formal Methods to Future Engineers<\/td>Catherine Dubois<\/a>, Virgile Prevosto<\/a> and Guillaume Burel<\/td>\n<\/tr>\n
FMTea 2019<\/strong><\/a><\/td>Teaching Formal Methods: From Software in the Small to Software in the Large<\/td>Mar\u00eda del Mar Gallardo<\/a> and Laura Panizo<\/a><\/td>\n<\/tr>\n
FMTea 2019<\/strong><\/a><\/td>Teaching Formal Methods: Lessons Learnt from Using Event-B (Poster)<\/td>N\u00e9stor Cata\u00f1o<\/a><\/td>\n<\/tr>\n
FMTea 2019<\/strong><\/a><\/td>Teaching Introductory Formal Methods and Discrete Mathematics to Software Engineers: Reflections on a modelling-focussed approach<\/td>Andrew Simpson<\/a><\/td>\n<\/tr>\n
FMTea 2019<\/strong><\/a><\/td>Teaching deductive verification through Frama-C and SPARK<\/td>Christophe Garion<\/a>, J\u00e9r\u00f4me Hugues, Claire Dross, Joffrey Huguet and L\u00e9o Creuse<\/td>\n<\/tr>\n
FMTea 2019<\/strong><\/a><\/td>The Computational Relevance of Formal Logic through Formal Proofs<\/td>Ariane A. Almeida, Ana Cristina Rocha-Oliveira, Thiago Mendon\u00e7a Ferreira Ramos, Flavio L. C. De Moura and Mauricio Ayala-Rincon<\/a><\/td>\n<\/tr>\n
FMTea 2019<\/strong><\/a><\/td>Using Krakatoa for teaching formal verification of Java programs<\/td>Jose Divas\u00f3n and Ana Romero<\/a><\/td>\n<\/tr>\n
FMTea 2019<\/strong><\/a><\/td>You already used Formal Methods but did not know (Poster)<\/td>Giampaolo Bella<\/a><\/td>\n<\/tr>\n
FMTea 2019<\/strong><\/a><\/td>pseuCo.com (Tutorial)<\/td>Holger Hermanns<\/a> and Felix Freiberger<\/a><\/td>\n<\/tr>\n
HFM 2019<\/strong><\/a><\/td>Babbage's mechanical notation<\/td>Adrian Johnstone<\/a> and Elizabeth Scott<\/a><\/td>\n<\/tr>\n
HFM 2019<\/strong><\/a><\/td>Formal specifications and software testing: a fruitful convergence<\/td>Marie-Claude Gaudel<\/a><\/td>\n<\/tr>\n
HFM 2019<\/strong><\/a><\/td>From manuscripts to programming languages: an archivist perspective<\/td>Alexandra Vidal<\/a>, Ana Sandra Meneses and Ant\u00f3nio Sousa<\/a><\/td>\n<\/tr>\n
HFM 2019<\/strong><\/a><\/td>History of Abstract Interpretation<\/td>Francesco Ranzato<\/a> and Roberto Giacobazzi<\/a><\/td>\n<\/tr>\n
HFM 2019<\/strong><\/a><\/td>Reasoning about shared-variable concurrency: interactions between research threads<\/td>Cliff Jones<\/a><\/td>\n<\/tr>\n
HFM 2019<\/strong><\/a><\/td>Specification with class: A brief history of Object-Z<\/td>David Duke<\/a> and Graeme Smith<\/a><\/td>\n<\/tr>\n
HFM 2019<\/strong><\/a><\/td>The History and Evolution of B and Event-B<\/td>Sebastian Krings<\/a>, Michael Butler<\/a>, Philipp Koerner<\/a>, Thierry Lecomte<\/a>, Michael Leuschel<\/a> and Laurent Voison<\/td>\n<\/tr>\n
HFM 2019<\/strong><\/a><\/td>The Prehistory and History of Requirements Engineering (RE) (+ Software Engineering) as Seen by Me: How my interest in Formal Methods eventually moved me to RE<\/td>Daniel Berry<\/a><\/td>\n<\/tr>\n
HFM 2019<\/strong><\/a><\/td>The School of Squiggol: A History of the Bird-Meertens Formalism<\/td>Jeremy Gibbons<\/a><\/td>\n<\/tr>\n
HFM 2019<\/strong><\/a><\/td>The early history of flow diagrams as a formal method (Invited Talk)<\/td>Mark Priestley<\/a><\/td>\n<\/tr>\n
NSAD 2019<\/strong><\/a><\/td>A Dividing Method Minimizing the Linearization Term in Affine Arithmetic<\/td>Maxime Jacquemin<\/a> and Franck Vedrine<\/a><\/td>\n<\/tr>\n
NSAD 2019<\/strong><\/a><\/td>An abstract domain for objects in dynamic programming languages<\/td>Vincenzo Arceri, Michele Pasqua<\/a> and Isabella Mastroeni<\/a><\/td>\n<\/tr>\n
NSAD 2019<\/strong><\/a><\/td>Combination of Boxes and PolyhedraAbstractions for Constraint Solving<\/td>Ghiles Ziat<\/a>, Alexandre Mar\u00e9chal, Marie Pelleau, Antoine Min\u00e9<\/a> and Charlotte Truchet<\/a><\/td>\n<\/tr>\n
NSAD 2019<\/strong><\/a><\/td>Flow Insensitive Relational Static Analysis<\/td>Sol\u00e8ne Mirliaz<\/a> and David Pichardie<\/a><\/td>\n<\/tr>\n
NSAD 2019<\/strong><\/a><\/td>Improving the Numerical Accuracy of Parallel Programs by Data Mapping<\/td>Farah Benmouhoub<\/a>, Pierre-Loic Garoche and Matthieu Martel<\/a><\/td>\n<\/tr>\n
NSAD 2019<\/strong><\/a><\/td>Towards an abstraction for data structures that implement cooperation mechanisms<\/td>Guillaume Cluzel and Cezara Dr\u0103goi<\/a><\/td>\n<\/tr>\n
OVT 2019<\/strong><\/a><\/td>Exploring Human Behaviour in Cyber-Physical Systems with Multi-modelling and Co-simulation<\/td>Ken Pierce<\/a>, Carl Gamble<\/a>, David Golightly<\/a> and Roberto Palac\u00edn<\/a><\/td>\n<\/tr>\n
OVT 2019<\/strong><\/a><\/td>Migrating Overture to a different IDE<\/td>Peter W. V. Tran-J\u00f8rgensen<\/a> and Tomas Kulik<\/a><\/td>\n<\/tr>\n
OVT 2019<\/strong><\/a><\/td>Moving the INTO-CPS Application to the Cloud<\/td>Mikkel Bayard Rasmussen, Peter Gorm Larsen<\/a>, Casper Thule<\/a> and Hugo Daniel Macedo<\/a><\/td>\n<\/tr>\n
OVT 2019<\/strong><\/a><\/td>Teaching VDM (Invited Talk)<\/td>Ana Paiva<\/a><\/td>\n<\/tr>\n
OVT 2019<\/strong><\/a><\/td>Towards Graphical Configuration in the INTO-CPS Application<\/td>Christian Legaard<\/a>, Casper Thule<\/a> and Peter Gorm Larsen<\/a><\/td>\n<\/tr>\n
OVT 2019<\/strong><\/a><\/td>Towards Static Check of FMUs in VDM-SL<\/td>Nick Battle<\/a>, Casper Thule<\/a>, Cl\u00e1udio Gomes<\/a>, Hugo Daniel Macedo<\/a> and Peter Gorm Larsen<\/a><\/td>\n<\/tr>\n
OVT 2019<\/strong><\/a><\/td>ViennaDoc: An Animatable and Testable Specification Documentation Tool<\/td>Tomohiro Oda<\/a>, Keijiro Araki<\/a>, Yasuhiro Yamamoto, Kumiyo Nakakoji, Hiroshi Sako, Han-Myung Chang and Peter Gorm Larsen<\/a><\/td>\n<\/tr>\n
OpenCERT 2019<\/strong><\/a><\/td>A Calculus of Chaos in Stochastic Compilation: Engineering in the Cause of Mathematics<\/td>Peter T. Breuer<\/a> and Simon Pickin<\/td>\n<\/tr>\n
OpenCERT 2019<\/strong><\/a><\/td>A Survey of Learning Methods in Open Source Software<\/td>Aidarbek Suleimenov<\/a>, Assiya Khuzyakhmetova<\/a> and Antonio Cerone<\/a><\/td>\n<\/tr>\n
OpenCERT 2019<\/strong><\/a><\/td>Challenges faced by students in an Open Source Software Undergraduate Course<\/td>Dias Issa<\/td>\n<\/tr>\n
OpenCERT 2019<\/strong><\/a><\/td>Open Community approaches to Education Publishing and Research - a look into the recent past (Invited Talk)<\/td>Andreas Meiszner<\/a><\/td>\n<\/tr>\n
OpenCERT 2019<\/strong><\/a><\/td>Open Source Software as a Learning Tool for Computer Science Students<\/td>Assiya Khuzyakhmetova<\/a> and Aidarbek Suleimenov<\/a><\/td>\n<\/tr>\n
OpenCERT 2019<\/strong><\/a><\/td>Open and Interactive Learning Resources for Algorithmic Problem Solving<\/td>Jo\u00e3o Ferreira<\/a> and Alexandra Mendes<\/a><\/td>\n<\/tr>\n
OpenCERT 2019<\/strong><\/a><\/td>Runtime Verification of Linux Kernel Security Module<\/td>Ilya Shchepetkov<\/a> and Denis Efremov<\/a><\/td>\n<\/tr>\n
REFINE 2019<\/strong><\/a><\/td>A Map of Asynchronous Communication Models<\/td>Florent Chevrou<\/a>, Aur\u00e9lie Hurault<\/a> and Philippe Queinnec<\/td>\n<\/tr>\n
REFINE 2019<\/strong><\/a><\/td>An abstract semantics of speculative execution for reasoning about security vulnerabilities<\/td>Robert Colvin<\/a> and Kirsten Winter<\/a><\/td>\n<\/tr>\n
REFINE 2019<\/strong><\/a><\/td>Comparing Correctness-by-Construction with Post-hoc Verification - A Qualitative User Study<\/td>Tobias Runge<\/a>, Thomas Th\u00fcm, Loek Cleophas<\/a>, Ina Schaefer<\/a> and Bruce Watson<\/a><\/td>\n<\/tr>\n
REFINE 2019<\/strong><\/a><\/td>Exploring the use of Rely\/Guarantee Reasoning for Non-blocking Algorithms (Short paper)<\/td>Nisansala Yatapanage<\/a><\/td>\n<\/tr>\n
REFINE 2019<\/strong><\/a><\/td>Refinement in practice: from an informal description to a formal specification (Invited Talk)<\/td>R\u00e9gine Laleau<\/a><\/td>\n<\/tr>\n
REFINE 2019<\/strong><\/a><\/td>Towards a Method for the Decomposition by Refinement in Event-B (Short paper)<\/td>Kenza Kraibi<\/a>, Rahma Ben Ayed, Joris Rehm, Simon Collart-Dutilleul, Philippe Bon<\/a> and Dorian Petit<\/td>\n<\/tr>\n
REFINE 2019<\/strong><\/a><\/td>Transformations for Generating Type Refinements<\/td>Douglas Smith<\/a> and Stephen Westfold<\/a><\/td>\n<\/tr>\n
REFINE 2019<\/strong><\/a><\/td>Weakening correctness and linearizability for concurrent objects on multicore processors<\/td>Graeme Smith<\/a> and Lindsay Groves<\/a><\/td>\n<\/tr>\n
RPLA 2019<\/strong><\/a><\/td>Minimal Reversible Deterministic Finite Automata<\/td>Markus Holzer<\/a><\/td>\n<\/tr>\n
RPLA 2019<\/strong><\/a><\/td>Quotients and Atoms of Reversible Languages<\/td>Hellis Tamm<\/a><\/td>\n<\/tr>\n
RPLA 2019<\/strong><\/a><\/td>Reversibility and Determinism in P Systems<\/td>Rudolf Freund<\/a><\/td>\n<\/tr>\n
RPLA 2019<\/strong><\/a><\/td>Reversible Computing from a Programming Language Perspective (Invited Talk)<\/td>Robert Gl\u00fcck<\/a><\/td>\n<\/tr>\n
RPLA 2019<\/strong><\/a><\/td>Reversible Programs Have Reversible Semantics<\/td>Robert Gl\u00fcck<\/a>, Robin Kaarsgaard<\/a> and Tetsuo Yokoyama<\/a><\/td>\n<\/tr>\n
RPLA 2019<\/strong><\/a><\/td>Reversible and Irreversible Regular Languages<\/td>Luca Prigioniero<\/a><\/td>\n<\/tr>\n
RPLA 2019<\/strong><\/a><\/td>Two-Way Quantum and Classical Automata with Advice for Online Minimization Problems<\/td>Kamil Khadiev<\/a> and Aliya Khadieva<\/td>\n<\/tr>\n
SASB 2019<\/strong><\/a><\/td>Bayesian Verification of Chemical Reaction Networks<\/td>Gareth Molyneux<\/a>, Viraj Brian Wijesuriya and Alessandro Abate<\/a><\/td>\n<\/tr>\n
SASB 2019<\/strong><\/a><\/td>Biochemical pathways from causal cores in rule-based modelling<\/td>S\u00e9bastien L\u00e9gar\u00e9<\/a><\/td>\n<\/tr>\n
SASB 2019<\/strong><\/a><\/td>Kappa Site-graph Patterns Equations Resolution<\/td>Yvan Sraka<\/a> and J\u00e9r\u00f4me Feret<\/a><\/td>\n<\/tr>\n
SASB 2019<\/strong><\/a><\/td>Learning boolean regulations based on prior-knowledge data: a logical-based viewpoint (Keynote talk)<\/td>Anne Siegel<\/a><\/td>\n<\/tr>\n
SASB 2019<\/strong><\/a><\/td>Modeling and optimizing metabolism with constraint-based and pathway analysis methods (Keynote talk)<\/td>Miguel Rocha<\/a><\/td>\n<\/tr>\n
SASB 2019<\/strong><\/a><\/td>Nested Event Representation for Automated Assembly of Cell Signaling Network Models<\/td>Evan Becker<\/a>, Kara Bocan and Natasa Miskov-Zivanov<\/a><\/td>\n<\/tr>\n
SASB 2019<\/strong><\/a><\/td>Specification and Analysis of Biochemical Systems in BCSL<\/td>Matej Troj\u00e1k<\/a>, David \u0160afr\u00e1nek<\/a>, Jan \u010cerven\u00fd, Lubo\u0161 Brim<\/a> and Lukr\u00e9cia Mertov\u00e1<\/td>\n<\/tr>\n
TAPAS 2019<\/strong><\/a><\/td>AuthCheck: Program-state Analysis for Access-control Vulnerabilities<\/td>Goran Piskachev<\/a>, Tobias Petrasch<\/a>, Johannes Sp\u00e4th and Eric Bodden<\/a><\/td>\n<\/tr>\n
TAPAS 2019<\/strong><\/a><\/td>Boost the Impact of Continuous Formal Verification in Industry<\/td>Felipe R. Monteiro, Mikhail R. Gadelha<\/a> and Lucas Cordeiro<\/a><\/td>\n<\/tr>\n
TAPAS 2019<\/strong><\/a><\/td>Establishing Sound Static Analysis for Integration Verification of Large-Scale Software in Automotive Industry (Invited Talk)<\/td>Bernard Schmidt<\/a><\/td>\n<\/tr>\n
TAPAS 2019<\/strong><\/a><\/td>Experiments in Context-Sensitive Incremental and Modular Static Analysis in CiaoPP (Extended Abstract)<\/td>Isabel Garcia-Contreras<\/a>, Jose F. Morales<\/a> and Manuel Hermenegildo<\/a><\/td>\n<\/tr>\n
TAPAS 2019<\/strong><\/a><\/td>Handling Heap Data Structures in Backward Symbolic Execution<\/td>Robert Hus\u00e1k<\/a>, Jan Kofro\u0148<\/a> and Filip Zavoral<\/td>\n<\/tr>\n
TAPAS 2019<\/strong><\/a><\/td>Leveraging Highly Automated Theorem Proving for Certification<\/td>Deni Raco<\/a>, Bernhard Rumpe<\/a> and Sebastian St\u00fcber<\/td>\n<\/tr>\n
TAPAS 2019<\/strong><\/a><\/td>PrideMM: Second Order Model Checking for Memory Consistency Models<\/td>Simon Cooksey, Sarah Harris, Mark Batty, Radu Grigore and Mikol\u00e1\u0161 Janota<\/a><\/td>\n<\/tr>\n
TAPAS 2019<\/strong><\/a><\/td>Transforming development processes of avionics software with formal methods (Invited Talk)<\/td>Pascal Lacabanne<\/a><\/td>\n<\/tr>\n
TAPAS 2019<\/strong><\/a><\/td>fkcc: the Farkas Calculator<\/td>Christophe Alias<\/a><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n
\n<\/small><\/p>\n","protected":false},"excerpt":{"rendered":"

The table below lists all invited talks and papers accepted for presentation at FM’19 events.<\/p>\n","protected":false},"author":3,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":[],"_links":{"self":[{"href":"http:\/\/formalmethods2019.inesctec.pt\/wp-json\/wp\/v2\/pages\/2207"}],"collection":[{"href":"http:\/\/formalmethods2019.inesctec.pt\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"http:\/\/formalmethods2019.inesctec.pt\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"http:\/\/formalmethods2019.inesctec.pt\/wp-json\/wp\/v2\/users\/3"}],"replies":[{"embeddable":true,"href":"http:\/\/formalmethods2019.inesctec.pt\/wp-json\/wp\/v2\/comments?post=2207"}],"version-history":[{"count":60,"href":"http:\/\/formalmethods2019.inesctec.pt\/wp-json\/wp\/v2\/pages\/2207\/revisions"}],"predecessor-version":[{"id":3820,"href":"http:\/\/formalmethods2019.inesctec.pt\/wp-json\/wp\/v2\/pages\/2207\/revisions\/3820"}],"wp:attachment":[{"href":"http:\/\/formalmethods2019.inesctec.pt\/wp-json\/wp\/v2\/media?parent=2207"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}