Titlebook: Automated and Algorithmic Debugging; First International Peter A. Fritzson Conference proceedings 1993 Springer-Verlag Berlin Heidelberg 1

細(xì)查

Towards declarative debugging of concurrent constraint programs,rocesses. In this paper, we describe an approach to the declarative debugging of cc programs. We develop the concept of observable and specified behaviors of cc processes, define incorrect processes based on differences between these behaviors, and present a top-down debugging algorithm for the dete

TAIN

出處

鬼魂

The location of errors in functional programs,ools available. Many of the tools and techniques developed for debugging functional programs are based on those for imperative programming and lack a theoretical basis relevant to functional programming. In addition, the techniques used are typically very time-consuming. A theoretical foundation on

產(chǎn)生

A generalised query minimisation for program debugging,ging. His algorithm applies a half-splitting strategy which repeatedly subdivides an AND-tree representing an incorrect computation under the guidance of an oracle until the bug responsible has been localised. His aim was to minimise the number of queries asked of the oracle, and in general his meth

BURSA

詼諧

花束

Slicing concurrent programs,ph-theoretical approach to slicing concurrent programs. In addition to the usual control and data dependences proposed and studied for sequential programs, the paper introduces three new types of primary program dependences in concurrent programs, named the selection dependence, synchronization depe

天真

Assignment