Sciweavers

1485 search results - page 114 / 297
» Whole Program Paths
Sort
View
POPL
2008
ACM
14 years 9 months ago
Proving non-termination
The search for proof and the search for counterexamples (bugs) are complementary activities that need to be pursued concurrently in order to maximize the practical success rate of...
Ashutosh Gupta, Thomas A. Henzinger, Rupak Majumda...
FM
2009
Springer
124views Formal Methods» more  FM 2009»
14 years 3 months ago
An Incremental Approach to Scope-Bounded Checking Using a Lightweight Formal Method
We present a novel approach to optimize scope-bounded checking programs using a relational constraint solver. Given a program and its correctness specification, the traditional app...
Danhua Shao, Sarfraz Khurshid, Dewayne E. Perry
FMCAD
2009
Springer
14 years 3 months ago
Software model checking via large-block encoding
Abstract—Several successful approaches to software verificabased on the construction and analysis of an abstract reachability tree (ART). The ART represents unwindings of the co...
Dirk Beyer, Alessandro Cimatti, Alberto Griggio, M...
ICC
2008
IEEE
175views Communications» more  ICC 2008»
14 years 3 months ago
Routing in Cooperative Wireless Networks with Mutual-Information Accumulation
Cooperation between the nodes of wireless multihop networks can increase communication reliability, reduce energy consumption, and decrease latency. The possible improvements are ...
Stark C. Draper, Lingjia Liu, Andreas F. Molisch, ...
ISORC
2008
IEEE
14 years 3 months ago
Obstacles in Worst-Case Execution Time Analysis
The analysis of the worst-case execution time (WCET) requires detailed knowledge of the program behavior. In practice it is still not possible to obtain all needed information aut...
Raimund Kirner, Peter P. Puschner