Sciweavers

11740 search results - page 59 / 2348
» More Problems in Rewriting
Sort
View
CADE
2001
Springer
14 years 10 months ago
More On Implicit Syntax
Proof assistants based on type theories, such as Coq and Lego, allow users to omit subterms on input that can be inferred automatically. While those mechanisms are well known, ad-h...
Marko Luther
SIGCOMM
2005
ACM
14 years 3 months ago
One more bit is enough
Achieving efficient and fair bandwidth allocation while minimizing packet loss in high bandwidth-delay product networks has long been a daunting challenge. Existing endto-end cong...
Yong Xia, Lakshminarayanan Subramanian, Ion Stoica...
ICSE
2008
IEEE-ACM
14 years 10 months ago
Data flow testing of service-oriented workflow applications
WS-BPEL applications are a kind of service-oriented application. They use XPath extensively to integrate loosely-coupled workflow steps. However, XPath may extract wrong data from...
Lijun Mei, W. K. Chan, T. H. Tse
ESORICS
2011
Springer
12 years 9 months ago
Supporting Concurrency in Private Data Outsourcing
Abstract. With outsourcing emerging as a successful paradigm for delegating data and service management to third parties, the problem of guaranteeing proper privacy protection agai...
Sabrina De Capitani di Vimercati, Sara Foresti, St...
CADE
2007
Springer
14 years 4 months ago
Proving Termination by Bounded Increase
Abstract. Most methods for termination analysis of term rewrite systems (TRSs) essentially try to find arguments of functions that decrease in recursive calls. However, they fail ...
Jürgen Giesl, René Thiemann, Stephan S...