Sciweavers

514 search results - page 20 / 103
» Dependency Analysis of Ada Programs
Sort
View
LPAR
2001
Springer
13 years 11 months ago
Boolean Functions for Finite-Tree Dependencies
Several logic-based languages, such as Prolog II and its successors, SICStus Prolog and Oz, offer a computation domain including rational trees. Infinite rational trees allow fo...
Roberto Bagnara, Enea Zaffanella, Roberta Gori, Pa...
WCET
2008
13 years 8 months ago
Computing time as a program variable: a way around infeasible paths
Conditional branches connect the values of program variables with the execution paths and thus with the execution times, including the worstcase execution time (WCET). Flow analys...
Niklas Holsti
CVPR
2005
IEEE
14 years 9 months ago
WaldBoost - Learning for Time Constrained Sequential Detection
: In many computer vision classification problems, both the error and time characterizes the quality of a decision. We show that such problems can be formalized in the framework of...
Jan Sochman, Jiri Matas
WORDS
2005
IEEE
14 years 28 days ago
Towards a Flow Analysis for Embedded System C Programs
Reliable program Worst-Case Execution Time (WCET) estimates are a key component when designing and verifying real-time systems. One way to derive such estimates is by static WCET ...
Jan Gustafsson, Andreas Ermedahl, Björn Lispe...
SIGSOFT
2003
ACM
14 years 8 months ago
Runtime safety analysis of multithreaded programs
Foundational and scalable techniques for runtime safety analysis of multithreaded programs are explored in this paper. A technique based on vector clocks to extract the causal dep...
Koushik Sen, Grigore Rosu, Gul Agha