Sciweavers

4940 search results - page 182 / 988
» On the Complexity of Universal Programs
Sort
View
CASES
2009
ACM
15 years 11 months ago
Tight WCRT analysis of synchronous C programs
Accurate estimation of the tick length of a synchronous program is essential for efficient and predictable implementations that are devoid of timing faults. The techniques to dete...
Partha S. Roop, Sidharta Andalam, Reinhard von Han...
SIGUCCS
2003
ACM
15 years 10 months ago
Deep in benchmarking: using industry standards to assess a training program
At the University of Missouri – Columbia’s Information and Access Technology (IAT) Services, InfoTech Training compares the results of their IT training program with similar t...
Joleen Pfefer
DAC
2004
ACM
16 years 6 months ago
Abstraction of assembler programs for symbolic worst case execution time analysis
ion of Assembler Programs for Symbolic Worst Case Execution Time Analysis Tobias Schuele Tobias.Schuele@informatik.uni-kl.de Klaus Schneider Klaus.Schneider@informatik.uni-kl.de Re...
Klaus Schneider, Tobias Schüle
ATVA
2006
Springer
162views Hardware» more  ATVA 2006»
15 years 8 months ago
Predicate Abstraction of Programs with Non-linear Computation
e Abstraction of Programs With Non-linear Computation Songtao Xia1 Ben Di Vito2 Cesar Munoz3 1 NASA Postdoc at NASA Langley Research Center, Hampton, VA 2 NASA Langley Research Cen...
Songtao Xia, Ben Di Vito, César Muño...
MPC
2010
Springer
246views Mathematics» more  MPC 2010»
15 years 7 months ago
Abstraction of Object Graphs in Program Verification
ion of Object Graphs in Program Verification Yifeng Chen1 and J.W. Sanders2 1 HCST Key Lab at School of EECS, Peking University, China. 2 UNU-IIST, Macao. A set-theoretic formalism...
Yifeng Chen, Jeff W. Sanders