986 search results - page 13 / 198 » Generalized Goal Programming: polynomial methods and applica... |
ENTCS
2006
13 years 7 months ago
2006
We extend the Reichel-Jacobs coalgebraic account of specification and refinement of objects and classes in Object Oriented Programming to (generalized) binary methods. These are m...
TDSC
2010
13 years 2 months ago
2010
We describe Instruction-Set Randomization (ISR), a general approach for safeguarding systems against any type of code-injection attack. We apply Kerckhoffs' principle to creat...
FOSSACS
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We show how to generate well-founded and stable term orderings based on polynomial interpretations over the real numbers. Monotonicity (another usual requirement in termi...
SIGSOFT
2010
ACM
13 years 5 months ago
2010
ACM
It is widely believed that program analysis can be more closely targeted to the needs of programmers if the program is accompanied by further redundant documentation. This may inc...
ICCAD
2003
IEEE
14 years 4 months ago
2003
IEEE
This paper presents an efficient method to reduce complexities of a linear network in s-domain. The new method works on circuit matrices directly and reduces the circuit complexi...