Sciweavers

9182 search results - page 1626 / 1837
» Requirements for Requirements Management Tools
Sort
View
VLSID
2001
IEEE
200views VLSI» more  VLSID 2001»
16 years 7 months ago
Evaluation of the Traffic-Performance Characteristics of System-on-Chip Communication Architectures
The emergence of several communication architectures for System-on-Chips provides designers with a variety of design alternatives. In addition, the need to customize the system ar...
Kanishka Lahiri, Sujit Dey, Anand Raghunathan
CHI
2002
ACM
16 years 7 months ago
Quantitative analysis of scrolling techniques
We propose a formal experimental paradigm designed to help evaluate scrolling interaction techniques. Such a method is needed by interaction designers to quantify scrolling perfor...
Ken Hinckley, Edward Cutrell, Steve Bathiche, Tim ...
POPL
2006
ACM
16 years 7 months ago
Verifying properties of well-founded linked lists
We describe a novel method for verifying programs that manipulate linked lists, based on two new predicates that characterize reachability of heap cells. These predicates allow re...
Shuvendu K. Lahiri, Shaz Qadeer
POPL
2003
ACM
16 years 7 months ago
From symptom to cause: localizing errors in counterexample traces
There is significant room for improving users' experiences with model checking tools. An error trace produced by a model checker can be lengthy and is indicative of a symptom...
Thomas Ball, Mayur Naik, Sriram K. Rajamani
STOC
2007
ACM
111views Algorithms» more  STOC 2007»
16 years 7 months ago
Low-end uniform hardness vs. randomness tradeoffs for AM
In 1998, Impagliazzo and Wigderson [IW98] proved a hardness vs. randomness tradeoff for BPP in the uniform setting, which was subsequently extended to give optimal tradeoffs for t...
Ronen Shaltiel, Christopher Umans
« Prev « First page 1626 / 1837 Last » Next »