279 search results - page 12 / 56 » Invariant Patterns for Program Reasoning |
CADE
2001
Springer
14 years 7 months ago
2001
Springer
The modalities of Dynamic Logic refer to the final state of a program execution and allow to specify programs with pre- and postconditions. In this paper, we extend Dynamic Logic w...
ICSE
2005
IEEE-ACM
14 years 7 months ago
2005
IEEE-ACM
Data structure repair is a promising technique for enabling programs to execute successfully in the presence of otherwise fatal data structure corruption errors. Previous research...
POPL
2009
ACM
14 years 8 months ago
2009
ACM
This work develops an integrated approach to the verification of behaviourally rich programs, founded directly on operational semantics. The power of the approach is demonstrated ...
TLDI
2003
ACM
14 years 21 days ago
2003
ACM
We describe a design pattern for writing programs that traverse data structures built from rich mutually-recursive data types. Such programs often have a great deal of “boilerpl...
LPAR
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. We present ABC, a software tool for automatically computing symbolic upper bounds on the number of iterations of nested program loops. The system combines static analysis...