Program transformation for development, verification, and synthesis of programs

This paper briefly describes the use of the program transformation methodology for the development of correct and efficient programs. In particular, we will refer to the case of constraint logic programs and, through some examples, we will show how by program transformation, one can improve, synthesize, and verify programs

Program Transformation for Development, Verification, and Synthesis of Software

In this paper we briefly describe the use of the program transformation methodology for the development of correct and efficient programs. We will consider, in particular, the case of the transformation and the development of constraint logic programs

A Framework for Datatype Transformation

We study one dimension in program evolution, namely the evolution of the datatype declarations in a program. To this end, a suite of basic transformation operators is designed. We cover structure-preserving refactorings, but also structure-extending and -reducing adaptations. Both the object programs that are subject to datatype transformations, and the meta programs that encode datatype transformations are functional programs.Comment: Minor revision; now accepted at LDTA 200

The golog programming language and agency

In this paper, we present our initial experiences modeling agency in the situation calculus and the Golog programming language. We describe the problems we have faced and discuss some research issues that remain to be addressed in the future. As an application of this research line, we propose an axiomatization of the robot Charles and the Fantastic City in the situation calculus as well as a controller written in Golog.Eje: Inteligencia artificialRed de Universidades con Carreras en Informática (RedUNCI

The golog programming language and agency

In this paper, we present our initial experiences modeling agency in the situation calculus and the Golog programming language. We describe the problems we have faced and discuss some research issues that remain to be addressed in the future. As an application of this research line, we propose an axiomatization of the robot Charles and the Fantastic City in the situation calculus as well as a controller written in Golog.Eje: Inteligencia artificialRed de Universidades con Carreras en Informática (RedUNCI

The count model of exponents correlation and its using for automation of decision in economic problems

Розробка і обґрунтування альтернативного підходу до рішення економічних задач представлена як першорядна задача теоретико-методологічних досліджень. Автором статті пропонуються власні концептуальні установки графового моделювання. Особлива увага приділяється алгоритмізації розрахунків.The elaboration and basis of alternative approach to economic problems decision is represented as a paramount problem in theoretic-systematic research. By the author of the article is offered own conception directions of count modeling. Special attention is spared to algoritmation of calculation

Automated verification of shape, size and bag properties.

In recent years, separation logic has emerged as a contender for formal reasoning of heap-manipulating imperative programs. Recent works have focused on specialised provers that are mostly based on fixed sets of predicates. To improve expressivity, we have proposed a prover that can automatically handle user-defined predicates. These shape predicates allow programmers to describe a wide range of data structures with their associated size properties. In the current work, we shall enhance this prover by providing support for a new type of constraints, namely bag (multi-set) constraints. With this extension, we can capture the reachable nodes (or values) inside a heap predicate as a bag constraint. Consequently, we are able to prove properties about the actual values stored inside a data structure

Views, Program Transformations, and the Evolutivity Problem in a Functional Language

We report on an experience to support multiple views of programs to solve the tyranny of the dominant decomposition in a functional setting. We consider two possible architectures in Haskell for the classical example of the expression problem. We show how the Haskell Refactorer can be used to transform one view into the other, and the other way back. That transformation is automated and we discuss how the Haskell Refactorer has been adapted to be able to support this automated transformation. Finally, we compare our implementation of views with some of the literature.Comment: 19 page