282 search results - page 42 / 57 » Description Logics for Shape Analysis |
POPL
2010
ACM
14 years 8 months ago
2010
ACM
The automated inference of quantified invariants is considered one of the next challenges in software verification. The question of the right precision-efficiency tradeoff for the...
CADE
2002
Springer
14 years 11 months ago
2002
Springer
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
IANDC
2010
13 years 8 months ago
2010
The paper proposes a novel analysis of quantificational subordination, e.g. Harvey courts a woman at every convention. {She is very pretty. vs. She always comes to the banquet with...
ECOWS
2007
Springer
14 years 5 months ago
2007
Springer
Execution monitoring of complex web service process models is critical for effective management and control of web services based systems. During the composite process model execu...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
A theory, graphical notation, mathematical calculus and implementation for finding whether two given expressions can, at execution time, denote references attached to the same obje...