Phase semantics and verification of concurrent constraint programs

被引:1
|
作者
Fages, F [1 ]
Ruet, P [1 ]
Soliman, S [1 ]
机构
[1] Ecole Normale Super, CNRS, LIENS, F-75005 Paris, France
关键词
D O I
10.1109/LICS.1998.705651
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
The class CC of concurrent constraint programming languages and its non-monotonic extension LCC based on linear constraint systems can be given a logical semantics in Girard's intuitionistic linear logic for a variety of observables. In this paper we settle basic completeness results and rue show how the phase semantics of linear logic can be used to provide simple and very concise "semantical" proofs of safety properties for CC or LCC programs.
引用
收藏
页码:141 / 152
页数:12
相关论文
共 50 条