458 search results - page 5 / 92 » An Algebraic Approach to Sharing Analysis of Logic Programs |
SIGSOFT
2005
ACM
14 years 8 months ago
2005
ACM
We present a technique that enables the use of finite model finding to check the satisfiability of certain formulas whose intended models are infinite. Such formulas arise when us...
CHARME
2003
Springer
14 years 22 days ago
2003
Springer
We present a non-operational approach to specifying and analyzing shared memory consistency models. The method uses higher order logic to capture a complete set of ordering constra...
ECAI
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. In previous research, we presented a dynamicprogramming-based EM (expectation-maximization) algorithm for parameterized logic programs, which is based on the structure sh...
TLCA
2009
Springer
14 years 2 months ago
2009
Springer
Terms are a concise representation of tree structures. Since they can be naturally defined by an inductive type, they offer data structures in functional programming and mechanis...
APLAS
2010
ACM
13 years 7 months ago
2010
ACM
We consider the problem of specifying data structures with complex sharing in a manner that is both declarative and results in provably correct code. In our approach, abstract data...