431 citations
- Technical University of DenmarkDK18 papers
- IMDEA Software InstituteES11 papers
- University of CopenhagenDK10 papers
- Danish National Research FoundationDK8 papers
- Centre National de la Recherche ScientifiqueFR7 papers
- University of California, BerkeleyUS7 papers
- Institut Laue-LangevinFR5 papers
- Nankai UniversityCN5 papers
- The University of SydneyAU5 papers
- Aalborg UniversityDK4 papers
- Deutsches Zentrum für Luft- und Raumfahrt e. V. (DLR)DE4 papers
- Monash UniversityAU4 papers
12 papers · 1 filter
Teaching Intuitionistic and Classical Propositional Logic Using Isabelle
Jørgen Villadsen, Asta Halkjær From, Patrick Blackburn
We describe a natural deduction formalization of intuitionistic and classical propositional logic in the Isabelle/Pure framework. In contrast to earlier work, where we explored the…
Regular Path Clauses and Their Application in Solving Loops
Bishoksan Kafle, John P. Gallagher, Manuel V. Hermenegildo +3
A well-established approach to reasoning about loops during program analysis is to capture the effect of a loop by extracting recurrences from the loop; these express relationships…
Isabelle/HOL as a Meta-Language for Teaching Logic
Asta Halkjær From, Jørgen Villadsen, Patrick Blackburn
Proof assistants are important tools for teaching logic. We support this claim by discussing three formalizations in Isabelle/HOL used in a recent course on automated reasoning. Th…
Polyvariant Program Specialisation with Property-based Abstraction
John P. Gallagher
In this paper we show that property-based abstraction, an established technique originating in software model checking, is a flexible method of controlling polyvariance in program…
Proceedings Third Workshop on Models for Formal Analysis of Real Systems and Sixth International Workshop on Verification and Program Transformation
John P. Gallagher, Rob van Glabbeek, Wendelin Serwe
This volume contains the joint proceedings of MARS 2018, the third workshop on Models for Formal Analysis of Real Systems, and VPT 2018, the sixth international workshop on Verific…
On Proving Confluence Modulo Equivalence for Constraint Handling Rules
Henning Christiansen, Maja H. Kirkeby
Previous results on proving confluence for Constraint Handling Rules are extended in two ways in order to allow a larger and more realistic class of CHR programs to be considered c…