Sciweavers

1485 search results - page 7 / 297
» Whole Program Paths
Sort
View
SAS
2010
Springer
121views Formal Methods» more  SAS 2010»
14 years 10 months ago
Alternation for Termination
Proving termination of sequential programs is an important problem, both for establishing the total correctness of systems and as a component of proving more general termination an...
William R. Harris, Akash Lal, Aditya V. Nori, Srir...
42
Voted
ICALP
1989
Springer
15 years 3 months ago
Shortest Paths Without a Map
Christos H. Papadimitriou, Mihalis Yannakakis
POPL
2010
ACM
15 years 9 months ago
Program Analysis via Satisfiability Modulo Path Programs
William R. Harris, Sriram Sankaranarayanan, Franjo...
GLOBECOM
2008
IEEE
15 years 6 months ago
A Dynamic Programming Approach for Routing in Wireless Mesh Networks
—The routing problem in Wireless Mesh Networks is concerned with finding “good” source-destination paths. It generally faces multiple objectives to be optimized, such as i) ...
Jorge Crichigno, Joud Khoury, Min-You Wu, Wei Shu