The KeY Platform for Verification and Analysis of Java Programs

Ahrendt, Wolfgang; Beckert, Bernhard; Bruns, Daniel; Bubel, Richard; Gladisch, Christoph; Grebing, Sarah; Hähnle, Reiner; Hentschel, Martin; Herda, Mihai; Klebanov, Vladimir; Mostowski, Wojciech; Scheben, Christoph; Schmitt, Peter H.; Ulbrich, Mattias

doi:10.1007/978-3-319-12154-3_4

Cited by 46 publications

(41 citation statements)

References 36 publications

(40 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We provide a precise semantics by giving an explicit logical encoding of overridable model methods in a first-order verification logic. This encoding is used in the implementation of our approach within the KeY program verifier [2,4]. In KeY Java programs and their JML specifications are translated to proof obligations and then proved correct by the KeY verification engine that provides a high degree of automation, and allows for user guided proof interactions where necessary.…”

Section: Introductionmentioning

confidence: 99%

Dynamic Dispatch for Method Contracts Through Abstract Predicates

Mostowski¹,

Ulbrich²

2016

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. Dynamic method dispatch is a core feature of object-oriented programming by which the executed implementation for a polymorphic method is only chosen at runtime. In this paper, we present a specification and verification methodology which extends the concept of dynamic dispatch to design-by-contract specifications.The formal specification language JML has only rudimentary means for polymorphic abstraction in expressions. We promote these to fully flexible specification-only query methods called model methods that can, like ordinary methods, be overridden to give specifications a new semantics in subclasses in a transparent and modular fashion. Moreover, we allow them to refer to more than one program state which give us the possibility to fully abstract and encapsulate two-state specification contexts, i.e., history constraints and method postconditions. Finally, we provide an elegant and flexible mechanism to specify restrictions on specifications in subtypes. Thus behavioural subtyping can be enforced, yet it still allows for other specification paradigms.We provide the semantics for model methods by giving a translation into a first order logic and according proof obligations. We fully implemented this framework in the KeY program verifier and successfully verified relevant examples. We have also implemented an extension to KeY to support permission-based verification of concurrent Java programs. In this context model methods provide a modular specification method to treat code synchronisation through API methods.

show abstract

Section: Introductionmentioning

confidence: 99%

Dynamic Dispatch for Method Contracts Through Abstract Predicates

Mostowski¹,

Ulbrich²

2016

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…We base our work on the Java Dynamic Logic [7] and its implementation in the KeY verifier 2 [8]. KeY is a symbolic execution-based interactive verification system for Java programs annotated with JML [9].…”

Section: Introductionmentioning

confidence: 99%

Dynamic Frames Based Verification Method for Concurrent Java Programs

Mostowski

2016

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. In this paper we discuss a verification method for concurrent Java programs based on the concept of dynamic frames. We build on our earlier work that proposes a new, symbolic permission system for concurrent reasoning and we provide the following new contributions. First, we describe our approach for proving program specifications to be self-framed w.r.t. permissions, which is a necessary condition to maintain soundness in concurrent reasoning. Second, we show how we use predicates to provide modular and reusable specifications for program synchronisation points, like locks or forked threads. Our work primarily targets the KeY verification system with its specification language JML * and symbolic execution proving method. Hence, we also give the current status of the work on implementation and we discuss some examples that are verifiable with KeY.

show abstract

“…In more recent years, a new class of approaches have emerged that try to achieve an intermediate degree of automation in the continuum that goes from automatic to interactive-hence their designation [33] as the portmanteau auto-active. 1 Auto-active tools need no user input during verification, which proceeds autonomously until it succeeds or fails; however, the user is still expected to provide guidance indirectly ("off-line") through annotations (such as loop invariants or intermediate lemmas) in the input program. Pro- 1 Although inter-matic would be as good a name.…”

Section: Auto-active Functional Verification Of Object-oriented Programsmentioning

confidence: 99%

“…1 Auto-active tools need no user input during verification, which proceeds autonomously until it succeeds or fails; however, the user is still expected to provide guidance indirectly ("off-line") through annotations (such as loop invariants or intermediate lemmas) in the input program. Pro- 1 Although inter-matic would be as good a name.…”

Section: Auto-active Functional Verification Of Object-oriented Programsmentioning

confidence: 99%

AutoProof: auto-active functional verification of object-oriented programs

Furia

Nordio

Polikarpova³

et al. 2016

Int J Softw Tools Technol Transfer

View full text Add to dashboard Cite

Auto-active verifiers provide a level of automation intermediate between fully automatic and interactive: users supply code with annotations as input while benefiting from a high level of automation in the back-end. This paper presents AutoProof, a state-of-the-art auto-active verifier for object-oriented sequential programs with complex functional specifications. AutoProof fully supports advanced objectoriented features and a powerful methodology for framing and class invariants, which make it applicable in practice to idiomatic object-oriented patterns. The paper focuses on describing AutoProof's interface, design, and implementation features, and demonstrates AutoProof's performance on a rich collection of benchmark problems. The results attest AutoProof's competitiveness among tools in its league on cutting-edge functional verification of object-oriented programs.

show abstract

The KeY Platform for Verification and Analysis of Java Programs

Cited by 46 publications

References 36 publications

Dynamic Dispatch for Method Contracts Through Abstract Predicates

Dynamic Dispatch for Method Contracts Through Abstract Predicates

Dynamic Frames Based Verification Method for Concurrent Java Programs

AutoProof: auto-active functional verification of object-oriented programs

Contact Info

Product

Resources

About