Sciweavers

3513 search results - page 540 / 703
» Super Logic Programs
Sort
View
SCP
2010
123views more  SCP 2010»
13 years 5 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
POPL
2008
ACM
14 years 11 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
14 years 10 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
12 years 10 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
POPL
2012
ACM
12 years 6 months ago
Playing in the grey area of proofs
Interpolation is an important technique in verification and static analysis of programs. In particular, interpolants extracted from proofs of various properties are used in invar...
Krystof Hoder, Laura Kovács, Andrei Voronko...