English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 Local TagsRelease HistoryDetailsSummary
  Automatic Generation of Invariants for Circular Derivations in SUP(LA) 1

Fietzke, A., Kruglov, E., & Weidenbach, C.(2012). Automatic Generation of Invariants for Circular Derivations in SUP(LA) 1 (MPI-I-2012-RG1-002). Saarbrücken: Max-Planck-Institut für Informatik.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0024-03CF-9 Version Permalink: https://hdl.handle.net/21.11116/0000-000E-337A-0
Genre: Report
Latex : Automatic Generation of Invariants for Circular Derivations in {SUP(LA)} 1

Files

show Files
hide Files
:
MPI_I_2012_RG1-002.pdf (Any fulltext), 202KB
View   Save
File Permalink:
https://hdl.handle.net/11858/00-001M-0000-0024-03D1-1
Name:
MPI_I_2012_RG1-002.pdf
Description:
-
OA-Status:
Visibility:
Public
MIME-Type / Checksum:
application/pdf / [MD5]
Technical Metadata:
View
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show

Creators

show
hide
 Creators:
Fietzke, Arnaud1, Author           
Kruglov, Evgeny1, Author           
Weidenbach, Christoph1, Author                 
Affiliations:
1Automation of Logic, MPI for Informatics, Max Planck Society, ou_1116545              

Content

show
hide
Free keywords: -
 Abstract: The hierarchic combination of linear arithmetic and firstorder logic with free function symbols, FOL(LA), results in a strictly more expressive logic than its two parts. The SUP(LA) calculus can be turned into a decision procedure for interesting fragments of FOL(LA). For example, reachability problems for timed automata can be decided by SUP(LA) using an appropriate translation into FOL(LA). In this paper, we extend the SUP(LA) calculus with an additional inference rule, automatically generating inductive invariants from partial SUP(LA) derivations. The rule enables decidability of more expressive fragments, including reachability for timed automata with unbounded integer variables. We have implemented the rule in the SPASS(LA) theorem prover with promising results, showing that it can considerably speed up proof search and enable termination of saturation for practically relevant problems.

Details

show
hide
Language(s): eng - English
 Dates: 2012
 Publication Status: Published online
 Pages: 26 p.
 Publishing info: Saarbrücken : Max-Planck-Institut für Informatik
 Table of Contents: -
 Rev. Type: -
 Identifiers: BibTex Citekey: FietzkeKruglovWeidenbach2012
Report Nr.: MPI-I-2012-RG1-002
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Research Report
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: - Identifier: ISSN: 0946-011X