Publications

Authors:

Bonacina, Maria Paola

Title:

On theorem proving for program checking - Historical perspective and recent developments

Year:

2010

Type of item:

Contributo in atti di convegno

Tipologia ANVUR:

Contributo in Atti di convegno

Language:

Inglese

Format:

A Stampa

Congresso:

Twelfth International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming (PPDP)

Place:

Schloss Hagenberg, Linz, Austria

Period:

July 2010

Publisher:

ACM Press

ISBN:

9781450301329

Page numbers:

1-11

Keyword:

Satisfiability modulo theories; Combination of theories; Rewrite-based theorem proving; Speculative inferences

Short description of contents:

This article is a survey of recent results, related works and new challenges in automated theorem proving for program checking. The aim is to give some historical perspective, albeit necessarily incomplete, and highlight some of the turning points that made crucial advances possible.

Note:

Invited paper

Web page:

http://dx.doi.org/10.1145/1836089.1836090
https://mariapaola.github.io/

Product ID:

57184

Handle IRIS:

11562/342242

Deposited On:

July 30, 2010

Last Modified:

September 16, 2023

Bibliographic citation:

Bonacina, Maria Paola, On theorem proving for program checking - Historical perspective and recent developments  in Proceedings of the Twelfth International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming (PPDP) , ACM Press , Proceedings of "Twelfth International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming (PPDP)" , Schloss Hagenberg, Linz, Austria , July 2010 , 2010 , pp. 1-11

Consulta la scheda completa presente nel repository istituzionale della Ricerca di Ateneo