1716 search results - page 222 / 344 » Proving Conditional Termination |
117
click to vote
APLAS
2005
ACM
15 years 6 months ago
2005
ACM
This paper describes a sound technique that combines the precision em proving with the loop-invariant inference of abstract interpretation. The loop-invariant computations are invo...
135
click to vote
COCOON
2006
Springer
15 years 6 months ago
2006
Springer
Denote by an -component a connected b-uniform hypergraph with k edges and k(b - 1) - vertices. We prove that the expected number of creations of -component during a random hypergr...
149
click to vote
COCOON
2005
Springer
15 years 6 months ago
2005
Springer
We consider a variation of the classical problem of finding prices which guarantee equilibrium in linear markets consisting of divisible goods and agents with money. Specificall...
136
click to vote
CSFW
2008
IEEE
15 years 5 months ago
2008
IEEE
Declassification occurs when the confidentiality of information is weakened; erasure occurs when the confidentiality of information is strengthened, perhaps to the point of comple...
150
click to vote
FASE
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. Graph constraints were introduced in the area of graph transformation, in connection with the notion of (negative) application conditions, as a form to limit the applicab...