ing a Speci cation from Code Martin Ward Computer Science Dept Science Labs South Rd Durham DH1 3LE July 16, 1993 Abstract Much of the work on developing program transformation systems has concentrated on systems to assist in program development. However, the four separate surveys carried out between 1977 and 1990 [18,20,22,24], summarised in [17], show that between 40% and 60% of all commercia...

ing and Counting Synchronizing Processes Zeinab Ganjei, Ahmed Rezine, Petru Eles, and Zebo Peng Linköping University, Sweden Abstract. We address the problem of automatically establishing synchronization dependent correctness (e.g. due to using barriers or ensuring absence of deadlocks) of programs generating an arbitrary number of concurrent processes and manipulating variables ranging over an...

ing the Tower of Hanoi Craig A. Knoblock School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 [email protected] Abstract This paper describes an automated approach to generating abstractions for the Tower of Hanoi and analyzes the use of these abstractions for problem solving. The analysis shows that the learned abstractions produce an exponential reduction in the size of the...

In this paper we propose to represent a scene as an abstraction of “things”. We start from “things” as generated by modern object proposals, and we investigate their immediately observable properties: position, size, aspect ratio and color, and those only. Where the recent successes and excitement of the field lie in object identification, we represent the scene composition independent of objec...

ing Asynchronous Multi-Valued Networks

Our i n i t i a l e f f o r t s a t automat ic a b s t r a c t i n g began in 1969 as p a r t of a more genera l q u e s t i o n answering system (Tharp , 1969; Tharp and K r u l e e , 1969) which made use of shor t s t o r i e s about f a mous d i s c o v e r i e s taken from a c h i l d r e n ' s encyc lo p e d i a . The o r i g i n a l t e x t was mapped i n t o a set of p r e d i c a t e s ...

ion, abstracting recursive function calls to derive hylomorphisms and abstracting maximal non-recursive subterms to structure hylomorphisms. A prototype of our algorithm has been implemented and tested extensively, showing its promise to be embedded in a real system. Finally, our algorithm gives the evidence that hylomorphisms can specify all recursions of interests as claimed in [BdM94].