Add to ORKGIn this paper we present an abstract representation of pointer structures in Kleene algebras and the properties of a particular selective update function. These can be used as prerequisites for the definition of in-situ pointer updates and a general framework to derive in-situ pointer algorithms from their specification
In relational semantics, the input-output semantics of a program is a relation on its set of states....
Elements of Kleene algebras can be used, among others, as abstractions of the inputoutput semantics ...
In relational semantics, the input-output semantics of a program is a relation on its set of states....
In this paper we present an abstract representation of pointer structures in Kleene algebras and the...
Pointer Kleene algebra. - In: Relational and Kleene algebraic methods in computer science : revised ...
Software controlled systems more and more become established in our daily life. Thus, the probabilit...
Kleene algebras provide a convenient and powerful algebraic axiomatisation of a complete lattice tha...
Kleene algebras provide a convenient and powerful algebraic axiomatisation of a complete lattice tha...
Pointer Kleene algebra has proved to be a useful abstraction for reasoning about reachability proper...
Based on the algebra of relations and maps we present some techniques for safe manipulation of point...
quential composition, choice and nite iteration. It was rst introduced by Kleene in 1956 and further...
Elements of Kleene algebras can be used, among others, as abstractions of the input-output semantics...
Elements of Kleene algebras can be used, among others, as abstractions of the input-output semantics...
Kleene algebras (KA) have turned out to be an appropriate tool to formally describe algebraic system...
We show that the well-known unfold/fold transformation strategy is also fruitful for the (formal) de...
In relational semantics, the input-output semantics of a program is a relation on its set of states....
Elements of Kleene algebras can be used, among others, as abstractions of the inputoutput semantics ...
In relational semantics, the input-output semantics of a program is a relation on its set of states....
In this paper we present an abstract representation of pointer structures in Kleene algebras and the...
Pointer Kleene algebra. - In: Relational and Kleene algebraic methods in computer science : revised ...
Software controlled systems more and more become established in our daily life. Thus, the probabilit...
Kleene algebras provide a convenient and powerful algebraic axiomatisation of a complete lattice tha...
Kleene algebras provide a convenient and powerful algebraic axiomatisation of a complete lattice tha...
Pointer Kleene algebra has proved to be a useful abstraction for reasoning about reachability proper...
Based on the algebra of relations and maps we present some techniques for safe manipulation of point...
quential composition, choice and nite iteration. It was rst introduced by Kleene in 1956 and further...
Elements of Kleene algebras can be used, among others, as abstractions of the input-output semantics...
Elements of Kleene algebras can be used, among others, as abstractions of the input-output semantics...
Kleene algebras (KA) have turned out to be an appropriate tool to formally describe algebraic system...
We show that the well-known unfold/fold transformation strategy is also fruitful for the (formal) de...
In relational semantics, the input-output semantics of a program is a relation on its set of states....
Elements of Kleene algebras can be used, among others, as abstractions of the inputoutput semantics ...
In relational semantics, the input-output semantics of a program is a relation on its set of states....