Sciweavers

518 search results - page 77 / 104
» Automating Proofs in Category Theory
Sort
View
86
Voted
ATAL
2008
Springer
15 years 1 months ago
Anonymity-proof Shapley value: extending shapley value for coalitional games in open environments
Coalition formation is an important capability for automated negotiation among self-interested agents. In order for coalitions to be stable, a key question that must be answered i...
Naoki Ohta, Vincent Conitzer, Yasufumi Satoh, Atsu...
POPL
2009
ACM
16 years 12 days ago
Compositional shape analysis by means of bi-abduction
This paper describes a compositional shape analysis, where each procedure is analyzed independently of its callers. The analysis uses an abstract domain based on a restricted frag...
Cristiano Calcagno, Dino Distefano, Peter W. O'Hea...
POPL
2004
ACM
16 years 2 days ago
Symbolic transfer function-based approaches to certified compilation
We present a framework for the certification of compilation and of compiled programs. Our approach uses a symbolic transfer functions-based representation of programs, so as to ch...
Xavier Rival
STOC
2006
ACM
129views Algorithms» more  STOC 2006»
16 years 2 days ago
Optimal phylogenetic reconstruction
One of the major tasks of evolutionary biology is the reconstruction of phylogenetic trees from molecular data. The evolutionary model is given by a Markov chain on the true evolu...
Constantinos Daskalakis, Elchanan Mossel, Sé...
POPL
2010
ACM
15 years 9 months ago
Dependent types and program equivalence
The definition of type equivalence is one of the most important design issues for any typed language. In dependentlytyped languages, because terms appear in types, this definition...
Jianzhou Zhao, Limin Jia, Stephanie Weirich, Vilhe...