1689 search results - page 122 / 338 » Refining abstract interpretations |
128
Voted
VMCAI
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. We introduce Subpolyhedra (SubPoly) a new numerical abstract domain to infer and propagate linear inequalities. SubPoly is as expressive as Polyhedra, but it drops some o...
146
click to vote
SIGSOFT
2006
ACM
16 years 5 months ago
2006
ACM
We consider the problem if a given program satisfies a specified safety property. Interesting programs have infinite state spaces, with inputs ranging over infinite domains, and f...
157
Voted
ASPDAC
2009
ACM
15 years 9 months ago
2009
ACM
— This paper proposes the first automatic approach to simultaneously generate Cycle Accurate and Cycle Count Accurate transaction level bus models. Since TLM (Transaction Level M...
126
click to vote
COSIT
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. This paper addresses the problem of merging qualitative constraint networks (QCNs) defined on different qualitative formalisms. Our model is restricted to formalisms wher...
132
click to vote
DATE
2004
IEEE
15 years 8 months ago
2004
IEEE
In this paper, we present a technique to design and verify the Look-Aside (LA-1) Interface standard used in network processors. Our design flow includes several refinements starti...