322 search results - page 6 / 65 » Combinations of Abstract Domains for Logic Programming |
146
Voted
ENTCS
2000
15 years 3 months ago
2000
Abstract. Logic programming languages based on linear logic are of both theoretical and practical interest, particulaly because such languages can be seen as providing a logical ba...
113
Voted
ICFEM
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. Automated verification of memory safety and functional correctness for heap-manipulating programs has been a challenging task, especially when dealing with complex data ...
176
Voted
MKM
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Formal verification of numerical programs is notoriously difficult. On the one hand, there exist automatic tools specialized in floatingpoint arithmetic, such as Gappa...
149
Voted
FLOPS
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. We present a declarative method for diagnosing missing computed answers in CFLP(D), a generic scheme for lazy Constraint Functional-Logic Programming which can be instant...
98
Voted
AGP
1999
IEEE
15 years 8 months ago
1999
IEEE
We study the problem of an efficient and precise sharing analysis of (constraint) logic programs. After recognizing that neither aring nor its non-redundant (but equivalent) abstra...