282 search results - page 42 / 57 » Description Logics for Shape Analysis |
102
Voted
POPL
2010
ACM
15 years 10 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...
118
Voted
CADE
2002
Springer
16 years 1 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 ...
97
Voted
IANDC
2010
14 years 10 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...
134
Voted
ECOWS
2007
Springer
15 years 6 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...
93
Voted
CORR
2010
Springer
15 years 24 days 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...