759 search results - page 99 / 152 » Identifying Modeling Errors in Signatures by Model Checking |
PLDI
2009
ACM
14 years 5 months ago
2009
ACM
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
AAIM
2009
Springer
14 years 4 months ago
2009
Springer
Polyhedra are widely used in model checking and abstract interpretation. Polyhedral analysis is effective when the relationships between variables are linear, but suffers from im...
ATVA
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. Compositional reasoning aims to improve scalability of verification tools by reducing the original verification task into subproblems. The simplification is typically bas...
ICDT
2009
ACM
13 years 8 months ago
2009
ACM
We describe a novel approach to verification of software systems centered around an underlying database. Instead of applying general-purpose techniques with only partial guarantee...
COMPULOG
1999
Springer
14 years 2 months ago
1999
Springer
Many constraint satisfaction problems can be naturally and efficiently modelled using non-binary constraints like the “all-different” and “global cardinality” constraints...