Sciweavers

595 search results - page 19 / 119
» Using Constraints with Memory to Implement Variable Eliminat...
Sort
View
123
Voted
CASCON
2006
149views Education» more  CASCON 2006»
15 years 4 months ago
Packet decoding using context sensitive parsing
Protocol tester is a project at RMC and Queen's that applies program transformation techniques to protocol data to evaluate the security of network applications. As part of t...
Sylvain Marquis, Thomas R. Dean, Scott Knight
111
Voted
FORMATS
2006
Springer
15 years 6 months ago
Verification of the Generic Architecture of a Memory Circuit Using Parametric Timed Automata
Using a variant of Clariso-Cortadella's parametric method for verifying asynchronous circuits, we formally derive a set of linear constraints that ensure the correctness of so...
Remy Chevallier, Emmanuelle Encrenaz-Tiphèn...
126
Voted
CP
2006
Springer
15 years 6 months ago
Retroactive Ordering for Dynamic Backtracking
Dynamic Backtracking (DBT) is a well known algorithm for solving Constraint Satisfaction Problems. In DBT, variables are allowed to keep their assignment during backjump, if they a...
Roie Zivan, Uri Shapen, Moshe Zazone, Amnon Meisel...
149
Voted
CORR
2004
Springer
176views Education» more  CORR 2004»
15 years 2 months ago
The First-Order Theory of Sets with Cardinality Constraints is Decidable
Data structures often use an integer variable to keep track of the number of elements they store. An invariant of such data structure is that the value of the integer variable is ...
Viktor Kuncak, Martin C. Rinard
ISSS
2002
IEEE
133views Hardware» more  ISSS 2002»
15 years 7 months ago
Data Memory Design Considering Effective Bitwidth for Low-Energy Embedded Systems
This paper presents a novel low-energy memory design technique, considering effective bitwidth of variables for applicationspecific systems, called VAbM technique. It targets th...
Hiroto Yasuura, Hiroyuki Tomiyama, Takanori Okuma,...