We define an abstract model of belief propagation on a graph based on the methodology of the revision theory of truth together with the Assertion Network Toolkit, a graphical interface designed to test our semantics.

We present an approach for automatically generating relevant , focused questions to be asked during code inspection sessions. The method is based on Hoare-logic. The novel key idea is the introduction of informal predicates, which, though not having a formal definition , may have a perfectly legal and unique informal interpretation. Such predicates make it easier to express requirements in term...

We revisit the connection between equality assertion checking in programs and unification that was recently described in [8]. Using a general formalization of this connection, we establish interesting connections between the complexity of assertion checking in programs and unification theory of the underlying program expressions. In particular, we show that assertion checking is: (a) PTIME for ...

Many automated techniques for invariant generation are based on the idea that the invariant should show that something “bad” will not happen in the analyzed program. In this article we present an algorithm for loop invariant generation in programs with assertions using a weakest precondition calculus. We have realized the algorithm in the extended static checker ESC/Java2. Challenges stemming f...

We provide a deflationarily acceptable account of assertion in truth-relativistic domains. First, we state what we take relativism and deflationism to be. Second, we clarify the problem of assertion in relativistic domains by singling out the features that make assertion within those domains problematic. Then, we tackle the problem directly by generalizing a standard deflationary account of the...

The gap in [5] occurs in Section 4 in the proof of assertions (A) and (B), at the point where there are diagram chasing arguments in two commutative diagrams (displayed on page 1333 for case (A)). In each diagram the groups Gn in the two rows are isomorphic but not identical. If we denote by Gn and G n these two isomorphic groups, the first diagram chase needs the composition Hi.Gn/!Hi.GnC1/!Hi...

Conversationally relevant descriptions are definite descriptions that are not merely tools for the identification of a referent, but are also crucial to the discourse in other respects. I analyze the uses of such descriptions in assertions as conveying a particular ~ype of conversational implicatures. Such implicstures can be represented within the framework of possible world semantics. The ana...