Pubblicazioni

Autori:

Bonacina, Maria Paola

Titolo:

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

Anno:

2010

Tipologia prodotto:

Contributo in atti di convegno

Tipologia ANVUR:

Contributo in Atti di convegno

Lingua:

Inglese

Formato:

A Stampa

Titolo del Convegno:

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

Luogo:

Schloss Hagenberg, Linz, Austria

Periodo:

July 2010

Casa editrice:

ACM Press

ISBN:

9781450301329

Intervallo pagine:

1-11

Parole chiave:

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

Breve descrizione dei contenuti:

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

Pagina Web:

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

Id prodotto:

57184

Handle IRIS:

11562/342242

depositato il:

30 luglio 2010

ultima modifica:

16 settembre 2023

Citazione bibliografica:

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 , Atti di "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