328 search results - page 24 / 66 » Proving Termination of Communicating Programs |
CADE
2007
Springer
14 years 8 months ago
2007
Springer
Abstract. A method based on dependency pairs for showing termination of functional programs on data structures generated by constructors with relations is proposed. A functional pr...
ENTCS
2002
13 years 7 months ago
2002
The past decade has seen an explosion of work on calculi of explicit substitutions. Numerous work has illustrated the usefulness of these calculi for practical notions like the im...
CSFW
1997
IEEE
13 years 12 months ago
1997
IEEE
A type system is given that eliminates two kinds of covert flows in an imperative programming language. The first kind arises from nontermination and the other from partial oper...
APLAS
2007
ACM
13 years 11 months ago
2007
ACM
We propose a series of type systems for the information-flow security of assembly code. These systems extend previous work TALC with some timing annotations and associated judgment...
MOBICOM
2006
ACM
14 years 1 months ago
2006
ACM
We propose novel solutions for unicast routing in wireless networks consisted of selfish terminals: in order to alleviate the inevitable over-payment problem (and thus economic i...