Proceedings Article, Paper
@InProceedings
Beitrag in Tagungsband, Workshop


Show entries of:

this year (2019) | last year (2018) | two years ago (2017) | Notes URL

Action:

login to update

Options:








Author, Editor

Author(s):

Sofronie-Stokkermans, Viorica

dblp



Editor(s):

Ranise, Silvio

dblp

Not MPII Editor(s):

Ranise, Silvio

BibTeX cite key*:

Sofronie-Stokkermans-ftp07-abstract

Title, Booktitle

Title*:

Hierarchical and modular reasoning in complex theories: The case of local theory extensions.

Booktitle*:

Proceedings of the Sixth International Workshop on First-Order Theorem Proving (FTP 2007)

Event, URLs

URL of the conference:

http://www.csc.liv.ac.uk/~ftp07/venue.html

URL for downloading the paper:

http://www.csc.liv.ac.uk/research/techreports/tr2007/ulcs-07-018.pdf

Event Address*:

Liverpool, UK

Language:

English

Event Date*
(no longer used):


Organization:


Event Start Date:

12 September 2007

Event End Date:

14 September 2007

Publisher

Name*:

University of Liverpool

URL:


Address*:

Liverpool, UK

Type:

Abstract

Vol, No, Year, pp.

Series:

Technical Report, Department of Computer Science, University of Liverpool.

Volume:

ULCS-07-018

Number:


Month:


Pages:

1

Year*:

2007

VG Wort Pages:

1

ISBN/ISSN:


Sequence Number:


DOI:




Note, Abstract, ©

Note:

the full paper appeared in the proceedings of FroCos 2007

(LaTeX) Abstract:

Many problems in computer science can be reduced to proving the satisfiability of conjunctions of literals w.r.t. a background theory. This theory can be a concrete theory (e.g. the theory of real or rational numbers), the extension of a theory with additional functions (free, monotone, or recursively defined) or a combination of theories. It is therefore very important to have efficient procedures for checking the satisfiability of conjunctions of ground literals in such theories.

We here give an overview of results on hierarchical and modular reasoning in complex theories. We show that for a special type of extensions of a base theory, which we call local, hierarchic reasoning is possible (i.e. proof tasks in the extension can be hierarchically reduced to proof tasks w.r.t. the base theory). Many theories important for computer science or mathematics fall into this class (typical examples are theories of data structures, theories of free or monotone functions, but also functions occurring in mathematical analysis).

In fact, it is often necessary to consider complex extensions, in which various types of functions or data structures need to be taken into account at the same time. We show how such local theory extensions can be identified and under which conditions locality is preserved when combining theories, and we investigate possibilities of efficient modular reasoning in such theory combinations.
We present several examples of application domains where such theories occur in a natural way. We show, in particular, that various phenomena analyzed in the verification literature can be explained in a unified way using the notion of locality.

URL for the Abstract:

http://www.csc.liv.ac.uk/~ftp07/abstracts.html



Download
Access Level:

Public

Correlation

MPG Unit:

Max-Planck-Institut für Informatik



MPG Subunit:

Automation of Logic

Audience:

experts only

Appearance:

MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat, VG Wort



BibTeX Entry:

@INPROCEEDINGS{Sofronie-Stokkermans-ftp07-abstract,
AUTHOR = {Sofronie-Stokkermans, Viorica},
EDITOR = {Ranise, Silvio},
TITLE = {Hierarchical and modular reasoning in complex theories: The case of local theory extensions.},
BOOKTITLE = {Proceedings of the Sixth International Workshop on First-Order Theorem Proving (FTP 2007)},
PUBLISHER = {University of Liverpool},
YEAR = {2007},
TYPE = {Abstract},
VOLUME = {ULCS-07-018},
PAGES = {1},
SERIES = {Technical Report, Department of Computer Science, University of Liverpool.},
ADDRESS = {Liverpool, UK},
NOTE = {the full paper appeared in the proceedings of FroCos 2007},
}


Entry last modified by Viorica Sofronie-Stokkermans, 02/28/2008
Show details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

Editor(s)
Viorica Sofronie-Stokkermans
Created
09/20/2007 02:12:06 PM
Revisions
3.
2.
1.
0.
Editor(s)
Viorica Sofronie-Stokkermans
Viorica Sofronie-Stokkermans
Viorica Sofronie-Stokkermans
Viorica Sofronie-Stokkermans
Edit Dates
01/11/2008 12:46:17 PM
01/11/2008 12:45:57 PM
01/10/2008 02:05:14 PM
09/20/2007 02:12:06 PM
Show details for Attachment SectionAttachment Section
Hide details for Attachment SectionAttachment Section