Sciweavers

59 search results - page 10 / 12
» Generating all polynomial invariants in simple loops
Sort
View
VLSISP
2008
173views more  VLSISP 2008»
13 years 9 months ago
Fast Bit Gather, Bit Scatter and Bit Permutation Instructions for Commodity Microprocessors
Advanced bit manipulation operations are not efficiently supported by commodity word-oriented microprocessors. Programming tricks are typically devised to shorten the long sequence...
Yedidya Hilewitz, Ruby B. Lee
VMCAI
2004
Springer
14 years 3 months ago
Construction of a Semantic Model for a Typed Assembly Language
Typed Assembly Languages (TALs) can be used to validate the safety of assembly-language programs. However, typing rules are usually trusted as axioms. In this paper, we show how to...
Gang Tan, Andrew W. Appel, Kedar N. Swadi, Dinghao...
ICSE
2009
IEEE-ACM
14 years 4 months ago
Test selection for result inspection via mining predicate rules
It is labor-intensive to manually verify the outputs of a large set of tests that are not equipped with test oracles. Test selection helps to reduce this cost by selecting a small...
Wujie Zheng, Michael R. Lyu, Tao Xie
AIPS
2008
14 years 3 days ago
Linear Relaxation Techniques for Task Management in Uncertain Settings
In this paper, we consider the problem of assisting a busy user in managing her workload of pending tasks. We assume that our user is typically oversubscribed, and is invariably j...
Pradeep Varakantham, Stephen F. Smith
AAAI
1996
13 years 11 months ago
What Is Planning in the Presence of Sensing?
The Airport Example The Omelette Example Copyright c 1996 American Association for Artificial Intelligence. All rights reserved. Despite the existence of programs that are able to ...
Hector J. Levesque