English
Related papers

Related papers: Interactive Simplifier Tracing and Debugging in Is…

200 papers

We significantly improve the performance of the E automated theorem prover on the Isabelle Sledgehammer problems by combining learning and theorem proving in several ways. In particular, we develop targeted versions of the ENIGMA guidance…

Artificial Intelligence · Computer Science 2022-05-05 Zarathustra A. Goertzel , Jan Jakubův , Cezary Kaliszyk , Miroslav Olšák , Jelle Piepenbrock , Josef Urban

Proof competence, i.e. the ability to write and check (mathematical) proofs, is an important skill in Computer Science, but for many students it represents a difficult challenge. The main issues are the correct use of formal language and…

Logic in Computer Science · Computer Science 2023-08-15 Nadine Karsten , Frederik Krogsdal Jacobsen , Kim Jana Eiken , Uwe Nestmann , Jørgen Villadsen

Recent advances in Large Language Models have led to Large Reasoning Models, which produce step-by-step reasoning traces. These traces offer insight into how models think and their goals, improving explainability and helping users follow…

Human-Computer Interaction · Computer Science 2025-11-17 Ludwig Felder , Jacob Miller , Markus Wallinger , Stephen Kobourov , Chunyang Chen

Auto2 is a recently introduced prover for the proof assistant Isabelle. It is designed to be both highly customizable from within Isabelle, and also have a powerful proof search mechanism. In this paper, we apply auto2 to the verification…

Logic in Computer Science · Computer Science 2018-02-27 Bohua Zhan

We describe our Natural Deduction Assistant (NaDeA) and the interfaces between the Isabelle proof assistant and NaDeA. In particular, we explain how NaDeA, using a generated prover that has been verified in Isabelle, provides feedback to…

Logic in Computer Science · Computer Science 2018-03-06 Jørgen Villadsen , Andreas Halkjær From , Anders Schlichtkrull

Linear programming describes the problem of optimising a linear objective function over a set of constraints on its variables. In this paper we present a solver for linear programs implemented in the proof assistant Isabelle/HOL. This…

Logic in Computer Science · Computer Science 2024-03-29 Julian Parsert

The Isabelle Archive of Formal Proofs (AFP) has grown to over 500 articles in late 2019. Meanwhile, finding formalizations in it has not exactly become easier. At the time of writing, the site-specific AFP google search and the Isabelle…

Logic in Computer Science · Computer Science 2022-05-02 Fabian Huch , Alexander Krauss

Assurance cases are often required to certify critical systems. The use of formal methods in assurance can improve automation, increase confidence, and overcome errant reasoning. However, assurance cases can never be fully formalised, as…

Software Engineering · Computer Science 2021-06-11 Simon Foster , Yakoub Nemouchi , Mario Gleirscher , Ran Wei , Tim Kelly

OnlineProver is an interactive proof assistant tailored for the educational setting. Its main features include a user-friendly interface for editing and checking proofs. The user interface provides feedback directly within the derivation,…

A large class of data questions can be modeled as identifying important slices of data driven by user defined metrics. This paper presents TRACE, a Time-Relational Approximate Cubing Engine that enables interactive analysis on such slices…

Information Retrieval · Computer Science 2024-01-15 Suharsh Sivakumar , Jonathan Shen , Rajat Monga

The Abella interactive theorem prover has proven to be an effective vehicle for reasoning about relational specifications. However, the system has a limitation that arises from the fact that it is based on a simply typed logic:…

Logic in Computer Science · Computer Science 2018-06-21 Gopalan Nadathur , Yuting Wang

In this paper, we propose the use of interactive theorem proving for explainable machine learning. After presenting our proposition, we illustrate it on the dedicated application of explaining security attacks using the Isabelle…

Software Engineering · Computer Science 2022-01-03 Florian Kammüller

Exploring data relations across multiple views has been a common task in many domains such as bioinformatics, cybersecurity, and healthcare. To support this, various techniques (e.g., visual links and brushing and linking) are used to show…

Human-Computer Interaction · Computer Science 2025-05-30 Abdul Rahman Shaikh , Maoyuan Sun , Xingchen Liu , Hamed Alhoori , Jian Zhao , David Koop

This paper describes Hipster, a system integrating theory exploration with the proof assistant Isabelle/HOL. Theory exploration is a technique for automatically discovering new interesting lemmas in a given theory development. Hipster can…

Logic in Computer Science · Computer Science 2014-05-15 Moa Johansson , Dan Rosen , Nicholas Smallbone , Koen Claessen

We present a novel iterative, edit-based approach to unsupervised sentence simplification. Our model is guided by a scoring function involving fluency, simplicity, and meaning preservation. Then, we iteratively perform word and phrase-level…

Computation and Language · Computer Science 2020-06-18 Dhruv Kumar , Lili Mou , Lukasz Golab , Olga Vechtomova

Although modern recommendation systems can exploit the structure in users' item feedback, most are powerless in the face of new users who provide no structure for them to exploit. In this paper we introduce ImplicitCE, an algorithm for…

Information Retrieval · Computer Science 2018-09-12 Dan Shiebler

Mechanized theorem proving is becoming the basis of reliable systems programming and rigorous mathematics. Despite decades of progress in proof automation, writing mechanized proofs still requires engineers' expertise and remains labor…

Logic in Computer Science · Computer Science 2019-04-19 Yutaka Nagashima

Systematic reviews provide comprehensive syntheses of research fields. As a result, systematic reviews often emphasize synthesizing across the large bodies of literature rather than just describing the studies from which the conclusions…

Proof assistants, such as Isabelle/HOL, offer tools to facilitate inductive theorem proving. Isabelle experts know how to use these tools effectively; however, there is a little tool support for transferring this expert knowledge to a wider…

Logic in Computer Science · Computer Science 2020-05-26 Yutaka Nagashima

Teaching precise mathematical reasoning can be very hard. It is very easy for a student to make a subtle mistake in a proof which invalidates it, but it is often hard for the teacher to pinpoint and explain the problem in the (often…

Computers and Society · Computer Science 2015-07-15 Marek Materzok