Domain independent ask approximation in CCP | Zendy

Enea Zaffanella | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Domain independent ask approximation in CCP

Author(s) -

Enea Zaffanella

Publication year - 1995

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

ISBN - 3-540-60299-2

DOI - 10.1007/3-540-60299-2_22

Subject(s) - correctness , computer science , domain (mathematical analysis) , ask price , context (archaeology) , class (philosophy) , computation , observable , constraint (computer aided design) , logical consequence , theoretical computer science , abstract interpretation , algorithm , programming language , artificial intelligence , mathematics , mathematical analysis , paleontology , physics , geometry , economy , quantum mechanics , economics , biology

. The main difficulty in the formalization of a static analysisframework for CC programs is probably related to the correct approximationof the entailment relation between constraints. This approximationis needed for the abstract evaluation of the ask guards and directly influencesthe overall precision of the analysis. In this paper we providea solution to this problem by stating reasonable correctness conditionsrelating the abstract and the concrete domains of computation. The solution...

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research