2290 search results - page 276 / 458 » Extensible Protected Types |
175
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
We study the definability of constraint satisfaction problems (CSP) in various fixed-point and infinitary logics. We show that testing the solvability of systems of equations over...
179
click to vote
ICECCS
2007
IEEE
15 years 10 months ago
2007
IEEE
In recent years, separation logic has emerged as a contender for formal reasoning of heap-manipulating imperative programs. Recent works have focused on specialised provers that a...
191
click to vote
CC
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. Some codes require computations to use fewer bits of precision than are normal for the target machine. For example, Java requires 32-bit arithmetic even on a 64-bit targe...
125
click to vote
CSL
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. In [6] J. Laird has shown that an infinitary sequential extenPCF has a fully abstract model in his category of locally boolean domains (introduced in [8]). In this paper ...
161
click to vote
ERCIMDL
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. This paper describes CAP7, a system for searching and browsing in distributed document (metadata) collections. The system architecture is similar to Harvest, comprising g...