Counting Aliases

Marius Bozga (1) , Radu Iosif (1) , Yassine Lakhnech (1)

1 VERIMAG - IMAG - VERIMAG

Our contribution is the development and study of a first order interpreted logic (κAL) in which we can express shape properties of recursive data structures and compute weakest preconditions. We show that, in general, the satisfiability problem of κAL is undecidable.

Domaines: Logique en informatique [cs.LO]

Marius Bozga, Radu Iosif, Yassine Lakhnech. Counting Aliases. [Research Report] VERIMAG. 2004. ⟨hal-01423603⟩