1187 search results - page 114 / 238 » Graph-Based Procedural Abstraction |
116
click to vote
CADE
2009
Springer
16 years 2 months ago
2009
Springer
Abstract. An approach based on term rewriting techniques for the automated termination analysis of imperative programs operating on integers is presented. An imperative program is ...
101
click to vote
SAS
2009
Springer
16 years 2 months ago
2009
Springer
Abstract. The capability calculus is a framework for statically reasoning about program resources such as deallocatable memory regions. Fractional capabilities, originally proposed...
115
click to vote
CADE
2008
Springer
16 years 2 months ago
2008
Springer
Abstract. We present the first terminating tableau calculus for basic hybrid logic with the difference modality and converse modalities. The language under consideration is basic m...
110
click to vote
CADE
2006
Springer
16 years 2 months ago
2006
Springer
Abstract. The inverse method is a generalization of resolution that can be applied to non-classical logics. We have recently shown how Andreoli's focusing strategy can be adap...
ICSE
2003
IEEE-ACM
16 years 1 months ago
2003
IEEE-ACM
We present a new methodology for automatic verification of C programs against finite state machine specifications. Our approach is compositional, naturally enabling us to decompos...