1689 search results - page 105 / 338 » Refining abstract interpretations |
122
click to vote
CAISE
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. The development of critical systems requires a high assurance process from requirements to the running code. Formal methods, such as B, now provide industry-strength tool...
124
click to vote
IJCIS
2007
15 years 4 months ago
2007
by allowing designers to model their systems at different abstraction levels, providing them omatic model transformations to incrementally refine abstract models into more concrete...
149
click to vote
LICS
1994
IEEE
15 years 8 months ago
1994
IEEE
The theory of cut-free sequent proofs has been used to motivate and justify the design of a number of logic programming languages. Two such languages, Prolog and its linear logic ...
143
click to vote
DAC
2004
ACM
16 years 5 months ago
2004
ACM
Instances of the Boolean satisfiability problem (SAT) arise in many areas of circuit design and verification. These instances are typically constructed from some human-designed ar...
142
click to vote
AMT
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. Consistent description and representation method of user interests are required for personalized Web applications. In this paper, we provide a formal definition and the &...