Published: 2nd September 2019|
|Preface Mircea Marin and Adrian Crăciun||1|
|Verifying the DPLL Algorithm in Dafny Cezar-Constantin Andrici and Ştefan Ciobâcă||3|
|From Hybrid Modal Logic to Matching Logic and Back Ioana Leuştean, Natalia Moangă and Traian Florin Şerbănuţă||16|
|(Co)inductive Proof Systems for Compositional Proofs in Reachability Logic Vlad Rusu and David Nowak||32|
|Explaining SDN Failures via Axiomatisations Georgiana Caltais||48|
|Gröbner Bases with Reduction Machines Georgiana Şurlea and Adrian Crăciun||61|
|Proof–Based Synthesis of Sorting Algorithms Using Multisets in Theorema Isabela Drămnesc and Tudor Jebelean||76|
|Probabilities in Session Types Bogdan Aman and Gabriel Ciobanu||92|
|An Operational Semantics of Graph Transformation Systems Using Symmetric Nets Lorenzo Capra||107|
|Finitely Supported Sets Containing Infinite Uniformly Supported Subsets Andrei Alexandru and Gabriel Ciobanu||120|
This workshop featured nine invited talks, nine presentations of regular papers, and six presentations of short papers. These proceedings contain the full version of the regular papers.
FROM aims to bring together researchers and practitioners who work on formal methods by contributing new theoretical results, methods, techniques, and frameworks, and/or make the formal methods to work by creating or using software tools that apply theoretical contributions. Areas and formalisms of interest to this workshop included:
We thank invited speakers and authors for their contributions to this EPTCS volume, and the PC members of FROM 2019 for their help in the review process. We are grateful to the editor-in-chief of EPTCS, Professor Rob van Glabbeek, for his support.