1423 search results - page 141 / 285 » Languages of Nested Trees |
138
Voted
AADEBUG
1997
Springer
15 years 7 months ago
1997
Springer
We introduce an assertion language for run-time checking of linked list data structure shapes. The assertion language is expressive enough to define characteristic predicates for ...
130
Voted
INLG
2010
Springer
15 years 1 months ago
2010
Springer
We have begun a project to automatically create the lexico-syntactic resources for a microplanner as a side-effect of running a domain-specific language understanding system. The ...
123
Voted
ASPLOS
2006
ACM
15 years 9 months ago
2006
ACM
For transactional memory (TM) to achieve widespread acceptance, transactions should not be limited to the physical resources of any specific hardware implementation. TM systems s...
161
Voted
ASPLOS
2008
ACM
15 years 5 months ago
2008
ACM
Standard concurrency control mechanisms offer a trade-off: Transactional memory approaches maximize concurrency, but suffer high overheads and cost for retrying in the case of act...
157
Voted
ICALP
2011
Springer
14 years 7 months ago
2011
Springer
We consider the following Tree-Constrained Bipartite Matching problem: Given two rooted trees T1 = (V1, E1), T2 = (V2, E2) and a weight function w : V1 × V2 → R+, find a maximu...