Add to ORKGIn this paper we give a representation of a weakest precondition calculus for abstract object creation in dynamic logic, the logic underlying the KeY theorem prover. This representation allows to both specify and verify properties of objects at the abstraction level of the (object-oriented) programming language. Objects which are not (yet) created never play any r
We provide a logical analysis of abstract argumentation frameworks and their dynamics. Following pre...
AbstractWe present algebraic laws for a language similar to a subset of sequential Java that include...
The marriage of logic and objects is a very wide-ranging problem, approached with various approaches...
In this paper we give a representation of a weakest precondition calculus for abstract object creat...
In this paper we give a representation of a weakest precondition calculus for abstract object creati...
We present a fully abstract weakest precondition calculus and its integration with symbolic executio...
Abstract. We introduce a dynamic logic that is enriched by non-rigid functions, i.e., functions that...
AbstractThis paper describes a proof outline logic that covers most typical object-oriented language...
This report presents a sound and complete Hoare logic for a sequential object-oriented language with...
This thesis is about proving the functional correctness and incorrectness of imperative, object-or...
This thesis presents a proof outline logic for a simple object-oriented programming language. The la...
We propose to bring together two research traditions, computation with first order logic from comput...
The marriage of logic and objects is a very wide-ranging problem, approached with various approaches...
The present author as well as Andréka's group has experienced, while writing program- verifying prog...
Humans can make a plan by refining abstract actions. Dynamic logic, which enables reasoning about th...
We provide a logical analysis of abstract argumentation frameworks and their dynamics. Following pre...
AbstractWe present algebraic laws for a language similar to a subset of sequential Java that include...
The marriage of logic and objects is a very wide-ranging problem, approached with various approaches...
In this paper we give a representation of a weakest precondition calculus for abstract object creat...
In this paper we give a representation of a weakest precondition calculus for abstract object creati...
We present a fully abstract weakest precondition calculus and its integration with symbolic executio...
Abstract. We introduce a dynamic logic that is enriched by non-rigid functions, i.e., functions that...
AbstractThis paper describes a proof outline logic that covers most typical object-oriented language...
This report presents a sound and complete Hoare logic for a sequential object-oriented language with...
This thesis is about proving the functional correctness and incorrectness of imperative, object-or...
This thesis presents a proof outline logic for a simple object-oriented programming language. The la...
We propose to bring together two research traditions, computation with first order logic from comput...
The marriage of logic and objects is a very wide-ranging problem, approached with various approaches...
The present author as well as Andréka's group has experienced, while writing program- verifying prog...
Humans can make a plan by refining abstract actions. Dynamic logic, which enables reasoning about th...
We provide a logical analysis of abstract argumentation frameworks and their dynamics. Following pre...
AbstractWe present algebraic laws for a language similar to a subset of sequential Java that include...
The marriage of logic and objects is a very wide-ranging problem, approached with various approaches...