198 search results - page 22 / 40 » Lightweight reasoning about program correctness |
TCS
2010
13 years 7 months ago
2010
We define a program semantics that is preserved by dependence-based slicing algorithms. It is a natural extension, to non-terminating programs, of the semantics introduced by Wei...
SIGSOFT
1994
ACM
14 years 20 days ago
1994
ACM
In this paper we present an approach, based on data ow analysis, that can provide cost-e ective analysis of concurrent programs with respect to explicitly stated correctness prope...
LISP
2008
13 years 8 months ago
2008
Abstract Reasoning about the termination of equational programs in sophisticated equational languages such as ELAN, MAUDE, OBJ, CAFEOBJ, HASKELL, and so on, requires support for ad...
AI
1998
Springer
13 years 8 months ago
1998
Springer
We argue that the situation calculus is a natural formalism for representing and reasoning about control and strategic information. As a case study, in this paper we provide a sit...
POPL
2007
ACM
14 years 9 months ago
2007
ACM
We present a formal model of memory that both captures the lowlevel features of C's pointers and memory, and that forms the basis for an expressive implementation of separati...