Sciweavers

2558 search results - page 139 / 512
» Model Composition Contracts
Sort
View
ICSE
2009
IEEE-ACM
16 years 7 months ago
FEATUREHOUSE: Language-independent, automated software composition
Superimposition is a composition technique that has been applied successfully in many areas of software development. Although superimposition is a general-purpose concept, it has ...
Christian Kästner, Christian Lengauer, Sven A...
JMLR
2012
13 years 8 months ago
Sample Complexity of Composite Likelihood
We present the first PAC bounds for learning parameters of Conditional Random Fields [12] with general structures over discrete and real-valued variables. Our bounds apply to com...
Joseph K. Bradley, Carlos Guestrin
LCPC
1992
Springer
15 years 10 months ago
A Calculus of Gamma Programs
The Gamma model is a minimal programming language based on local multiset rewriting (with an elegant chemical reaction metaphor); Hankin et al derived a calculus of Gamma programs...
Chris Hankin, Daniel Le Métayer, David Sand...
STOC
2002
ACM
159views Algorithms» more  STOC 2002»
16 years 6 months ago
On the composition of authenticated byzantine agreement
A fundamental problem of distributed computing is that of simulating a secure broadcast channel, within the setting of a point-to-point network. This problem is known as Byzantine...
Yehuda Lindell, Anna Lysyanskaya, Tal Rabin
TACAS
2009
Springer
134views Algorithms» more  TACAS 2009»
16 years 1 months ago
Compositional Predicate Abstraction from Game Semantics
ional Predicate Abstraction from Game Semantics Adam Bakewell and Dan R. Ghica University of Birmingham, U.K. We introduce a technique for using conventional predicate abstraction ...
Adam Bakewell, Dan R. Ghica