261 search results - page 46 / 53 » Formal Proof from UML Models |
170
click to vote
FMCAD
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. We consider the problem of refinement checking for asynchronous processes where refinement corresponds to stutter-closed language inclusion. Since an efficient algorithmi...
158
click to vote
FMCAD
2006
Springer
15 years 10 months ago
2006
Springer
The last few years have seen the advent of a new breed of decision procedures for various fragments of first-order logic based on ional abstraction. A lazy satisfiability checker ...
174
click to vote
POPL
2000
ACM
15 years 10 months ago
2000
ACM
with existing analysis tools. Modular reasoning principles such as abstraction, compositional refinement, and assume-guarantee reasoning are well understood for architectural hiera...
188
click to vote
NMR
2004
Springer
15 years 11 months ago
2004
Springer
All major semantics of normal logic programs and normal logic programs with aggregates can be described as fixpoints of the one-step provability operator or of operators that can...
174
click to vote
PODC
2010
ACM
15 years 8 months ago
2010
ACM
The study of complex networks led to the belief that the connectivity of network nodes generally follows a Power-law distribution. In this work, we show that modeling large-scale ...