Moa Johansson

Associate Professor at Formal methods

Contact Details ORCID

Publications (20)
Projects (1)

Showing 20 publications

2021

Conjectures, tests and proofs: An overview of theory exploration

Moa Johansson, Nicholas Smallbone

Electronic Proceedings in Theoretical Computer Science, EPTCS. Vol. 341, p. 1-16

Paper in proceeding

2020

Template-based Theory Exploration: Discovering Properties of Functional Programs by Testing

Sólrún Einarsdóttir, Nicholas Smallbone, Moa Johansson

ACM International Conference Proceeding Series, p. 67-78

Paper in proceeding

2020

Theory exploration: Conjecturing, testing and reasoning about programs

Moa Johansson

Electronic Proceedings in Theoretical Computer Science, EPTCS. Vol. 320

Paper in proceeding

2019

Preface

José Júlio Alferes, Moa Johansson

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 11372 LNCS, p. V-VI

Other text in scientific journal

2019

Lemma Discovery for Induction: A Survey

Moa Johansson

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 11617 LNAI, p. 125-139

Paper in proceeding

2019

Proving Type Class Laws for Haskell

Andreas Arvidsson, Moa Johansson, Robin Touche

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 10447 LNCS, p. 61-74

Paper in proceeding

2018

Into the infinite - theory exploration for coinduction

Sólrún Einarsdóttir, Moa Johansson, Johannes Åman Pohjala

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 11110 LNAI, p. 70-86

Paper in proceeding

2018

Towards Machine Learning on Data from Professional Cyclists

Agrin Hilmkil, Oscar Ivarsson, Moa Johansson et al

Paper in proceeding

2017

Quick Specifications for the Busy Programmer

Nicholas Smallbone, Moa Johansson, Koen Lindström Claessen et al

Journal of Functional Programming. Vol. 27

Journal article

2017

QuickSpec: a lightweight theory exploration tool for programmers (system demonstration)

Maximilian Algehed, Koen Lindström Claessen, Moa Johansson et al

SIGPLAN Notices (ACM Special Interest Group on Programming Languages). Vol. 52 (10), p. 38-39

Journal article

2017

Automated theory exploration for interactive theorem proving: An introduction to the hipster system

Moa Johansson

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 10499 LNCS, p. 1-11

Paper in proceeding

2016

Proving Type Class Laws for Haskell

Andreas Arvidsson, Moa Johansson, Robin Touche

Preprint

2015

TIP: Tons of Inductive Problems

Koen Lindström Claessen, Moa Johansson, Dan Rosén et al

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 9150, p. 332-336

Paper in proceeding

2015

The Theory behind TheoryMine

A. Bundy, F. Cavallo, L. Dixon et al

IEEE Intelligent Systems. Vol. 30 (4), p. 64-69

Journal article

2015

Interpolation Systems for Ground Proofs in Automated Deduction: a Survey

M.P. Bonacina, Moa Johansson

Journal of Automated Reasoning. Vol. 54 (4), p. 353-390

Journal article

2015

On Interpolation in Automated Theorem Proving

M.P. Bonacina, Moa Johansson

Journal of Automated Reasoning. Vol. 54 (1), p. 69-97

Journal article

2015

Conditional Lemma Discovery and Recursion Induction in Hipster.

Moa Johansson, Irene Lobo Valbuena

Proceedings of the International Workshop on Automated Verification of Critical Systems (AVoCS). Electronic Communications of the EASST.. Vol. 72

Paper in proceeding

2014

Hipster: Integrating theory exploration in a proof assistant

Moa Johansson, Dan Rosén, Nicholas Smallbone et al

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 8543, p. 108-122

Paper in proceeding

2013

Automating Inductive Proofs using Theory Exploration

Koen Lindström Claessen, Dan Rosén, Moa Johansson et al

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7898, p. 392-406

Paper in proceeding

2013

Proof-pattern recognition and lemma discovery in ACL2

J. Heras, E. Komendantskaya, Moa Johansson et al

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 8312, p. 389-406

Paper in proceeding

Download publication list

You can download this list to your computer.

Filter and download publication list

As logged in user (Chalmers employee) you find more export functions in MyResearch.

You may also import these directly to Zotero or Mendeley by using a browser plugin. These are found herer:

Zotero Connector
Mendeley Web Importer

The service SwePub offers export of contents from Research in other formats, such as Harvard and Oxford in .RIS, BibTex and RefWorks format.

Showing 1 research projects

2015–2018

Learning and Exploration in Automated Theorem Proving

Moa Johansson Software Technology (Chalmers)

Swedish Research Council (VR)

There might be more projects where Moa Johansson participates, but you have to be logged in as a Chalmers employee to see them.