CHR的合成语义
A compositional Semantics for CHR
摘要:
约束处理规则(英语:Constraint Handling Rules)是一种提交选择的声明性语言,被设计用于编写约束求解器。一个可重写程序由多头保护规则组成,这些规则允许人们将约束重写为更简单的约束,直到达到一个解决的形式。无论是从实践还是从理论方面,都对网络安全进行了相当大的关注。然而,由于使用了多首分句,有几个方面的语义学尚未得到澄清。特别是,到目前为止还没有定义用于XML的组合语义。在本文中,我们介绍了一个固定点的语义特征的输入/输出行为的一个可编程的程序,这是和组合,也就是说,它允许检索的语义的合取查询从语义的组件。这种语义可以用作定义增量和模块化分析和验证工具的基础。
英文摘要:
Constraint Handling Rules (CHR) are a committed-choice declarative language which has been designed for writing constraint solvers. A CHR program consists of multi-headed guarded rules which allow one to rewrite constraints into simpler ones until a solved form is reached. CHR has received a considerable attention, both from the practical and from the theoretical side. Nevertheless, due the use of multi-headed clauses, there are several aspects of the CHR semantics which have not been clarified yet. In particular, no compositional semantics for CHR has been defined so far. In this paper we introduce a fix-point semantics which characterizes the input/output behavior of a CHR program and which is and-compositional, that is, which allows to retrieve the semantics of a conjunctive query from the semantics of its components. Such a semantics can be used as a basis to define incremental and modular analysis and verification tools.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。