Observational proofs by rewriting

详细信息    查看全文

• 作者：Bouhoula ; Adel ; Rusinowitch ; Michaë ; l
• 关键词：Observational semantics ; Automated proofs ; Induction ; Rewriting
• 刊名：Theoretical Computer Science
• 出版年：2002
• 出版时间：March 28, 2002
• 年：2002
• 卷：275
• 期：1-2
• 页码：675-698
• 全文大小：185 K

文摘

Observability concepts contribute to a better understanding of software correctness. In order to prove observational properties, the concept of Context Induction has been developed by Hennicker (Hennicker, Formal Aspects of Computing 3(4) (1991) 326–345). We propose in this paper to embed Context Induction in the implicit induction framework of (Bouhoula and Rusinowitch, Journal of Automated Reasoning 14(2) (1995) 189–235). The proof system we obtain applies to conditional specifications. It allows for many rewriting techniques and for the refutation of false observational conjectures. Under reasonable assumptions our method is refutationally complete, i.e. it can refute any conjecture which is not observationally valid. Moreover this proof system is operational: it has been implemented within the Spike prover and interesting computer experiments are reported.