903 search results - page 67 / 181 » Non-well-founded trees in categories |
259
click to vote
POPL
2011
ACM
14 years 9 months ago
2011
ACM
We define a new logic, STRAND, that allows reasoning with heapmanipulating programs using deductive verification and SMT solvers. STRAND logic (“STRucture ANd Data” logic) f...
151
click to vote
ASPLOS
2012
ACM
14 years 1 months ago
2012
ACM
Traditional storage systems provide a simple read/write interface, which is inadequate for low-locality update-intensive workloads because it limits the disk scheduling flexibili...
157
click to vote
REX
1993
15 years 10 months ago
1993
Abstract. Models for concurrency can be classified with respect to three relevant parameters: behaviour/system, interleaving/noninterleaving, linear/branching time. When modelling...
190
click to vote
CIKM
2004
Springer
15 years 10 months ago
2004
Springer
In this paper we study the problem of collecting training samples for building enterprise taxonomies. We develop a computer-aided tool named InfoAnalyzer, which can effectively as...
184
click to vote
ACL
2007
15 years 7 months ago
2007
Until quite recently, extending Phrase-based Statistical Machine Translation (PBSMT) with syntactic structure caused system performance to deteriorate. In this work we show that i...