Cookies Policy
We use cookies to improve our site and your experience. By continuing to browse our site you accept our cookie policy. Find out More
Close
  • Menu
About

About

I am an Assistant Professor at the Department of Informatics of the University of Minho and a researcher at HASLab/INESC TEC. I obtained is PhD degree in Computer Science from this university in 2004. My research interests include formal methods, program verification, type systems and logic.

Interest
Topics
Details

Details

  • Name

    Maria João Frade
  • Cluster

    Computer Science
  • Role

    Senior Researcher
  • Since

    01st November 2011
001
Publications

2018

A Generalized Approach to Verification Condition Generation

Authors
Lourenço, CB; Frade, MJ; Nakajima, S; Pinto, JS;

Publication
2018 IEEE 42nd Annual Computer Software and Applications Conference, COMPSAC 2018, Tokyo, Japan, 23-27 July 2018, Volume 1

Abstract

2016

Formalizing single-assignment program verification: An adaptation-complete approach

Authors
Lourenco, CB; Frade, MJ; Pinto, JS;

Publication
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Abstract
Deductive verification tools typically rely on the conversion of code to a single-assignment (SA) form. In this paper we formalize program verification based on the translation of While programs annotated with loop invariants into a dynamic single-assignment language with a dedicated iterating construct, and the subsequent generation of compact, indeed linear-size, verification conditions. Soundness and completeness proofs are given for the entire workflow, including the translation of annotated programs to SA form. The formalization is based on a program logic that we show to be adaptation-complete. Although this important property has not, as far as we know, been established for any existing program verification tool, we believe that adaptationcompleteness is one of the major motivations for the use of SA form as an intermediate language. Our results here show that indeed this allows for the tools to achieve the maximum degree of adaptation when handling subprograms. © Springer-Verlag Berlin Heidelberg 2016.

2014

A Bounded Model Checker for SPARK Programs

Authors
Lourenco, CB; Frade, MJ; Pinto, JS;

Publication
AUTOMATED TECHNOLOGY FOR VERIFICATION AND ANALYSIS, ATVA 2014

Abstract
This paper discusses the design and implementation of a bounded model checker for SPARK code, and provides a proof of concept of the utility and practicality of bounded verification for SPARK.

2011

Verification Conditions for Source-level Imperative Programs

Authors
Maria João Frade; Jorge Sousa Pinto

Publication
Computer Science Review - Computer Science Review, vol.5, no.3, pp.252-277

Abstract

Supervised
thesis

2016

Correct Translation of Imperative Programs to Single Assignment Form

Author
Marta Vasconcelos Castro Azevedo

Institution
UM

2015

AuTGen-C: uma plataforma para geração de testes com base no CBMC

Author
Fábio Esteves Sousa

Institution
UM