Sciweavers

3481 search results - page 556 / 697
» Higher-Order Logic Programming as Constraint Logic Programmi...
Sort
View
SCP
2010
123views more  SCP 2010»
14 years 10 months ago
Slicing for architectural analysis
Current software development often relies on non trivial coordination logic for combining autonomous services, eventually running on different platforms. As a rule, however, such ...
Nuno F. Rodrigues, Luís Soares Barbosa
139
Voted
TODS
2012
13 years 5 months ago
A survey of B-tree logging and recovery techniques
B-trees have been ubiquitous in database management systems for several decades, and they serve in many other storage systems as well. Their basic structure and their basic operat...
Goetz Graefe
241
Voted
POPL
2008
ACM
16 years 3 months ago
Relational inductive shape analysis
alyses are concerned with precise abstractions of the heap to capture detailed structural properties. To do so, they need to build and decompose summaries of disjoint memory regio...
Bor-Yuh Evan Chang, Xavier Rival
ICFP
2005
ACM
16 years 3 months ago
Toward a general theory of names: binding and scope
High-level formalisms for reasoning about names and binding such uijn indices, various flavors of higher-order abstract syntax, ry of Contexts, and nominal abstract syntax address...
James Cheney
CONCUR
2011
Springer
14 years 3 months ago
Reasoning about Threads with Bounded Lock Chains
The problem of model checking threads interacting purely via the standard synchronization primitives is key for many concurrent program analyses, particularly dataflow analysis. U...
Vineet Kahlon