437 search results - page 58 / 88 » Proving Termination by Divergence |
CSL
2005
Springer
14 years 1 months ago
2005
Springer
Since Val Tannen's pioneering work on the combination of simply-typed λ-calculus and rst-order rewriting [11], many authors have contributed to this subject by extending it ...
EMSOFT
2005
Springer
14 years 1 months ago
2005
Springer
We describe a system as a set of communicating concurrent programs. Quasi-static scheduling compiles the concurrent programs into a sequential one. It uses a Petri net as an inter...
STOC
2007
ACM
14 years 8 months ago
2007
ACM
We prove and extend a conjecture of Kempe, Kleinberg, and Tardos (KKT) on the spread of influence in social networks. A social network can be represented by a directed graph where...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
— Linial, London and Rabinovich [16] and Aumann and Rabani [3] proved that the min-cut max-flow ratio for general maximum concurrent flow problems (when there are k commodities...
CC
2009
Springer
14 years 8 months ago
2009
Springer
This paper presents a compiler which produces machine code from functions defined in the logic of a theorem prover, and at the same time proves that the generated code executes the...