• Cite Icon11
  • https://doi.org/10.1007/978-3-319-49812-6_3Copy DOI Icon

Dynamic Logic for Java

  • Jan 1, 2016
  • Bernhard Beckert +2 more
Show More
  • Abstract
  • Literature Map
  • Citations
  • Similar Papers
Abstract

In this chapter, we introduce an instance of dynamic logic, called JavaDL, that allows us to reason about Java programs. Dynamic logic extends first-order logic and makes it possible to consider several program states in a single formula. Its principle is the formulation of assertions about program behavior by integrating programs and formulas within a single language. We present a sequent calculus for JavaDL, which is used in the KeY System for verifying Java programs. Deduction in this calculus is based on symbolic program execution and simple program transformations and is, thus, close to a programmer's understanding of Java. Besides rules for symbolic execution, the calculus contains rules for program abstraction and modularization, including invariant rules for reasoning about loops and rules that replace a method invocation by the method's contract.

Similar Papers
  • Research Article
  • Citations7

Automatic Extraction of Heap Reference Properties in Object-Oriented Programs

  • May 01, 2009
  • IEEE Transactions on Software Engineering
  • B Demsky +1
  • Conference Article
  • Citations3

Symbolic parallel adaptive importance sampling for probabilistic program analysis

  • Aug 18, 2021
  • Yicheng Luo +2
  • Supplementary Content
  • Citations1

Deductive Verification of Safety-Critical Java Programs

  • Jan 01, 2009
  • Repository KITopen (Karlsruhe Institute of Technology)
  • Christian Engel
  • Book Chapter
  • Citations5

Cut Free Labelled Sequent Calculus for Dynamic Logic of Relation Changers

  • Jan 01, 2017
  • Ryo Hatano +2
  • Research Article
  • Citations1

Verification of dynamic memory allocators based on symbolic program execution

  • Feb 01, 2020
  • Scientific and Technical Journal of Information Technologies, Mechanics and Optics
  • A.M Dergachev +4
  • PDF
  • Research Article
  • Citations1

Формальная модель обнаружения программных ошибок с помощью символьного исполнения программ

  • Jan 01, 2019
  • Proceedings of the Institute for System Programming of the RAS
  • A.Y Gerasimov +2
  • Conference Article

Resolution method for one passage symbolic testing of ramified program structures

  • Nov 01, 2010
  • Branko Markoski +4
  • Research Article

An input centric paradigm for program dynamic optimizations and lifetime evolvement

  • Oct 17, 2018
  • Xipeng Shen +1
  • Research Article
  • Citations15

Automated exploit generation for stack buffer overflow vulnerabilities

  • Nov 01, 2015
  • Programming and Computer Software
  • V A Padaryan +2
  • Research Article
  • Citations17

Methodology and empirical results of program behaviour measurements

  • May 28, 1980
  • ACM SIGMETRICS Performance Evaluation Review
  • Timo O Alanko +2
  • Conference Article
  • Citations6

Open Unification for Program Query Languages

  • Nov 01, 2007
  • Johan Brichau +2
  • Research Article
  • Citations18

Propositional dynamic logic with local assignment

  • Jan 01, 1985
  • Theoretical Computer Science
  • M.L Tiomkin +1
  • Research Article
  • Citations46

Extracting and answering why and why not questions about Java program output

  • Aug 01, 2010
  • ACM Transactions on Software Engineering and Methodology
  • Amy J Ko +1
  • Book Chapter
  • Citations1

On the Construction of Multi-valued Concurrent Dynamic Logics

  • Jan 01, 2020
  • Leandro Gomes
  • Research Article
  • Citations91

Hardware-Assisted Run-Time Monitoring for Secure Program Execution on Embedded Processors

  • Dec 01, 2006
  • IEEE Transactions on Very Large Scale Integration (VLSI) Systems
  • Divya Arora +3
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.