Sparkle is a theorem prover specially constructed for the functional programming language Clean. In a pure functional language like Clean the variables represent constant values; variables do not change in time. Hence it seems that temporality has no meaning in functional programs. However, in certain cases (e.g. in interactive or distributed programs, or in ones that use I/O), a series of values computed from one another can be considered as different states of the same "abstract object". For this abstract object temporal properties can be proved. This paper presents a method to describe abstract objects and invariant properties in an extended version of the Sparkle Core language. The creation of such descriptions will be supported by a re...
AbstractThis paper presents proof principles for establishing invariance and liveness properties of ...
We present the first method for reasoning about temporal logic properties of higher-order, infinite-...
Logical deduction and abstraction from detail are fundamental, yet distinct aspects of reasoning abo...
Abstract. In a pure functional language like Clean the values of the functional variables are consta...
Abstract. Sparkle is a new theorem prover written and specialized in the functional programming lang...
International audienceWe present new static analysis methods for proving liveness properties of prog...
AbstractThe paper presents a relatively complete proof system for proving the validity of temporal p...
This thesis develops a new method for proving properties of concurrent programs and gives formal de...
International audienceWe present new static analysis methods for proving liveness properties of prog...
SRI International A liveness property asserts that program execution eventually reaches some desirab...
While temporal verification of programs is a topic with a long history, its traditional basis—semant...
In this thesis, we address the problem of verifying the functional correctness of concurrent program...
In this article, we investigate the automated verification of temporal properties of heap-aware prog...
We propose a deductive reasoning approach to the automatic verification of temporal properties of po...
Program verification increases the degree of confidence that a program will perform correctly. Manua...
AbstractThis paper presents proof principles for establishing invariance and liveness properties of ...
We present the first method for reasoning about temporal logic properties of higher-order, infinite-...
Logical deduction and abstraction from detail are fundamental, yet distinct aspects of reasoning abo...
Abstract. In a pure functional language like Clean the values of the functional variables are consta...
Abstract. Sparkle is a new theorem prover written and specialized in the functional programming lang...
International audienceWe present new static analysis methods for proving liveness properties of prog...
AbstractThe paper presents a relatively complete proof system for proving the validity of temporal p...
This thesis develops a new method for proving properties of concurrent programs and gives formal de...
International audienceWe present new static analysis methods for proving liveness properties of prog...
SRI International A liveness property asserts that program execution eventually reaches some desirab...
While temporal verification of programs is a topic with a long history, its traditional basis—semant...
In this thesis, we address the problem of verifying the functional correctness of concurrent program...
In this article, we investigate the automated verification of temporal properties of heap-aware prog...
We propose a deductive reasoning approach to the automatic verification of temporal properties of po...
Program verification increases the degree of confidence that a program will perform correctly. Manua...
AbstractThis paper presents proof principles for establishing invariance and liveness properties of ...
We present the first method for reasoning about temporal logic properties of higher-order, infinite-...
Logical deduction and abstraction from detail are fundamental, yet distinct aspects of reasoning abo...