Sciweavers

350 search results - page 32 / 70
» Branching Programs for Tree Evaluation
Sort
View
COCO
2005
Springer
128views Algorithms» more  COCO 2005»
14 years 1 months ago
More on Noncommutative Polynomial Identity Testing
We continue the study of noncommutative polynomial identity testing initiated by Raz and Shpilka and present efficient algorithms for the following problems in the noncommutative...
Andrej Bogdanov, Hoeteck Wee
COMPSAC
2009
IEEE
13 years 11 months ago
Tamper Resistance for Software Defined Radio Software
The security of software defined radio (SDR) software is essential to the trustworthiness of the overall radio system. When designing and developing security solutions for SDR sof...
Shucai Xiao, Jung-Min Park, Yanzhu Ye
LCPC
2005
Springer
14 years 1 months ago
Revisiting Graph Coloring Register Allocation: A Study of the Chaitin-Briggs and Callahan-Koblenz Algorithms
Techniques for global register allocation via graph coloring have been extensively studied and widely implemented in compiler frameworks. This paper examines a particular variant ...
Keith D. Cooper, Anshuman Dasgupta, Jason Eckhardt
SIGSOFT
1998
ACM
13 years 11 months ago
Further Empirical Studies of Test Effectiveness
This paper reports on an empirical evaluation of the fault-detecting ability of two white-box software testing techniques: decision coverage (branch testing) and the all-uses data...
Phyllis G. Frankl, Oleg Iakounenko
CADE
2010
Springer
13 years 8 months ago
A Slice-Based Decision Procedure for Type-Based Partial Orders
Automated software verification and path-sensitive program analysis require the ability to distinguish executable program paths from those that are infeasible. To achieve this, pro...
Elena Sherman, Brady J. Garvin, Matthew B. Dwyer