Beta-catenin integrates intracellular WNT signalling and the intercellular E-cadherin-catenin adhesion system. To date, little is known about the role of beta-catenin activation and nuclear accumulation in hepatocarcinogenesis. This study has analysed beta-catenin expression patterns in human dysplastic nodules (DNs), as well as in hepatocellular carcinomas (HCCs) in comparison with proliferation, expression of WNT-1 target genes, E-cadherin, and p53. One hundred and seventy HCCs and 25 DNs were categorized according to established criteria and analysed for the expression pattern of beta-catenin. Analysis of the proliferative activity and expression of E-cadherin, cyclin D1, MMP-7, c-myc, and p53 was performed on a representative subgroup of cases. All DNs lacked nuclear beta-catenin, while 36% of all HCCs were positive, with the number of nuclear stained cells ranging from less than 1% to more than 90%. Increasing nuclear accumulation of beta-catenin correlated with reduced membranous E-cadherin expression and nuclear p53 but not with proliferation. Cyclin D1, MMP-7, and c-myc expression was detected in 54%, 26%, and 65% of HCCs, respectively, but did not correlate with nuclear beta-catenin, proliferation, or grading. Sequence analysis of the beta-catenin gene revealed no detectable mutations in DNs, but mutations in the GSK-3beta binding site were present in 14.3% of the HCCs. In conclusion, this study has demonstrated that nuclear accumulation of beta-catenin is a frequent progression event in human hepatocarcinogenesis which correlates with nuclear p53 accumulation and loss of membranous E-cadherin, but not with the expression pattern of established WNT-1 target genes. It is hypothesized that the role of beta-catenin in human HCC differs significantly from its established function in colon carcinogenesis.

We present a logical framework for the verification of relational properties in imperative programs. Our framework reduces verification of relational properties of imperative programs to a validity problem in trace logic, an expressive instance of first-order predicate logic. Trace logic draws its expressiveness from its syntax, which allows expressing properties over computation traces. Its axiomatization supports fine-grained reasoning about intermediate steps in program execution, notably loop iterations. We present an algorithm to encode the semantics of programs as well as their relational properties in trace logic, and then show how first-order theorem proving can be used to reason about the resulting trace logic formulas. Our work is implemented in the tool RAPID and evaluated with examples coming from the security field.

No abstract

No abstract