50 search results - page 4 / 10 » Rewrite-Based Satisfiability Procedures for Recursive Data S... |
95
Voted
ESOP
2008
Springer
14 years 11 months ago
2008
Springer
A data structure is said to be persistent when any update operation returns a new structure without altering the old version. This paper introduces a new notion of persistence, cal...
64
Voted
PLDI
2010
ACM
15 years 6 months ago
2010
ACM
Synthesis of program fragments from specifications can make programs easier to write and easier to reason about. To integrate synthesis into programming languages, synthesis algor...
172
click to vote
ICDE
2008
IEEE
15 years 10 months ago
2008
IEEE
ct The backbone of the XML data model, namely ordered, unranked trees, is inherently recursive and it is natural to equip the associated languages with constructs that can query su...
120
click to vote
CORR
2004
Springer
14 years 9 months ago
2004
Springer
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...
120
Voted
MICCAI
2010
Springer
15 years 2 months ago
2010
Springer
The effectiveness and clinical benefits of image guided surgery are
well established for procedures where there is manageable tissue motion. In
minimally invasive cardiac, gastro...