The relationship between logic programs and specifications-the subset example revisited

✍ Scribed by Kung-Kiu Lau; Mario Ornaghi

• Publisher: Elsevier Science
• Year: 1997
• Tongue: English
• Weight: 1000 KB
• Volume: 30
• Category: Article
• ISSN: 0743-1066
• DOI: 10.1016/s0743-1066(96)00128-8

✦ Synopsis

The fundamental relation between a program P and its specification S is correctness: P satisfies S if and only if P is correct with respect to S. In logic programming, this relationship can be particularly close, since logic can be used to express both specifications and programs. Indeed logic programs are often regarded and used as (executable) specifications themselves. In this paper, we argue that the relation between S and P should be firmly set in the context of the underlying problem domain, which we call a framework J, and we give a model-theoretic view of the correctness relation between specifications and programs in ~.. We show that the correctness relation between S and P is always well-defined. It thus provides a basis for properly distinguishing between S and P. We use the subset example throughout to illustrate our model-theoretic approach.