Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Conferences, Workshops, Symposiums, and Seminars
  4. Translating Scala Programs to Isabelle/HOL, Automated Reasoning
 
conference paper

Translating Scala Programs to Isabelle/HOL, Automated Reasoning

Hupel, Lars
•
Kuncak, Viktor
June 12, 2016
Lecture Notes in Computer Science

We present a trustworthy connection between the Leon verification system and the Isabelle proof assistant. Leon is a system for verifying functional Scala programs. It uses a variety of automated theorem provers (ATPs) to check verification conditions (VCs) stemming from the input program. Isabelle, on the other hand, is an interactive theorem prover used to verify mathematical specifications using its own input language Isabelle/Isar. Users specify (inductive) definitions and write proofs about them manually, albeit with the help of semi-automated tactics. The integration of these two systems allows us to exploit Isabelle’s rich standard library and give greater confidence guarantees in the correctness of analysed programs.

  • Files
  • Details
  • Metrics
Loading...
Thumbnail Image
Name

HupelKuncak16TranslatingScalaProgramsIsabelleHOLSystemDescription.pdf

Access type

openaccess

Size

199.91 KB

Format

Adobe PDF

Checksum (MD5)

1636b8ef2791d5caf45c82ed881d4462

Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés