Abstract. This tutorial paper discusses a particular style of operational semantics that enables one to give a ‘syntax-directed ’ inductive definition of termination which is very useful for reasoning about operational equivalence of programs. We restrict attention to contextual equivalence of expressions in the ML family of programming languages, concentrating on functions involving local state. A brief tour of structural operational machine using ‘frame stacks’. Applications of this to reasoning about contextual equivalence are given
MasterThe focus of these lecture notes is on abstract models and basic ideasand results that relate ...
The most important open problem in the study of termination for logic programs is that of existentia...
We give a fully automated description of a small programming language PL in the theorem prover Isab...
We present a new approach to providing a structural operational semantics for imperative programming...
AbstractComputational systems based on reducing expressions usually have a predefined reduction stra...
The termination assertion p〈S〉 q means that whenever the formula p is true, there is an execution of...
In principle termination analysis is easy: find a well-founded partial order and prove that calls de...
One way to develop more robust software is to use formal program verification. Formal program verifi...
[EN] The notion of operational termination provides a logic-based definition of termination of compu...
Definition of programming languages consists of the formal definition of syntax and semantics. One o...
AbstractMorris-style contextual equivalence – invariance of termination under any context of ground ...
Structural operational semantics is a simple, yet powerful mathematical theory for describing the be...
AbstractWe present a new approach to providing a structural operational semantics for imperative pro...
AbstractDijkstra and Scholten (1990) present an axiomatic semantics for Dijkstra's guarded command l...
AbstractWe present a context-based approach to proving termination of evaluation in reduction semant...
MasterThe focus of these lecture notes is on abstract models and basic ideasand results that relate ...
The most important open problem in the study of termination for logic programs is that of existentia...
We give a fully automated description of a small programming language PL in the theorem prover Isab...
We present a new approach to providing a structural operational semantics for imperative programming...
AbstractComputational systems based on reducing expressions usually have a predefined reduction stra...
The termination assertion p〈S〉 q means that whenever the formula p is true, there is an execution of...
In principle termination analysis is easy: find a well-founded partial order and prove that calls de...
One way to develop more robust software is to use formal program verification. Formal program verifi...
[EN] The notion of operational termination provides a logic-based definition of termination of compu...
Definition of programming languages consists of the formal definition of syntax and semantics. One o...
AbstractMorris-style contextual equivalence – invariance of termination under any context of ground ...
Structural operational semantics is a simple, yet powerful mathematical theory for describing the be...
AbstractWe present a new approach to providing a structural operational semantics for imperative pro...
AbstractDijkstra and Scholten (1990) present an axiomatic semantics for Dijkstra's guarded command l...
AbstractWe present a context-based approach to proving termination of evaluation in reduction semant...
MasterThe focus of these lecture notes is on abstract models and basic ideasand results that relate ...
The most important open problem in the study of termination for logic programs is that of existentia...
We give a fully automated description of a small programming language PL in the theorem prover Isab...