Sciweavers

87 search results - page 6 / 18
» Reasoning About Call-by-need by Means of Types
Sort
View
BMCBI
2008
116views more  BMCBI 2008»
13 years 7 months ago
Gene Ontology annotations: what they mean and where they come from
To address the challenges of information integration and retrieval, the computational genomics community increasingly has come to rely on the methodology of creating annotations o...
David P. Hill, Barry Smith, Monica S. McAndrews-Hi...
ATAL
2009
Springer
14 years 2 months ago
Reasoning intra-dependency in commitments for robust scheduling
Commitment-modeled protocols enable flexible and robust interactions among agents. However, existing work has focused on features and capabilities of protocols without considerin...
Mingzhong Wang, Kotagiri Ramamohanarao, Jinjun Che...
LICS
2009
IEEE
14 years 2 months ago
Logical Step-Indexed Logical Relations
We show how to reason about “step-indexed” logitions in an abstract way, avoiding the tedious, error-prone, and proof-obscuring step-index arithmetic that seems superficially...
Derek Dreyer, Amal Ahmed, Lars Birkedal
POPL
2010
ACM
14 years 5 months ago
Structuring the verification of heap-manipulating programs
Most systems based on separation logic consider only restricted forms of implication or non-separating conjunction, as full support for these connectives requires a non-trivial no...
Aleksandar Nanevski, Josh Berdine, Viktor Vafeiadi...
TLDI
2009
ACM
122views Formal Methods» more  TLDI 2009»
14 years 4 months ago
Towards type-theoretic semantics for transactional concurrency
We propose a dependent type theory that integrates programming, specifications, and reasoning about higher-order concurrent programs with shared transactional memory. The design ...
Aleksandar Nanevski, Paul Govereau, Greg Morrisett