Sciweavers

933 search results - page 17 / 187
» Monotone Complexity of a Pair
Sort
View
BIRTHDAY
2008
Springer
13 years 9 months ago
The Pairing of Contracts and Session Types
Abstract. We pair session types and contracts using two encodings. The encoding of session types accommodates width and depth subtyping, two properties that partially hold in contr...
Cosimo Laneve, Luca Padovani
FOSSACS
2004
Springer
14 years 26 days ago
Polynomials for Proving Termination of Context-Sensitive Rewriting
Abstract. We show how to generate well-founded and stable term orderings based on polynomial interpretations over the real numbers. Monotonicity (another usual requirement in termi...
Salvador Lucas
EMNLP
2004
13 years 9 months ago
Monolingual Machine Translation for Paraphrase Generation
We apply statistical machine translation (SMT) tools to generate novel paraphrases of input sentences in the same language. The system is trained on large volumes of sentence pair...
Chris Quirk, Chris Brockett, William B. Dolan
AAECC
2005
Springer
128views Algorithms» more  AAECC 2005»
13 years 7 months ago
The size-change principle and dependency pairs for termination of term rewriting
Abstract In [24], a new size-change principle was proposed to verify termination of functional programs automatically. We extend this principle in order to prove termination and in...
René Thiemann, Jürgen Giesl
PODC
2009
ACM
14 years 2 months ago
Brief announcement: new bounds for the controller problem
The (M, W)-controller, originally studied by Afek, Awerbuch, Plotkin, and Saks, is a basic distributed tool that an abstraction for managing the consumption of a global resource i...
Yuval Emek, Amos Korman