Proving the equivalence of successive, closely related versions of a program has the potential of being easier in practice than functional verification, although both problems are undecidable. Thereâ€¦ (More)

Inspired by Hoareâ€™s rule for recursive procedures, we present three proof rules for the equivalence between recursive programs. The first rule can be used for proving partial equivalence of programs;â€¦ (More)

Proving the equivalence of successive, closely related versions of a program has the potential of being easier in practice than functional verification, although both problems are undecidable. Thereâ€¦ (More)

We discuss the complexity of computing various graph polynomials of graphs of fixed clique-width. We show that the chromatic polynomial, the matching polynomial and the two-variable interlaceâ€¦ (More)

K.Dohmen, A.PÃ¶nitz and P.Tittman (2003), introduced a bivariate generalization of the chromatic polynomial P (G, x, y) which subsumes also the independent set polynomial of I. Gutman and F. Harary,â€¦ (More)

We look for graph polynomials which satisfy recurrence relations on three kinds of edge elimination: edge deletion, edge contraction and edge extraction, i.e., deletion of edges together with theirâ€¦ (More)

Formal Methods in Computer Aided Design (FMCAD'07â€¦

2007

In simulation-based verification, we check the correctness of a given program by executing it on some input vectors. Even for medium-size programs, exhaustive testing is impossible. Thus, many errorsâ€¦ (More)

Software model checking came to the focus of research recently, with sharp growth in the number of safety-critical applications and in the complexity of software. In model checking of software weâ€¦ (More)

A graph polynomial p(G, XÌ„) can code numeric information about the underlying graph G in various ways: as its degree, as one of its specific coefficients or as evaluations at specific points XÌ„ =â€¦ (More)