The theory of finite term algebras provides a natural framework to describe the semantics of functional languages. The ability to efficiently reason about term algebras is essential to automate program analysis and verification for functional or imperative programs over algebraic data types such as lists and trees. However, as the theory of finite term algebras is not finitely axiomatizable, reasoning about quantified properties over term algebras is challenging. <br/> In this paper we address full first-order reasoning about properties of programs manipulating term algebras, and describe two approaches for doing so by using first-order theorem proving. Our first method is a conservative extension of the theory of term algebras using a fi...
AbstractA framework of definitions for, and questions about, notions of computability, complexity, a...
We begin with a disucssion of some of the serious deficiencies of first order predicate languages. T...
Defining data types as initial algebras, or dually as final co-algebras, is beneficial, if not indis...
The theory of finite term algebras provides a natural framework to describe the semantics of functio...
The theory of finite term algebras provides a natural framework to describe the semantics of functio...
AbstractTerm algebras can model recursive data structures which are widely used in programming langu...
Static analysis of program semantics can be used to provide strong guarantees about the correctness ...
Abstract. Term algebras have wide applicability in computer science. Unfortunately, the decision pro...
Term algebras are important structures in many areas of mathematics and computer science. Reasoning ...
We propose a new approach to the computer-assisted verification of functional programs. We work in...
We propose a new approach to the computer-assisted verification of functional programs. We work in f...
Abstract. To support verification of expressive properties of functional programs, we consider algeb...
We present the foundations of a verifier for higher-order functional programs with generics and recu...
This talk describes how a combination of symbolic computation techniques with first-order theorem pr...
In this paper we give a semantics of higher-order functional-logic programming in the framework of t...
AbstractA framework of definitions for, and questions about, notions of computability, complexity, a...
We begin with a disucssion of some of the serious deficiencies of first order predicate languages. T...
Defining data types as initial algebras, or dually as final co-algebras, is beneficial, if not indis...
The theory of finite term algebras provides a natural framework to describe the semantics of functio...
The theory of finite term algebras provides a natural framework to describe the semantics of functio...
AbstractTerm algebras can model recursive data structures which are widely used in programming langu...
Static analysis of program semantics can be used to provide strong guarantees about the correctness ...
Abstract. Term algebras have wide applicability in computer science. Unfortunately, the decision pro...
Term algebras are important structures in many areas of mathematics and computer science. Reasoning ...
We propose a new approach to the computer-assisted verification of functional programs. We work in...
We propose a new approach to the computer-assisted verification of functional programs. We work in f...
Abstract. To support verification of expressive properties of functional programs, we consider algeb...
We present the foundations of a verifier for higher-order functional programs with generics and recu...
This talk describes how a combination of symbolic computation techniques with first-order theorem pr...
In this paper we give a semantics of higher-order functional-logic programming in the framework of t...
AbstractA framework of definitions for, and questions about, notions of computability, complexity, a...
We begin with a disucssion of some of the serious deficiencies of first order predicate languages. T...
Defining data types as initial algebras, or dually as final co-algebras, is beneficial, if not indis...