3119 search results - page 230 / 624 » General Default Logic |
203
click to vote
POPL
2007
ACM
16 years 1 months ago
2007
ACM
This paper contributes to the development of techniques for the modular proof of programs that include concurrent algorithms. We present a proof of a non-blocking concurrent algor...
209
click to vote
POPL
2004
ACM
16 years 1 months ago
2004
ACM
We investigate proof rules for information hiding, using the recent formalism of separation logic. In essence, we use the separating conjunction to partition the internal resource...
138
click to vote
ACL2
2006
ACM
15 years 6 months ago
2006
ACM
ACL2 is used to systematically study domains whose elements can be “uniquely” factored into products of “irreducible” elements. The best known examples of such domains are...
128
Voted
ICLP
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. We instrument a higher-order logic programming search procedure to generate and check small proof witnesses for the Twelf system, an implementation of the logical framewo...
118
click to vote
BDA
2006
15 years 2 months ago
2006
Surprisingly enough, there has been few investigations for typing references of semistructured data and XML documents. This paper build on a previous proposal [7] introducing simp...