3481 search results - page 257 / 697 » Higher-Order Logic Programming as Constraint Logic Programmi... |
147
click to vote
LFCS
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. In order to verify programs with pointer variables, we introduce a temporal logic LTLmem whose underlying assertion language is the quantifier-free fragment of separatio...
126
click to vote
GCC
2003
Springer
15 years 9 months ago
2003
Springer
This paper introduces a method for automatic composition of semantic web services using linear logic theorem proving. The method uses semantic web service language (DAML-S) for ext...
122
click to vote
ESWA
2002
15 years 3 months ago
2002
In current-day software development, programmers often use programming patterns to clarify their intents and to increase the understandability of their programs. Unfortunately, mo...
151
click to vote
ICLP
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. Groundness analysis of logic programs using Pos-based abstract interpretation is one of the clear success stories of the last decade in the area of logic program analysis...
127
click to vote
SIGSOFT
2005
ACM
16 years 4 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...