prolog - 建模约束逻辑程序(用于分析)

Question

面向对象的程序可以通过不同的模型建模，例如自动机、过程代数、Petri 网或 UML。其中一些模型可用于执行各种分析，以发现性能或设计中的问题。

我正在研究逻辑编程，想知道 CLP 是否有这种模型？您如何分析 CLP 程序？

Answer 1

千万不要错过cTI_lt (constraint based termination inference for left termination) !

Termination inference is an annotation free generalization of termination analysis/checking. It shifts the programmer's focus away from particular cases to the whole relation. Traditionally, a termination analyzer tries to prove that a given class of queries terminates. This class must be provided by the user, which is rather cumbersome if the programs have been written previously without any annotations. With termination inference no annotations are necessary. All provably terminating classes to all related predicates are inferred at once, illustrating the 'multi-directionality' of predicates. This means that predicates can be used safely in several 'directions'.