1017 search results - page 106 / 204 » Higher-Order Logic Programming Languages with Constraints: A... |
108
click to vote
CAV
2004
Springer
15 years 1 months ago
2004
Springer
We study the problem of formally verifying shared memory multiprocessor executions against memory consistency models--an important step during post-silicon verification of multipro...
CSL
2003
Springer
15 years 3 months ago
2003
Springer
The semantics of class-based languages can be defined in terms of objects only [8, 7, 1] if classes are viewed as objects with a constructor method. One obtains a store in which m...
100
click to vote
POPL
2012
ACM
13 years 5 months ago
2012
ACM
There has been great interest in creating probabilistic programming languages to simplify the coding of statistical tasks; however, there still does not exist a formal language th...
129
click to vote
TLDI
2010
ACM
15 years 6 months ago
2010
ACM
ML modules are a powerful language mechanism for decomposing programs into reusable components. Unfortunately, they also have a reputation for being “complex” and requiring fa...
ENTCS
2008
14 years 9 months ago
2008
The B+ tree is an ordered tree structure with a fringe list. It is the most widely used data structure for data organisation and searching in database systems specifically, and, p...