Add to ORKGCan the semantics of a program be represented as a single formula? We show that one formula is insufficient to handle assertions, refinement or slicing, while two formulae are sufficient: ()S , defining non-termination, and ()S , defining behaviour. Any two formulae A and B will de-fine a corresponding program. Refinement is defined as implication between these formulae
In LIsper: "Total Unfolding: Theory and Applications" some results were proved regarding properties...
Non-termination analysis proves that programs, or parts of a program, do notterminate. This is impor...
Program transformation systems are applied both in program synthesis and in program optimization. Fo...
Since the original development of program slicing in 1979 [.Weiser slices 1979.] there have been ma...
The termination assertion p〈S〉 q means that whenever the formula p is true, there is an execution of...
One of the main advantages of logic programs is that it allows to write declarative programs that ve...
In this paper we focus on the relationship between a number of specification models. The models are ...
International audienceWe consider the termination/non-termination property of a class of loops. Such...
The term meta-programming refers to the ability of writing programs that have other programs as data...
Refinement algebras are axiomatisations intended for reasoning about programs in a total correctness...
Real-time control programs are often used in contexts where (conceptually) they run forever. Repetit...
There are two kinds of approaches for termination analysis of logic programs: "transformational" and...
In programming, termination of a program/algorithm means that its evaluation will eventually termina...
Program transformation systems are applied both in program synthesis and in program optimization. Fo...
Refinement algebras are abstract algebras for reasoning about programs in a total correctness framew...
In LIsper: "Total Unfolding: Theory and Applications" some results were proved regarding properties...
Non-termination analysis proves that programs, or parts of a program, do notterminate. This is impor...
Program transformation systems are applied both in program synthesis and in program optimization. Fo...
Since the original development of program slicing in 1979 [.Weiser slices 1979.] there have been ma...
The termination assertion p〈S〉 q means that whenever the formula p is true, there is an execution of...
One of the main advantages of logic programs is that it allows to write declarative programs that ve...
In this paper we focus on the relationship between a number of specification models. The models are ...
International audienceWe consider the termination/non-termination property of a class of loops. Such...
The term meta-programming refers to the ability of writing programs that have other programs as data...
Refinement algebras are axiomatisations intended for reasoning about programs in a total correctness...
Real-time control programs are often used in contexts where (conceptually) they run forever. Repetit...
There are two kinds of approaches for termination analysis of logic programs: "transformational" and...
In programming, termination of a program/algorithm means that its evaluation will eventually termina...
Program transformation systems are applied both in program synthesis and in program optimization. Fo...
Refinement algebras are abstract algebras for reasoning about programs in a total correctness framew...
In LIsper: "Total Unfolding: Theory and Applications" some results were proved regarding properties...
Non-termination analysis proves that programs, or parts of a program, do notterminate. This is impor...
Program transformation systems are applied both in program synthesis and in program optimization. Fo...