328 search results - page 14 / 66 » Proving Termination of Communicating Programs |
VTC
2010
IEEE
13 years 6 months ago
2010
IEEE
—In this paper we present an architectural analysis of a smart DMA (sDMA) controller for protocol stack acceleration in mobile devices supporting 3GPP’s Long Term Evolution (LT...
CHARME
2003
Springer
14 years 27 days ago
2003
Springer
Intrusion-tolerance is the technique of using fault-tolerance to achieve security properties. Assuming that faults, both benign and Byzantine, are unavoidable, the main goal of Int...
TOPLAS
2008
13 years 7 months ago
2008
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...
ICLP
1999
Springer
13 years 12 months ago
1999
Springer
We introduce the notion of bounded nondeterminism for logic programs and queries. A program and a query have bounded nondeterminism if there are finitely many refutations for the...
PEPM
2010
ACM
13 years 9 months ago
2010
ACM
Software engineering, automated reasoning, rule-based programming or specifications often use rewriting systems for which termination, among other properties, may have to be ensur...