858 search results - page 81 / 172 » Abstract Interpretation Based Verification of Logic Programs |
183
click to vote
POPL
2004
ACM
16 years 5 days ago
2004
ACM
We prove the decidability of the quantifier-free, static fragment of ambient logic, with composition adjunct and iteration, which corresponds to a kind of regular expression langu...
CORR
2006
Springer
14 years 12 months ago
2006
Springer
The refinement calculus for logic programs is a framework for deriving logic programs from specifications. It is based on a wide-spectrum language that can express both specificat...
111
click to vote
FASE
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. Graph constraints were introduced in the area of graph transformation, in connection with the notion of (negative) application conditions, as a form to limit the applicab...
105
click to vote
AOSD
2007
ACM
15 years 3 months ago
2007
ACM
Design rules express constraints on the behavior and structure of a program. These rules can help ensure that a program follows a set of established practices, and avoids certain ...
RR
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. We illustrate the potential of conditional hedge transformations in Web-related applications on the example of PρLog: an extension of logic programming with advanced rul...