# Publications

2019

Blanchette, J. C., Gheri, L., Popescu, A., & Traytel, D. (2019). Bindings as Bounded Natural Functors.

*Proceedings of the ACM on Programming Languages (Proc. POPL 2019)*,*3*. doi:10.1145/3290335Export

BibTeX

@article{Blanchette_POPL2019,
TITLE = {Bindings as Bounded Natural Functors},
AUTHOR = {Blanchette, Jasmin Christian and Gheri, Lorenzo and Popescu, Andrei and Traytel, Dmitriy},
LANGUAGE = {eng},
ISSN = {2475-1421},
DOI = {10.1145/3290335},
PUBLISHER = {ACM},
ADDRESS = {New York, NY},
YEAR = {2019},
MARGINALMARK = {$\bullet$},
JOURNAL = {Proceedings of the ACM on Programming Languages (Proc. POPL)},
VOLUME = {3},
EID = {22},
BOOKTITLE = {46th ACM SIGPLAN Symposium on Principles of Programming Languages (POPL 2019)},
}

Endnote

%0 Journal Article
%A Blanchette, Jasmin Christian
%A Gheri, Lorenzo
%A Popescu, Andrei
%A Traytel, Dmitriy
%+ Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
External Organizations
%T Bindings as Bounded Natural Functors :
%G eng
%U http://hdl.handle.net/21.11116/0000-0002-E59A-E
%R 10.1145/3290335
%7 2019
%D 2019
%J Proceedings of the ACM on Programming Languages
%O PACMPL
%V 3
%Z sequence number: 22
%I ACM
%C New York, NY
%@ false
%B 46th ACM SIGPLAN Symposium on Principles of Programming Languages
%O POPL 2019 Sun 13 - Sat 19 January 2019 Cascais, Portugal

Blanchette, J. C. (2019). Formalizing the Metatheory of Logical Calculi and Automatic Provers in Isabelle/HOL (Invited Talk). In

*CPP’19, 8th ACM SIGPLAN International Conference onCertified Programs and Proofs*. Cascais, Portugal: ACM. doi:10.1145/3293880.3294087Export

BibTeX

@inproceedings{Blanchette_CPP2019,
TITLE = {Formalizing the metatheory of logical calculi and automatic provers in {I}sabelle/{HOL} (invited talk)},
AUTHOR = {Blanchette, Jasmin Christian},
LANGUAGE = {eng},
ISBN = {978-1-4503-6222-1},
DOI = {10.1145/3293880.3294087},
PUBLISHER = {ACM},
YEAR = {2019},
MARGINALMARK = {$\bullet$},
DATE = {2019},
BOOKTITLE = {CPP'19, 8th ACM SIGPLAN International Conference onCertified Programs and Proofs},
EDITOR = {Mahboubi, Assia and Myreen, Magnus O.},
PAGES = {1--13},
ADDRESS = {Cascais, Portugal},
}

Endnote

%0 Conference Proceedings
%A Blanchette, Jasmin Christian
%+ Automation of Logic, MPI for Informatics, Max Planck Society
%T Formalizing the Metatheory of Logical Calculi and Automatic Provers in Isabelle/HOL (Invited Talk) :
%G eng
%U http://hdl.handle.net/21.11116/0000-0002-E5A0-6
%R 10.1145/3293880.3294087
%D 2019
%B 8th ACM SIGPLAN International Conference onCertified Programs and Proofs
%Z date of event: 2019-01-14 - 2019-01-15
%C Cascais, Portugal
%B CPP'19
%E Mahboubi, Assia; Myreen, Magnus O.
%P 1 - 13
%I ACM
%@ 978-1-4503-6222-1

Bradford, R., Davenport, J. H., England, M., Errami, H., Gerdt, V., Grigoriev, D., … Weber, A. (n.d.). Identifying the Parametric Occurrence of Multiple Steady States for some Biological Networks.

(Accepted/in press) *Journal of Symbolic Computation*.Export

BibTeX

@article{BradfordDavenport:19a,
TITLE = {Identifying the Parametric Occurrence of Multiple Steady States for some Biological Networks},
AUTHOR = {Bradford, Russell and Davenport, James H. and England, Matthew and Errami, Hassan and Gerdt, Vladimir and Grigoriev, Dima and Hoyt, Charles and Ko{\v s}ta, Marek and Radulescu, Ovidiu and Sturm, Thomas and Weber, Andreas},
LANGUAGE = {eng},
ISSN = {0747-7171},
PUBLISHER = {Academic Press},
ADDRESS = {London},
YEAR = {2019},
PUBLREMARK = {Accepted},
MARGINALMARK = {$\bullet$},
JOURNAL = {Journal of Symbolic Computation},
}

Endnote

%0 Journal Article
%A Bradford, Russell
%A Davenport, James H.
%A England, Matthew
%A Errami, Hassan
%A Gerdt, Vladimir
%A Grigoriev, Dima
%A Hoyt, Charles
%A Košta, Marek
%A Radulescu, Ovidiu
%A Sturm, Thomas
%A Weber, Andreas
%+ External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
%T Identifying the Parametric Occurrence of Multiple Steady States for some Biological Networks :
%G eng
%U http://hdl.handle.net/21.11116/0000-0002-F04B-B
%D 2019
%J Journal of Symbolic Computation
%I Academic Press
%C London
%@ false

Bradford, R., Davenport, J. H., England, M., Errami, H., Gerdt, V., Grigoriev, D., … Weber, A. (2019). Identifying the Parametric Occurrence of Multiple Steady States for some Biological Networks. Retrieved from http://arxiv.org/abs/1902.04882

(arXiv: 1902.04882) Abstract

We consider a problem from biological network analysis of determining regions
in a parameter space over which there are multiple steady states for positive
real values of variables and parameters. We describe multiple approaches to
address the problem using tools from Symbolic Computation. We describe how
progress was made to achieve semi-algebraic descriptions of the
multistationarity regions of parameter space, and compare symbolic results to
numerical methods. The biological networks studied are models of the
mitogen-activated protein kinases (MAPK) network which has already consumed
considerable effort using special insights into its structure of corresponding
models. Our main example is a model with 11 equations in 11 variables and 19
parameters, 3 of which are of interest for symbolic treatment. The model also
imposes positivity conditions on all variables and parameters.
We apply combinations of symbolic computation methods designed for mixed
equality/inequality systems, specifically virtual substitution, lazy real
triangularization and cylindrical algebraic decomposition, as well as a
simplification technique adapted from Gaussian elimination and graph theory. We
are able to determine multistationarity of our main example over a
2-dimensional parameter space. We also study a second MAPK model and a symbolic
grid sampling technique which can locate such regions in 3-dimensional
parameter space.

Export

BibTeX

@online{Bradford_arXiv1902.04882,
TITLE = {Identifying the Parametric Occurrence of Multiple Steady States for some Biological Networks},
AUTHOR = {Bradford, Russell and Davenport, James H. and England, Matthew and Errami, Hassan and Gerdt, Vladimir and Grigoriev, Dima and Hoyt, Charles and Ko{\v s}ta, Marek and Radulescu, Ovidiu and Sturm, Thomas and Weber, Andreas},
LANGUAGE = {eng},
URL = {http://arxiv.org/abs/1902.04882},
EPRINT = {1902.04882},
EPRINTTYPE = {arXiv},
YEAR = {2019},
MARGINALMARK = {$\bullet$},
ABSTRACT = {We consider a problem from biological network analysis of determining regions in a parameter space over which there are multiple steady states for positive real values of variables and parameters. We describe multiple approaches to address the problem using tools from Symbolic Computation. We describe how progress was made to achieve semi-algebraic descriptions of the multistationarity regions of parameter space, and compare symbolic results to numerical methods. The biological networks studied are models of the mitogen-activated protein kinases (MAPK) network which has already consumed considerable effort using special insights into its structure of corresponding models. Our main example is a model with 11 equations in 11 variables and 19 parameters, 3 of which are of interest for symbolic treatment. The model also imposes positivity conditions on all variables and parameters. We apply combinations of symbolic computation methods designed for mixed equality/inequality systems, specifically virtual substitution, lazy real triangularization and cylindrical algebraic decomposition, as well as a simplification technique adapted from Gaussian elimination and graph theory. We are able to determine multistationarity of our main example over a 2-dimensional parameter space. We also study a second MAPK model and a symbolic grid sampling technique which can locate such regions in 3-dimensional parameter space.},
}

Endnote

%0 Report
%A Bradford, Russell
%A Davenport, James H.
%A England, Matthew
%A Errami, Hassan
%A Gerdt, Vladimir
%A Grigoriev, Dima
%A Hoyt, Charles
%A Košta, Marek
%A Radulescu, Ovidiu
%A Sturm, Thomas
%A Weber, Andreas
%+ External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
%T Identifying the Parametric Occurrence of Multiple Steady States for some
Biological Networks :
%G eng
%U http://hdl.handle.net/21.11116/0000-0002-FF3C-D
%U http://arxiv.org/abs/1902.04882
%D 2019
%X We consider a problem from biological network analysis of determining regions
in a parameter space over which there are multiple steady states for positive
real values of variables and parameters. We describe multiple approaches to
address the problem using tools from Symbolic Computation. We describe how
progress was made to achieve semi-algebraic descriptions of the
multistationarity regions of parameter space, and compare symbolic results to
numerical methods. The biological networks studied are models of the
mitogen-activated protein kinases (MAPK) network which has already consumed
considerable effort using special insights into its structure of corresponding
models. Our main example is a model with 11 equations in 11 variables and 19
parameters, 3 of which are of interest for symbolic treatment. The model also
imposes positivity conditions on all variables and parameters.
We apply combinations of symbolic computation methods designed for mixed
equality/inequality systems, specifically virtual substitution, lazy real
triangularization and cylindrical algebraic decomposition, as well as a
simplification technique adapted from Gaussian elimination and graph theory. We
are able to determine multistationarity of our main example over a
2-dimensional parameter space. We also study a second MAPK model and a symbolic
grid sampling technique which can locate such regions in 3-dimensional
parameter space.
%K Computer Science, Symbolic Computation, cs.SC

Schlichtkrull, A., Blanchette, J. C., & Traytel, D. (2019). A Verified Prover Based on Ordered Resolution. In

*CPP’19, 8th ACM SIGPLAN International Conference onCertified Programs and Proofs*. Cascais, Portugal: ACM. doi:10.1145/3293880.3294100Export

BibTeX

@inproceedings{Schlichtkrull_CPP2019,
TITLE = {A Verified Prover Based on Ordered Resolution},
AUTHOR = {Schlichtkrull, Anders and Blanchette, Jasmin Christian and Traytel, Dmitriy},
LANGUAGE = {eng},
ISBN = {978-1-4503-6222-1},
DOI = {10.1145/3293880.3294100},
PUBLISHER = {ACM},
YEAR = {2019},
MARGINALMARK = {$\bullet$},
DATE = {2019},
BOOKTITLE = {CPP'19, 8th ACM SIGPLAN International Conference onCertified Programs and Proofs},
EDITOR = {Mahboubi, Assia and Myreen, Magnus O.},
PAGES = {152--165},
ADDRESS = {Cascais, Portugal},
}

Endnote

%0 Conference Proceedings
%A Schlichtkrull, Anders
%A Blanchette, Jasmin Christian
%A Traytel, Dmitriy
%+ External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
%T A Verified Prover Based on Ordered Resolution :
%G eng
%U http://hdl.handle.net/21.11116/0000-0002-E59E-A
%R 10.1145/3293880.3294100
%D 2019
%B 8th ACM SIGPLAN International Conference onCertified Programs and Proofs
%Z date of event: 2019-01-14 - 2019-01-15
%C Cascais, Portugal
%B CPP'19
%E Mahboubi, Assia; Myreen, Magnus O.
%P 152 - 165
%I ACM
%@ 978-1-4503-6222-1

Tourret, S., & Cropper, A. (n.d.). SLD-Resolution Reduction of Second-Order Horn Fragments. In

(Accepted/in press) *16th edition of the European Conference on Logics in Artificial Intelligence (JELIA 2019)*. Rende, Italy: Springer.Export

BibTeX

@inproceedings{Tourret_JELIA2019,
TITLE = {{SLD}-Resolution Reduction of Second-Order {H}orn Fragments},
AUTHOR = {Tourret, Sophie and Cropper, Andrew},
LANGUAGE = {eng},
PUBLISHER = {Springer},
YEAR = {2019},
PUBLREMARK = {Accepted},
MARGINALMARK = {$\bullet$},
BOOKTITLE = {16th edition of the European Conference on Logics in Artificial Intelligence (JELIA 2019)},
SERIES = {Lecture Notes in Computer Science},
ADDRESS = {Rende, Italy},
}

Endnote

%0 Conference Proceedings
%A Tourret, Sophie
%A Cropper, Andrew
%+ Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
%T SLD-Resolution Reduction of Second-Order Horn Fragments :
%G eng
%U http://hdl.handle.net/21.11116/0000-0002-D2B3-6
%D 2019
%B 16th European Conference on Logics in Artificial Intelligence
%Z date of event: 2019-05-08 - 2019-05-10
%C Rende, Italy
%B 16th edition of the European Conference on Logics in Artificial Intelligence
%I Springer
%B Lecture Notes in Computer Science

2018

Azmy, N., Merz, S., & Weidenbach, C. (2018). A Machine-checked Correctness Proof for Pastry.

*Science of Computer Programming*,*158*. doi:10.1016/j.scico.2017.08.003Export

BibTeX

@article{Azmy2018,
TITLE = {A machine-checked correctness proof for {Pastry}},
AUTHOR = {Azmy, Noran and Merz, Stephan and Weidenbach, Christoph},
LANGUAGE = {eng},
ISSN = {0167-6423},
DOI = {10.1016/j.scico.2017.08.003},
PUBLISHER = {Elsevier},
ADDRESS = {Amsterdam},
YEAR = {2018},
MARGINALMARK = {$\bullet$},
DATE = {2018},
JOURNAL = {Science of Computer Programming},
VOLUME = {158},
PAGES = {64--80},
}

Endnote

%0 Journal Article
%A Azmy, Noran
%A Merz, Stephan
%A Weidenbach, Christoph
%+ Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
%T A Machine-checked Correctness Proof for Pastry :
%G eng
%U http://hdl.handle.net/21.11116/0000-0001-4F95-F
%R 10.1016/j.scico.2017.08.003
%7 2017
%D 2018
%J Science of Computer Programming
%V 158
%& 64
%P 64 - 80
%I Elsevier
%C Amsterdam
%@ false

Bentkamp, A., Blanchette, J. C., Cruanes, S., & Waldmann, U. (2018). Superposition for Lambda-Free Higher-Order Logic. In

*Automated Reasoning (IJCAR 2018)*. Oxford, UK: Springer. doi:10.1007/978-3-319-94205-6_3Export

BibTeX

@inproceedings{Bentkamp_IJCAR2018,
TITLE = {Superposition for Lambda-Free Higher-Order Logic},
AUTHOR = {Bentkamp, Alexander and Blanchette, Jasmin Christian and Cruanes, Simon and Waldmann, Uwe},
LANGUAGE = {eng},
ISBN = {978-3-319-94204-9},
DOI = {10.1007/978-3-319-94205-6_3},
PUBLISHER = {Springer},
YEAR = {2018},
MARGINALMARK = {$\bullet$},
DATE = {2018},
BOOKTITLE = {Automated Reasoning (IJCAR 2018)},
EDITOR = {Galmiche, Didier and Schulz, Stephan and Sebastiani, Roberto},
PAGES = {28--46},
SERIES = {Lecture Notes in Artificial Intelligence},
VOLUME = {10900},
ADDRESS = {Oxford, UK},
}

Endnote

%0 Conference Proceedings
%A Bentkamp, Alexander
%A Blanchette, Jasmin Christian
%A Cruanes, Simon
%A Waldmann, Uwe
%+ External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
%T Superposition for Lambda-Free Higher-Order Logic :
%G eng
%U http://hdl.handle.net/21.11116/0000-0002-5F3A-4
%R 10.1007/978-3-319-94205-6_3
%D 2018
%B 9th International Joint Conference on Automated Reasoning
%Z date of event: 2018-07-14 - 2018-07-17
%C Oxford, UK
%B Automated Reasoning
%E Galmiche, Didier; Schulz, Stephan; Sebastiani, Roberto
%P 28 - 46
%I Springer
%@ 978-3-319-94204-9
%B Lecture Notes in Artificial Intelligence
%N 10900

Blanchette, J. C., Fleury, M., Lammich, P., & Weidenbach, C. (2018). A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality.

*Journal of Automated Reasoning*,*61*(1-4). doi:10.1007/s10817-018-9455-7Export

BibTeX

@article{Blanchette2018,
TITLE = {A Verified {SAT} Solver Framework with Learn, Forget, Restart, and Incrementality},
AUTHOR = {Blanchette, Jasmin Christian and Fleury, Mathias and Lammich, Peter and Weidenbach, Christoph},
LANGUAGE = {eng},
ISSN = {0168-7433},
DOI = {10.1007/s10817-018-9455-7},
PUBLISHER = {Springer},
ADDRESS = {New York, NY},
YEAR = {2018},
MARGINALMARK = {$\bullet$},
DATE = {2018},
JOURNAL = {Journal of Automated Reasoning},
VOLUME = {61},
NUMBER = {1-4},
PAGES = {333--365},
}

Endnote

%0 Journal Article
%A Blanchette, Jasmin Christian
%A Fleury, Mathias
%A Lammich, Peter
%A Weidenbach, Christoph
%+ Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
%T A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality
:
%G eng
%U http://hdl.handle.net/21.11116/0000-0001-7ADB-0
%R 10.1007/s10817-018-9455-7
%7 2018
%D 2018
%J Journal of Automated Reasoning
%V 61
%N 1-4
%& 333
%P 333 - 365
%I Springer
%C New York, NY
%@ false

Blanchette, J. C., Peltier, N., & Robillard, S. (2018). Superposition with Datatypes and Codatatypes. In

*Automated Reasoning (IJCAR 2018)*. Oxford, UK: Springer. doi:10.1007/978-3-319-94205-6_25Export

BibTeX

@inproceedings{Blanchette_IJCAR2018,
TITLE = {Superposition with Datatypes and Codatatypes},
AUTHOR = {Blanchette, Jasmin Christian and Peltier, Nicolas and Robillard, Simon},
LANGUAGE = {eng},
ISBN = {978-3-319-94204-9},
DOI = {10.1007/978-3-319-94205-6_25},
PUBLISHER = {Springer},
YEAR = {2018},
MARGINALMARK = {$\bullet$},
DATE = {2018},
BOOKTITLE = {Automated Reasoning (IJCAR 2018)},
EDITOR = {Galmiche, Didier and Schulz, Stephan and Sebastiani, Roberto},
PAGES = {370--387},
SERIES = {Lecture Notes in Artificial Intelligence},
VOLUME = {10900},
ADDRESS = {Oxford, UK},
}

Endnote

%0 Conference Proceedings
%A Blanchette, Jasmin Christian
%A Peltier, Nicolas
%A Robillard, Simon
%+ Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T Superposition with Datatypes and Codatatypes :
%G eng
%U http://hdl.handle.net/21.11116/0000-0002-5F40-C
%R 10.1007/978-3-319-94205-6_25
%D 2018
%B 9th International Joint Conference on Automated Reasoning
%Z date of event: 2018-07-14 - 2018-07-17
%C Oxford, UK
%B Automated Reasoning
%E Galmiche, Didier; Schulz, Stephan; Sebastiani, Roberto
%P 370 - 387
%I Springer
%@ 978-3-319-94204-9
%B Lecture Notes in Artificial Intelligence
%N 10900

Boulier, F., Fages, F., Radulescu, O., Samal, S. S., Schuppert, A., Seiler, W., … Weber, A. (2018a). The SYMBIONT Project: Symbolic Methods for Biological Networks.

*Faculty of 1000 Research*,*7*. doi:10.7490/f1000research.1115995.1Export

BibTeX

@article{Boulier_2018,
TITLE = {The {SYMBIONT} Project: {S}ymbolic Methods for Biological Networks},
AUTHOR = {Boulier, Fran{\c c}ois and Fages, Fran{\c c}ois and Radulescu, Ovidiu and Samal, Satya Swarup and Schuppert, Andreas and Seiler, Werner and Sturm, Thomas and Walcher, Sebastian and Weber, Andreas},
LANGUAGE = {eng},
ISSN = {2046-1402},
DOI = {10.7490/f1000research.1115995.1},
PUBLISHER = {BioMed Central},
ADDRESS = {London},
YEAR = {2018},
MARGINALMARK = {$\bullet$},
JOURNAL = {Faculty of 1000 Research},
VOLUME = {7},
EID = {1341},
}

Endnote

%0 Journal Article
%A Boulier, François
%A Fages, François
%A Radulescu, Ovidiu
%A Samal, Satya Swarup
%A Schuppert, Andreas
%A Seiler, Werner
%A Sturm, Thomas
%A Walcher, Sebastian
%A Weber, Andreas
%+ External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T The SYMBIONT Project: Symbolic Methods for Biological Networks :
%G eng
%U http://hdl.handle.net/21.11116/0000-0002-E8C2-D
%R 10.7490/f1000research.1115995.1
%7 2018
%D 2018
%J Faculty of 1000 Research
%O F1000Research
%V 7
%Z sequence number: 1341
%I BioMed Central
%C London
%@ false
%U https://doi.org/10.7490/f1000research.1115995.1

Boulier, F., Fages, F., Radulescu, O., Samal, S. S., Schuppert, A., Seiler, W., … Weber, A. (2018b). The SYMBIONT Project: Symbolic Methods for Biological Networks.

*ACM Communications in Computer Algebra*,*52*(3). doi:10.1145/3313880.3313885Export

BibTeX

@article{BoulierFages:18a,
TITLE = {The {SYMBIONT} Project: {S}ymbolic Methods for Biological Networks},
AUTHOR = {Boulier, Fran{\c c}ois and Fages, Fran{\c c}ois and Radulescu, Ovidiu and Samal, Satya Swarup and Schuppert, Andreas and Seiler, Werner and Sturm, Thomas and Walcher, Sebastian and Weber, Andreas},
LANGUAGE = {eng},
ISSN = {1932-2240},
DOI = {10.1145/3313880.3313885},
PUBLISHER = {ACM},
ADDRESS = {New York, NY},
YEAR = {2018},
MARGINALMARK = {$\bullet$},
JOURNAL = {ACM Communications in Computer Algebra},
VOLUME = {52},
NUMBER = {3},
PAGES = {67--70},
}

Endnote

%0 Journal Article
%A Boulier, François
%A Fages, François
%A Radulescu, Ovidiu
%A Samal, Satya Swarup
%A Schuppert, Andreas
%A Seiler, Werner
%A Sturm, Thomas
%A Walcher, Sebastian
%A Weber, Andreas
%+ External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T The SYMBIONT Project: Symbolic Methods for Biological Networks :
%G eng
%U http://hdl.handle.net/21.11116/0000-0002-F07D-3
%R 10.1145/3313880.3313885
%7 2018
%D 2018
%J ACM Communications in Computer Algebra
%V 52
%N 3
%& 67
%P 67 - 70
%I ACM
%C New York, NY
%@ false

Bromberger, M. (2018). A Reduction from Unbounded Linear Mixed Arithmetic Problems into Bounded Problems. In

*Automated Reasoning (IJCAR 2018)*. Oxford, UK: Springer. doi:10.1007/978-3-319-94205-6_22Export

BibTeX

@inproceedings{Bromberger18,
TITLE = {A Reduction from Unbounded Linear Mixed Arithmetic Problems into Bounded Problems},
AUTHOR = {Bromberger, Martin},
LANGUAGE = {eng},
ISBN = {978-3-319-94204-9},
DOI = {10.1007/978-3-319-94205-6_22},
PUBLISHER = {Springer},
YEAR = {2018},
MARGINALMARK = {$\bullet$},
DATE = {2018},
BOOKTITLE = {Automated Reasoning (IJCAR 2018)},
EDITOR = {Galmiche, Didier and Schulz, Stephan and Sebastiani, Roberto},
PAGES = {329--345},
SERIES = {Lecture Notes in Artificial Intelligence},
VOLUME = {10900},
ADDRESS = {Oxford, UK},
}

Endnote

%0 Conference Proceedings
%A Bromberger, Martin
%+ Automation of Logic, MPI for Informatics, Max Planck Society
%T A Reduction from Unbounded Linear Mixed Arithmetic Problems into Bounded Problems :
%G eng
%U http://hdl.handle.net/21.11116/0000-0002-94C1-C
%R 10.1007/978-3-319-94205-6_22
%D 2018
%B 9th International Joint Conference on Automated Reasoning
%Z date of event: 2018-07-14 - 2018-07-17
%C Oxford, UK
%B Automated Reasoning
%E Galmiche, Didier; Schulz, Stephan; Sebastiani, Roberto
%P 329 - 345
%I Springer
%@ 978-3-319-94204-9
%B Lecture Notes in Artificial Intelligence
%N 10900

Cropper, A., & Tourret, S. (2018). Derivation Reduction of Metarules in Meta-interpretive Learning. In

*Inductive Logic Programming (ILP 2018)*. Ferrara, Italy: Springer. doi:10.1007/978-3-319-99960-9_1Export

BibTeX

@inproceedings{Cropper_ILP2018,
TITLE = {Derivation Reduction of Metarules in Meta-interpretive Learning},
AUTHOR = {Cropper, Andrew and Tourret, Sophie},
LANGUAGE = {eng},
ISBN = {978-3-319-99959-3; 978-3-319-99960-9},
DOI = {10.1007/978-3-319-99960-9_1},
PUBLISHER = {Springer},
YEAR = {2018},
MARGINALMARK = {$\bullet$},
DATE = {2018},
BOOKTITLE = {Inductive Logic Programming (ILP 2018)},
EDITOR = {Riguzi, Fabrizio and Bellodi, Elena and Zese, Riccardo},
PAGES = {1--21},
SERIES = {Lecture Notes in Artificial Intelligence},
VOLUME = {11105},
ADDRESS = {Ferrara, Italy},
}

Endnote

%0 Conference Proceedings
%A Cropper, Andrew
%A Tourret, Sophie
%+ External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
%T Derivation Reduction of Metarules in Meta-interpretive Learning :
%G eng
%U http://hdl.handle.net/21.11116/0000-0002-A2B9-6
%R 10.1007/978-3-319-99960-9_1
%D 2018
%B 28th International Conference on Inductive Logic Programming
%Z date of event: 2018-09-02 - 2018-09-04
%C Ferrara, Italy
%B Inductive Logic Programming
%E Riguzi, Fabrizio; Bellodi, Elena; Zese, Riccardo
%P 1 - 21
%I Springer
%@ 978-3-319-99959-3 978-3-319-99960-9
%B Lecture Notes in Artificial Intelligence
%N 11105

Echenim, M., Peltier, N., & Tourret, S. (2018). Prime Implicate Generation in Equational Logic. In

*Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence (IJCAI 2018)*. Stockholm, Sweden: IJCAI. doi:10.24963/ijcai.2018/790Export

BibTeX

@inproceedings{EchenimIJCAI2018,
TITLE = {Prime Implicate Generation in Equational Logic},
AUTHOR = {Echenim, Mnacho and Peltier, Nicolas and Tourret, Sophie},
LANGUAGE = {eng},
ISBN = {978-0-9992411-2-7},
DOI = {10.24963/ijcai.2018/790},
PUBLISHER = {IJCAI},
YEAR = {2018},
MARGINALMARK = {$\bullet$},
BOOKTITLE = {Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence (IJCAI 2018)},
EDITOR = {Lang, J{\'e}r{\^o}me},
PAGES = {5588--5592},
ADDRESS = {Stockholm, Sweden},
}

Endnote

%0 Conference Proceedings
%A Echenim, Mnacho
%A Peltier, Nicolas
%A Tourret, Sophie
%+ External Organizations
External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
%T Prime Implicate Generation in Equational Logic :
%G eng
%U http://hdl.handle.net/21.11116/0000-0002-A2B1-E
%R 10.24963/ijcai.2018/790
%D 2018
%B 27th International Joint Conference on Artificial Intelligence and the 23rd European Conference on Artificial Intelligence
%Z date of event: 2018-07-13 - 2018-07-19
%C Stockholm, Sweden
%B Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence
%E Lang, Jérôme
%P 5588 - 5592
%I IJCAI
%@ 978-0-9992411-2-7

Fleury, M., Blanchette, J. C., & Lammich, P. (2018). A Verified SAT Solver with Watched Literals using Imperative HOL. In

*CPP’18, 7th ACM SIGPLAN International Conference on Certified Programs and Proofs*. Los Angeles, CA, USA: ACM. doi:10.1145/3167080Export

BibTeX

@inproceedings{FleuryCPP2018,
TITLE = {A verified {SAT} solver with watched literals using imperative {HOL}},
AUTHOR = {Fleury, Mathias and Blanchette, Jasmin Christian and Lammich, Peter},
LANGUAGE = {eng},
ISBN = {978-1-4503-5586-5},
DOI = {10.1145/3167080},
PUBLISHER = {ACM},
YEAR = {2018},
MARGINALMARK = {$\bullet$},
DATE = {2018},
BOOKTITLE = {CPP'18, 7th ACM SIGPLAN International Conference on Certified Programs and Proofs},
EDITOR = {Andronick, June and Felty, Amy},
PAGES = {158--171},
ADDRESS = {Los Angeles, CA, USA},
}

Endnote

%0 Conference Proceedings
%A Fleury, Mathias
%A Blanchette, Jasmin Christian
%A Lammich, Peter
%+ Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
%T A Verified SAT Solver with Watched Literals using Imperative HOL :
%G eng
%U http://hdl.handle.net/21.11116/0000-0001-4174-3
%R 10.1145/3167080
%D 2018
%B 7th ACM SIGPLAN International Conference on Certified Programs and Proofs
%Z date of event: 2018-01-08 - 2018-01-09
%C Los Angeles, CA, USA
%B CPP'18
%E Andronick, June; Felty, Amy
%P 158 - 171
%I ACM
%@ 978-1-4503-5586-5

Fontaine, P., Ogawa, M., Sturm, T., To, V. K., & Vu, X. T. (2018). Wrapping Computer Algebra is Surprisingly Successful for Non-Linear SMT. In

*Proceedings of the 3rd Workshop on Satisfiability Checking and Symbolic Computation co-located with Federated Logic Conference (SC-Square 2018)*. Oxford, UK: CEUR-WS. Retrieved from urn:nbn:de:0074-2189-9Export

BibTeX

@inproceedings{Fontaine_SC-Square2018,
TITLE = {Wrapping Computer Algebra is Surprisingly Successful for Non-Linear {SMT}},
AUTHOR = {Fontaine, Pascal and Ogawa, Mizuhito and Sturm, Thomas and To, Van Khanh and Vu, Xuan Tung},
LANGUAGE = {eng},
URL = {urn:nbn:de:0074-2189-9},
PUBLISHER = {CEUR-WS},
YEAR = {2018},
MARGINALMARK = {$\bullet$},
BOOKTITLE = {Proceedings of the 3rd Workshop on Satisfiability Checking and Symbolic Computation co-located with Federated Logic Conference (SC-Square 2018)},
EDITOR = {Bigatti, Anna M. and Brain, Martin},
PAGES = {110--117},
EID = {3},
SERIES = {CEUR Workshop Proceedings},
VOLUME = {2189},
ADDRESS = {Oxford, UK},
}

Endnote

%0 Conference Proceedings
%A Fontaine, Pascal
%A Ogawa, Mizuhito
%A Sturm, Thomas
%A To, Van Khanh
%A Vu, Xuan Tung
%+ External Organizations
External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T Wrapping Computer Algebra is Surprisingly Successful for Non-Linear SMT :
%G eng
%U http://hdl.handle.net/21.11116/0000-0002-E8AB-8
%D 2018
%B 3rd Workshop on Satisfiability Checking and Symbolic Computation
%Z date of event: 2018-07-11 - 2018-07-11
%C Oxford, UK
%B Proceedings of the 3rd Workshop on Satisfiability Checking and Symbolic Computation co-located with Federated Logic Conference
%E Bigatti, Anna M.; Brain, Martin
%P 110 - 117
%Z sequence number: 3
%I CEUR-WS
%B CEUR Workshop Proceedings
%N 2189
%U http://ceur-ws.org/Vol-2189/paper3.pdf

Hong, H., & Sturm, T. (2018a). Positive Solutions of Systems of Signed Parametric Polynomial Inequalities. Retrieved from http://arxiv.org/abs/1804.09705

(arXiv: 1804.09705) Abstract

We consider systems of strict multivariate polynomial inequalities over the
reals. All polynomial coefficients are parameters ranging over the reals, where
for each coefficient we prescribe its sign. We are interested in the existence
of positive real solutions of our system for all choices of coefficients
subject to our sign conditions. We give a decision procedure for the existence
of such solutions. In the positive case our procedure yields a parametric
positive solution as a rational function in the coefficients. Our framework
allows to reformulate heuristic subtropical approaches for non-parametric
systems of polynomial inequalities that have been recently used in qualitative
biological network analysis and, independently, in satisfiability modulo theory
solving. We apply our results to characterize the incompleteness of those
methods.

Export

BibTeX

@online{Hong_arXiv1804.09705,
TITLE = {Positive Solutions of Systems of Signed Parametric Polynomial Inequalities},
AUTHOR = {Hong, Hoon and Sturm, Thomas},
LANGUAGE = {eng},
URL = {http://arxiv.org/abs/1804.09705},
EPRINT = {1804.09705},
EPRINTTYPE = {arXiv},
YEAR = {2018},
MARGINALMARK = {$\bullet$},
ABSTRACT = {We consider systems of strict multivariate polynomial inequalities over the reals. All polynomial coefficients are parameters ranging over the reals, where for each coefficient we prescribe its sign. We are interested in the existence of positive real solutions of our system for all choices of coefficients subject to our sign conditions. We give a decision procedure for the existence of such solutions. In the positive case our procedure yields a parametric positive solution as a rational function in the coefficients. Our framework allows to reformulate heuristic subtropical approaches for non-parametric systems of polynomial inequalities that have been recently used in qualitative biological network analysis and, independently, in satisfiability modulo theory solving. We apply our results to characterize the incompleteness of those methods.},
}

Endnote

%0 Report
%A Hong, Hoon
%A Sturm, Thomas
%+ External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
%T Positive Solutions of Systems of Signed Parametric Polynomial
Inequalities :
%G eng
%U http://hdl.handle.net/21.11116/0000-0002-5F54-6
%U http://arxiv.org/abs/1804.09705
%D 2018
%X We consider systems of strict multivariate polynomial inequalities over the
reals. All polynomial coefficients are parameters ranging over the reals, where
for each coefficient we prescribe its sign. We are interested in the existence
of positive real solutions of our system for all choices of coefficients
subject to our sign conditions. We give a decision procedure for the existence
of such solutions. In the positive case our procedure yields a parametric
positive solution as a rational function in the coefficients. Our framework
allows to reformulate heuristic subtropical approaches for non-parametric
systems of polynomial inequalities that have been recently used in qualitative
biological network analysis and, independently, in satisfiability modulo theory
solving. We apply our results to characterize the incompleteness of those
methods.
%K Computer Science, Symbolic Computation, cs.SC,Computer Science, Logic in Computer Science, cs.LO

Hong, H., & Sturm, T. (2018b). Positive Solutions of Systems of Signed Parametric Polynomial Inequalities. In

*Computer Algebra in Scientific Computing (CASC 2018)*. Lille, France: Springer. doi:10.1007/978-3-319-99639-4_17Export

BibTeX

@inproceedings{Hong_CASC2018,
TITLE = {Positive Solutions of Systems of Signed Parametric Polynomial Inequalities},
AUTHOR = {Hong, Hoon and Sturm, Thomas},
LANGUAGE = {eng},
ISBN = {978-3-319-99638-7},
DOI = {10.1007/978-3-319-99639-4_17},
PUBLISHER = {Springer},
YEAR = {2018},
MARGINALMARK = {$\bullet$},
DATE = {2018},
BOOKTITLE = {Computer Algebra in Scientific Computing (CASC 2018)},
EDITOR = {Gerdt, Vladimir P. and Koepf, Wolfram and Seiler, Werner M. and Vorozhtsov, Evgenii V.},
PAGES = {238--253},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {11077},
ADDRESS = {Lille, France},
}

Endnote

%0 Conference Proceedings
%A Hong, Hoon
%A Sturm, Thomas
%+ External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
%T Positive Solutions of Systems of Signed Parametric Polynomial
Inequalities :
%G eng
%U http://hdl.handle.net/21.11116/0000-0002-5F60-8
%R 10.1007/978-3-319-99639-4_17
%D 2018
%B 20th International Workshop on Computer Algebra in Scientific Computing
%Z date of event: 2018-09-17 - 2018-09-21
%C Lille, France
%B Computer Algebra in Scientific Computing
%E Gerdt, Vladimir P.; Koepf, Wolfram; Seiler, Werner M.; Vorozhtsov, Evgenii V.
%P 238 - 253
%I Springer
%@ 978-3-319-99638-7
%B Lecture Notes in Computer Science
%N 11077

Schlichtkrull, A., Blanchette, J. C., Traytel, D., & Waldmann, U. (2018a). Formalization of Bachmair and Ganzinger’s Ordered Resolution Prover.

*Archive of Formal Proofs*.Export

BibTeX

@article{BlanchetteAFP2018,
TITLE = {Formalization of {B}achmair and {G}anzinger's Ordered Resolution Prover},
AUTHOR = {Schlichtkrull, Anders and Blanchette, Jasmin Christian and Traytel, Dmitriy and Waldmann, Uwe},
LANGUAGE = {eng},
ISSN = {2150-914X},
YEAR = {2018},
MARGINALMARK = {$\bullet$},
JOURNAL = {Archive of Formal Proofs},
}

Endnote

%0 Journal Article
%A Schlichtkrull, Anders
%A Blanchette, Jasmin Christian
%A Traytel, Dmitriy
%A Waldmann, Uwe
%+ External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
%T Formalization of Bachmair and Ganzinger's Ordered Resolution Prover :
%G eng
%U http://hdl.handle.net/21.11116/0000-0000-6489-5
%7 2018-01-18
%D 2018
%8 18.01.2018
%J Archive of Formal Proofs
%@ false
%U https://www.isa-afp.org/browser_info/current/AFP/Ordered_Resolution_Prover/document.pdf

Schlichtkrull, A., Blanchette, J. C., Traytel, D., & Waldmann, U. (2018b). Formalization of Bachmair and Ganzinger’s Ordered Resolution Prover. In

*Automated Reasoning (IJCAR 2018)*. Oxford, UK: Springer. doi:10.1007/978-3-319-94205-6_7Export

BibTeX

@inproceedings{Schlichtkrull_IJCAR2018,
TITLE = {Formalization of {B}achmair and {G}anzinger's Ordered Resolution Prover},
AUTHOR = {Schlichtkrull, Anders and Blanchette, Jasmin Christian and Traytel, Dmitriy and Waldmann, Uwe},
LANGUAGE = {eng},
ISBN = {978-3-319-94204-9},
DOI = {10.1007/978-3-319-94205-6_7},
PUBLISHER = {Springer},
YEAR = {2018},
MARGINALMARK = {$\bullet$},
DATE = {2018},
BOOKTITLE = {Automated Reasoning (IJCAR 2018)},
EDITOR = {Galmiche, Didier and Schulz, Stephan and Sebastiani, Roberto},
PAGES = {89--107},
SERIES = {Lecture Notes in Artificial Intelligence},
VOLUME = {10900},
ADDRESS = {Oxford, UK},
}

Endnote

%0 Conference Proceedings
%A Schlichtkrull, Anders
%A Blanchette, Jasmin Christian
%A Traytel, Dmitriy
%A Waldmann, Uwe
%+ External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
%T Formalization of Bachmair and Ganzinger's Ordered Resolution Prover :
%G eng
%U http://hdl.handle.net/21.11116/0000-0002-5F3E-0
%R 10.1007/978-3-319-94205-6_7
%D 2018
%B 9th International Joint Conference on Automated Reasoning
%Z date of event: 2018-07-14 - 2018-07-17
%C Oxford, UK
%B Automated Reasoning
%E Galmiche, Didier; Schulz, Stephan; Sebastiani, Roberto
%P 89 - 107
%I Springer
%@ 978-3-319-94204-9
%B Lecture Notes in Artificial Intelligence
%N 10900

Sturm, T. (2018). Thirty Years of Virtual Substitution: Foundations, Techniques, Applications. In

*ISSAC’18, 43rd International Symposium on Symbolic and Algebraic Computation*. New York, NY, USA: ACM. doi:10.1145/3208976.3209030Export

BibTeX

@inproceedings{Sturm_ISSAC2018,
TITLE = {Thirty Years of Virtual Substitution: Foundations, Techniques, Applications},
AUTHOR = {Sturm, Thomas},
LANGUAGE = {eng},
ISBN = {978-1-4503-5550-6},
DOI = {10.1145/3208976.3209030},
PUBLISHER = {ACM},
YEAR = {2018},
MARGINALMARK = {$\bullet$},
DATE = {2018},
BOOKTITLE = {ISSAC'18, 43rd International Symposium on Symbolic and Algebraic Computation},
EDITOR = {Arreche, Carlos},
PAGES = {11--16},
ADDRESS = {New York, NY, USA},
}

Endnote

%0 Conference Proceedings
%A Sturm, Thomas
%+ Automation of Logic, MPI for Informatics, Max Planck Society
%T Thirty Years of Virtual Substitution: Foundations, Techniques, Applications :
%G eng
%U http://hdl.handle.net/21.11116/0000-0002-E8D6-7
%R 10.1145/3208976.3209030
%D 2018
%B 43rd International Symposium on Symbolic and Algebraic Computation
%Z date of event: 2018-07-16 - 2018-07-19
%C New York, NY, USA
%B ISSAC'18
%E Arreche, Carlos
%P 11 - 16
%I ACM
%@ 978-1-4503-5550-6

Teucke, A. (2018).

*An Approximation and Refinement Approach to First-Order Automated Reasoning*. Universität des Saarlandes, Saarbrücken. Retrieved from urn:nbn:de:bsz:291-scidok-ds-271963Abstract

With the goal of lifting model-based guidance from the propositional setting to first-
order logic, I have developed an approximation theorem proving approach based on
counterexample-guided abstraction refinement. A given clause set is transformed
into a simplified form where satisfiability is decidable. This approximation extends
the signature and preserves unsatisfiability: if the simplified clause set is satisfi-
able, so is the original clause set. A resolution refutation generated by a decision
procedure on the simplified clause set can then either be lifted to a refutation in
the original clause set, or it guides a refinement excluding the previously found
unliftable refutation. This way the approach is refutationally complete.
The monadic shallow linear Horn fragment, which is the initial target of the
approximation, is well-known to be decidable. It was a long standing open prob-
lem how to extend the fragment to the non-Horn case, preserving decidability, that
would, e.g., enable to express non-determinism in protocols. I have now proven de-
cidability of the non-Horn monadic shallow linear fragment via ordered resolution.
I further extend the clause language with a new type of constraints, called
straight dismatching constraints. The extended clause language is motivated by an
improved refinement of the approximation-refinement framework. All needed oper-
ations on straight dismatching constraints take linear or linear logarithmic time in
the size of the constraint. Ordered resolution with straight dismatching constraints
is sound and complete and the monadic shallow linear fragment with straight dis-
matching constraints is decidable.
I have implemented my approach based on the SPASS theorem prover. On cer-
tain satisfiable problems, the implementation shows the ability to beat established
provers such as SPASS, iProver, and Vampire.

Export

BibTeX

@phdthesis{Teuckephd2018,
TITLE = {An Approximation and Refinement Approach to First-Order Automated Reasoning},
AUTHOR = {Teucke, Andreas},
LANGUAGE = {eng},
URL = {urn:nbn:de:bsz:291-scidok-ds-271963},
DOI = {10.22028/D291-27196},
SCHOOL = {Universit{\"a}t des Saarlandes},
ADDRESS = {Saarbr{\"u}cken},
YEAR = {2018},
MARGINALMARK = {$\bullet$},
DATE = {2018},
ABSTRACT = {With the goal of lifting model-based guidance from the propositional setting to first- order logic, I have developed an approximation theorem proving approach based on counterexample-guided abstraction refinement. A given clause set is transformed into a simplified form where satisfiability is decidable. This approximation extends the signature and preserves unsatisfiability: if the simplified clause set is satisfi- able, so is the original clause set. A resolution refutation generated by a decision procedure on the simplified clause set can then either be lifted to a refutation in the original clause set, or it guides a refinement excluding the previously found unliftable refutation. This way the approach is refutationally complete. The monadic shallow linear Horn fragment, which is the initial target of the approximation, is well-known to be decidable. It was a long standing open prob- lem how to extend the fragment to the non-Horn case, preserving decidability, that would, e.g., enable to express non-determinism in protocols. I have now proven de- cidability of the non-Horn monadic shallow linear fragment via ordered resolution. I further extend the clause language with a new type of constraints, called straight dismatching constraints. The extended clause language is motivated by an improved refinement of the approximation-refinement framework. All needed oper- ations on straight dismatching constraints take linear or linear logarithmic time in the size of the constraint. Ordered resolution with straight dismatching constraints is sound and complete and the monadic shallow linear fragment with straight dis- matching constraints is decidable. I have implemented my approach based on the SPASS theorem prover. On cer- tain satisfiable problems, the implementation shows the ability to beat established provers such as SPASS, iProver, and Vampire.},
}

Endnote

%0 Thesis
%A Teucke, Andreas
%A referee: Korovin, Konstatin
%Y Weidenbach, Christoph
%+ Automation of Logic, MPI for Informatics, Max Planck Society
International Max Planck Research School, MPI for Informatics, Max Planck Society
External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
%T An Approximation and Refinement Approach to First-Order Automated
Reasoning :
%G eng
%U http://hdl.handle.net/21.11116/0000-0001-8E49-E
%R 10.22028/D291-27196
%U urn:nbn:de:bsz:291-scidok-ds-271963
%I Universität des Saarlandes
%C Saarbrücken
%D 2018
%P XIV, 133 p.
%V phd
%9 phd
%X With the goal of lifting model-based guidance from the propositional setting to first-
order logic, I have developed an approximation theorem proving approach based on
counterexample-guided abstraction refinement. A given clause set is transformed
into a simplified form where satisfiability is decidable. This approximation extends
the signature and preserves unsatisfiability: if the simplified clause set is satisfi-
able, so is the original clause set. A resolution refutation generated by a decision
procedure on the simplified clause set can then either be lifted to a refutation in
the original clause set, or it guides a refinement excluding the previously found
unliftable refutation. This way the approach is refutationally complete.
The monadic shallow linear Horn fragment, which is the initial target of the
approximation, is well-known to be decidable. It was a long standing open prob-
lem how to extend the fragment to the non-Horn case, preserving decidability, that
would, e.g., enable to express non-determinism in protocols. I have now proven de-
cidability of the non-Horn monadic shallow linear fragment via ordered resolution.
I further extend the clause language with a new type of constraints, called
straight dismatching constraints. The extended clause language is motivated by an
improved refinement of the approximation-refinement framework. All needed oper-
ations on straight dismatching constraints take linear or linear logarithmic time in
the size of the constraint. Ordered resolution with straight dismatching constraints
is sound and complete and the monadic shallow linear fragment with straight dis-
matching constraints is decidable.
I have implemented my approach based on the SPASS theorem prover. On cer-
tain satisfiable problems, the implementation shows the ability to beat established
provers such as SPASS, iProver, and Vampire.
%U https://publikationen.sulb.uni-saarland.de/handle/20.500.11880/27069

2017

Althaus, E., Beber, B., Damm, W., Disch, S., Hagemann, W., Rakow, A., … Wirtz, B. (2017). Verification of Linear Hybrid Systems with Large Discrete State Spaces Using Counterexample-guided Abstraction Refinement.

*Science of Computer Programming*,*148*. doi:10.1016/j.scico.2017.04.010Export

BibTeX

@article{Althaus2017,
TITLE = {Verification of Linear Hybrid Systems with Large Discrete State Spaces Using Counterexample-guided Abstraction Refinement},
AUTHOR = {Althaus, Ernst and Beber, Bj{\"o}rn and Damm, Werner and Disch, Stefan and Hagemann, Willem and Rakow, Astrid and Scholl, Christoph and Waldmann, Uwe and Wirtz, Boris},
LANGUAGE = {eng},
ISSN = {0167-6423},
DOI = {10.1016/j.scico.2017.04.010},
PUBLISHER = {Elsevier},
ADDRESS = {Amsterdam},
YEAR = {2017},
MARGINALMARK = {$\bullet$},
DATE = {2017},
JOURNAL = {Science of Computer Programming},
VOLUME = {148},
PAGES = {123--160},
}

Endnote

%0 Journal Article
%A Althaus, Ernst
%A Beber, Björn
%A Damm, Werner
%A Disch, Stefan
%A Hagemann, Willem
%A Rakow, Astrid
%A Scholl, Christoph
%A Waldmann, Uwe
%A Wirtz, Boris
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
%T Verification of Linear Hybrid Systems with Large Discrete State Spaces Using Counterexample-guided Abstraction Refinement :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-002E-1C23-5
%R 10.1016/j.scico.2017.04.010
%7 2017-05-10
%D 2017
%J Science of Computer Programming
%V 148
%& 123
%P 123 - 160
%I Elsevier
%C Amsterdam
%@ false

Barbosa, H., Blanchette, J. C., Cruanes, S., El Ouraoui, D., & Fontaine, P. (2017). Language and Proofs for Higher-Order SMT (Work in Progress).

(arXiv: 1712.01486) *Electronic Proceedings in Theoretical Computer Science*,*262*. doi:10.4204/EPTCS.262.3Abstract

Satisfiability modulo theories (SMT) solvers have throughout the years been
able to cope with increasingly expressive formulas, from ground logics to full
first-order logic modulo theories. Nevertheless, higher-order logic within SMT
is still little explored. One main goal of the Matryoshka project, which
started in March 2017, is to extend the reasoning capabilities of SMT solvers
and other automatic provers beyond first-order logic. In this preliminary
report, we report on an extension of the SMT-LIB language, the standard input
format of SMT solvers, to handle higher-order constructs. We also discuss how
to augment the proof format of the SMT solver veriT to accommodate these new
constructs and the solving techniques they require.

Export

BibTeX

@article{Barbosa1712.01486,
TITLE = {Language and Proofs for Higher-Order {SMT} (Work in Progress)},
AUTHOR = {Barbosa, Haniel and Blanchette, Jasmin Christian and Cruanes, Simon and El Ouraoui, Daniel and Fontaine, Pascal},
LANGUAGE = {eng},
URL = {http://arxiv.org/abs/1712.01486},
DOI = {10.4204/EPTCS.262.3},
EPRINT = {1712.01486},
EPRINTTYPE = {arXiv},
YEAR = {2017},
MARGINALMARK = {$\bullet$},
ABSTRACT = {Satisfiability modulo theories (SMT) solvers have throughout the years been able to cope with increasingly expressive formulas, from ground logics to full first-order logic modulo theories. Nevertheless, higher-order logic within SMT is still little explored. One main goal of the Matryoshka project, which started in March 2017, is to extend the reasoning capabilities of SMT solvers and other automatic provers beyond first-order logic. In this preliminary report, we report on an extension of the SMT-LIB language, the standard input format of SMT solvers, to handle higher-order constructs. We also discuss how to augment the proof format of the SMT solver veriT to accommodate these new constructs and the solving techniques they require.},
JOURNAL = {Electronic Proceedings in Theoretical Computer Science},
VOLUME = {262},
PAGES = {15--22},
}

Endnote

%0 Journal Article
%A Barbosa, Haniel
%A Blanchette, Jasmin Christian
%A Cruanes, Simon
%A El Ouraoui, Daniel
%A Fontaine, Pascal
%+ External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
External Organizations
%T Language and Proofs for Higher-Order SMT (Work in Progress) :
%G eng
%U http://hdl.handle.net/21.11116/0000-0000-64DD-7
%R 10.4204/EPTCS.262.3
%U http://arxiv.org/abs/1712.01486
%7 2017
%D 2017
%X Satisfiability modulo theories (SMT) solvers have throughout the years been
able to cope with increasingly expressive formulas, from ground logics to full
first-order logic modulo theories. Nevertheless, higher-order logic within SMT
is still little explored. One main goal of the Matryoshka project, which
started in March 2017, is to extend the reasoning capabilities of SMT solvers
and other automatic provers beyond first-order logic. In this preliminary
report, we report on an extension of the SMT-LIB language, the standard input
format of SMT solvers, to handle higher-order constructs. We also discuss how
to augment the proof format of the SMT solver veriT to accommodate these new
constructs and the solving techniques they require.
%K Computer Science, Logic in Computer Science, cs.LO
%J Electronic Proceedings in Theoretical Computer Science
%O EPTCS
%V 262
%& 15
%P 15 - 22

Barbosa, H., Blanchette, J. C., & Fontaine, P. (2017). Scalable Fine-Grained Proofs for Formula Processing. In

*Automated Deduction -- CADE 26*. Gothenburg, Sweden: Springer. doi:10.1007/978-3-319-63046-5_25Export

BibTeX

@inproceedings{BarbosaCADE2017,
TITLE = {Scalable Fine-Grained Proofs for Formula Processing},
AUTHOR = {Barbosa, Haniel and Blanchette, Jasmin Christian and Fontaine, Pascal},
LANGUAGE = {eng},
ISBN = {978-3-319-63045-8},
DOI = {10.1007/978-3-319-63046-5_25},
PUBLISHER = {Springer},
YEAR = {2017},
MARGINALMARK = {$\bullet$},
DATE = {2017},
BOOKTITLE = {Automated Deduction -- CADE 26},
EDITOR = {de Moura, Leonardo},
PAGES = {398--412},
SERIES = {Lecture Notes in Artificial Intelligence},
VOLUME = {10395},
ADDRESS = {Gothenburg, Sweden},
}

Endnote

%0 Conference Proceedings
%A Barbosa, Haniel
%A Blanchette, Jasmin Christian
%A Fontaine, Pascal
%+ External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
%T Scalable Fine-Grained Proofs for Formula Processing :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-002E-0713-5
%R 10.1007/978-3-319-63046-5_25
%D 2017
%B 26th International Conference on Automated Deduction
%Z date of event: 2017-08-06 - 2017-08-11
%C Gothenburg, Sweden
%B Automated Deduction -- CADE 26
%E de Moura, Leonardo
%P 398 - 412
%I Springer
%@ 978-3-319-63045-8
%B Lecture Notes in Artificial Intelligence
%N 10395

Barkatou, M. A., Jaroschek, M., & Maddah, S. S. (2017). Formal Solutions of Completely Integrable Pfaffian Systems With Normal Crossings.

*Journal of Symbolic Computation*,*81*. doi:10.1016/j.jsc.2016.11.018Export

BibTeX

@article{Barkatou2017,
TITLE = {Formal Solutions of Completely Integrable {Pfaffian} Systems With Normal Crossings},
AUTHOR = {Barkatou, Moulay A. and Jaroschek, Maximilian and Maddah, Suzy S.},
LANGUAGE = {eng},
ISSN = {0747-7171},
DOI = {10.1016/j.jsc.2016.11.018},
PUBLISHER = {Elsevier},
ADDRESS = {Amsterdam},
YEAR = {2017},
MARGINALMARK = {$\bullet$},
DATE = {2017},
JOURNAL = {Journal of Symbolic Computation},
VOLUME = {81},
PAGES = {41--68},
}

Endnote

%0 Journal Article
%A Barkatou, Moulay A.
%A Jaroschek, Maximilian
%A Maddah, Suzy S.
%+ External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
%T Formal Solutions of Completely Integrable Pfaffian Systems With Normal Crossings :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-002C-6564-9
%R 10.1016/j.jsc.2016.11.018
%7 2016-11-18
%D 2017
%J Journal of Symbolic Computation
%V 81
%& 41
%P 41 - 68
%I Elsevier
%C Amsterdam
%@ false

Becker, H., Blanchette, J. C., Waldmann, U., & Wand, D. (2017). A Transfinite Knuth–Bendix Order for Lambda-Free Higher-Order Terms. In

*Automated Deduction -- CADE 26*. Gothenburg, Sweden: Springer. doi:10.1007/978-3-319-63046-5_27Export

BibTeX

@inproceedings{BeckerCADE2017,
TITLE = {A Transfinite {K}nuth--{B}endix Order for Lambda-Free Higher-Order Terms},
AUTHOR = {Becker, Heiko and Blanchette, Jasmin Christian and Waldmann, Uwe and Wand, Daniel},
LANGUAGE = {eng},
ISBN = {978-3-319-63045-8},
DOI = {10.1007/978-3-319-63046-5_27},
PUBLISHER = {Springer},
YEAR = {2017},
MARGINALMARK = {$\bullet$},
DATE = {2017},
BOOKTITLE = {Automated Deduction -- CADE 26},
EDITOR = {de Moura, Leonardo},
PAGES = {432--453},
SERIES = {Lecture Notes in Artificial Intelligence},
VOLUME = {10395},
ADDRESS = {Gothenburg, Sweden},
}

Endnote

%0 Conference Proceedings
%A Becker, Heiko
%A Blanchette, Jasmin Christian
%A Waldmann, Uwe
%A Wand, Daniel
%+ External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T A Transfinite Knuth–Bendix Order for Lambda-Free Higher-Order Terms :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-002E-0711-9
%R 10.1007/978-3-319-63046-5_27
%D 2017
%B 26th International Conference on Automated Deduction
%Z date of event: 2017-08-06 - 2017-08-11
%C Gothenburg, Sweden
%B Automated Deduction -- CADE 26
%E de Moura, Leonardo
%P 432 - 453
%I Springer
%@ 978-3-319-63045-8
%B Lecture Notes in Artificial Intelligence
%N 10395

Bentkamp, A., Blanchette, J. C., & Klakow, D. (2017). A Formal Proof of the Expressiveness of Deep Learning. In

*Interactive Theorem Proving (ITP 2017)*. Brasilia, Brazil: Springer. doi:10.1007/978-3-319-66107-0_4Export

BibTeX

@inproceedings{BentkampITP2017,
TITLE = {A Formal Proof of the Expressiveness of Deep Learning},
AUTHOR = {Bentkamp, Alexander and Blanchette, Jasmin Christian and Klakow, Dietrich},
LANGUAGE = {eng},
ISBN = {978-3-319-66106-3},
DOI = {10.1007/978-3-319-66107-0_4},
PUBLISHER = {Springer},
YEAR = {2017},
MARGINALMARK = {$\bullet$},
DATE = {2017},
BOOKTITLE = {Interactive Theorem Proving (ITP 2017)},
EDITOR = {Avala-Rinc{\'o}n, Mauricio and Mu{\~n}oz, C{\'e}sar A.},
PAGES = {46--64},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {10499},
ADDRESS = {Brasilia, Brazil},
}

Endnote

%0 Conference Proceedings
%A Bentkamp, Alexander
%A Blanchette, Jasmin Christian
%A Klakow, Dietrich
%+ External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
%T A Formal Proof of the Expressiveness of Deep Learning :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-002E-06F8-9
%R 10.1007/978-3-319-66107-0_4
%D 2017
%B 8th Conference on Interactive Theorem Proving
%Z date of event: 2017-09-26 - 2017-09-29
%C Brasilia, Brazil
%B Interactive Theorem Proving
%E Avala-Rincón, Mauricio; Muñoz, César A.
%P 46 - 64
%I Springer
%@ 978-3-319-66106-3
%B Lecture Notes in Computer Science
%N 10499

Biendarra, J., Blanchette, J. C., Bouzy, A., Desharnais, M., Fleury, M., Hölzl, J., … Traytel, D. (2017). Foundational (Co)datatypes and (Co)recursion for Higher-Order Logic. In

*Frontiers of Combining Systems (FroCoS 2017)*. Brasília, Brazil: Springer. doi:10.1007/978-3-319-66167-4_1Export

BibTeX

@inproceedings{BiendarraFroCoS2017,
TITLE = {Foundational (Co)datatypes and (Co)recursion for Higher-Order Logic},
AUTHOR = {Biendarra, Julian and Blanchette, Jasmin Christian and Bouzy, Aymeric and Desharnais, Martin and Fleury, Mathias and H{\"o}lzl, Johannes and Kun{\v c}ar, Ond{\v r}ej and Lochbihler, Andreas and Meier, Fabian and Panny, Lorenz and Popescu, Andrei and Sternagel, Christian and Thiemann, Ren{\'e} and Traytel, Dmitriy},
LANGUAGE = {eng},
ISBN = {978-3-319-66166-7},
DOI = {10.1007/978-3-319-66167-4_1},
PUBLISHER = {Springer},
YEAR = {2017},
MARGINALMARK = {$\bullet$},
DATE = {2017},
BOOKTITLE = {Frontiers of Combining Systems (FroCoS 2017)},
EDITOR = {Dixon, Clare and Finger, Marcelo},
PAGES = {3--21},
SERIES = {Lecture Notes in Artificial Intelligence},
VOLUME = {10483},
ADDRESS = {Bras{\'i}lia, Brazil},
}

Endnote

%0 Conference Proceedings
%A Biendarra, Julian
%A Blanchette, Jasmin Christian
%A Bouzy, Aymeric
%A Desharnais, Martin
%A Fleury, Mathias
%A Hölzl, Johannes
%A Kunčar, Ondřej
%A Lochbihler, Andreas
%A Meier, Fabian
%A Panny, Lorenz
%A Popescu, Andrei
%A Sternagel, Christian
%A Thiemann, René
%A Traytel, Dmitriy
%+ External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
%T Foundational (Co)datatypes and (Co)recursion for Higher-Order Logic :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-002E-070E-4
%R 10.1007/978-3-319-66167-4_1
%D 2017
%B 11th International Symposium on Frontiers of Combining Systems
%Z date of event: 2017-09-27 - 2017-09-29
%C Brasília, Brazil
%B Frontiers of Combining Systems
%E Dixon, Clare; Finger, Marcelo
%P 3 - 21
%I Springer
%@ 978-3-319-66166-7
%B Lecture Notes in Artificial Intelligence
%N 10483

Blanchette, J. C., Fleury, M., & Weidenbach, C. (2017). A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality. In

*Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence (IJCAI 2017)*. Melbourne, Australia: International Joint Conferences on Artificial Intelligence. doi:10.24963/ijcai.2017/667Export

BibTeX

@inproceedings{BlanchetteIJCAI2017,
TITLE = {A Verified {SAT} Solver Framework with Learn, Forget, Restart, and Incrementality},
AUTHOR = {Blanchette, Jasmin Christian and Fleury, Mathias and Weidenbach, Christoph},
LANGUAGE = {eng},
ISBN = {978-3-319-40228-4},
DOI = {10.24963/ijcai.2017/667},
PUBLISHER = {International Joint Conferences on Artificial Intelligence},
YEAR = {2017},
MARGINALMARK = {$\bullet$},
BOOKTITLE = {Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence (IJCAI 2017)},
EDITOR = {Sierra, Carles},
PAGES = {4786--4790},
ADDRESS = {Melbourne, Australia},
}

Endnote

%0 Conference Proceedings
%A Blanchette, Jasmin Christian
%A Fleury, Mathias
%A Weidenbach, Christoph
%+ Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-002E-0702-B
%R 10.24963/ijcai.2017/667
%D 2017
%B Twenty-Sixth International Joint Conference on Artificial Intelligence
%Z date of event: 2017-08-19 - 2017-08-25
%C Melbourne, Australia
%B Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence
%E Sierra, Carles
%P 4786 - 4790
%I International Joint Conferences on Artificial Intelligence
%@ 978-3-319-40228-4

Blanchette, J. C., Fleury, M., & Traytel, D. (2017). Nested Multisets, Hereditary Multisets, and Syntactic Ordinals in Isabelle/HOL. In

*2nd International Conference on Formal Structures for Computation and Deduction (FSCD 2017)*. Oxford, UK: Schloss Dagstuhl. doi:10.4230/LIPIcs.FSCD.2017.11Export

BibTeX

@inproceedings{BlanchetteFSCD2017,
TITLE = {Nested Multisets, Hereditary Multisets, and Syntactic Ordinals in {Isabelle}/{HOL}},
AUTHOR = {Blanchette, Jasmin Christian and Fleury, Mathias and Traytel, Dmitriy},
LANGUAGE = {eng},
ISSN = {1868-8969},
ISBN = {978-3-95977-047-7},
URL = {urn:nbn:de:0030-drops-77155},
DOI = {10.4230/LIPIcs.FSCD.2017.11},
PUBLISHER = {Schloss Dagstuhl},
YEAR = {2017},
MARGINALMARK = {$\bullet$},
BOOKTITLE = {2nd International Conference on Formal Structures for Computation and Deduction (FSCD 2017)},
EDITOR = {Miller, Dale},
PAGES = {1--18},
EID = {1},
SERIES = {Leibniz International Proceedings in Informatics},
VOLUME = {84},
ADDRESS = {Oxford, UK},
}

Endnote

%0 Conference Proceedings
%A Blanchette, Jasmin Christian
%A Fleury, Mathias
%A Traytel, Dmitriy
%+ Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
%T Nested Multisets, Hereditary Multisets, and Syntactic Ordinals in Isabelle/HOL :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-002E-06EE-1
%R 10.4230/LIPIcs.FSCD.2017.11
%U urn:nbn:de:0030-drops-77155
%D 2017
%B 2nd International Conference on Formal Structures for Computation and Deduction
%Z date of event: 2017-09-03 - 2017-09-09
%C Oxford, UK
%B 2nd International Conference on Formal Structures for Computation and Deduction
%E Miller, Dale
%P 1 - 18
%Z sequence number: 1
%I Schloss Dagstuhl
%@ 978-3-95977-047-7
%B Leibniz International Proceedings in Informatics
%N 84
%@ false
%U http://drops.dagstuhl.de/opus/volltexte/2017/7715/http://drops.dagstuhl.de/doku/urheberrecht1.html

Blanchette, J. C., Waldmann, U., & Wand, D. (2017). A Lambda-Free Higher-Order Recursive Path Order. In

*Foundations of Software Science and Computation Structures (FoSSaCS 2017)*. Uppsala, Sweden: Springer. doi:10.1007/978-3-662-54458-7_27Export

BibTeX

@inproceedings{BlanchetteFoSSaCS2017,
TITLE = {A Lambda-Free Higher-Order Recursive Path Order},
AUTHOR = {Blanchette, Jasmin Christian and Waldmann, Uwe and Wand, Daniel},
LANGUAGE = {eng},
ISBN = {978-3-662-54457-0},
DOI = {10.1007/978-3-662-54458-7_27},
PUBLISHER = {Springer},
YEAR = {2017},
MARGINALMARK = {$\bullet$},
DATE = {2017},
BOOKTITLE = {Foundations of Software Science and Computation Structures (FoSSaCS 2017)},
EDITOR = {Esparza, Javier and Murawski, Andrzej S.},
PAGES = {461--479},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {10203},
ADDRESS = {Uppsala, Sweden},
}

Endnote

%0 Conference Proceedings
%A Blanchette, Jasmin Christian
%A Waldmann, Uwe
%A Wand, Daniel
%+ Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T A Lambda-Free Higher-Order Recursive Path Order :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-002D-91BA-2
%R 10.1007/978-3-662-54458-7_27
%D 2017
%B 20th International Conference on Foundations of Software Science and Computation Structures
%Z date of event: 2017-04-24 - 2017-04-27
%C Uppsala, Sweden
%B Foundations of Software Science and Computation Structures
%E Esparza, Javier; Murawski, Andrzej S.
%P 461 - 479
%I Springer
%@ 978-3-662-54457-0
%B Lecture Notes in Computer Science
%N 10203

Blanchette, J. C., Popescu, A., & Traytel, D. (2017a). Abstract Soundness.

*Archive of Formal Proofs*.Export

BibTeX

@article{BlanchetteAFP2017,
TITLE = {Abstract Soundness},
AUTHOR = {Blanchette, Jasmin Christian and Popescu, Andrei and Traytel, Dmitriy},
LANGUAGE = {eng},
ISSN = {2150-914X},
YEAR = {2017},
MARGINALMARK = {$\bullet$},
JOURNAL = {Archive of Formal Proofs},
PAGES = {1--15},
}

Endnote

%0 Journal Article
%A Blanchette, Jasmin Christian
%A Popescu, Andrei
%A Traytel, Dmitriy
%+ Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T Abstract Soundness :
%G eng
%U http://hdl.handle.net/21.11116/0000-0000-64A8-2
%7 2017
%D 2017
%J Archive of Formal Proofs
%& 1
%P 1 - 15
%@ false
%U https://www.isa-afp.org/browser_info/current/AFP/Abstract_Soundness/document.pdf

Blanchette, J. C., Popescu, A., & Traytel, D. (2017b). Soundness and Completeness Proofs by Coinductive Methods.

*Journal of Automated Reasoning*,*58*(1). doi:10.1007/s10817-016-9391-3Export

BibTeX

@article{DBLP:journals/jar/BlanchettePT17,
TITLE = {Soundness and Completeness Proofs by Coinductive Methods},
AUTHOR = {Blanchette, Jasmin Christian and Popescu, Andrei and Traytel, Dmitriy},
LANGUAGE = {eng},
ISSN = {0168-7433},
DOI = {10.1007/s10817-016-9391-3},
PUBLISHER = {Springer},
ADDRESS = {London},
YEAR = {2017},
MARGINALMARK = {$\bullet$},
DATE = {2017},
JOURNAL = {Journal of Automated Reasoning},
VOLUME = {58},
NUMBER = {1},
PAGES = {149--179},
}

Endnote

%0 Journal Article
%A Blanchette, Jasmin Christian
%A Popescu, Andrei
%A Traytel, Dmitriy
%+ Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T Soundness and Completeness Proofs by Coinductive Methods :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-002C-3B94-0
%R 10.1007/s10817-016-9391-3
%7 2016-10-18
%D 2017
%J Journal of Automated Reasoning
%V 58
%N 1
%& 149
%P 149 - 179
%I Springer
%C London
%@ false

Blanchette, J. C., Fontaine, P., Schulz, S., & Waldmann, U. (2017). Towards Strong Higher-Order Automation for Fast Interactive Verification. In

*ARCADE 2017*. Gothenburg, Sweden. doi:10.29007/3ngxExport

BibTeX

@inproceedings{Blanchette_ARCADE2017,
TITLE = {Towards Strong Higher-Order Automation for Fast Interactive Verification},
AUTHOR = {Blanchette, Jasmin Christian and Fontaine, Pascal and Schulz, Stephan and Waldmann, Uwe},
LANGUAGE = {eng},
DOI = {10.29007/3ngx},
YEAR = {2017},
MARGINALMARK = {$\bullet$},
BOOKTITLE = {ARCADE 2017},
EDITOR = {Reger, Giles and Traytel, Dmitriy},
PAGES = {16--23},
SERIES = {EPiC Series in Computing},
VOLUME = {51},
ADDRESS = {Gothenburg, Sweden},
}

Endnote

%0 Conference Proceedings
%A Blanchette, Jasmin Christian
%A Fontaine, Pascal
%A Schulz, Stephan
%A Waldmann, Uwe
%+ Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
%T Towards Strong Higher-Order Automation for Fast Interactive Verification :
%G eng
%U http://hdl.handle.net/21.11116/0000-0000-64CF-7
%R 10.29007/3ngx
%D 2017
%B 1st International Workshop on Automated Reasoning
%Z date of event: 2017-08-06 - 2017-08-06
%C Gothenburg, Sweden
%B ARCADE 2017
%E Reger, Giles; Traytel, Dmitriy
%P 16 - 23
%B EPiC Series in Computing
%N 51

Bradford, R., Davenport, J. H., England, M., Errami, H., Gerdt, V., Grigoriev, D., … Weber, A. (2017a). A Case Study on the Parametric Occurrence of Multiple Steady States. In

*ISSAC’17, International Symposium on Symbolic and Algebraic Computation*. Kaiserslautern, Germany: ACM. doi:10.1145/3087604.3087622Export

BibTeX

@inproceedings{BradfordISSAC2017,
TITLE = {A Case Study on the Parametric Occurrence of Multiple Steady States},
AUTHOR = {Bradford, Russell and Davenport, James H. and England, Matthew and Errami, Hassan and Gerdt, Vladimir and Grigoriev, Dima and Hoyt, Charles and Ko{\v s}ta, Marek and Radulescu, Ovidiu and Sturm, Thomas and Weber, Andreas},
LANGUAGE = {eng},
ISBN = {978-1-4503-5064-8},
DOI = {10.1145/3087604.3087622},
PUBLISHER = {ACM},
YEAR = {2017},
MARGINALMARK = {$\bullet$},
DATE = {2017},
BOOKTITLE = {ISSAC{\textquoteright}17, International Symposium on Symbolic and Algebraic Computation},
PAGES = {45--52},
ADDRESS = {Kaiserslautern, Germany},
}

Endnote

%0 Conference Proceedings
%A Bradford, Russell
%A Davenport, James H.
%A England, Matthew
%A Errami, Hassan
%A Gerdt, Vladimir
%A Grigoriev, Dima
%A Hoyt, Charles
%A Košta, Marek
%A Radulescu, Ovidiu
%A Sturm, Thomas
%A Weber, Andreas
%+ External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
%T A Case Study on the Parametric Occurrence of Multiple Steady States :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-002E-07B0-1
%R 10.1145/3087604.3087622
%D 2017
%B International Symposium on Symbolic and Algebraic Computation
%Z date of event: 2017-07-25 - 2017-07-28
%C Kaiserslautern, Germany
%B ISSAC’17
%P 45 - 52
%I ACM
%@ 978-1-4503-5064-8

Bradford, R., Davenport, J. H., England, M., Errami, H., Gerdt, V., Grigoriev, D., … Weber, A. (2017b). A Case Study on the Parametric Occurrence of Multiple Steady States. Retrieved from http://arxiv.org/abs/1704.08997

(arXiv: 1704.08997) Abstract

We consider the problem of determining multiple steady states for positive
real values in models of biological networks. Investigating the potential for
these in models of the mitogen-activated protein kinases (MAPK) network has
consumed considerable effort using special insights into the structure of
corresponding models. Here we apply combinations of symbolic computation
methods for mixed equality/inequality systems, specifically virtual
substitution, lazy real triangularization and cylindrical algebraic
decomposition. We determine multistationarity of an 11-dimensional MAPK network
when numeric values are known for all but potentially one parameter. More
precisely, our considered model has 11 equations in 11 variables and 19
parameters, 3 of which are of interest for symbolic treatment, and furthermore
positivity conditions on all variables and parameters.

Export

BibTeX

@online{DBLP:journals/corr/BradfordDEEGGHK17,
TITLE = {A Case Study on the Parametric Occurrence of Multiple Steady States},
AUTHOR = {Bradford, Russell and Davenport, James H. and England, Matthew and Errami, Hassan and Gerdt, Vladimir and Grigoriev, Dima and Hoyt, Charles and Ko{\v s}ta, Marek and Radulescu, Ovidiu and Sturm, Thomas and Weber, Andreas},
LANGUAGE = {eng},
URL = {http://arxiv.org/abs/1704.08997},
EPRINT = {1704.08997},
EPRINTTYPE = {arXiv},
YEAR = {2017},
MARGINALMARK = {$\bullet$},
ABSTRACT = {We consider the problem of determining multiple steady states for positive real values in models of biological networks. Investigating the potential for these in models of the mitogen-activated protein kinases (MAPK) network has consumed considerable effort using special insights into the structure of corresponding models. Here we apply combinations of symbolic computation methods for mixed equality/inequality systems, specifically virtual substitution, lazy real triangularization and cylindrical algebraic decomposition. We determine multistationarity of an 11-dimensional MAPK network when numeric values are known for all but potentially one parameter. More precisely, our considered model has 11 equations in 11 variables and 19 parameters, 3 of which are of interest for symbolic treatment, and furthermore positivity conditions on all variables and parameters.},
}

Endnote

%0 Report
%A Bradford, Russell
%A Davenport, James H.
%A England, Matthew
%A Errami, Hassan
%A Gerdt, Vladimir
%A Grigoriev, Dima
%A Hoyt, Charles
%A Košta, Marek
%A Radulescu, Ovidiu
%A Sturm, Thomas
%A Weber, Andreas
%+ External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
%T A Case Study on the Parametric Occurrence of Multiple Steady States :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-002D-91D0-E
%U http://arxiv.org/abs/1704.08997
%D 2017
%X We consider the problem of determining multiple steady states for positive
real values in models of biological networks. Investigating the potential for
these in models of the mitogen-activated protein kinases (MAPK) network has
consumed considerable effort using special insights into the structure of
corresponding models. Here we apply combinations of symbolic computation
methods for mixed equality/inequality systems, specifically virtual
substitution, lazy real triangularization and cylindrical algebraic
decomposition. We determine multistationarity of an 11-dimensional MAPK network
when numeric values are known for all but potentially one parameter. More
precisely, our considered model has 11 equations in 11 variables and 19
parameters, 3 of which are of interest for symbolic treatment, and furthermore
positivity conditions on all variables and parameters.
%K Computer Science, Symbolic Computation, cs.SC

Bromberger, M., & Weidenbach, C. (2017). New Techniques for Linear Arithmetic: Cubes and Equalities.

*Formal Methods in System Design*,*51*(3). doi:10.1007/s10703-017-0278-7Export

BibTeX

@article{Bromberger2017,
TITLE = {New Techniques for Linear Arithmetic: {C}ubes and Equalities},
AUTHOR = {Bromberger, Martin and Weidenbach, Christoph},
LANGUAGE = {eng},
ISSN = {0925-9856},
DOI = {10.1007/s10703-017-0278-7},
PUBLISHER = {Springer},
ADDRESS = {Berlin},
YEAR = {2017},
MARGINALMARK = {$\bullet$},
DATE = {2017},
JOURNAL = {Formal Methods in System Design},
VOLUME = {51},
NUMBER = {3},
PAGES = {433--461},
}

Endnote

%0 Journal Article
%A Bromberger, Martin
%A Weidenbach, Christoph
%+ Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T New Techniques for Linear Arithmetic: Cubes and Equalities :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-002E-260E-C
%R 10.1007/s10703-017-0278-7
%7 2017
%D 2017
%J Formal Methods in System Design
%V 51
%N 3
%& 433
%P 433 - 461
%I Springer
%C Berlin
%@ false

Demri, S., Kapur, D., & Weidenbach, C. (2017). Preface -Special Issue of Selected Extended Papers of IJCAR 2014.

*Journal of Automated Reasoning*,*58*(1). doi:10.1007/s10817-016-9394-0Export

BibTeX

@article{DBLP:journals/jar/DemriKW17,
TITLE = {Preface -- Special Issue of Selected Extended Papers of {IJCAR} 2014},
AUTHOR = {Demri, St{\'e}phane and Kapur, Deepak and Weidenbach, Christoph},
LANGUAGE = {eng},
ISSN = {0168-7433},
DOI = {10.1007/s10817-016-9394-0},
PUBLISHER = {D. Reidel Pub. Co.},
ADDRESS = {Dordrecht, Holland},
YEAR = {2017},
MARGINALMARK = {$\bullet$},
DATE = {2017},
JOURNAL = {Journal of Automated Reasoning},
VOLUME = {58},
NUMBER = {1},
PAGES = {1--2},
}

Endnote

%0 Journal Article
%A Demri, Stéphane
%A Kapur, Deepak
%A Weidenbach, Christoph
%+ External Organizations
External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
%T Preface -Special Issue of Selected Extended Papers of IJCAR 2014 :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-002C-4CD1-C
%R 10.1007/s10817-016-9394-0
%7 2016
%D 2017
%J Journal of Automated Reasoning
%V 58
%N 1
%& 1
%P 1 - 2
%I D. Reidel Pub. Co.
%C Dordrecht, Holland
%@ false

Echenim, M., Peltier, N., & Tourret, S. (2017). Prime Implicate Generation in Equational Logic.

*Journal of Artificial Intelligence Research*,*60*. doi:10.1613/jair.5481Export

BibTeX

@article{Echenim2017,
TITLE = {Prime Implicate Generation in Equational Logic},
AUTHOR = {Echenim, Mnacho and Peltier, Nicolas and Tourret, Sophie},
LANGUAGE = {eng},
ISSN = {1076-9757},
DOI = {10.1613/jair.5481},
PUBLISHER = {AI Access Foundation},
ADDRESS = {S.l.},
YEAR = {2017},
MARGINALMARK = {$\bullet$},
DATE = {2017},
JOURNAL = {Journal of Artificial Intelligence Research},
VOLUME = {60},
PAGES = {827--880},
}

Endnote

%0 Journal Article
%A Echenim, Mnacho
%A Peltier, Nicolas
%A Tourret, Sophie
%+ External Organizations
External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
%T Prime Implicate Generation in Equational Logic :
%G eng
%U http://hdl.handle.net/21.11116/0000-0000-C8DF-4
%R 10.1613/jair.5481
%7 2017
%D 2017
%J Journal of Artificial Intelligence Research
%V 60
%& 827
%P 827 - 880
%I AI Access Foundation
%C S.l.
%@ false

England, M., Errami, H., Grigoriev, D., Radulescu, O., Sturm, T., & Weber, A. (2017a). Symbolic Versus Numerical Computation and Visualization of Parameter Regions for Multistationarity of Biological Networks. In

*Computer Algebra in Scientific Computing*. Beijing, China: Springer. doi:10.1007/978-3-319-66320-3_8Export

BibTeX

@inproceedings{EnglandCASC2017,
TITLE = {Symbolic Versus Numerical Computation and Visualization of Parameter Regions for Multistationarity of Biological Networks},
AUTHOR = {England, Matthew and Errami, Hassan and Grigoriev, Dima and Radulescu, Ovidiu and Sturm, Thomas and Weber, Andreas},
LANGUAGE = {eng},
ISBN = {978-3-319-66319-7},
DOI = {10.1007/978-3-319-66320-3_8},
PUBLISHER = {Springer},
YEAR = {2017},
MARGINALMARK = {$\bullet$},
DATE = {2017},
BOOKTITLE = {Computer Algebra in Scientific Computing},
EDITOR = {Gerdt, Vladimir P. and Koepf, Wolfram and Seiler, Werner M. and Vorozhtsov, Evgenii V.},
PAGES = {93--108},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {10490},
ADDRESS = {Beijing, China},
}

Endnote

%0 Conference Proceedings
%A England, Matthew
%A Errami, Hassan
%A Grigoriev, Dima
%A Radulescu, Ovidiu
%A Sturm, Thomas
%A Weber, Andreas
%+ External Organizations
External Organizations
External Organizations
External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
%T Symbolic Versus Numerical Computation and Visualization of Parameter Regions for Multistationarity of Biological Networks :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-002E-07A0-5
%R 10.1007/978-3-319-66320-3_8
%D 2017
%B 19th International Workshop on Computer Algebra in Scientific Computing
%Z date of event: 2017-09-18 - 2017-09-22
%C Beijing, China
%B Computer Algebra in Scientific Computing
%E Gerdt, Vladimir P.; Koepf, Wolfram; Seiler, Werner M.; Vorozhtsov, Evgenii V.
%P 93 - 108
%I Springer
%@ 978-3-319-66319-7
%B Lecture Notes in Computer Science
%N 10490

England, M., Errami, H., Grigoriev, D., Radulescu, O., Sturm, T., & Weber, A. (2017b). Symbolic Versus Numerical Computation and Visualization of Parameter Regions for Multistationarity of Biological Networks. Retrieved from http://arxiv.org/abs/1706.08794

(arXiv: 1706.08794) Abstract

We investigate models of the mitogenactivated protein kinases (MAPK) network,
with the aim of determining where in parameter space there exist multiple
positive steady states. We build on recent progress which combines various
symbolic computation methods for mixed systems of equalities and inequalities.
We demonstrate that those techniques benefit tremendously from a newly
implemented graph theoretical symbolic preprocessing method. We compare
computation times and quality of results of numerical continuation methods with
our symbolic approach before and after the application of our preprocessing.

Export

BibTeX

@online{DBLP:journals/corr/EnglandEGR0017,
TITLE = {Symbolic Versus Numerical Computation and Visualization of Parameter Regions for Multistationarity of Biological Networks},
AUTHOR = {England, Matthew and Errami, Hassan and Grigoriev, Dima and Radulescu, Ovidiu and Sturm, Thomas and Weber, Andreas},
LANGUAGE = {eng},
URL = {http://arxiv.org/abs/1706.08794},
EPRINT = {1706.08794},
EPRINTTYPE = {arXiv},
YEAR = {2017},
MARGINALMARK = {$\bullet$},
ABSTRACT = {We investigate models of the mitogenactivated protein kinases (MAPK) network, with the aim of determining where in parameter space there exist multiple positive steady states. We build on recent progress which combines various symbolic computation methods for mixed systems of equalities and inequalities. We demonstrate that those techniques benefit tremendously from a newly implemented graph theoretical symbolic preprocessing method. We compare computation times and quality of results of numerical continuation methods with our symbolic approach before and after the application of our preprocessing.},
}

Endnote

%0 Report
%A England, Matthew
%A Errami, Hassan
%A Grigoriev, Dima
%A Radulescu, Ovidiu
%A Sturm, Thomas
%A Weber, Andreas
%+ External Organizations
External Organizations
External Organizations
External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
%T Symbolic Versus Numerical Computation and Visualization of Parameter Regions for Multistationarity of Biological Networks :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-002D-91C9-F
%U http://arxiv.org/abs/1706.08794
%D 2017
%X We investigate models of the mitogenactivated protein kinases (MAPK) network,
with the aim of determining where in parameter space there exist multiple
positive steady states. We build on recent progress which combines various
symbolic computation methods for mixed systems of equalities and inequalities.
We demonstrate that those techniques benefit tremendously from a newly
implemented graph theoretical symbolic preprocessing method. We compare
computation times and quality of results of numerical continuation methods with
our symbolic approach before and after the application of our preprocessing.
%K Computer Science, Symbolic Computation, cs.SC

Fontaine, P., Ogawa, M., Sturm, T., & Vu, X. T. (2017a). Subtropical Satisfiability. In

*Frontiers of Combining Systems (FroCoS 2017)*. Brasília, Brazil: Springer. doi:10.1007/978-3-319-66167-4_11Export

BibTeX

@inproceedings{FontaineFroCoS2017,
TITLE = {Subtropical Satisfiability},
AUTHOR = {Fontaine, Pascal and Ogawa, Mizuhito and Sturm, Thomas and Vu, Xuan Tung},
LANGUAGE = {eng},
ISBN = {978-3-319-66166-7},
DOI = {10.1007/978-3-319-66167-4_11},
PUBLISHER = {Springer},
YEAR = {2017},
MARGINALMARK = {$\bullet$},
DATE = {2017},
BOOKTITLE = {Frontiers of Combining Systems (FroCoS 2017)},
EDITOR = {Dixon, Clare and Finger, Marcelo},
PAGES = {189--206},
SERIES = {Lecture Notes in Artificial Intelligence},
VOLUME = {10483},
ADDRESS = {Bras{\'i}lia, Brazil},
}

Endnote

%0 Conference Proceedings
%A Fontaine, Pascal
%A Ogawa, Mizuhito
%A Sturm, Thomas
%A Vu, Xuan Tung
%+ External Organizations
External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
%T Subtropical Satisfiability :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-002E-07A7-8
%R 10.1007/978-3-319-66167-4_11
%D 2017
%B 11th International Symposium on Frontiers of Combining Systems
%Z date of event: 2017-09-27 - 2017-09-29
%C Brasília, Brazil
%B Frontiers of Combining Systems
%E Dixon, Clare; Finger, Marcelo
%P 189 - 206
%I Springer
%@ 978-3-319-66166-7
%B Lecture Notes in Artificial Intelligence
%N 10483

Fontaine, P., Ogawa, M., Sturm, T., & Vu, X. T. (2017b). Subtropical Satisfiability. Retrieved from http://arxiv.org/abs/1706.09236

(arXiv: 1706.09236) Abstract

Quantifier-free nonlinear arithmetic (QF_NRA) appears in many applications of
satisfiability modulo theories solving (SMT). Accordingly, efficient reasoning
for corresponding constraints in SMT theory solvers is highly relevant. We
propose a new incomplete but efficient and terminating method to identify
satisfiable instances. The method is derived from the subtropical method
recently introduced in the context of symbolic computation for computing real
zeros of single very large multivariate polynomials. Our method takes as input
conjunctions of strict polynomial inequalities, which represent more than 40%
of the QF_NRA section of the SMT-LIB library of benchmarks. The method takes an
abstraction of polynomials as exponent vectors over the natural numbers tagged
with the signs of the corresponding coefficients. It then uses, in turn, SMT to
solve linear problems over the reals to heuristically find suitable points that
translate back to satisfying points for the original problem. Systematic
experiments on the SMT-LIB demonstrate that our method is not a sufficiently
strong decision procedure by itself but a valuable heuristic to use within a
portfolio of techniques.

Export

BibTeX

@online{DBLP:journals/corr/FontaineO0V17,
TITLE = {Subtropical Satisfiability},
AUTHOR = {Fontaine, Pascal and Ogawa, Mizuhito and Sturm, Thomas and Vu, Xuan Tung},
LANGUAGE = {eng},
URL = {http://arxiv.org/abs/1706.09236},
EPRINT = {1706.09236},
EPRINTTYPE = {arXiv},
YEAR = {2017},
MARGINALMARK = {$\bullet$},
ABSTRACT = {Quantifier-free nonlinear arithmetic (QF_NRA) appears in many applications of satisfiability modulo theories solving (SMT). Accordingly, efficient reasoning for corresponding constraints in SMT theory solvers is highly relevant. We propose a new incomplete but efficient and terminating method to identify satisfiable instances. The method is derived from the subtropical method recently introduced in the context of symbolic computation for computing real zeros of single very large multivariate polynomials. Our method takes as input conjunctions of strict polynomial inequalities, which represent more than 40% of the QF_NRA section of the SMT-LIB library of benchmarks. The method takes an abstraction of polynomials as exponent vectors over the natural numbers tagged with the signs of the corresponding coefficients. It then uses, in turn, SMT to solve linear problems over the reals to heuristically find suitable points that translate back to satisfying points for the original problem. Systematic experiments on the SMT-LIB demonstrate that our method is not a sufficiently strong decision procedure by itself but a valuable heuristic to use within a portfolio of techniques.},
}

Endnote

%0 Report
%A Fontaine, Pascal
%A Ogawa, Mizuhito
%A Sturm, Thomas
%A Vu, Xuan Tung
%+ External Organizations
External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
%T Subtropical Satisfiability :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-002D-91C2-E
%U http://arxiv.org/abs/1706.09236
%D 2017
%X Quantifier-free nonlinear arithmetic (QF_NRA) appears in many applications of
satisfiability modulo theories solving (SMT). Accordingly, efficient reasoning
for corresponding constraints in SMT theory solvers is highly relevant. We
propose a new incomplete but efficient and terminating method to identify
satisfiable instances. The method is derived from the subtropical method
recently introduced in the context of symbolic computation for computing real
zeros of single very large multivariate polynomials. Our method takes as input
conjunctions of strict polynomial inequalities, which represent more than 40%
of the QF_NRA section of the SMT-LIB library of benchmarks. The method takes an
abstraction of polynomials as exponent vectors over the natural numbers tagged
with the signs of the corresponding coefficients. It then uses, in turn, SMT to
solve linear problems over the reals to heuristically find suitable points that
translate back to satisfying points for the original problem. Systematic
experiments on the SMT-LIB demonstrate that our method is not a sufficiently
strong decision procedure by itself but a valuable heuristic to use within a
portfolio of techniques.
%K Computer Science, Logic in Computer Science, cs.LO

Horbach, M., Voigt, M., & Weidenbach, C. (2017a). On the Combination of the Bernays-Schönfinkel-Ramsey Fragment with Simple Linear Integer Arithmetic. In

*Automated Deduction -- CADE 26*. Gothenburg, Sweden: Springer. doi:10.1007/978-3-319-63046-5_6Export

BibTeX

@inproceedings{HorbachCADE2017,
TITLE = {On the Combination of the {B}ernays-{S}ch{\"o}nfinkel-{R}amsey Fragment with Simple Linear Integer Arithmetic},
AUTHOR = {Horbach, Matthias and Voigt, Marco and Weidenbach, Christoph},
LANGUAGE = {eng},
ISBN = {978-3-319-63045-8},
DOI = {10.1007/978-3-319-63046-5_6},
PUBLISHER = {Springer},
YEAR = {2017},
MARGINALMARK = {$\bullet$},
DATE = {2017},
BOOKTITLE = {Automated Deduction -- CADE 26},
EDITOR = {de Moura, Leonardo},
PAGES = {77--94},
SERIES = {Lecture Notes in Artificial Intelligence},
VOLUME = {10395},
ADDRESS = {Gothenburg, Sweden},
}

Endnote

%0 Conference Proceedings
%A Horbach, Matthias
%A Voigt, Marco
%A Weidenbach, Christoph
%+ Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T On the Combination of the Bernays-Schönfinkel-Ramsey Fragment with Simple Linear Integer Arithmetic :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-002D-FB27-F
%R 10.1007/978-3-319-63046-5_6
%D 2017
%B 26th International Conference on Automated Deduction
%Z date of event: 2017-08-06 - 2017-08-11
%C Gothenburg, Sweden
%B Automated Deduction -- CADE 26
%E de Moura, Leonardo
%P 77 - 94
%I Springer
%@ 978-3-319-63045-8
%B Lecture Notes in Artificial Intelligence
%N 10395

Horbach, M., Voigt, M., & Weidenbach, C. (2017b). On the Combination of the Bernays-Schönfinkel-Ramsey Fragment with Simple Linear Integer Arithmetic. Retrieved from http://arxiv.org/abs/1705.08792

(arXiv: 1705.08792) Abstract

In general, first-order predicate logic extended with linear integer
arithmetic is undecidable. We show that the Bernays-Sch\"onfinkel-Ramsey
fragment ($\exists^* \forall^*$-sentences) extended with a restricted form of
linear integer arithmetic is decidable via finite ground instantiation. The
identified ground instances can be employed to restrict the search space of
existing automated reasoning procedures considerably, e.g., when reasoning
about quantified properties of array data structures formalized in Bradley,
Manna, and Sipma's array property fragment. Typically, decision procedures for
the array property fragment are based on an exhaustive instantiation of
universally quantified array indices with all the ground index terms that occur
in the formula at hand. Our results reveal that one can get along with
significantly fewer instances.

Export

BibTeX

@online{HorbachArXiv2017,
TITLE = {On the Combination of the Bernays-Sch{\"o}nfinkel-Ramsey Fragment with Simple Linear Integer Arithmetic},
AUTHOR = {Horbach, Matthias and Voigt, Marco and Weidenbach, Christoph},
LANGUAGE = {eng},
URL = {http://arxiv.org/abs/1705.08792},
EPRINT = {1705.08792},
EPRINTTYPE = {arXiv},
YEAR = {2017},
MARGINALMARK = {$\bullet$},
ABSTRACT = {In general, first-order predicate logic extended with linear integer arithmetic is undecidable. We show that the Bernays-Sch\"onfinkel-Ramsey fragment ($\exists^* \forall^*$-sentences) extended with a restricted form of linear integer arithmetic is decidable via finite ground instantiation. The identified ground instances can be employed to restrict the search space of existing automated reasoning procedures considerably, e.g., when reasoning about quantified properties of array data structures formalized in Bradley, Manna, and Sipma's array property fragment. Typically, decision procedures for the array property fragment are based on an exhaustive instantiation of universally quantified array indices with all the ground index terms that occur in the formula at hand. Our results reveal that one can get along with significantly fewer instances.},
}

Endnote

%0 Report
%A Horbach, Matthias
%A Voigt, Marco
%A Weidenbach, Christoph
%+ Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T On the Combination of the Bernays-Schönfinkel-Ramsey Fragment with Simple Linear Integer Arithmetic :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-002D-8140-2
%U http://arxiv.org/abs/1705.08792
%D 2017
%X In general, first-order predicate logic extended with linear integer
arithmetic is undecidable. We show that the Bernays-Sch\"onfinkel-Ramsey
fragment ($\exists^* \forall^*$-sentences) extended with a restricted form of
linear integer arithmetic is decidable via finite ground instantiation. The
identified ground instances can be employed to restrict the search space of
existing automated reasoning procedures considerably, e.g., when reasoning
about quantified properties of array data structures formalized in Bradley,
Manna, and Sipma's array property fragment. Typically, decision procedures for
the array property fragment are based on an exhaustive instantiation of
universally quantified array indices with all the ground index terms that occur
in the formula at hand. Our results reveal that one can get along with
significantly fewer instances.
%K Computer Science, Logic in Computer Science, cs.LO

Horbach, M., Voigt, M., & Weidenbach, C. (2017c). The Universal Fragment of Presburger Arithmetic with Unary Uninterpreted Predicates is Undecidable. Retrieved from http://arxiv.org/abs/1703.01212

(arXiv: 1703.01212) Abstract

The first-order theory of addition over the natural numbers, known as
Presburger arithmetic, is decidable in double exponential time. Adding an
uninterpreted unary predicate to the language leads to an undecidable theory.
We sharpen the known boundary between decidable and undecidable in that we show
that the purely universal fragment of the extended theory is already
undecidable. Our proof is based on a reduction of the halting problem for
two-counter machines to unsatisfiability of sentences in the extended language
of Presburger arithmetic that does not use existential quantification. On the
other hand, we argue that a single $\forall\exists$ quantifier alternation
turns the set of satisfiable sentences of the extended language into a
$\Sigma^1_1$-complete set. Some of the mentioned results can be transfered to
the realm of linear arithmetic over the ordered real numbers. This concerns the
undecidability of the purely universal fragment and the $\Sigma^1_1$-hardness
for sentences with at least one quantifier alternation. Finally, we discuss the
relevance of our results to verification. In particular, we derive
undecidability results for quantified fragments of separation logic, the theory
of arrays, and combinations of the theory of equality over uninterpreted
functions with restricted forms of integer arithmetic. In certain cases our
results even imply the absence of sound and complete deductive calculi.

Export

BibTeX

@online{VoigtHorbachWeidenbacharXiv2017,
TITLE = {The Universal Fragment of Presburger Arithmetic with Unary Uninterpreted Predicates is Undecidable},
AUTHOR = {Horbach, Matthias and Voigt, Marco and Weidenbach, Christoph},
LANGUAGE = {eng},
URL = {http://arxiv.org/abs/1703.01212},
EPRINT = {1703.01212},
EPRINTTYPE = {arXiv},
YEAR = {2017},
MARGINALMARK = {$\bullet$},
ABSTRACT = {The first-order theory of addition over the natural numbers, known as Presburger arithmetic, is decidable in double exponential time. Adding an uninterpreted unary predicate to the language leads to an undecidable theory. We sharpen the known boundary between decidable and undecidable in that we show that the purely universal fragment of the extended theory is already undecidable. Our proof is based on a reduction of the halting problem for two-counter machines to unsatisfiability of sentences in the extended language of Presburger arithmetic that does not use existential quantification. On the other hand, we argue that a single $\forall\exists$ quantifier alternation turns the set of satisfiable sentences of the extended language into a $\Sigma^1_1$-complete set. Some of the mentioned results can be transfered to the realm of linear arithmetic over the ordered real numbers. This concerns the undecidability of the purely universal fragment and the $\Sigma^1_1$-hardness for sentences with at least one quantifier alternation. Finally, we discuss the relevance of our results to verification. In particular, we derive undecidability results for quantified fragments of separation logic, the theory of arrays, and combinations of the theory of equality over uninterpreted functions with restricted forms of integer arithmetic. In certain cases our results even imply the absence of sound and complete deductive calculi.},
}

Endnote

%0 Report
%A Horbach, Matthias
%A Voigt, Marco
%A Weidenbach, Christoph
%+ Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T The Universal Fragment of Presburger Arithmetic with Unary Uninterpreted Predicates is Undecidable :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-002C-A5E7-D
%U http://arxiv.org/abs/1703.01212
%D 2017
%X The first-order theory of addition over the natural numbers, known as
Presburger arithmetic, is decidable in double exponential time. Adding an
uninterpreted unary predicate to the language leads to an undecidable theory.
We sharpen the known boundary between decidable and undecidable in that we show
that the purely universal fragment of the extended theory is already
undecidable. Our proof is based on a reduction of the halting problem for
two-counter machines to unsatisfiability of sentences in the extended language
of Presburger arithmetic that does not use existential quantification. On the
other hand, we argue that a single $\forall\exists$ quantifier alternation
turns the set of satisfiable sentences of the extended language into a
$\Sigma^1_1$-complete set. Some of the mentioned results can be transfered to
the realm of linear arithmetic over the ordered real numbers. This concerns the
undecidability of the purely universal fragment and the $\Sigma^1_1$-hardness
for sentences with at least one quantifier alternation. Finally, we discuss the
relevance of our results to verification. In particular, we derive
undecidability results for quantified fragments of separation logic, the theory
of arrays, and combinations of the theory of equality over uninterpreted
functions with restricted forms of integer arithmetic. In certain cases our
results even imply the absence of sound and complete deductive calculi.
%K Computer Science, Logic in Computer Science, cs.LO

Lamotte-Schubert, M., & Weidenbach, C. (2017). BDI: A New Decidable Clause Class.

*Journal of Logic and Computation*,*27*(2). doi:10.1093/logcom/exu074Export

BibTeX

@article{Lamotte-SchubertWeidenbach17,
TITLE = {{BDI}: A New Decidable Clause Class},
AUTHOR = {Lamotte-Schubert, Manuel and Weidenbach, Christoph},
LANGUAGE = {eng},
ISSN = {0955-792X},
DOI = {10.1093/logcom/exu074},
PUBLISHER = {Oxford University Press},
ADDRESS = {Oxford},
YEAR = {2017},
MARGINALMARK = {$\bullet$},
DATE = {2017},
JOURNAL = {Journal of Logic and Computation},
VOLUME = {27},
NUMBER = {2},
PAGES = {441--468},
}

Endnote

%0 Journal Article
%A Lamotte-Schubert, Manuel
%A Weidenbach, Christoph
%+ Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T BDI: A New Decidable Clause Class :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0024-C365-F
%R 10.1093/logcom/exu074
%7 2017
%D 2017
%J Journal of Logic and Computation
%V 27
%N 2
%& 441
%P 441 - 468
%I Oxford University Press
%C Oxford
%@ false

Reynolds, A., & Blanchette, J. C. (2017). A Decision Procedure for (Co)datatypes in SMT Solvers.

*Journal of Automated Reasoning*,*58*(3). doi:10.1007/s10817-016-9372-6Export

BibTeX

@article{DBLP:journals/jar/ReynoldsB17,
TITLE = {A Decision Procedure for (Co)datatypes in {SMT} Solvers},
AUTHOR = {Reynolds, Andrew and Blanchette, Jasmin Christian},
LANGUAGE = {eng},
ISSN = {0168-7433},
DOI = {10.1007/s10817-016-9372-6},
PUBLISHER = {Springer},
ADDRESS = {New York, NY},
YEAR = {2017},
MARGINALMARK = {$\bullet$},
DATE = {2017},
JOURNAL = {Journal of Automated Reasoning},
EDITOR = {Kambhampati, Subbarao},
VOLUME = {58},
NUMBER = {3},
PAGES = {341--362},
}

Endnote

%0 Journal Article
%A Reynolds, Andrew
%A Blanchette, Jasmin Christian
%+ External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
%T A Decision Procedure for (Co)datatypes in SMT Solvers :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-002C-80D4-C
%R 10.1007/s10817-016-9372-6
%7 2017
%D 2017
%J Journal of Automated Reasoning
%V 58
%N 3
%& 341
%P 341 - 362
%I Springer
%C New York, NY
%@ false

Sturm, T. (2017). A Survey of Some Methods for Real Quantifier Elimination, Decision, and Satisfiability and Their Applications.

*Mathematics in Computer Science*,*11*(3-4). doi:10.1007/s11786-017-0319-zExport

BibTeX

@article{Sturm2017,
TITLE = {A Survey of Some Methods for Real Quantifier Elimination, Decision, and Satisfiability and Their Applications},
AUTHOR = {Sturm, Thomas},
LANGUAGE = {eng},
DOI = {10.1007/s11786-017-0319-z},
PUBLISHER = {Springer},
ADDRESS = {New York, NY},
YEAR = {2017},
MARGINALMARK = {$\bullet$},
DATE = {2017},
JOURNAL = {Mathematics in Computer Science},
VOLUME = {11},
NUMBER = {3-4},
PAGES = {483--502},
}

Endnote

%0 Journal Article
%A Sturm, Thomas
%+ Automation of Logic, MPI for Informatics, Max Planck Society
%T A Survey of Some Methods for Real Quantifier Elimination, Decision, and Satisfiability and Their Applications :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-002C-A3B5-B
%R 10.1007/s11786-017-0319-z
%7 2017
%D 2017
%J Mathematics in Computer Science
%V 11
%N 3-4
%& 483
%P 483 - 502
%I Springer
%C New York, NY

Tang, C. H. (2017).

*Logics for Rule-based Configuration Systems*. Universität des Saarlandes, Saarbrücken. Retrieved from urn:nbn:de:bsz:291-scidok-69639Abstract

Rule-based configuration systems are being successfully used in industry, such as DOPLER at Siemens. Those systems make complex domain knowledge available to users and let them derive valid, customized products out of large sets of components. However, maintenance of such systems remains a challenge. Formal models are a prerequisite for the use of automated methods of analysis. This thesis deals with the formalization of rule-based configuration. We develop two logics whose transition semantics are suited for expressing the way systems like DOPLER operate. This is due to the existence of two types of transitions, namely user and rule transitions, and a fixpoint mechanism that determines their dynamic relationship. The first logic, PIDL, models propositional systems, while the second logic, PIDL+, additionally considers arithmetic constraints. They allow the formulation and automated verification of relevant properties of rule- based configuration systems.

Export

BibTeX

@phdthesis{Tangphd2017,
TITLE = {Logics for Rule-based Configuration Systems},
AUTHOR = {Tang, Ching Hoo},
LANGUAGE = {eng},
URL = {urn:nbn:de:bsz:291-scidok-69639},
SCHOOL = {Universit{\"a}t des Saarlandes},
ADDRESS = {Saarbr{\"u}cken},
YEAR = {2017},
MARGINALMARK = {$\bullet$},
DATE = {2017},
ABSTRACT = {Rule-based configuration systems are being successfully used in industry, such as DOPLER at Siemens. Those systems make complex domain knowledge available to users and let them derive valid, customized products out of large sets of components. However, maintenance of such systems remains a challenge. Formal models are a prerequisite for the use of automated methods of analysis. This thesis deals with the formalization of rule-based configuration. We develop two logics whose transition semantics are suited for expressing the way systems like DOPLER operate. This is due to the existence of two types of transitions, namely user and rule transitions, and a fixpoint mechanism that determines their dynamic relationship. The first logic, PIDL, models propositional systems, while the second logic, PIDL+, additionally considers arithmetic constraints. They allow the formulation and automated verification of relevant properties of rule- based configuration systems.},
}

Endnote

%0 Thesis
%A Tang, Ching Hoo
%Y Weidenbach, Christoph
%A referee: Herzig, Andreas
%+ Automation of Logic, MPI for Informatics, Max Planck Society
International Max Planck Research School, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
%T Logics for Rule-based Configuration Systems :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-002E-0871-7
%U urn:nbn:de:bsz:291-scidok-69639
%I Universität des Saarlandes
%C Saarbrücken
%D 2017
%P X, 123 p.
%V phd
%9 phd
%X Rule-based configuration systems are being successfully used in industry, such as DOPLER at Siemens. Those systems make complex domain knowledge available to users and let them derive valid, customized products out of large sets of components. However, maintenance of such systems remains a challenge. Formal models are a prerequisite for the use of automated methods of analysis. This thesis deals with the formalization of rule-based configuration. We develop two logics whose transition semantics are suited for expressing the way systems like DOPLER operate. This is due to the existence of two types of transitions, namely user and rule transitions, and a fixpoint mechanism that determines their dynamic relationship. The first logic, PIDL, models propositional systems, while the second logic, PIDL+, additionally considers arithmetic constraints. They allow the formulation and automated verification of relevant properties of rule- based configuration systems.
%U http://scidok.sulb.uni-saarland.de/volltexte/2017/6963/http://scidok.sulb.uni-saarland.de/doku/lic_ohne_pod.php?la=de

Teucke, A., & Weidenbach, C. (2017a). Decidability of the Monadic Shallow Linear First-Order Fragment with Straight Dismatching Constraints. Retrieved from http://arxiv.org/abs/1703.02837

(arXiv: 1703.02837) Abstract

The monadic shallow linear Horn fragment is well-known to be decidable and
has many application, e.g., in security protocol analysis, tree automata, or
abstraction refinement. It was a long standing open problem how to extend the
fragment to the non-Horn case, preserving decidability, that would, e.g.,
enable to express non-determinism in protocols. We prove decidability of the
non-Horn monadic shallow linear fragment via ordered resolution further
extended with dismatching constraints and discuss some applications of the new
decidable fragment.

Export

BibTeX

@online{TeuckearXiv2017,
TITLE = {Decidability of the Monadic Shallow Linear First-Order Fragment with Straight Dismatching Constraints},
AUTHOR = {Teucke, Andreas and Weidenbach, Christoph},
LANGUAGE = {eng},
URL = {http://arxiv.org/abs/1703.02837},
EPRINT = {1703.02837},
EPRINTTYPE = {arXiv},
YEAR = {2017},
MARGINALMARK = {$\bullet$},
ABSTRACT = {The monadic shallow linear Horn fragment is well-known to be decidable and has many application, e.g., in security protocol analysis, tree automata, or abstraction refinement. It was a long standing open problem how to extend the fragment to the non-Horn case, preserving decidability, that would, e.g., enable to express non-determinism in protocols. We prove decidability of the non-Horn monadic shallow linear fragment via ordered resolution further extended with dismatching constraints and discuss some applications of the new decidable fragment.},
}

Endnote

%0 Report
%A Teucke, Andreas
%A Weidenbach, Christoph
%+ Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T Decidability of the Monadic Shallow Linear First-Order Fragment with
Straight Dismatching Constraints :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-002C-A213-1
%U http://arxiv.org/abs/1703.02837
%D 2017
%X The monadic shallow linear Horn fragment is well-known to be decidable and
has many application, e.g., in security protocol analysis, tree automata, or
abstraction refinement. It was a long standing open problem how to extend the
fragment to the non-Horn case, preserving decidability, that would, e.g.,
enable to express non-determinism in protocols. We prove decidability of the
non-Horn monadic shallow linear fragment via ordered resolution further
extended with dismatching constraints and discuss some applications of the new
decidable fragment.
%K Computer Science, Logic in Computer Science, cs.LO

Teucke, A., & Weidenbach, C. (2017b). Decidability of the Monadic Shallow Linear First-Order Fragment with Straight Dismatching Constraints. In

*Automated Deduction -- CADE 26*. Gothenburg, Sweden: Springer. doi:10.1007/978-3-319-63046-5_13Export

BibTeX

@inproceedings{TeuckeCADE2017,
TITLE = {Decidability of the Monadic Shallow Linear First-Order Fragment with Straight Dismatching Constraints},
AUTHOR = {Teucke, Andreas and Weidenbach, Christoph},
LANGUAGE = {eng},
ISBN = {978-3-319-63045-8},
DOI = {10.1007/978-3-319-63046-5_13},
PUBLISHER = {Springer},
YEAR = {2017},
MARGINALMARK = {$\bullet$},
DATE = {2017},
BOOKTITLE = {Automated Deduction -- CADE 26},
EDITOR = {de Moura, Leonardo},
PAGES = {202--219},
SERIES = {Lecture Notes in Artificial Intelligence},
VOLUME = {10395},
ADDRESS = {Gothenburg, Sweden},
}

Endnote

%0 Conference Proceedings
%A Teucke, Andreas
%A Weidenbach, Christoph
%+ Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T Decidability of the Monadic Shallow Linear First-Order Fragment with Straight Dismatching Constraints :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-002D-FB2A-9
%R 10.1007/978-3-319-63046-5_13
%D 2017
%B 26th International Conference on Automated Deduction
%Z date of event: 2017-08-06 - 2017-08-11
%C Gothenburg, Sweden
%B Automated Deduction -- CADE 26
%E de Moura, Leonardo
%P 202 - 219
%I Springer
%@ 978-3-319-63045-8
%B Lecture Notes in Artificial Intelligence
%N 10395

Voigt, M. (2017a). A Fine-Grained Hierarchy of Hard Problems in the Separated Fragment. In

*32nd Annual ACM-IEEE Symposium on Logic in Computer Science (LICS 2017)*. Reykjavik, Iceland: ACM. doi:10.1109/LICS.2017.8005094Export

BibTeX

@inproceedings{VoigtLICS2017,
TITLE = {A Fine-Grained Hierarchy of Hard Problems in the Separated Fragment},
AUTHOR = {Voigt, Marco},
LANGUAGE = {eng},
ISBN = {978-1-5090-3019-4},
DOI = {10.1109/LICS.2017.8005094},
PUBLISHER = {ACM},
YEAR = {2017},
MARGINALMARK = {$\bullet$},
DATE = {2017},
BOOKTITLE = {32nd Annual ACM-IEEE Symposium on Logic in Computer Science (LICS 2017)},
PAGES = {1--12},
ADDRESS = {Reykjavik, Iceland},
}

Endnote

%0 Conference Proceedings
%A Voigt, Marco
%+ Automation of Logic, MPI for Informatics, Max Planck Society
%T A Fine-Grained Hierarchy of Hard Problems in the Separated Fragment :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-002C-EFA6-4
%R 10.1109/LICS.2017.8005094
%D 2017
%B 32nd Annual ACM-IEEE Symposium on Logic in Computer Science
%Z date of event: 2017-06-20 - 2017-06-23
%C Reykjavik, Iceland
%B 32nd Annual ACM-IEEE Symposium on Logic in Computer Science
%P 1 - 12
%I ACM
%@ 978-1-5090-3019-4

Voigt, M. (2017b). A Fine-Grained Hierarchy of Hard Problems in the Separated Fragment. Retrieved from http://arxiv.org/abs/1704.02145

(arXiv: 1704.02145) Abstract

Recently, the separated fragment (SF) has been introduced and proved to be
decidable. Its defining principle is that universally and existentially
quantified variables may not occur together in atoms. The known upper bound on
the time required to decide SF's satisfiability problem is formulated in terms
of quantifier alternations: Given an SF sentence $\exists \vec{z} \forall
\vec{x}_1 \exists \vec{y}_1 \ldots \forall \vec{x}_n \exists \vec{y}_n . \psi$
in which $\psi$ is quantifier free, satisfiability can be decided in
nondeterministic $n$-fold exponential time. In the present paper, we conduct a
more fine-grained analysis of the complexity of SF-satisfiability. We derive an
upper and a lower bound in terms of the degree of interaction of existential
variables (short: degree)}---a novel measure of how many separate existential
quantifier blocks in a sentence are connected via joint occurrences of
variables in atoms. Our main result is the $k$-NEXPTIME-completeness of the
satisfiability problem for the set $SF_{\leq k}$ of all SF sentences that have
degree $k$ or smaller. Consequently, we show that SF-satisfiability is
non-elementary in general, since SF is defined without restrictions on the
degree. Beyond trivial lower bounds, nothing has been known about the hardness
of SF-satisfiability so far.

Export

BibTeX

@online{VoigtLICS2017ArxivFullPaper,
TITLE = {A Fine-Grained Hierarchy of Hard Problems in the Separated Fragment},
AUTHOR = {Voigt, Marco},
URL = {http://arxiv.org/abs/1704.02145},
EPRINT = {1704.02145},
EPRINTTYPE = {arXiv},
YEAR = {2017},
MARGINALMARK = {$\bullet$},
ABSTRACT = {Recently, the separated fragment (SF) has been introduced and proved to be decidable. Its defining principle is that universally and existentially quantified variables may not occur together in atoms. The known upper bound on the time required to decide SF's satisfiability problem is formulated in terms of quantifier alternations: Given an SF sentence $\exists \vec{z} \forall \vec{x}_1 \exists \vec{y}_1 \ldots \forall \vec{x}_n \exists \vec{y}_n . \psi$ in which $\psi$ is quantifier free, satisfiability can be decided in nondeterministic $n$-fold exponential time. In the present paper, we conduct a more fine-grained analysis of the complexity of SF-satisfiability. We derive an upper and a lower bound in terms of the degree of interaction of existential variables (short: degree)}---a novel measure of how many separate existential quantifier blocks in a sentence are connected via joint occurrences of variables in atoms. Our main result is the $k$-NEXPTIME-completeness of the satisfiability problem for the set $SF_{\leq k}$ of all SF sentences that have degree $k$ or smaller. Consequently, we show that SF-satisfiability is non-elementary in general, since SF is defined without restrictions on the degree. Beyond trivial lower bounds, nothing has been known about the hardness of SF-satisfiability so far.},
}

Endnote

%0 Report
%A Voigt, Marco
%+ Automation of Logic, MPI for Informatics, Max Planck Society
%T A Fine-Grained Hierarchy of Hard Problems in the Separated Fragment :
%U http://hdl.handle.net/11858/00-001M-0000-002C-EFA0-0
%U http://arxiv.org/abs/1704.02145
%D 2017
%X Recently, the separated fragment (SF) has been introduced and proved to be
decidable. Its defining principle is that universally and existentially
quantified variables may not occur together in atoms. The known upper bound on
the time required to decide SF's satisfiability problem is formulated in terms
of quantifier alternations: Given an SF sentence $\exists \vec{z} \forall
\vec{x}_1 \exists \vec{y}_1 \ldots \forall \vec{x}_n \exists \vec{y}_n . \psi$
in which $\psi$ is quantifier free, satisfiability can be decided in
nondeterministic $n$-fold exponential time. In the present paper, we conduct a
more fine-grained analysis of the complexity of SF-satisfiability. We derive an
upper and a lower bound in terms of the degree of interaction of existential
variables (short: degree)}---a novel measure of how many separate existential
quantifier blocks in a sentence are connected via joint occurrences of
variables in atoms. Our main result is the $k$-NEXPTIME-completeness of the
satisfiability problem for the set $SF_{\leq k}$ of all SF sentences that have
degree $k$ or smaller. Consequently, we show that SF-satisfiability is
non-elementary in general, since SF is defined without restrictions on the
degree. Beyond trivial lower bounds, nothing has been known about the hardness
of SF-satisfiability so far.
%K Computer Science, Logic in Computer Science, cs.LO

Voigt, M. (2017c). The Bernays-Schönfinkel-Ramsey Fragment with Bounded Difference Constraints over the Reals Is Decidable. In

*Frontiers of Combining Systems (FroCoS 2017)*. Brasília, Brazil: Springer. doi:10.1007/978-3-319-66167-4_14Export

BibTeX

@inproceedings{VoigtFroCoS2017,
TITLE = {The {B}ernays--{S}ch{\"o}nfinkel--{R}amsey Fragment with Bounded Difference Constraints over the Reals Is Decidable},
AUTHOR = {Voigt, Marco},
LANGUAGE = {eng},
ISBN = {978-3-319-66166-7},
DOI = {10.1007/978-3-319-66167-4_14},
PUBLISHER = {Springer},
YEAR = {2017},
MARGINALMARK = {$\bullet$},
DATE = {2017},
BOOKTITLE = {Frontiers of Combining Systems (FroCoS 2017)},
EDITOR = {Dixon, Clare and Finger, Marcelo},
PAGES = {244--261},
SERIES = {Lecture Notes in Artificial Intelligence},
VOLUME = {10483},
ADDRESS = {Bras{\'i}lia, Brazil},
}

Endnote

%0 Conference Proceedings
%A Voigt, Marco
%+ Automation of Logic, MPI for Informatics, Max Planck Society
%T The Bernays-Schönfinkel-Ramsey Fragment with Bounded Difference Constraints over the Reals Is Decidable :
%G eng
%U http://hdl.handle.net/21.11116/0000-0001-E6DE-2
%R 10.1007/978-3-319-66167-4_14
%D 2017
%B 11th International Symposium on Frontiers of Combining Systems
%Z date of event: 2017-09-27 - 2017-09-29
%C Brasília, Brazil
%B Frontiers of Combining Systems
%E Dixon, Clare; Finger, Marcelo
%P 244 - 261
%I Springer
%@ 978-3-319-66166-7
%B Lecture Notes in Artificial Intelligence
%N 10483

Voigt, M. (2017d). On Generalizing Decidable Standard Prefix Classes of First-Order Logic. Retrieved from http://arxiv.org/abs/1706.03949

(arXiv: 1706.03949) Abstract

Recently, the separated fragment (SF) of first-order logic has been
introduced. Its defining principle is that universally and existentially
quantified variables may not occur together in atoms. SF properly generalizes
both the Bernays-Sch\"onfinkel-Ramsey (BSR) fragment and the relational monadic
fragment. In this paper the restrictions on variable occurrences in SF
sentences are relaxed such that universally and existentially quantified
variables may occur together in the same atom under certain conditions. Still,
satisfiability can be decided. This result is established in two ways: firstly,
by an effective equivalence-preserving translation into the BSR fragment, and,
secondly, by a model-theoretic argument.
Slight modifications to the described concepts facilitate the definition of
other decidable classes of first-order sentences. The paper presents a second
fragment which is novel, has a decidable satisfiability problem, and properly
contains the Ackermann fragment and---once more---the relational monadic
fragment. The definition is again characterized by restrictions on the
occurrences of variables in atoms. More precisely, after certain
transformations, Skolemization yields only unary functions and constants, and
every atom contains at most one universally quantified variable. An effective
satisfiability-preserving translation into the monadic fragment is devised and
employed to prove decidability of the associated satisfiability problem.

Export

BibTeX

@online{Voigt_arXiv1706.03949,
TITLE = {On Generalizing Decidable Standard Prefix Classes of First-Order Logic},
AUTHOR = {Voigt, Marco},
LANGUAGE = {eng},
URL = {http://arxiv.org/abs/1706.03949},
EPRINT = {1706.03949},
EPRINTTYPE = {arXiv},
YEAR = {2017},
MARGINALMARK = {$\bullet$},
ABSTRACT = {Recently, the separated fragment (SF) of first-order logic has been introduced. Its defining principle is that universally and existentially quantified variables may not occur together in atoms. SF properly generalizes both the Bernays-Sch\"onfinkel-Ramsey (BSR) fragment and the relational monadic fragment. In this paper the restrictions on variable occurrences in SF sentences are relaxed such that universally and existentially quantified variables may occur together in the same atom under certain conditions. Still, satisfiability can be decided. This result is established in two ways: firstly, by an effective equivalence-preserving translation into the BSR fragment, and, secondly, by a model-theoretic argument. Slight modifications to the described concepts facilitate the definition of other decidable classes of first-order sentences. The paper presents a second fragment which is novel, has a decidable satisfiability problem, and properly contains the Ackermann fragment and---once more---the relational monadic fragment. The definition is again characterized by restrictions on the occurrences of variables in atoms. More precisely, after certain transformations, Skolemization yields only unary functions and constants, and every atom contains at most one universally quantified variable. An effective satisfiability-preserving translation into the monadic fragment is devised and employed to prove decidability of the associated satisfiability problem.},
}

Endnote

%0 Report
%A Voigt, Marco
%+ Automation of Logic, MPI for Informatics, Max Planck Society
%T On Generalizing Decidable Standard Prefix Classes of First-Order Logic :
%G eng
%U http://hdl.handle.net/21.11116/0000-0002-EFAE-E
%U http://arxiv.org/abs/1706.03949
%D 2017
%X Recently, the separated fragment (SF) of first-order logic has been
introduced. Its defining principle is that universally and existentially
quantified variables may not occur together in atoms. SF properly generalizes
both the Bernays-Sch\"onfinkel-Ramsey (BSR) fragment and the relational monadic
fragment. In this paper the restrictions on variable occurrences in SF
sentences are relaxed such that universally and existentially quantified
variables may occur together in the same atom under certain conditions. Still,
satisfiability can be decided. This result is established in two ways: firstly,
by an effective equivalence-preserving translation into the BSR fragment, and,
secondly, by a model-theoretic argument.
Slight modifications to the described concepts facilitate the definition of
other decidable classes of first-order sentences. The paper presents a second
fragment which is novel, has a decidable satisfiability problem, and properly
contains the Ackermann fragment and---once more---the relational monadic
fragment. The definition is again characterized by restrictions on the
occurrences of variables in atoms. More precisely, after certain
transformations, Skolemization yields only unary functions and constants, and
every atom contains at most one universally quantified variable. An effective
satisfiability-preserving translation into the monadic fragment is devised and
employed to prove decidability of the associated satisfiability problem.
%K Computer Science, Logic in Computer Science, cs.LO

Voigt, M. (2017e). The Bernays-Schönfinkel-Ramsey Fragment with Bounded Difference Constraints over the Reals is Decidable. Retrieved from http://arxiv.org/abs/1706.08504

(arXiv: 1706.08504) Abstract

First-order linear real arithmetic enriched with uninterpreted predicate
symbols yields an interesting modeling language. However, satisfiability of
such formulas is undecidable, even if we restrict the uninterpreted predicate
symbols to arity one. In order to find decidable fragments of this language, it
is necessary to restrict the expressiveness of the arithmetic part. One
possible path is to confine arithmetic expressions to difference constraints of
the form $x - y \mathrel{\#} c$, where $\#$ ranges over the standard relations
$<, \leq, =, \neq, \geq, >$ and $x,y$ are universally quantified. However, it
is known that combining difference constraints with uninterpreted predicate
symbols yields an undecidable satisfiability problem again. In this paper, it
is shown that satisfiability becomes decidable if we in addition bound the
ranges of universally quantified variables. As bounded intervals over the reals
still comprise infinitely many values, a trivial instantiation procedure is not
sufficient to solve the problem.

Export

BibTeX

@online{Voigt_arXIv1706.08504,
TITLE = {The {B}ernays--{S}ch{\"o}nfinkel--{R}amsey {Fragment with Bounded Difference Constraints over the Reals Is Decidable}},
AUTHOR = {Voigt, Marco},
LANGUAGE = {eng},
URL = {http://arxiv.org/abs/1706.08504},
EPRINT = {1706.08504},
EPRINTTYPE = {arXiv},
YEAR = {2017},
MARGINALMARK = {$\bullet$},
ABSTRACT = {First-order linear real arithmetic enriched with uninterpreted predicate symbols yields an interesting modeling language. However, satisfiability of such formulas is undecidable, even if we restrict the uninterpreted predicate symbols to arity one. In order to find decidable fragments of this language, it is necessary to restrict the expressiveness of the arithmetic part. One possible path is to confine arithmetic expressions to difference constraints of the form $x -- y \mathrel{\#} c$, where $\#$ ranges over the standard relations $<, \leq, =, \neq, \geq, >$ and $x,y$ are universally quantified. However, it is known that combining difference constraints with uninterpreted predicate symbols yields an undecidable satisfiability problem again. In this paper, it is shown that satisfiability becomes decidable if we in addition bound the ranges of universally quantified variables. As bounded intervals over the reals still comprise infinitely many values, a trivial instantiation procedure is not sufficient to solve the problem.},
}

Endnote

%0 Report
%A Voigt, Marco
%+ Automation of Logic, MPI for Informatics, Max Planck Society
%T The Bernays-Schönfinkel-Ramsey Fragment with Bounded Difference
Constraints over the Reals is Decidable :
%G eng
%U http://hdl.handle.net/21.11116/0000-0002-EFBD-D
%U http://arxiv.org/abs/1706.08504
%D 2017
%X First-order linear real arithmetic enriched with uninterpreted predicate
symbols yields an interesting modeling language. However, satisfiability of
such formulas is undecidable, even if we restrict the uninterpreted predicate
symbols to arity one. In order to find decidable fragments of this language, it
is necessary to restrict the expressiveness of the arithmetic part. One
possible path is to confine arithmetic expressions to difference constraints of
the form $x - y \mathrel{\#} c$, where $\#$ ranges over the standard relations
$<, \leq, =, \neq, \geq, >$ and $x,y$ are universally quantified. However, it
is known that combining difference constraints with uninterpreted predicate
symbols yields an undecidable satisfiability problem again. In this paper, it
is shown that satisfiability becomes decidable if we in addition bound the
ranges of universally quantified variables. As bounded intervals over the reals
still comprise infinitely many values, a trivial instantiation procedure is not
sufficient to solve the problem.
%K Computer Science, Logic in Computer Science, cs.LO

Voigt, M. (2017f). Towards Elimination of Second-Order Quantifiers in the Separated Fragment. In

*Proceedings of the Workshop on Second-Order Quantifier Elimination and Related Topics (SOQE 2017)*. Dresden, Germany: CEUR-WS. Retrieved from urn:nbn:de:0074-2013-7Export

BibTeX

@inproceedings{Voigt_SOQE2017,
TITLE = {Towards Elimination of Second-Order Quantifiers in the Separated Fragment},
AUTHOR = {Voigt, Marco},
LANGUAGE = {eng},
URL = {urn:nbn:de:0074-2013-7},
PUBLISHER = {CEUR-WS},
YEAR = {2018},
MARGINALMARK = {$\bullet$},
BOOKTITLE = {Proceedings of the Workshop on Second-Order Quantifier Elimination and Related Topics (SOQE 2017)},
EDITOR = {Koopmann, Patrick and Rudolph, Sebastian and Schmidt, Renate A. and Wernhard, Christoph},
PAGES = {67--81},
EID = {16},
SERIES = {CEUR Workshop Proceedings},
VOLUME = {2013},
ADDRESS = {Dresden, Germany},
}

Endnote

%0 Conference Proceedings
%A Voigt, Marco
%+ Automation of Logic, MPI for Informatics, Max Planck Society
%T Towards Elimination of Second-Order Quantifiers in the Separated Fragment :
%G eng
%U http://hdl.handle.net/21.11116/0000-0002-EFA3-9
%D 2017
%B Workshop on Second-Order Quantifier Elimination and Related Topics
%Z date of event: 2018-12-06 - 2018-12-08
%C Dresden, Germany
%B Proceedings of the Workshop on Second-Order Quantifier Elimination and Related Topics
%E Koopmann, Patrick; Rudolph, Sebastian; Schmidt, Renate A.; Wernhard, Christoph
%P 67 - 81
%Z sequence number: 16
%I CEUR-WS
%B CEUR Workshop Proceedings
%N 2013
%U http://ceur-ws.org/Vol-2013/paper16.pdf

Wand, D. (2017).

*Superposition: Types and Induction*. Universität des Saarlandes, Saarbrücken. Retrieved from urn:nbn:de:bsz:291-scidok-69522Abstract

Proof assistants are becoming widespread for formalization of theories both in computer science and mathematics. They provide rich logics with powerful type systems and machine-checked proofs which increase the confidence in the correctness in complicated and detailed proofs.
However, they incur a significant overhead compared to pen-and-paper proofs.
This thesis describes work on bridging the gap between high-order proof assistants and first-order automated theorem provers by extending the capabilities of the automated theorem provers to provide features usually found in proof assistants.
My first contribution is the development and implementation of a first-order superposition calculus with a polymorphic type system that supports type classes and the accompanying refutational completeness proof for that calculus. The inclusion of the type system into the superposition calculus and solvers completely removes the type encoding overhead when encoding problems from many proof assistants.
My second contribution is the development of SupInd, an extension of the typed superposition calculus that supports data types and structural induction over those data types. It includes heuristics that guide the induction and conjecture strengthening techniques, which can be applied independently of the underlying calculus.
I have implemented the contributions in a tool called Pirate. The evaluations of both contributions show promising results.

Export

BibTeX

@phdthesis{wandphd2017,
TITLE = {Superposition: Types and Induction},
AUTHOR = {Wand, Daniel},
LANGUAGE = {eng},
URL = {urn:nbn:de:bsz:291-scidok-69522},
SCHOOL = {Universit{\"a}t des Saarlandes},
ADDRESS = {Saarbr{\"u}cken},
YEAR = {2017},
MARGINALMARK = {$\bullet$},
DATE = {2017},
ABSTRACT = {Proof assistants are becoming widespread for formalization of theories both in computer science and mathematics. They provide rich logics with powerful type systems and machine-checked proofs which increase the confidence in the correctness in complicated and detailed proofs. However, they incur a significant overhead compared to pen-and-paper proofs. This thesis describes work on bridging the gap between high-order proof assistants and first-order automated theorem provers by extending the capabilities of the automated theorem provers to provide features usually found in proof assistants. My first contribution is the development and implementation of a first-order superposition calculus with a polymorphic type system that supports type classes and the accompanying refutational completeness proof for that calculus. The inclusion of the type system into the superposition calculus and solvers completely removes the type encoding overhead when encoding problems from many proof assistants. My second contribution is the development of SupInd, an extension of the typed superposition calculus that supports data types and structural induction over those data types. It includes heuristics that guide the induction and conjecture strengthening techniques, which can be applied independently of the underlying calculus. I have implemented the contributions in a tool called Pirate. The evaluations of both contributions show promising results.},
}

Endnote

%0 Thesis
%A Wand, Daniel
%Y Weidenbach, Christoph
%A referee: Blanchette, Jasmin Christian
%A referee: Sutcliffe, Geoff
%+ Automation of Logic, MPI for Informatics, Max Planck Society
International Max Planck Research School, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T Superposition: Types and Induction :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-002D-E99C-5
%U urn:nbn:de:bsz:291-scidok-69522
%I Universität des Saarlandes
%C Saarbrücken
%D 2017
%P x, 167 p.
%V phd
%9 phd
%X Proof assistants are becoming widespread for formalization of theories both in computer science and mathematics. They provide rich logics with powerful type systems and machine-checked proofs which increase the confidence in the correctness in complicated and detailed proofs.
However, they incur a significant overhead compared to pen-and-paper proofs.
This thesis describes work on bridging the gap between high-order proof assistants and first-order automated theorem provers by extending the capabilities of the automated theorem provers to provide features usually found in proof assistants.
My first contribution is the development and implementation of a first-order superposition calculus with a polymorphic type system that supports type classes and the accompanying refutational completeness proof for that calculus. The inclusion of the type system into the superposition calculus and solvers completely removes the type encoding overhead when encoding problems from many proof assistants.
My second contribution is the development of SupInd, an extension of the typed superposition calculus that supports data types and structural induction over those data types. It includes heuristics that guide the induction and conjecture strengthening techniques, which can be applied independently of the underlying calculus.
I have implemented the contributions in a tool called Pirate. The evaluations of both contributions show promising results.
%U http://scidok.sulb.uni-saarland.de/volltexte/2017/6952/http://scidok.sulb.uni-saarland.de/doku/lic_ohne_pod.php?la=de

Weidenbach, C. (2017). Do Portfolio Solvers Harm? In

*ARCADE 2017*. Gothenburg, Sweden. doi:10.29007/vpxmExport

BibTeX

@inproceedings{Weidenbach_ARCADE2017,
TITLE = {Do Portfolio Solvers Harm?},
AUTHOR = {Weidenbach, Christoph},
LANGUAGE = {eng},
DOI = {10.29007/vpxm},
YEAR = {2017},
MARGINALMARK = {$\bullet$},
BOOKTITLE = {ARCADE 2017},
EDITOR = {Reger, Giles and Traytel, Dmitriy},
PAGES = {76--81},
SERIES = {EPiC Series in Computing},
VOLUME = {51},
ADDRESS = {Gothenburg, Sweden},
}

Endnote

%0 Conference Proceedings
%A Weidenbach, Christoph
%+ Automation of Logic, MPI for Informatics, Max Planck Society
%T Do Portfolio Solvers Harm? :
%G eng
%U http://hdl.handle.net/21.11116/0000-0000-3C43-2
%R 10.29007/vpxm
%D 2017
%B 1st International Workshop on Automated Reasoning
%Z date of event: 2017-08-06 - 2017-08-06
%C Gothenburg, Sweden
%B ARCADE 2017
%E Reger, Giles; Traytel, Dmitriy
%P 76 - 81
%B EPiC Series in Computing
%N 51

2016

Ábrahám, E., Abbott, J., Becker, B., Bigatti, A. M., Brain, M., Buchberger, B., … Sturm, T. (2016a). Satisfiability Checking and Symbolic Computation.

*ACM Communications in Computer Algebra*,*50*(4). doi:10.1145/3055282.3055285Export

BibTeX

@article{AbrahamCCA2016,
TITLE = {Satisfiability Checking and Symbolic Computation},
AUTHOR = {{\'A}brah{\'a}m, Erika and Abbott, John and Becker, Bernd and Bigatti, Anna M. and Brain, Martin and Buchberger, Bruno and Cimatti, Alessandro and Davenport, James H. and England, Matthew and Fontaine, Pascal and Forrest, Stephen and Griggio, Alberto and Kroening, Daniel and Seiler, Werner M. and Sturm, Thomas},
LANGUAGE = {eng},
DOI = {10.1145/3055282.3055285},
PUBLISHER = {ACM},
ADDRESS = {New York, NY},
YEAR = {2016},
DATE = {2016},
JOURNAL = {ACM Communications in Computer Algebra},
VOLUME = {50},
NUMBER = {4},
PAGES = {145--147},
}

Endnote

%0 Journal Article
%A Ábrahám, Erika
%A Abbott, John
%A Becker, Bernd
%A Bigatti, Anna M.
%A Brain, Martin
%A Buchberger, Bruno
%A Cimatti, Alessandro
%A Davenport, James H.
%A England, Matthew
%A Fontaine, Pascal
%A Forrest, Stephen
%A Griggio, Alberto
%A Kroening, Daniel
%A Seiler, Werner M.
%A Sturm, Thomas
%+ External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
%T Satisfiability Checking and Symbolic Computation :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-002C-8ACA-3
%R 10.1145/3055282.3055285
%7 2016
%D 2016
%J ACM Communications in Computer Algebra
%V 50
%N 4
%& 145
%P 145 - 147
%I ACM
%C New York, NY

Ábrahám, E., Abbott, J., Becker, B., Bigatti, A. M., Brain, M., Buchberger, B., … Sturm, T. (2016b). Satisfiability Checking and Symbolic Computation. Retrieved from http://arxiv.org/abs/1607.06945

(arXiv: 1607.06945) Abstract

Symbolic Computation and Satisfiability Checking are viewed as individual
research areas, but they share common interests in the development,
implementation and application of decision procedures for arithmetic theories.
Despite these commonalities, the two communities are currently only weakly
connected. We introduce a new project SC-square to build a joint community in
this area, supported by a newly accepted EU (H2020-FETOPEN-CSA) project of the
same name. We aim to strengthen the connection between these communities by
creating common platforms, initiating interaction and exchange, identifying
common challenges, and developing a common roadmap. This abstract and
accompanying poster describes the motivation and aims for the project, and
reports on the first activities.

Export

BibTeX

@online{Sturm1607.06945,
TITLE = {Satisfiability Checking and Symbolic Computation},
AUTHOR = {{\'A}brah{\'a}m, Erika and Abbott, John and Becker, Bernd and Bigatti, Anna M. and Brain, Martin and Buchberger, Bruno and Cimatti, Alessandro and Davenport, James H. and England, Matthew and Fontaine, Pascal and Forrest, Stephen and Griggio, Alberto and Kroening, Daniel and Seiler, Werner M. and Sturm, Thomas},
LANGUAGE = {eng},
URL = {http://arxiv.org/abs/1607.06945},
EPRINT = {1607.06945},
EPRINTTYPE = {arXiv},
YEAR = {2016},
ABSTRACT = {Symbolic Computation and Satisfiability Checking are viewed as individual research areas, but they share common interests in the development, implementation and application of decision procedures for arithmetic theories. Despite these commonalities, the two communities are currently only weakly connected. We introduce a new project SC-square to build a joint community in this area, supported by a newly accepted EU (H2020-FETOPEN-CSA) project of the same name. We aim to strengthen the connection between these communities by creating common platforms, initiating interaction and exchange, identifying common challenges, and developing a common roadmap. This abstract and accompanying poster describes the motivation and aims for the project, and reports on the first activities.},
}

Endnote

%0 Report
%A Ábrahám, Erika
%A Abbott, John
%A Becker, Bernd
%A Bigatti, Anna M.
%A Brain, Martin
%A Buchberger, Bruno
%A Cimatti, Alessandro
%A Davenport, James H.
%A England, Matthew
%A Fontaine, Pascal
%A Forrest, Stephen
%A Griggio, Alberto
%A Kroening, Daniel
%A Seiler, Werner M.
%A Sturm, Thomas
%+ External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
%T Satisfiability Checking and Symbolic Computation :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-002B-A959-7
%U http://arxiv.org/abs/1607.06945
%D 2016
%X Symbolic Computation and Satisfiability Checking are viewed as individual
research areas, but they share common interests in the development,
implementation and application of decision procedures for arithmetic theories.
Despite these commonalities, the two communities are currently only weakly
connected. We introduce a new project SC-square to build a joint community in
this area, supported by a newly accepted EU (H2020-FETOPEN-CSA) project of the
same name. We aim to strengthen the connection between these communities by
creating common platforms, initiating interaction and exchange, identifying
common challenges, and developing a common roadmap. This abstract and
accompanying poster describes the motivation and aims for the project, and
reports on the first activities.
%K Computer Science, Symbolic Computation, cs.SC,Computer Science, Logic in Computer Science, cs.LO

Ábrahám, E., Abbott, J., Becker, B., Bigatti, A. M., Brain, M., Buchberger, B., … Sturm, T. (2016c). SC2: Satisfiability Checking Meets Symbolic Computation. In

*Intelligent Computer Mathematics (CICM 2016)*. Bialystok, Poland: Springer. doi:10.1007/978-3-319-42547-4_3Export

BibTeX

@inproceedings{Abraham_CICM2016,
TITLE = {${SC}^{2}$: {S}atisfiability Checking Meets Symbolic Computation},
AUTHOR = {{\'A}brah{\'a}m, Erika and Abbott, John and Becker, Bernd and Bigatti, Anna M. and Brain, Martin and Buchberger, Bruno and Cimatti, Allesandro and Davenport, James H. and England, Matthew and Fontaine, Pascal and Forrest, Stephen and Griggio, Alberto and Kroening, Daniel and Seiler, Werner M. and Sturm, Thomas},
LANGUAGE = {eng},
ISBN = {978-3-319-42546-7},
DOI = {10.1007/978-3-319-42547-4_3},
PUBLISHER = {Springer},
YEAR = {2016},
DATE = {2016},
BOOKTITLE = {Intelligent Computer Mathematics (CICM 2016)},
EDITOR = {Kohlhase, Michael and Johansson, Moa and Miller, Bruce and de Moura, Leonardo and Tompa, Frank},
PAGES = {28--43},
SERIES = {Lecture Notes in Artificial Intelligence},
VOLUME = {9791},
ADDRESS = {Bialystok, Poland},
}

Endnote

%0 Conference Proceedings
%A Ábrahám, Erika
%A Abbott, John
%A Becker, Bernd
%A Bigatti, Anna M.
%A Brain, Martin
%A Buchberger, Bruno
%A Cimatti, Allesandro
%A Davenport, James H.
%A England, Matthew
%A Fontaine, Pascal
%A Forrest, Stephen
%A Griggio, Alberto
%A Kroening, Daniel
%A Seiler, Werner M.
%A Sturm, Thomas
%+ External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
%T SC2: Satisfiability Checking Meets Symbolic Computation : Project Paper
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-002B-0A83-3
%R 10.1007/978-3-319-42547-4_3
%D 2016
%B 9th International Conference on Intelligent Computer Mathematics
%Z date of event: 2016-07-25 - 2016-07-29
%C Bialystok, Poland
%B Intelligent Computer Mathematics
%E Kohlhase, Michael; Johansson, Moa; Miller, Bruce; de Moura, Leonardo; Tompa, Frank
%P 28 - 43
%I Springer
%@ 978-3-319-42546-7
%B Lecture Notes in Artificial Intelligence
%N 9791

Ábrahám, E., Abbott, J., Becker, B., Bigatti, A. M., Brain, M., Buchberger, B., … Sturm, T. (2016d). SC2: Satisfiability Checking meets Symbolic Computation (Project Paper). Retrieved from http://arxiv.org/abs/1607.08028

(arXiv: 1607.08028) Abstract

Symbolic Computation and Satisfiability Checking are two research areas, both
having their individual scientific focus but sharing also common interests in
the development, implementation and application of decision procedures for
arithmetic theories. Despite their commonalities, the two communities are
rather weakly connected. The aim of our newly accepted SC-square project
(H2020-FETOPEN-CSA) is to strengthen the connection between these communities
by creating common platforms, initiating interaction and exchange, identifying
common challenges, and developing a common roadmap from theory along the way to
tools and (industrial) applications. In this paper we report on the aims and on
the first activities of this project, and formalise some relevant challenges
for the unified SC-square community.

Export

BibTeX

@online{Sturm1607.08028,
TITLE = {${SC}^{2}$: {S}atisfiability Checking meets Symbolic Computation (Project Paper)},
AUTHOR = {{\'A}brah{\'a}m, Erika and Abbott, John and Becker, Bernd and Bigatti, Anna M. and Brain, Martin and Buchberger, Bruno and Cimatti, Alessandro and Davenport, James H. and England, Matthew and Fontaine, Pascal and Forrest, Stephen and Griggio, Alberto and Kroening, Daniel and Seiler, Werner M. and Sturm, Thomas},
LANGUAGE = {eng},
URL = {http://arxiv.org/abs/1607.08028},
EPRINT = {1607.08028},
EPRINTTYPE = {arXiv},
YEAR = {2016},
ABSTRACT = {Symbolic Computation and Satisfiability Checking are two research areas, both having their individual scientific focus but sharing also common interests in the development, implementation and application of decision procedures for arithmetic theories. Despite their commonalities, the two communities are rather weakly connected. The aim of our newly accepted SC-square project (H2020-FETOPEN-CSA) is to strengthen the connection between these communities by creating common platforms, initiating interaction and exchange, identifying common challenges, and developing a common roadmap from theory along the way to tools and (industrial) applications. In this paper we report on the aims and on the first activities of this project, and formalise some relevant challenges for the unified SC-square community.},
}

Endnote

%0 Report
%A Ábrahám, Erika
%A Abbott, John
%A Becker, Bernd
%A Bigatti, Anna M.
%A Brain, Martin
%A Buchberger, Bruno
%A Cimatti, Alessandro
%A Davenport, James H.
%A England, Matthew
%A Fontaine, Pascal
%A Forrest, Stephen
%A Griggio, Alberto
%A Kroening, Daniel
%A Seiler, Werner M.
%A Sturm, Thomas
%+ External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
%T SC2: Satisfiability Checking meets Symbolic Computation (Project Paper) :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-002B-A967-7
%U http://arxiv.org/abs/1607.08028
%D 2016
%X Symbolic Computation and Satisfiability Checking are two research areas, both
having their individual scientific focus but sharing also common interests in
the development, implementation and application of decision procedures for
arithmetic theories. Despite their commonalities, the two communities are
rather weakly connected. The aim of our newly accepted SC-square project
(H2020-FETOPEN-CSA) is to strengthen the connection between these communities
by creating common platforms, initiating interaction and exchange, identifying
common challenges, and developing a common roadmap from theory along the way to
tools and (industrial) applications. In this paper we report on the aims and on
the first activities of this project, and formalise some relevant challenges
for the unified SC-square community.
%K Computer Science, Symbolic Computation, cs.SC,Computer Science, Logic in Computer Science, cs.LO

Althaus, E., Beber, B., Damm, W., Disch, S., Hagemann, W., Rakow, A., … Wirtz, B. (2016).

*Verification of Linear Hybrid Systems with Large Discrete State Spaces: Exploring the Design Space for Optimization*(No. ATR103). SFB/TR 14 AVACS.Abstract

This paper provides a suite of optimization techniques for
the verification of safety properties of linear hybrid
automata with large discrete state spaces, such as
naturally arising when incorporating health state
monitoring and degradation levels into the controller
design. Such models can -- in contrast to purely functional
controller models -- not analyzed with hybrid verification
engines relying on explicit representations of modes, but
require fully symbolic representations for both the
continuous and discrete part of the state space. The
optimization techniques shown yield consistently a speedup
of about 20 against previously published results for a
similar benchmark suite, and complement these with new
results on counterexample guided abstraction refinement. In
combination with the methods guaranteeing preciseness of
abstractions, this allows to significantly extend the class
of models for which safety can be established, covering in
particular models with 23 continuous variables and 2 to the
71 discrete states, 20 continuous variables and 2 to the
199 discrete states, and 9 continuous variables and 2 to
the 271 discrete states.

Export

BibTeX

@techreport{AlthausBeberDammEtAl2016ATR,
TITLE = {Verification of Linear Hybrid Systems with Large Discrete State Spaces: Exploring the Design Space for Optimization},
AUTHOR = {Althaus, Ernst and Beber, Bj{\"o}rn and Damm, Werner and Disch, Stefan and Hagemann, Willem and Rakow, Astrid and Scholl, Christoph and Waldmann, Uwe and Wirtz, Boris},
LANGUAGE = {eng},
ISSN = {1860-9821},
NUMBER = {ATR103},
INSTITUTION = {SFB/TR 14 AVACS},
YEAR = {2016},
DATE = {2016},
ABSTRACT = {This paper provides a suite of optimization techniques for the verification of safety properties of linear hybrid automata with large discrete state spaces, such as naturally arising when incorporating health state monitoring and degradation levels into the controller design. Such models can -- in contrast to purely functional controller models -- not analyzed with hybrid verification engines relying on explicit representations of modes, but require fully symbolic representations for both the continuous and discrete part of the state space. The optimization techniques shown yield consistently a speedup of about 20 against previously published results for a similar benchmark suite, and complement these with new results on counterexample guided abstraction refinement. In combination with the methods guaranteeing preciseness of abstractions, this allows to significantly extend the class of models for which safety can be established, covering in particular models with 23 continuous variables and 2 to the 71 discrete states, 20 continuous variables and 2 to the 199 discrete states, and 9 continuous variables and 2 to the 271 discrete states.},
TYPE = {AVACS Technical Report},
VOLUME = {103},
}

Endnote

%0 Report
%A Althaus, Ernst
%A Beber, Björn
%A Damm, Werner
%A Disch, Stefan
%A Hagemann, Willem
%A Rakow, Astrid
%A Scholl, Christoph
%A Waldmann, Uwe
%A Wirtz, Boris
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
International Max Planck Research School, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
%T Verification of Linear Hybrid Systems with Large Discrete
State Spaces: Exploring the Design Space for Optimization :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-002C-4540-0
%Y SFB/TR 14 AVACS
%D 2016
%P 93 p.
%X This paper provides a suite of optimization techniques for
the verification of safety properties of linear hybrid
automata with large discrete state spaces, such as
naturally arising when incorporating health state
monitoring and degradation levels into the controller
design. Such models can -- in contrast to purely functional
controller models -- not analyzed with hybrid verification
engines relying on explicit representations of modes, but
require fully symbolic representations for both the
continuous and discrete part of the state space. The
optimization techniques shown yield consistently a speedup
of about 20 against previously published results for a
similar benchmark suite, and complement these with new
results on counterexample guided abstraction refinement. In
combination with the methods guaranteeing preciseness of
abstractions, this allows to significantly extend the class
of models for which safety can be established, covering in
particular models with 23 continuous variables and 2 to the
71 discrete states, 20 continuous variables and 2 to the
199 discrete states, and 9 continuous variables and 2 to
the 271 discrete states.
%B AVACS Technical Report
%N 103
%@ false
%U http://www.avacs.org/fileadmin/Publikationen/Open/avacs_technical_report_103.pdf

Azmy, N. (2016).

*A Machine-checked Proof of Correctness of Pastry*. Universität des Saarlandes, Saarbrücken. Retrieved from urn:nbn:de:bsz:291-scidok-67309Abstract

A distributed hash table (DHT) is a peer-to-peer network that offers the function of a classic hash table, but where different key-value pairs are stored at different nodes on the network. Like a classic hash table, the main function provided by a DHT is key lookup, which retrieves the value stored at a given key.
Examples of DHT protocols include Chord, Pastry, Kademlia and Tapestry.
Such DHT protocols certain correctness and performance guarantees, but formal verification typically discovers border cases that violate those guarantees. In his PhD thesis, Tianxiang Lu reported correctness problems in published versions of Pastry and developed a model called LuPastry, for which he provided a partial proof of correct delivery of lookup messages assuming no node failure, mechanized in the TLA+ Proof System. In analyzing Lu's proof, I discovered that it contained unproven assumptions, and found counterexamples to several of these assumptions. The contribution of this thesis is threefold. First, I present LuPastry+, a revised TLA+ specification of LuPastry. Aside from needed bug fixes, LuPastry+ contains new definitions that make the specification more modular and significantly improve proof automation. Second, I present a complete TLA+ proof of correct delivery for LuPastry+. Third, I prove that the final step of the node join process of LuPastry/LuPastry+ is not necessary to achieve consistency. In particular, I develop a new specification with a simpler node join process, which I denote by Simplified LuPastry+, and prove correct delivery of lookup messages for this new specification. The proof of correctness of Simplified LuPastry+ is written by reusing the proof for LuPastry+, which represents a success story in proof reuse, especially for proofs of this size.
Each of the two proofs amounts to over 32,000 proof steps; to my knowledge, they are currently the largest proofs written in the TLA+ language, and---together with Lu's proof---the only examples of applying full theorem proving for the verification of DHT protocols

Export

BibTeX

@phdthesis{Azmyphd16,
TITLE = {A Machine-checked Proof of Correctness of Pastry},
AUTHOR = {Azmy, Noran},
LANGUAGE = {eng},
URL = {urn:nbn:de:bsz:291-scidok-67309},
SCHOOL = {Universit{\"a}t des Saarlandes},
ADDRESS = {Saarbr{\"u}cken},
YEAR = {2016},
DATE = {2016},
ABSTRACT = {A distributed hash table (DHT) is a peer-to-peer network that offers the function of a classic hash table, but where different key-value pairs are stored at different nodes on the network. Like a classic hash table, the main function provided by a DHT is key lookup, which retrieves the value stored at a given key. Examples of DHT protocols include Chord, Pastry, Kademlia and Tapestry. Such DHT protocols certain correctness and performance guarantees, but formal verification typically discovers border cases that violate those guarantees. In his PhD thesis, Tianxiang Lu reported correctness problems in published versions of Pastry and developed a model called LuPastry, for which he provided a partial proof of correct delivery of lookup messages assuming no node failure, mechanized in the TLA+ Proof System. In analyzing Lu's proof, I discovered that it contained unproven assumptions, and found counterexamples to several of these assumptions. The contribution of this thesis is threefold. First, I present LuPastry+, a revised TLA+ specification of LuPastry. Aside from needed bug fixes, LuPastry+ contains new definitions that make the specification more modular and significantly improve proof automation. Second, I present a complete TLA+ proof of correct delivery for LuPastry+. Third, I prove that the final step of the node join process of LuPastry/LuPastry+ is not necessary to achieve consistency. In particular, I develop a new specification with a simpler node join process, which I denote by Simplified LuPastry+, and prove correct delivery of lookup messages for this new specification. The proof of correctness of Simplified LuPastry+ is written by reusing the proof for LuPastry+, which represents a success story in proof reuse, especially for proofs of this size. Each of the two proofs amounts to over 32,000 proof steps; to my knowledge, they are currently the largest proofs written in the TLA+ language, and---together with Lu's proof---the only examples of applying full theorem proving for the verification of DHT protocols},
}

Endnote

%0 Thesis
%A Azmy, Noran
%Y Weidenbach, Christoph
%A referee: Merz, Stephan
%+ Automation of Logic, MPI for Informatics, Max Planck Society
International Max Planck Research School, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
%T A Machine-checked Proof of Correctness of Pastry :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-002C-3BAD-9
%U urn:nbn:de:bsz:291-scidok-67309
%I Universität des Saarlandes
%C Saarbrücken
%D 2016
%P ix, 119 p.
%V phd
%9 phd
%X A distributed hash table (DHT) is a peer-to-peer network that offers the function of a classic hash table, but where different key-value pairs are stored at different nodes on the network. Like a classic hash table, the main function provided by a DHT is key lookup, which retrieves the value stored at a given key.
Examples of DHT protocols include Chord, Pastry, Kademlia and Tapestry.
Such DHT protocols certain correctness and performance guarantees, but formal verification typically discovers border cases that violate those guarantees. In his PhD thesis, Tianxiang Lu reported correctness problems in published versions of Pastry and developed a model called LuPastry, for which he provided a partial proof of correct delivery of lookup messages assuming no node failure, mechanized in the TLA+ Proof System. In analyzing Lu's proof, I discovered that it contained unproven assumptions, and found counterexamples to several of these assumptions. The contribution of this thesis is threefold. First, I present LuPastry+, a revised TLA+ specification of LuPastry. Aside from needed bug fixes, LuPastry+ contains new definitions that make the specification more modular and significantly improve proof automation. Second, I present a complete TLA+ proof of correct delivery for LuPastry+. Third, I prove that the final step of the node join process of LuPastry/LuPastry+ is not necessary to achieve consistency. In particular, I develop a new specification with a simpler node join process, which I denote by Simplified LuPastry+, and prove correct delivery of lookup messages for this new specification. The proof of correctness of Simplified LuPastry+ is written by reusing the proof for LuPastry+, which represents a success story in proof reuse, especially for proofs of this size.
Each of the two proofs amounts to over 32,000 proof steps; to my knowledge, they are currently the largest proofs written in the TLA+ language, and---together with Lu's proof---the only examples of applying full theorem proving for the verification of DHT protocols
%U http://scidok.sulb.uni-saarland.de/volltexte/2017/6730/http://scidok.sulb.uni-saarland.de/doku/lic_ohne_pod.php?la=de

Azmy, N., Merz, S., & Weidenbach, C. (2016). A Rigorous Correctness Proof for Pastry. In

*Abstract State Machines, Alloy, B, TLA, VDM, and Z (ABZ 2016)*. Linz, Austria: Springer. doi:10.1007/978-3-319-33600-8_5Export

BibTeX

@inproceedings{AzmyABZ2016,
TITLE = {A Rigorous Correctness Proof for {Pastry}},
AUTHOR = {Azmy, Noran and Merz, Stephan and Weidenbach, Christoph},
LANGUAGE = {eng},
ISBN = {978-3-319-33599-5},
DOI = {10.1007/978-3-319-33600-8_5},
PUBLISHER = {Springer},
YEAR = {2016},
DATE = {2016},
BOOKTITLE = {Abstract State Machines, Alloy, B, TLA, VDM, and Z (ABZ 2016)},
EDITOR = {Butler, Michael and Schewe, Klaus-Dieter and Mashkoor, Atif and Biro, Miklos},
PAGES = {86--101},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {9675},
ADDRESS = {Linz, Austria},
}

Endnote

%0 Conference Proceedings
%A Azmy, Noran
%A Merz, Stephan
%A Weidenbach, Christoph
%+ Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
%T A Rigorous Correctness Proof for Pastry :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-002B-01C5-C
%R 10.1007/978-3-319-33600-8_5
%D 2016
%B 5th International ABZ Conference
%Z date of event: 2016-05-23 - 2016-05-27
%C Linz, Austria
%B Abstract State Machines, Alloy, B, TLA, VDM, and Z
%E Butler, Michael; Schewe, Klaus-Dieter; Mashkoor, Atif; Biro, Miklos
%P 86 - 101
%I Springer
%@ 978-3-319-33599-5
%B Lecture Notes in Computer Science
%N 9675

Blanchette, J. C., Fleury, M., & Weidenbach, C. (2016). A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality. In

*Automated Reasoning (IJCAR 2016)*. Coimbra, Portugal: Springer. doi:10.1007/978-3-319-40229-1_4Export

BibTeX

@inproceedings{BlanchetteIJCAR2016,
TITLE = {A Verified {SAT} Solver Framework with Learn, Forget, Restart, and Incrementality},
AUTHOR = {Blanchette, Jasmin Christian and Fleury, Mathias and Weidenbach, Christoph},
LANGUAGE = {eng},
ISBN = {978-3-319-40228-4},
DOI = {10.1007/978-3-319-40229-1_4},
PUBLISHER = {Springer},
YEAR = {2016},
DATE = {2016},
BOOKTITLE = {Automated Reasoning (IJCAR 2016)},
EDITOR = {Olivetti, Nicola and Tiwari, Ashish},
PAGES = {25--44},
SERIES = {Lecture Notes in Artificial Intelligence},
VOLUME = {9706},
ADDRESS = {Coimbra, Portugal},
}

Endnote

%0 Conference Proceedings
%A Blanchette, Jasmin Christian
%A Fleury, Mathias
%A Weidenbach, Christoph
%+ Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-002B-01C7-8
%R 10.1007/978-3-319-40229-1_4
%D 2016
%B 8th International Joint Conference on Automated Reasoning
%Z date of event: 2016-06-27 - 2016-07-02
%C Coimbra, Portugal
%B Automated Reasoning
%E Olivetti, Nicola; Tiwari, Ashish
%P 25 - 44
%I Springer
%@ 978-3-319-40228-4
%B Lecture Notes in Artificial Intelligence
%N 9706

Blanchette, J. C., Böhme, S., Fleury, M., Smolka, S. J., & Steckermeier, A. (2016). Semi-intelligible Isar Proofs from Machine-Generated Proofs.

*Journal of Automated Reasoning*,*56*(2). doi:10.1007/s10817-015-9335-3Export

BibTeX

@article{BlanchetteJAR2016,
TITLE = {Semi-intelligible {Isar} Proofs from Machine-Generated Proofs},
AUTHOR = {Blanchette, Jasmin Christian and B{\"o}hme, Sascha and Fleury, Mathias and Smolka, Steffen Juilf and Steckermeier, Albert},
LANGUAGE = {eng},
ISSN = {0168-7433},
DOI = {10.1007/s10817-015-9335-3},
PUBLISHER = {Springer},
ADDRESS = {Dordrecht},
YEAR = {2016},
DATE = {2016},
JOURNAL = {Journal of Automated Reasoning},
VOLUME = {56},
NUMBER = {2},
PAGES = {155--200},
}

Endnote

%0 Journal Article
%A Blanchette, Jasmin Christian
%A Böhme, Sascha
%A Fleury, Mathias
%A Smolka, Steffen Juilf
%A Steckermeier, Albert
%+ Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T Semi-intelligible Isar Proofs from Machine-Generated Proofs :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0029-C69A-B
%R 10.1007/s10817-015-9335-3
%7 2015
%D 2016
%J Journal of Automated Reasoning
%V 56
%N 2
%& 155
%P 155 - 200
%I Springer
%C Dordrecht
%@ false

Blanchette, J. C., Greenaway, D., Kaliszyk, C., Kühlwein, D., & Urban, J. (2016). A Learning-Based Fact Selector for Isabelle/HOL.

*Journal of Automated Reasoning*,*57*(3). doi:10.1007/s10817-016-9362-8Export

BibTeX

@article{Blanchette2016JAR,
TITLE = {A Learning-Based Fact Selector for {I}sabelle/{HOL}},
AUTHOR = {Blanchette, Jasmin Christian and Greenaway, David and Kaliszyk, Cezary and K{\"u}hlwein, Daniel and Urban, Josef},
LANGUAGE = {eng},
ISSN = {0168-7433},
DOI = {10.1007/s10817-016-9362-8},
PUBLISHER = {Springer},
ADDRESS = {Dordrecht, Holland},
YEAR = {2016},
DATE = {2016},
JOURNAL = {Journal of Automated Reasoning},
VOLUME = {57},
NUMBER = {3},
PAGES = {219--244},
}

Endnote

%0 Journal Article
%A Blanchette, Jasmin Christian
%A Greenaway, David
%A Kaliszyk, Cezary
%A Kühlwein, Daniel
%A Urban, Josef
%+ Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
External Organizations
External Organizations
%T A Learning-Based Fact Selector for Isabelle/HOL :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-002A-4301-0
%R 10.1007/s10817-016-9362-8
%7 2016
%D 2016
%J Journal of Automated Reasoning
%V 57
%N 3
%& 219
%P 219 - 244
%I Springer
%C Dordrecht, Holland
%@ false

Blanchette, J. C., Böhme, S., Popescu, A., & Smallbone, N. (2016). Encoding Monomorphic and Polymorphic Types. doi:10.2168/LMCS-2014-1018

(arXiv: 1609.08916) Abstract

Many automatic theorem provers are restricted to untyped logics, and existing
translations from typed logics are bulky or unsound. Recent research proposes
monotonicity as a means to remove some clutter when translating monomorphic to
untyped first-order logic. Here we pursue this approach systematically,
analysing formally a variety of encodings that further improve on efficiency
while retaining soundness and completeness. We extend the approach to rank-1
polymorphism and present alternative schemes that lighten the translation of
polymorphic symbols based on the novel notion of "cover". The new encodings are
implemented in Isabelle/HOL as part of the Sledgehammer tool. We include
informal proofs of soundness and correctness, and have formalised the
monomorphic part of this work in Isabelle/HOL. Our evaluation finds the new
encodings vastly superior to previous schemes.

Export

BibTeX

@online{Blanchette1609.08916,
TITLE = {Encoding Monomorphic and Polymorphic Types},
AUTHOR = {Blanchette, Jasmin Christian and B{\"o}hme, Sascha and Popescu, Andrei and Smallbone, Nicholas},
LANGUAGE = {eng},
URL = {http://arxiv.org/abs/1609.08916},
DOI = {10.2168/LMCS-2014-1018},
EPRINT = {1609.08916},
EPRINTTYPE = {arXiv},
YEAR = {2016},
ABSTRACT = {Many automatic theorem provers are restricted to untyped logics, and existing translations from typed logics are bulky or unsound. Recent research proposes monotonicity as a means to remove some clutter when translating monomorphic to untyped first-order logic. Here we pursue this approach systematically, analysing formally a variety of encodings that further improve on efficiency while retaining soundness and completeness. We extend the approach to rank-1 polymorphism and present alternative schemes that lighten the translation of polymorphic symbols based on the novel notion of "cover". The new encodings are implemented in Isabelle/HOL as part of the Sledgehammer tool. We include informal proofs of soundness and correctness, and have formalised the monomorphic part of this work in Isabelle/HOL. Our evaluation finds the new encodings vastly superior to previous schemes.},
}

Endnote

%0 Report
%A Blanchette, Jasmin Christian
%A Böhme, Sascha
%A Popescu, Andrei
%A Smallbone, Nicholas
%+ Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
External Organizations
%T Encoding Monomorphic and Polymorphic Types :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-002B-A954-2
%R 10.2168/LMCS-2014-1018
%U http://arxiv.org/abs/1609.08916
%D 2016
%X Many automatic theorem provers are restricted to untyped logics, and existing
translations from typed logics are bulky or unsound. Recent research proposes
monotonicity as a means to remove some clutter when translating monomorphic to
untyped first-order logic. Here we pursue this approach systematically,
analysing formally a variety of encodings that further improve on efficiency
while retaining soundness and completeness. We extend the approach to rank-1
polymorphism and present alternative schemes that lighten the translation of
polymorphic symbols based on the novel notion of "cover". The new encodings are
implemented in Isabelle/HOL as part of the Sledgehammer tool. We include
informal proofs of soundness and correctness, and have formalised the
monomorphic part of this work in Isabelle/HOL. Our evaluation finds the new
encodings vastly superior to previous schemes.
%K Computer Science, Logic in Computer Science, cs.LO

Blanchette, J. C., Kaliszyk, C., Paulson, L. C., & Urban, J. (2016). Hammering towards QED.

*Journal of Formalized Reasoning*,*9*(1). doi:10.6092/issn.1972-5787/4593Export

BibTeX

@article{DBLP:journals/jfrea/BlanchetteKPU16,
TITLE = {Hammering towards {QED}},
AUTHOR = {Blanchette, Jasmin Christian and Kaliszyk, Cezary and Paulson, Lawrence C. and Urban, Josef},
LANGUAGE = {eng},
ISSN = {1972-5787},
DOI = {10.6092/issn.1972-5787/4593},
YEAR = {2016},
JOURNAL = {Journal of Formalized Reasoning},
VOLUME = {9},
NUMBER = {1},
PAGES = {101--148},
}

Endnote

%0 Journal Article
%A Blanchette, Jasmin Christian
%A Kaliszyk, Cezary
%A Paulson, Lawrence C.
%A Urban, Josef
%+ Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
External Organizations
%T Hammering towards QED :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-002C-3A64-6
%R 10.6092/issn.1972-5787/4593
%7 2016
%D 2016
%J Journal of Formalized Reasoning
%V 9
%N 1
%& 101
%P 101 - 148
%C Bologna
%@ false

Blanchette, J. C., & Merz, S. (Eds.). (2016).

*Interactive Theorem Proving*. Presented at the Seventh Conference on Interactive Theorem Proving, Nancy, France: Springer. doi:10.1007/978-3-319-43144-4Export

BibTeX

@proceedings{BlanchetteITP2016,
TITLE = {Interactive Theorem Proving (ITP 2016)},
EDITOR = {Blanchette, Jasmin Christian and Merz, Stephan},
LANGUAGE = {eng},
ISBN = {978-3-319-43143-7},
DOI = {10.1007/978-3-319-43144-4},
PUBLISHER = {Springer},
YEAR = {2016},
DATE = {2016},
PAGES = {XVII, 502 p.},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {9807},
ADDRESS = {Nancy, France},
}

Endnote

%0 Conference Proceedings
%E Blanchette, Jasmin Christian
%E Merz, Stephan
%+ Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
%T Interactive Theorem Proving : 7th International Conference, ITP 2016
Nancy, France, August 22-25, 2016 ; Proceedings
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-002C-3A6B-7
%@ 978-3-319-43143-7
%R 10.1007/978-3-319-43144-4
%I Springer
%D 2016
%B Seventh Conference on Interactive Theorem Proving
%Z date of event: 2016-08-22 - 2016-08-27
%D 2016
%C Nancy, France
%P XVII, 502 p.
%S Lecture Notes in Computer Science
%V 9807

Blanchette, J. C., & Kaliszyk, C. (Eds.). (2016).

(arXiv: 1606.05427) *Proceedings First International Workshop on Hammers for Type Theories*. Presented at the First International Workshop on Hammers for Type Theories, Coimbra, Portugal: EPTCS. doi:10.4204/EPTCS.210Export

BibTeX

@proceedings{HaTT2016,
TITLE = {Proceedings First International Workshop on Hammers for Type Theories (HaTT 2016)},
EDITOR = {Blanchette, Jasmin Christian and Kaliszyk, Cezary},
LANGUAGE = {eng},
DOI = {10.4204/EPTCS.210},
EPRINT = {1606.05427},
EPRINTTYPE = {arXiv},
PUBLISHER = {EPTCS},
YEAR = {2016},
PAGES = {35 p.},
SERIES = {Electronic Proceedings in Theoretical Computer Science},
VOLUME = {210},
ADDRESS = {Coimbra, Portugal},
}

Endnote

%0 Conference Proceedings
%E Blanchette, Jasmin Christian
%E Kaliszyk , Cezary
%+ Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
%T Proceedings First International Workshop on Hammers for Type Theories :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-002B-0A70-D
%R 10.4204/EPTCS.210
%I EPTCS
%D 2016
%B First International Workshop on Hammers for Type Theories
%Z date of event: 2016-07-01 - 2016-07-01
%D 2016
%C Coimbra, Portugal
%P 35 p.
%S Electronic Proceedings in Theoretical Computer Science
%V 210
%U http://arxiv.org/abs/1606.05427

Bromberger, M. (2016).

*Analysis and Implementation of LIA solvers: CutSAT and BBSAT*. Universität des Saarlandes, Saarbrücken.Export

BibTeX

@mastersthesis{BrombergerMaster2016,
TITLE = {Analysis and Implementation of {LIA} solvers: {CutSAT} and {BBSAT}},
AUTHOR = {Bromberger, Martin},
LANGUAGE = {eng},
SCHOOL = {Universit{\"a}t des Saarlandes},
ADDRESS = {Saarbr{\"u}cken},
YEAR = {2016},
DATE = {2016},
}

Endnote

%0 Thesis
%A Bromberger, Martin
%Y Weidenbach, Christoph
%A referee: Sturm, Thomas
%+ Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T Analysis and Implementation of LIA solvers: CutSAT and BBSAT :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-002C-410C-6
%I Universität des Saarlandes
%C Saarbrücken
%D 2016
%P 34 p.
%V master
%9 master

Bromberger, M., & Weidenbach, C. (2016a). Computing a Complete Basis for Equalities Implied by a System of LRA Constraints. In

*Satisfiability Modulo Theories (SMT 2016)*. Coimbra, Portugal: CEUR-WS.org. Retrieved from urn:nbn:de:0074-1617-8Export

BibTeX

@inproceedings{BrombergerSMT2016,
TITLE = {Computing a Complete Basis for Equalities Implied by a System of {LRA} Constraints},
AUTHOR = {Bromberger, Martin and Weidenbach, Christoph},
LANGUAGE = {eng},
ISSN = {1613-0073},
URL = {urn:nbn:de:0074-1617-8},
PUBLISHER = {CEUR-WS.org},
YEAR = {2016},
BOOKTITLE = {Satisfiability Modulo Theories (SMT 2016)},
EDITOR = {King, Tim and Piskac, Ruzica},
PAGES = {15--30},
SERIES = {CEUR Workshop Proceedings},
VOLUME = {1617},
ADDRESS = {Coimbra, Portugal},
}

Endnote

%0 Conference Proceedings
%A Bromberger, Martin
%A Weidenbach, Christoph
%+ Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T Computing a Complete Basis for Equalities Implied by a System of LRA Constraints :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-002B-0AA0-1
%D 2016
%B 14th International Workshop on Satisfiability Modulo Theories
%Z date of event: 2016-07-01 - 2016-07-02
%C Coimbra, Portugal
%B Satisfiability Modulo Theories
%E King, Tim; Piskac, Ruzica
%P 15 - 30
%I CEUR-WS.org
%B CEUR Workshop Proceedings
%N 1617
%@ false
%U http://ceur-ws.org/Vol-1617/paper2.pdf

Bromberger, M., & Weidenbach, C. (2016b). Fast Cube Tests for LIA Constraint Solving. In

*Automated Reasoning (IJCAR 2016)*. Coimbra, Portugal: Springer. doi:10.1007/978-3-319-40229-1_9Export

BibTeX

@inproceedings{BrombergerIJCAR2016,
TITLE = {Fast Cube Tests for {LIA} Constraint Solving},
AUTHOR = {Bromberger, Martin and Weidenbach, Christoph},
LANGUAGE = {eng},
ISBN = {978-3-319-40228-4},
DOI = {10.1007/978-3-319-40229-1_9},
PUBLISHER = {Springer},
YEAR = {2016},
DATE = {2016},
BOOKTITLE = {Automated Reasoning (IJCAR 2016)},
EDITOR = {Olivetti, Nicola and Tiwari, Ashish},
PAGES = {116--132},
SERIES = {Lecture Notes in Artificial Intelligence},
VOLUME = {9706},
ADDRESS = {Coimbra, Portugal},
}

Endnote

%0 Conference Proceedings
%A Bromberger, Martin
%A Weidenbach, Christoph
%+ Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T Fast Cube Tests for LIA Constraint Solving :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-002B-01C9-4
%R 10.1007/978-3-319-40229-1_9
%D 2016
%B 8th International Joint Conference on Automated Reasoning
%Z date of event: 2016-06-27 - 2016-07-02
%C Coimbra, Portugal
%B Automated Reasoning
%E Olivetti, Nicola; Tiwari, Ashish
%P 116 - 132
%I Springer
%@ 978-3-319-40228-4
%B Lecture Notes in Artificial Intelligence
%N 9706

Cruanes, S., & Blanchette, J. C. (2016). Extending Nunchaku to Dependent Type Theory. In

(arXiv: 1606.05945) *Proceedings First International Workshop on Hammers for Type Theories (HaTT 2016)*. Coimbra, Portugal. doi:10.4204/EPTCS.210.3Abstract

Nunchaku is a new higher-order counterexample generator based on a sequence
of transformations from polymorphic higher-order logic to first-order logic.
Unlike its predecessor Nitpick for Isabelle, it is designed as a stand-alone
tool, with frontends for various proof assistants. In this short paper, we
present some ideas to extend Nunchaku with partial support for dependent types
and type classes, to make frontends for Coq and other systems based on
dependent type theory more useful.

Export

BibTeX

@inproceedings{Cruanes1606.05945,
TITLE = {Extending {N}unchaku to Dependent Type Theory},
AUTHOR = {Cruanes, Simon and Blanchette, Jasmin Christian},
LANGUAGE = {eng},
ISSN = {2075-2180},
URL = {http://arxiv.org/abs/1606.05945},
DOI = {10.4204/EPTCS.210.3},
EPRINT = {1606.05945},
EPRINTTYPE = {arXiv},
YEAR = {2016},
ABSTRACT = {Nunchaku is a new higher-order counterexample generator based on a sequence of transformations from polymorphic higher-order logic to first-order logic. Unlike its predecessor Nitpick for Isabelle, it is designed as a stand-alone tool, with frontends for various proof assistants. In this short paper, we present some ideas to extend Nunchaku with partial support for dependent types and type classes, to make frontends for Coq and other systems based on dependent type theory more useful.},
BOOKTITLE = {Proceedings First International Workshop on Hammers for Type Theories (HaTT 2016)},
EDITOR = {Blanchette, Jasmin Christian and Kaliszyk, Cezary},
PAGES = {3--12},
SERIES = {Electronic Proceedings in Theoretical Computer Science},
VOLUME = {210},
ADDRESS = {Coimbra, Portugal},
}

Endnote

%0 Conference Proceedings
%A Cruanes, Simon
%A Blanchette, Jasmin Christian
%+ Inria Nancy -- Grand Est
Automation of Logic, MPI for Informatics, Max Planck Society
%T Extending Nunchaku to Dependent Type Theory :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-002B-0A6B-E
%R 10.4204/EPTCS.210.3
%U http://arxiv.org/abs/1606.05945
%D 2016
%B First International Workshop on Hammers for Type Theories
%Z date of event: 2016-07-01 - 2016-07-01
%C Coimbra, Portugal
%X Nunchaku is a new higher-order counterexample generator based on a sequence
of transformations from polymorphic higher-order logic to first-order logic.
Unlike its predecessor Nitpick for Isabelle, it is designed as a stand-alone
tool, with frontends for various proof assistants. In this short paper, we
present some ideas to extend Nunchaku with partial support for dependent types
and type classes, to make frontends for Coq and other systems based on
dependent type theory more useful.
%K Computer Science, Logic in Computer Science, cs.LO
%B Proceedings First International Workshop on Hammers for Type Theories
%E Blanchette, Jasmin Christian; Kaliszyk , Cezary
%P 3 - 12
%B Electronic Proceedings in Theoretical Computer Science
%N 210
%@ false

Fetzer, C., Weidenbach, C., & Wischnewski, P. (2016). Compliance, Functional Safety and Fault Detection by Formal Methods. In

*Leveraging Applications of Formal Methods, Verification and Validation (ISoLA 2016)*. Corfu, Greece: Springer. doi:10.1007/978-3-319-47169-3_48Export

BibTeX

@inproceedings{FetzerISOLA2016,
TITLE = {Compliance, Functional Safety and Fault Detection by Formal Methods},
AUTHOR = {Fetzer, Christof and Weidenbach, Christoph and Wischnewski, Patrick},
LANGUAGE = {eng},
ISBN = {978-3-319-47168-6},
DOI = {10.1007/978-3-319-47169-3_48},
PUBLISHER = {Springer},
YEAR = {2016},
DATE = {2016},
BOOKTITLE = {Leveraging Applications of Formal Methods, Verification and Validation (ISoLA 2016)},
EDITOR = {Margaria, Tiziana and Steffen, Bernhard},
PAGES = {626--632},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {9953},
ADDRESS = {Corfu, Greece},
}

Endnote

%0 Conference Proceedings
%A Fetzer, Christof
%A Weidenbach, Christoph
%A Wischnewski, Patrick
%+ External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
%T Compliance, Functional Safety and Fault Detection by Formal Methods :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-002C-3A6F-0
%R 10.1007/978-3-319-47169-3_48
%D 2016
%B 7th International Symposium on Leveraging Applications of Formal Methods, Verification and Validation
%Z date of event: 2016-10-10 - 2016-10-14
%C Corfu, Greece
%B Leveraging Applications of Formal Methods, Verification and Validation
%E Margaria, Tiziana; Steffen, Bernhard
%P 626 - 632
%I Springer
%@ 978-3-319-47168-6
%B Lecture Notes in Computer Science
%N 9953

Košta, M., Sturm, T., & Dolzmann, A. (2016). Better Answers to Real Questions.

*Journal of Symbolic Computation*,*74*. doi:10.1016/j.jsc.2015.07.002Abstract

We consider existential problems over the reals. Extended quantifier
elimination generalizes the concept of regular quantifier elimination by
providing in addition answers, which are descriptions of possible assignments
for the quantified variables. Implementations of extended quantifier
elimination via virtual substitution have been successfully applied to various
problems in science and engineering. So far, the answers produced by these
implementations included infinitesimal and infinite numbers, which are hard to
interpret in practice. We introduce here a post-processing procedure to
convert, for fixed parameters, all answers into standard real numbers. The
relevance of our procedure is demonstrated by application of our implementation
to various examples from the literature, where it significantly improves the
quality of the results.

Export

BibTeX

@article{KostaSymbol2015,
TITLE = {Better Answers to Real Questions},
AUTHOR = {Ko{\v s}ta, Marek and Sturm, Thomas and Dolzmann, Andreas},
LANGUAGE = {eng},
ISSN = {0747-7171},
DOI = {10.1016/j.jsc.2015.07.002},
PUBLISHER = {Academic Press},
ADDRESS = {London},
YEAR = {2016},
DATE = {2016},
ABSTRACT = {We consider existential problems over the reals. Extended quantifier elimination generalizes the concept of regular quantifier elimination by providing in addition answers, which are descriptions of possible assignments for the quantified variables. Implementations of extended quantifier elimination via virtual substitution have been successfully applied to various problems in science and engineering. So far, the answers produced by these implementations included infinitesimal and infinite numbers, which are hard to interpret in practice. We introduce here a post-processing procedure to convert, for fixed parameters, all answers into standard real numbers. The relevance of our procedure is demonstrated by application of our implementation to various examples from the literature, where it significantly improves the quality of the results.},
JOURNAL = {Journal of Symbolic Computation},
VOLUME = {74},
PAGES = {255--275},
}

Endnote

%0 Journal Article
%A Košta, Marek
%A Sturm, Thomas
%A Dolzmann, Andreas
%+ Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
%T Better Answers to Real Questions :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0026-A93B-2
%R 10.1016/j.jsc.2015.07.002
%7 2015
%D 2016
%X We consider existential problems over the reals. Extended quantifier
elimination generalizes the concept of regular quantifier elimination by
providing in addition answers, which are descriptions of possible assignments
for the quantified variables. Implementations of extended quantifier
elimination via virtual substitution have been successfully applied to various
problems in science and engineering. So far, the answers produced by these
implementations included infinitesimal and infinite numbers, which are hard to
interpret in practice. We introduce here a post-processing procedure to
convert, for fixed parameters, all answers into standard real numbers. The
relevance of our procedure is demonstrated by application of our implementation
to various examples from the literature, where it significantly improves the
quality of the results.
%K Computer Science, Symbolic Computation, cs.SC,Computer Science, Logic in Computer Science, cs.LO
%J Journal of Symbolic Computation
%V 74
%& 255
%P 255 - 275
%I Academic Press
%C London
%@ false

Košta, M. (2016).

*New Concepts for Real Quantifier Elimination by Virtual Substitution*. Universität des Saarlandes, Saarbrücken.Export

BibTeX

@phdthesis{Kostaphd16,
TITLE = {New Concepts for Real Quantifier Elimination by Virtual Substitution},
AUTHOR = {Ko{\v s}ta, Marek},
LANGUAGE = {eng},
SCHOOL = {Universit{\"a}t des Saarlandes},
ADDRESS = {Saarbr{\"u}cken},
YEAR = {2016},
DATE = {2016},
}

Endnote

%0 Thesis
%A Košta, Marek
%Y Sturm, Thomas
%A referee: Weber, Andreas
%A referee: Weidenbach, Christoph
%+ Automation of Logic, MPI for Informatics, Max Planck Society
International Max Planck Research School, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
%T New Concepts for Real Quantifier Elimination by Virtual Substitution :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-002C-30A8-9
%I Universität des Saarlandes
%C Saarbrücken
%D 2016
%P xvi, 214 p.
%V phd
%9 phd
%U http://scidok.sulb.uni-saarland.de/volltexte/2016/6716/http://scidok.sulb.uni-saarland.de/doku/lic_ohne_pod.php?la=de

Reynolds, A., & Blanchette, J. C. (2016). A Decision Procedure for (Co)datatypes in SMT Solvers. In

*Twenty-Fifth International Joint Conference on Artificial Intelligence (IJCAI 2016)*. New York, NY, USA: AAAI. Retrieved from http://www.ijcai.org/Proceedings/16/Papers/631.pdfExport

BibTeX

@inproceedings{DBLP:conf/ijcai/ReynoldsB16,
TITLE = {A Decision Procedure for (Co)datatypes in {SMT} Solvers},
AUTHOR = {Reynolds, Andrew and Blanchette, Jasmin Christian},
LANGUAGE = {eng},
ISBN = {978-1-57735-771-1},
URL = {http://www.ijcai.org/Proceedings/16/Papers/631.pdf},
PUBLISHER = {AAAI},
YEAR = {2016},
DATE = {2016},
BOOKTITLE = {Twenty-Fifth International Joint Conference on Artificial Intelligence (IJCAI 2016)},
EDITOR = {Kambhampati, Subbarao},
PAGES = {4205--4209},
EID = {631},
ADDRESS = {New York, NY, USA},
}

Endnote

%0 Conference Proceedings
%A Reynolds, Andrew
%A Blanchette, Jasmin Christian
%+ External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
%T A Decision Procedure for (Co)datatypes in SMT Solvers :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-002C-3A67-F
%U http://www.ijcai.org/Proceedings/16/Papers/631.pdf
%D 2016
%B 25th International Joint Conference on Artificial Intelligence
%Z date of event: 2016-07-09 - 2016-07-15
%C New York, NY, USA
%B Twenty-Fifth International Joint Conference on Artificial Intelligence
%E Kambhampati, Subbarao
%P 4205 - 4209
%Z sequence number: 631
%I AAAI
%@ 978-1-57735-771-1

Reynolds, A., Blanchette, J. C., Cruanes, S., & Tinelli, C. (2016). Model Finding for Recursive Functions in SMT. In

*Automated Reasoning (IJCAR 2016)*. Coimbra, Portugal: Springer. doi:10.1007/978-3-319-40229-1_10Export

BibTeX

@inproceedings{ReynoldsIJCAR2016,
TITLE = {Model Finding for Recursive Functions in {SMT}},
AUTHOR = {Reynolds, Andrew and Blanchette, Jasmin Christian and Cruanes, Simon and Tinelli, Cesare},
LANGUAGE = {eng},
ISBN = {978-3-319-40228-4},
DOI = {10.1007/978-3-319-40229-1_10},
PUBLISHER = {Springer},
YEAR = {2016},
DATE = {2016},
BOOKTITLE = {Automated Reasoning (IJCAR 2016)},
EDITOR = {Olivetti, Nicola and Tiwari, Ashish},
PAGES = {133--151},
SERIES = {Lecture Notes in Artificial Intelligence},
VOLUME = {9706},
ADDRESS = {Coimbra, Portugal},
}

Endnote

%0 Conference Proceedings
%A Reynolds, Andrew
%A Blanchette, Jasmin Christian
%A Cruanes, Simon
%A Tinelli, Cesare
%+ External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T Model Finding for Recursive Functions in SMT :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-002B-0900-2
%R 10.1007/978-3-319-40229-1_10
%D 2016
%B 8th International Joint Conference on Automated Reasoning
%Z date of event: 2016-06-27 - 2016-07-02
%C Coimbra, Portugal
%B Automated Reasoning
%E Olivetti, Nicola; Tiwari, Ashish
%P 133 - 151
%I Springer
%@ 978-3-319-40228-4
%B Lecture Notes in Artificial Intelligence
%N 9706

Sturm, T., Voigt, M., & Weidenbach, C. (2016a). Deciding First-Order Satisfiability when Universal and Existential Variables are Separated. Retrieved from http://arxiv.org/abs/1511.08999

(arXiv: 1511.08999) Abstract

We introduce a new decidable fragment of first-order logic with equality,
which strictly generalizes two already well-known ones -- the
Bernays-Sch\"onfinkel-Ramsey (BSR) Fragment and the Monadic Fragment. The
defining principle is the syntactic separation of universally quantified
variables from existentially quantified ones at the level of atoms. Thus, our
classification neither rests on restrictions on quantifier prefixes (as in the
BSR case) nor on restrictions on the arity of predicate symbols (as in the
monadic case). We demonstrate that the new fragment exhibits the finite model
property and derive a non-elementary upper bound on the computing time required
for deciding satisfiability in the new fragment. For the subfragment of prenex
sentences with the quantifier prefix $\exists^* \forall^* \exists^*$ the
satisfiability problem is shown to be complete for NEXPTIME. Finally, we
discuss how automated reasoning procedures can take advantage of our results.

Export

BibTeX

@online{SturmVoigtWeidenbachArXiv2016,
TITLE = {Deciding First-Order Satisfiability when Universal and Existential Variables are Separated},
AUTHOR = {Sturm, Thomas and Voigt, Marco and Weidenbach, Christoph},
LANGUAGE = {eng},
URL = {http://arxiv.org/abs/1511.08999},
EPRINT = {1511.08999},
EPRINTTYPE = {arXiv},
YEAR = {2016},
ABSTRACT = {We introduce a new decidable fragment of first-order logic with equality, which strictly generalizes two already well-known ones -- the Bernays-Sch\"onfinkel-Ramsey (BSR) Fragment and the Monadic Fragment. The defining principle is the syntactic separation of universally quantified variables from existentially quantified ones at the level of atoms. Thus, our classification neither rests on restrictions on quantifier prefixes (as in the BSR case) nor on restrictions on the arity of predicate symbols (as in the monadic case). We demonstrate that the new fragment exhibits the finite model property and derive a non-elementary upper bound on the computing time required for deciding satisfiability in the new fragment. For the subfragment of prenex sentences with the quantifier prefix $\exists^* \forall^* \exists^*$ the satisfiability problem is shown to be complete for NEXPTIME. Finally, we discuss how automated reasoning procedures can take advantage of our results.},
}

Endnote

%0 Report
%A Sturm, Thomas
%A Voigt, Marco
%A Weidenbach, Christoph
%+ Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T Deciding First-Order Satisfiability when Universal and Existential
Variables are Separated :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-002C-4377-6
%U http://arxiv.org/abs/1511.08999
%D 2016
%X We introduce a new decidable fragment of first-order logic with equality,
which strictly generalizes two already well-known ones -- the
Bernays-Sch\"onfinkel-Ramsey (BSR) Fragment and the Monadic Fragment. The
defining principle is the syntactic separation of universally quantified
variables from existentially quantified ones at the level of atoms. Thus, our
classification neither rests on restrictions on quantifier prefixes (as in the
BSR case) nor on restrictions on the arity of predicate symbols (as in the
monadic case). We demonstrate that the new fragment exhibits the finite model
property and derive a non-elementary upper bound on the computing time required
for deciding satisfiability in the new fragment. For the subfragment of prenex
sentences with the quantifier prefix $\exists^* \forall^* \exists^*$ the
satisfiability problem is shown to be complete for NEXPTIME. Finally, we
discuss how automated reasoning procedures can take advantage of our results.
%K Computer Science, Logic in Computer Science, cs.LO

Sturm, T., Voigt, M., & Weidenbach, C. (2016b). Deciding First-Order Satisfiability when Universal and Existential Variables are Separated. In

*Proceedings of the 31st Annual ACM-IEEE Symposium on Logic in Computer Science (LICS 2016)*. New York, NY, USA: ACM. doi:10.1145/2933575.2934532Export

BibTeX

@inproceedings{SturmLICS2016,
TITLE = {Deciding First-Order Satisfiability when Universal and Existential Variables are Separated},
AUTHOR = {Sturm, Thomas and Voigt, Marco and Weidenbach, Christoph},
LANGUAGE = {eng},
ISBN = {78-1-4503-4391-6},
DOI = {10.1145/2933575.2934532},
PUBLISHER = {ACM},
YEAR = {2016},
DATE = {2016},
BOOKTITLE = {Proceedings of the 31st Annual ACM-IEEE Symposium on Logic in Computer Science (LICS 2016)},
PAGES = {86--95},
ADDRESS = {New York, NY, USA},
}

Endnote

%0 Conference Proceedings
%A Sturm, Thomas
%A Voigt, Marco
%A Weidenbach, Christoph
%+ Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T Deciding First-Order Satisfiability when Universal and Existential Variables are Separated :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-002C-1B3A-F
%R 10.1145/2933575.2934532
%D 2016
%B 31st Annual ACM-IEEE Symposium on Logic in Computer Science
%Z date of event: 2016-07-05 - 2016-07-08
%C New York, NY, USA
%B Proceedings of the 31st Annual ACM-IEEE Symposium on
Logic in Computer Science
%P 86 - 95
%I ACM
%@ 78-1-4503-4391-6

Tang, C. H., & Weidenbach, C. (2016). A Dynamic Logic for Configuration. In

*Proceedings of the 2nd International Workshop on Automated Reasoning in Quantified Non-Classical Logics (ARQNL 2016) affiliated with the International Joint Conference on Automated Reasoning (IJCAR 2016)*. Coimbra, Portugal: CEUR-WS.org. Retrieved from http://ceur-ws.org/Vol-1770/ARQNL2016_paper3.pdf; urn:nbn:de:0074-1770-7Export

BibTeX

@inproceedings{TangARQNL2016,
TITLE = {A Dynamic Logic for Configuration},
AUTHOR = {Tang, Ching Hoo and Weidenbach, Christoph},
LANGUAGE = {eng},
ISSN = {1613-0073},
URL = {http://ceur-ws.org/Vol-1770/ARQNL2016_paper3.pdf; urn:nbn:de:0074-1770-7},
PUBLISHER = {CEUR-WS.org},
YEAR = {2016},
BOOKTITLE = {Proceedings of the 2nd International Workshop on Automated Reasoning in Quantified Non-Classical Logics (ARQNL 2016) affiliated with the International Joint Conference on Automated Reasoning (IJCAR 2016)},
EDITOR = {Benzm{\"u}ller, Christoph and Otten, Jens},
PAGES = {36--50},
SERIES = {CEUR Workshop Proceedings},
VOLUME = {1770},
ADDRESS = {Coimbra, Portugal},
}

Endnote

%0 Conference Proceedings
%A Tang, Ching Hoo
%A Weidenbach, Christoph
%+ Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T A Dynamic Logic for Configuration :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-002C-4A34-D
%U http://ceur-ws.org/Vol-1770/ARQNL2016_paper3.pdf
%D 2016
%B 2nd International Workshop on Automated Reasoning in Quantified Non-Classical Logics
%Z date of event: 2016-07-01 - 2016-07-01
%C Coimbra, Portugal
%B Proceedings of the 2nd International Workshop on Automated Reasoning in Quantified Non-Classical Logics (ARQNL 2016)
affiliated with the International Joint Conference on Automated Reasoning (IJCAR 2016)
%E Benzmüller, Christoph; Otten, Jens
%P 36 - 50
%I CEUR-WS.org
%B CEUR Workshop Proceedings
%N 1770
%@ false

Teucke, A., & Weidenbach, C. (2016). Ordered Resolution with Straight Dismatching Constraints. In

*Practical Aspects of Automated Reasoning (PAAR 2016)*. Coimbra, Portugal: CEUR-WS.org. Retrieved from urn:nbn:de:0074-1635-7Export

BibTeX

@inproceedings{Teucke_PAAR2016,
TITLE = {Ordered Resolution with Straight Dismatching Constraints},
AUTHOR = {Teucke, Andreas and Weidenbach, Christoph},
LANGUAGE = {eng},
ISSN = {1613-0073},
URL = {urn:nbn:de:0074-1635-7},
PUBLISHER = {CEUR-WS.org},
YEAR = {2016},
BOOKTITLE = {Practical Aspects of Automated Reasoning (PAAR 2016)},
EDITOR = {Fontaine, Pascal and Schulz, Stephan and Urban, Josef},
PAGES = {95--109},
SERIES = {CEUR Workshop Proceedings},
VOLUME = {1635},
ADDRESS = {Coimbra, Portugal},
}

Endnote

%0 Conference Proceedings
%A Teucke, Andreas
%A Weidenbach, Christoph
%+ Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T Ordered Resolution with Straight Dismatching Constraints :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-002B-0AB4-6
%D 2016
%B 5th Workshop on Practical Aspects of Automated Reasoning
%Z date of event: 2016-07-02 - 2016-07-02
%C Coimbra, Portugal
%B Practical Aspects of Automated Reasoning
%E Fontaine, Pascal; Schulz, Stephan; Urban, Josef
%P 95 - 109
%I CEUR-WS.org
%B CEUR Workshop Proceedings
%N 1635
%@ false
%U http://ceur-ws.org/Vol-1635/paper-09.pdf

Voigt, M. (2016a). Beyond Standard Miniscoping. In

*Deduktionstreffen 2016*. Klagenfurt, Austria.Export

BibTeX

@inproceedings{VoigtDeduktionstreffen2016,
TITLE = {Beyond Standard Miniscoping},
AUTHOR = {Voigt, Marco},
LANGUAGE = {eng},
YEAR = {2016},
BOOKTITLE = {Deduktionstreffen 2016},
ADDRESS = {Klagenfurt, Austria},
}

Endnote

%0 Conference Proceedings
%A Voigt, Marco
%+ Automation of Logic, MPI for Informatics, Max Planck Society
%T Beyond Standard Miniscoping :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-002C-4397-D
%D 2016
%B Deduktionstreffen 2016
%Z date of event: 2016-09-26 - 2016-09-26
%C Klagenfurt, Austria
%B Deduktionstreffen 2016
%U https://fg-dedsys.gi.de/fileadmin/user_upload/dt2016/voigt.pdf

Voigt, M. (2016b). The Complexity of Satisfiability in the Separated Fragment - A Journey Through ELEMENTARY and Beyond. In

*Seventeenth International Workshop on Logic and Computational Complexity (LCC 2016)*. Marseille, France.Export

BibTeX

@inproceedings{VoigtLCC2016,
TITLE = {The Complexity of Satisfiability in the Separated Fragment -- A Journey Through {ELEMENTARY} and Beyond},
AUTHOR = {Voigt, Marco},
LANGUAGE = {eng},
YEAR = {2016},
DATE = {2016},
BOOKTITLE = {Seventeenth International Workshop on Logic and Computational Complexity (LCC 2016)},
PAGES = {43--47},
ADDRESS = {Marseille, France},
}

Endnote

%0 Conference Proceedings
%A Voigt, Marco
%+ Automation of Logic, MPI for Informatics, Max Planck Society
%T The Complexity of Satisfiability in the Separated Fragment - A Journey Through ELEMENTARY and Beyond :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-002C-4392-8
%D 2016
%B Seventeenth International Workshop on Logic and Computational Complexity
%Z date of event: 2016-09-02 - 2016-09-03
%C Marseille, France
%B Seventeenth International Workshop on Logic and Computational Complexity
%P 43 - 47
%U http://csl16.lif.univ-mrs.fr/static/media/talk82/slides_website_version.pdf

Wand, D. (2016).

*More SPASS with Isabelle - Superposition with Hard Sorts and Configurable Simplification*. Universität des Saarlandes, Saarbrücken.Export

BibTeX

@mastersthesis{WandMaster2016,
TITLE = {More {SPASS} with {I}sabelle -- {S}uperposition with {H}ard {S}orts and {C}onfigurable {S}implification},
AUTHOR = {Wand, Daniel},
LANGUAGE = {eng},
SCHOOL = {Universit{\"a}t des Saarlandes},
ADDRESS = {Saarbr{\"u}cken},
YEAR = {2016},
DATE = {2016},
}

Endnote

%0 Thesis
%A Wand, Daniel
%Y Weidenbach, Christoph
%A referee: Waldmann, Uwe
%+ Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T More SPASS with Isabelle - Superposition with Hard Sorts and Configurable Simplification :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-002C-AC8E-1
%I Universität des Saarlandes
%C Saarbrücken
%D 2016
%P 22 p.
%V master
%9 master

2015

Alagi, G., & Weidenbach, C. (2015a). NRCL - A Model Building Approach to the Bernays-Schönfinkel Fragment. In

*Frontiers of Combining Systems (FroCoS 2015)*. Wrocław, Poland: Springer. doi:10.1007/978-3-319-24246-0_5Export

BibTeX

@inproceedings{AlagiFroCoS2015,
TITLE = {{NRCL} -- A Model Building Approach to the {Bernays}-{S}ch{\"o}nfinkel Fragment},
AUTHOR = {Alagi, G{\'a}bor and Weidenbach, Christoph},
LANGUAGE = {eng},
ISBN = {978-3-319-2424},
DOI = {10.1007/978-3-319-24246-0_5},
PUBLISHER = {Springer},
YEAR = {2015},
DATE = {2015},
BOOKTITLE = {Frontiers of Combining Systems (FroCoS 2015)},
EDITOR = {Lutz, Carsten and Ranise, Silvio},
PAGES = {69--84},
SERIES = {Lecture Notes in Artificial Intelligence},
VOLUME = {9322},
ADDRESS = {Wroc{\l}aw, Poland},
}

Endnote

%0 Conference Proceedings
%A Alagi, Gábor
%A Weidenbach, Christoph
%+ Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T NRCL - A Model Building Approach to the Bernays-Schönfinkel Fragment :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0028-8EFA-E
%R 10.1007/978-3-319-24246-0_5
%D 2015
%B 10th International Symposium on Frontiers of Combining Systems
%Z date of event: 2015-09-21 - 2015-09-24
%C Wrocław, Poland
%B Frontiers of Combining Systems
%E Lutz, Carsten; Ranise, Silvio
%P 69 - 84
%I Springer
%@ 978-3-319-2424
%B Lecture Notes in Artificial Intelligence
%N 9322

Alagi, G., & Weidenbach, C. (2015b). NRCL - A Model Building Approach to the Bernays-Schönfinkel Fragment. Retrieved from http://arxiv.org/abs/1502.05501

(arXiv: 1502.05501) Abstract

We combine key ideas from first-order superposition and propositional CDCL to
create the new calculus NRCL deciding the Bernays-Sch\"onfinkel fragment. It
inherits the abstract redundancy criterion and the monotone model operator from
superposition. CDCL adds to NRCL the dynamic, conflict-driven search for an
atom ordering inducing a model. As a result, in NRCL a false clause can be
effectively found modulo the current model assumption. It guides the derivation
of a first-order ordered resolvent that is never redundant. Similar to
1UIP-learning in CDCL, the learned resolvent induces backtracking and via
propagation blocks the previous conflict state for the rest of the search.
Since learned clauses are never redundant, only finitely many can be generated
by NRCL on the Bernays-Sch\"onfinkel fragment, which provides a nice argument
for termination.

Export

BibTeX

@online{DBLP:journals/corr/AlagiW15,
TITLE = {{NRCL} -- A Model Building Approach to the {B}ernays-{S}ch{\"o}nfinkel Fragment},
AUTHOR = {Alagi, G{\'a}bor and Weidenbach, Christoph},
LANGUAGE = {eng},
URL = {http://arxiv.org/abs/1502.05501},
EPRINT = {1502.05501},
EPRINTTYPE = {arXiv},
YEAR = {2015},
ABSTRACT = {We combine key ideas from first-order superposition and propositional CDCL to create the new calculus NRCL deciding the Bernays-Sch\"onfinkel fragment. It inherits the abstract redundancy criterion and the monotone model operator from superposition. CDCL adds to NRCL the dynamic, conflict-driven search for an atom ordering inducing a model. As a result, in NRCL a false clause can be effectively found modulo the current model assumption. It guides the derivation of a first-order ordered resolvent that is never redundant. Similar to 1UIP-learning in CDCL, the learned resolvent induces backtracking and via propagation blocks the previous conflict state for the rest of the search. Since learned clauses are never redundant, only finitely many can be generated by NRCL on the Bernays-Sch\"onfinkel fragment, which provides a nice argument for termination.},
}

Endnote

%0 Report
%A Alagi, Gábor
%A Weidenbach, Christoph
%+ Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T NRCL - A Model Building Approach to the Bernays-Schönfinkel Fragment
:
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0025-B02B-F
%U http://arxiv.org/abs/1502.05501
%D 2015
%8 19.02.2015
%X We combine key ideas from first-order superposition and propositional CDCL to
create the new calculus NRCL deciding the Bernays-Sch\"onfinkel fragment. It
inherits the abstract redundancy criterion and the monotone model operator from
superposition. CDCL adds to NRCL the dynamic, conflict-driven search for an
atom ordering inducing a model. As a result, in NRCL a false clause can be
effectively found modulo the current model assumption. It guides the derivation
of a first-order ordered resolvent that is never redundant. Similar to
1UIP-learning in CDCL, the learned resolvent induces backtracking and via
propagation blocks the previous conflict state for the rest of the search.
Since learned clauses are never redundant, only finitely many can be generated
by NRCL on the Bernays-Sch\"onfinkel fragment, which provides a nice argument
for termination.
%K Computer Science, Logic in Computer Science, cs.LO

Barkatou, M. A., Jaroschek, M., & Maddah, S. S. (2015). Formal Solutions of Completely Integrable Pfaffian Systems With Normal Crossings. Retrieved from http://arxiv.org/abs/1511.00180

(arXiv: 1511.00180) Abstract

In this paper, we present an algorithm for computing a fundamental matrix of
formal solutions of completely integrable Pfaffian systems with normal
crossings in several variables. This algorithm is a generalization of a method
developed for the bivariate case based on a combination of several reduction
techniques and is implemented in the computer algebra system Maple.

Export

BibTeX

@online{DBLP:journals/corr/BarkatouJM15,
TITLE = {Formal Solutions of Completely Integrable {Pfaffian} Systems With Normal Crossings},
AUTHOR = {Barkatou, Moulay A. and Jaroschek, Maximilian and Maddah, Suzy S.},
LANGUAGE = {eng},
URL = {http://arxiv.org/abs/1511.00180},
EPRINT = {1511.00180},
EPRINTTYPE = {arXiv},
YEAR = {2015},
ABSTRACT = {In this paper, we present an algorithm for computing a fundamental matrix of formal solutions of completely integrable Pfaffian systems with normal crossings in several variables. This algorithm is a generalization of a method developed for the bivariate case based on a combination of several reduction techniques and is implemented in the computer algebra system Maple.},
}

Endnote

%0 Report
%A Barkatou, Moulay A.
%A Jaroschek, Maximilian
%A Maddah, Suzy S.
%+ External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
%T Formal Solutions of Completely Integrable Pfaffian Systems With Normal
Crossings :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0029-6635-6
%U http://arxiv.org/abs/1511.00180
%D 2015
%X In this paper, we present an algorithm for computing a fundamental matrix of
formal solutions of completely integrable Pfaffian systems with normal
crossings in several variables. This algorithm is a generalization of a method
developed for the bivariate case based on a combination of several reduction
techniques and is implemented in the computer algebra system Maple.
%K Computer Science, Symbolic Computation, cs.SC

Baumgartner, P., Bax, J., & Waldmann, U. (2015). Beagle -- A Hierarchic Superposition Theorem Prover. In

*Automated Deduction -- CADE-25*. Berlin, Germany: Springer. doi:10.1007/978-3-319-21401-6_25Export

BibTeX

@inproceedings{BaumgartnerCADE2015,
TITLE = {Beagle -- A Hierarchic Superposition Theorem Prover},
AUTHOR = {Baumgartner, Peter and Bax, Joshua and Waldmann, Uwe},
LANGUAGE = {eng},
ISBN = {978-3-319-21400-9},
DOI = {10.1007/978-3-319-21401-6_25},
PUBLISHER = {Springer},
YEAR = {2015},
DATE = {2015},
BOOKTITLE = {Automated Deduction -- CADE-25},
EDITOR = {Felty, Amy P. and Middeldorp, Aart},
PAGES = {367--377},
SERIES = {Lecture Notes in Artificial Intelligence},
VOLUME = {9195},
ADDRESS = {Berlin, Germany},
}

Endnote

%0 Conference Proceedings
%A Baumgartner, Peter
%A Bax, Joshua
%A Waldmann, Uwe
%+ External Organizations
External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
%T Beagle -- A Hierarchic Superposition Theorem Prover :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0029-07D8-3
%R 10.1007/978-3-319-21401-6_25
%D 2015
%B 25th International Conference on Automated Deduction
%Z date of event: 2015-08-01 - 2015-08-07
%C Berlin, Germany
%B Automated Deduction -- CADE-25
%E Felty, Amy P.; Middeldorp, Aart
%P 367 - 377
%I Springer
%@ 978-3-319-21400-9
%B Lecture Notes in Artificial Intelligence
%N 9195

Blanchette, J. C., Popescu, A., & Traytel, D. (2015a). Foundational Extensible Corecursion. Retrieved from http://arxiv.org/abs/1501.05425

(arXiv: 1501.05425) Abstract

This paper presents a formalized framework for defining corecursive functions
safely in a total setting, based on corecursion up-to and relational
parametricity. The end product is a general corecursor that allows corecursive
(and even recursive) calls under well-behaved operations, including
constructors. Corecursive functions that are well behaved can be registered as
such, thereby increasing the corecursor's expressiveness. The metatheory is
formalized in the Isabelle proof assistant and forms the core of a prototype
tool. The corecursor is derived from first principles, without requiring new
axioms or extensions of the logic.

Export

BibTeX

@online{BlanchetteFoundArxiv15,
TITLE = {Foundational Extensible Corecursion},
AUTHOR = {Blanchette, Jasmin Christian and Popescu, Andrei and Traytel, Dmitriy},
LANGUAGE = {eng},
URL = {http://arxiv.org/abs/1501.05425},
EPRINT = {1501.05425},
EPRINTTYPE = {arXiv},
YEAR = {2015},
ABSTRACT = {This paper presents a formalized framework for defining corecursive functions safely in a total setting, based on corecursion up-to and relational parametricity. The end product is a general corecursor that allows corecursive (and even recursive) calls under well-behaved operations, including constructors. Corecursive functions that are well behaved can be registered as such, thereby increasing the corecursor's expressiveness. The metatheory is formalized in the Isabelle proof assistant and forms the core of a prototype tool. The corecursor is derived from first principles, without requiring new axioms or extensions of the logic.},
}

Endnote

%0 Report
%A Blanchette, Jasmin Christian
%A Popescu, Andrei
%A Traytel, Dmitriy
%+ Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T Foundational Extensible Corecursion :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0029-5B30-5
%U http://arxiv.org/abs/1501.05425
%D 2015
%8 22.01.2015
%X This paper presents a formalized framework for defining corecursive functions
safely in a total setting, based on corecursion up-to and relational
parametricity. The end product is a general corecursor that allows corecursive
(and even recursive) calls under well-behaved operations, including
constructors. Corecursive functions that are well behaved can be registered as
such, thereby increasing the corecursor's expressiveness. The metatheory is
formalized in the Isabelle proof assistant and forms the core of a prototype
tool. The corecursor is derived from first principles, without requiring new
axioms or extensions of the logic.
%K Computer Science, Programming Languages, cs.PL

Blanchette, J. C., Popescu, A., & Traytel, D. (2015b). Foundational Extensible Corecursion: A Proof Assistant Perspective. In

*ACM SIGPLAN Notices (Proc. ICFP 2015)*(Vol. 50). Vancouver, BC, Canada: ACM. doi:10.1145/2784731.2784732Export

BibTeX

@inproceedings{DBLP:conf/icfp/Blanchette0T15,
TITLE = {Foundational Extensible Corecursion: A Proof Assistant Perspective},
AUTHOR = {Blanchette, Jasmin Christian and Popescu, Andrei and Traytel, Dmitriy},
LANGUAGE = {eng},
ISSN = {0362-1340},
ISBN = {978-1-4503-3669-7},
DOI = {10.1145/2784731.2784732},
PUBLISHER = {ACM},
PUBLISHER = {ACM Press},
YEAR = {2015},
DATE = {2015},
BOOKTITLE = {Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming (ICFP 2015)},
PAGES = {192--204},
JOURNAL = {ACM SIGPLAN Notices (Proc. ICFP)},
VOLUME = {50},
ISSUE = {9},
ADDRESS = {Vancouver, BC, Canada},
}

Endnote

%0 Conference Proceedings
%A Blanchette, Jasmin Christian
%A Popescu, Andrei
%A Traytel, Dmitriy
%+ Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T Foundational Extensible Corecursion: A Proof Assistant Perspective :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0029-5B18-E
%R 10.1145/2784731.2784732
%D 2015
%B 20th ACM SIGPLAN International Conference on Functional Programming
%Z date of event: 2015-09-01 - 2015-09-03
%C Vancouver, BC, Canada
%B Proceedings of the 20th ACM SIGPLAN International Conference on
Functional Programming
%P 192 - 204
%I ACM
%@ 978-1-4503-3669-7
%J ACM SIGPLAN Notices
%V 50
%N 9
%I ACM Press
%@ false
%U http://doi.acm.org/10.1145/2784731.2784732

Blanchette, J. C., Haslbeck, M., Matichuk, D., & Nipkow, T. (2015). Mining the Archive of Formal Proofs. In

*Intelligent Computer Mathematics (CICM 2015)*. Washington, DC, USA: Springer. doi:10.1007/978-3-319-20615-8_1Export

BibTeX

@inproceedings{BlanchetteCIKM2015,
TITLE = {Mining the Archive of Formal Proofs},
AUTHOR = {Blanchette, Jasmin Christian and Haslbeck, Maximilian and Matichuk, Daniel and Nipkow, Tobias},
LANGUAGE = {eng},
ISBN = {978-3-319-20614-1},
DOI = {10.1007/978-3-319-20615-8_1},
PUBLISHER = {Springer},
YEAR = {2015},
DATE = {2015},
BOOKTITLE = {Intelligent Computer Mathematics (CICM 2015)},
EDITOR = {Kerber, Manfred and Carette, Jacques and Kaliszyk, Cezary and Rabe, Florian and Sorge, Volker},
PAGES = {3--17},
SERIES = {Lecture Notes in Artificial Intelligence},
VOLUME = {9150},
ADDRESS = {Washington, DC, USA},
}

Endnote

%0 Conference Proceedings
%A Blanchette, Jasmin Christian
%A Haslbeck, Maximilian
%A Matichuk, Daniel
%A Nipkow, Tobias
%+ Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
External Organizations
%T Mining the Archive of Formal Proofs :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0028-5D84-A
%R 10.1007/978-3-319-20615-8_1
%D 2015
%B International Conference on Intelligent Computer Mathematics
%Z date of event: 2015-07-13 - 2015-07-17
%C Washington, DC, USA
%B Intelligent Computer Mathematics
%E Kerber, Manfred; Carette, Jacques; Kaliszyk, Cezary; Rabe, Florian; Sorge, Volker
%P 3 - 17
%I Springer
%@ 978-3-319-20614-1
%B Lecture Notes in Artificial Intelligence
%N 9150

Blanchette, J. C., & Kosmatov, N. (Eds.). (2015).

*Tests and Proofs*. Presented at the 9th International Conference on Tests & Proofs, L’Aquila, Italy: Springer. doi:10.1007/978-3-319-21215-9Export

BibTeX

@proceedings{DBLP:conf/tap/2015,
TITLE = {Tests and Proofs (TAP 2015)},
EDITOR = {Blanchette, Jasmin Christian and Kosmatov, Nikolai},
LANGUAGE = {eng},
ISSN = {0302-9743},
ISBN = {978-3-319-21214-2},
DOI = {10.1007/978-3-319-21215-9},
PUBLISHER = {Springer},
YEAR = {2015},
DATE = {2015},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {9154},
ADDRESS = {L'Aquila, Italy},
}

Endnote

%0 Conference Proceedings
%E Blanchette, Jasmin Christian
%E Kosmatov, Nikolai
%+ Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
%T Tests and Proofs : 9th International Conference, TAP 2015, Held as Part of STAF 2015 ; L'Aquila, Italy, July 22-24, 2015 ; Proceedings
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0029-5B21-7
%@ 978-3-319-21214-2
%R 10.1007/978-3-319-21215-9
%I Springer
%D 2015
%B 9th International Conference on Tests & Proofs
%Z date of event: 2015-07-22 - 2015-07-24
%D 2015
%C L'Aquila, Italy
%S Lecture Notes in Computer Science
%V 9154
%@ false

Blanchette, J. C., Popescu, A., & Traytel, D. (2015c). Witnessing (Co)datatypes. In

*Programming Languages and Systems (ESOP 2015)*. London, UK: Springer. doi:10.1007/978-3-662-46669-8_15Export

BibTeX

@inproceedings{BlanchetteESOP2015,
TITLE = {Witnessing (Co)datatypes},
AUTHOR = {Blanchette, Jasmin Christian and Popescu, Andrei and Traytel, Dmitriy},
LANGUAGE = {eng},
ISBN = {978-3-662-46668-1},
DOI = {10.1007/978-3-662-46669-8_15},
PUBLISHER = {Springer},
YEAR = {2015},
DATE = {2015},
BOOKTITLE = {Programming Languages and Systems (ESOP 2015)},
EDITOR = {Vitek, Jan},
PAGES = {359--382},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {9032},
ADDRESS = {London, UK},
}

Endnote

%0 Conference Proceedings
%A Blanchette, Jasmin Christian
%A Popescu, Andrei
%A Traytel, Dmitriy
%+ Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T Witnessing (Co)datatypes :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0028-E142-C
%R 10.1007/978-3-662-46669-8_15
%D 2015
%B 24th European Symposium on Programming
%Z date of event: 2015-04-11 - 2015-04-18
%C London, UK
%B Programming Languages and Systems
%E Vitek, Jan
%P 359 - 382
%I Springer
%@ 978-3-662-46668-1
%B Lecture Notes in Computer Science
%N 9032

Bromberger, M., Sturm, T., & Weidenbach, C. (2015a). Linear Integer Arithmetic Revisited. In

*Automated Deduction -- CADE-25*. Berlin, Germany: Springer. doi:10.1007/978-3-319-21401-6_42Export

BibTeX

@inproceedings{BrombergerCADE2015,
TITLE = {Linear Integer Arithmetic Revisited},
AUTHOR = {Bromberger, Martin and Sturm, Thomas and Weidenbach, Christoph},
LANGUAGE = {eng},
ISBN = {978-3-319-21400-9},
DOI = {10.1007/978-3-319-21401-6_42},
PUBLISHER = {Springer},
YEAR = {2015},
DATE = {2015},
BOOKTITLE = {Automated Deduction -- CADE-25},
EDITOR = {Felty, Amy P. and Middeldorp, Aart},
PAGES = {623--637},
SERIES = {Lecture Notes in Artificial Intelligence},
VOLUME = {9195},
ADDRESS = {Berlin, Germany},
}

Endnote

%0 Conference Proceedings
%A Bromberger, Martin
%A Sturm, Thomas
%A Weidenbach, Christoph
%+ Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T Linear Integer Arithmetic Revisited :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0028-8EE6-9
%R 10.1007/978-3-319-21401-6_42
%D 2015
%B 25th International Conference on Automated Deduction
%Z date of event: 2015-08-01 - 2015-08-07
%C Berlin, Germany
%B Automated Deduction -- CADE-25
%E Felty, Amy P.; Middeldorp, Aart
%P 623 - 637
%I Springer
%@ 978-3-319-21400-9
%B Lecture Notes in Artificial Intelligence
%N 9195

Bromberger, M., Sturm, T., & Weidenbach, C. (2015b). Linear Integer Arithmetic Revisited. Retrieved from http://arxiv.org/abs/1503.02948

(arXiv: 1503.02948) Abstract

We consider feasibility of linear integer programs in the context of
verification systems such as SMT solvers or theorem provers. Although
satisfiability of linear integer programs is decidable, many state-of-the-art
solvers neglect termination in favor of efficiency. It is challenging to design
a solver that is both terminating and practically efficient. Recent work by
Jovanovic and de Moura constitutes an important step into this direction. Their
algorithm CUTSAT is sound, but does not terminate, in general. In this paper we
extend their CUTSAT algorithm by refined inference rules, a new type of
conflicting core, and a dedicated rule application strategy. This leads to our
algorithm CUTSAT++, which guarantees termination.

Export

BibTeX

@online{BrombergerSturmWeidenbacharXiv2015,
TITLE = {Linear Integer Arithmetic Revisited},
AUTHOR = {Bromberger, Martin and Sturm, Thomas and Weidenbach, Christoph},
LANGUAGE = {eng},
URL = {http://arxiv.org/abs/1503.02948},
EPRINT = {1503.02948},
EPRINTTYPE = {arXiv},
YEAR = {2015},
ABSTRACT = {We consider feasibility of linear integer programs in the context of verification systems such as SMT solvers or theorem provers. Although satisfiability of linear integer programs is decidable, many state-of-the-art solvers neglect termination in favor of efficiency. It is challenging to design a solver that is both terminating and practically efficient. Recent work by Jovanovic and de Moura constitutes an important step into this direction. Their algorithm CUTSAT is sound, but does not terminate, in general. In this paper we extend their CUTSAT algorithm by refined inference rules, a new type of conflicting core, and a dedicated rule application strategy. This leads to our algorithm CUTSAT++, which guarantees termination.},
}

Endnote

%0 Report
%A Bromberger, Martin
%A Sturm, Thomas
%A Weidenbach, Christoph
%+ Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T Linear Integer Arithmetic Revisited :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0025-6937-4
%U http://arxiv.org/abs/1503.02948
%D 2015
%8 10.03.2015
%X We consider feasibility of linear integer programs in the context of
verification systems such as SMT solvers or theorem provers. Although
satisfiability of linear integer programs is decidable, many state-of-the-art
solvers neglect termination in favor of efficiency. It is challenging to design
a solver that is both terminating and practically efficient. Recent work by
Jovanovic and de Moura constitutes an important step into this direction. Their
algorithm CUTSAT is sound, but does not terminate, in general. In this paper we
extend their CUTSAT algorithm by refined inference rules, a new type of
conflicting core, and a dedicated rule application strategy. This leads to our
algorithm CUTSAT++, which guarantees termination.
%K Computer Science, Logic in Computer Science, cs.LO

Brown, C. W., & Košta, M. (2015). Constructing a Single Cell in Cylindrical Algebraic Decomposition.

*Journal of Symbolic Computation*,*70*. doi:10.1016/j.jsc.2014.09.024Export

BibTeX

@article{BrownKosta:2014a,
TITLE = {Constructing a Single Cell in Cylindrical Algebraic Decomposition},
AUTHOR = {Brown, Christopher W. and Ko{\v s}ta, Marek},
LANGUAGE = {eng},
ISSN = {0747-7171},
DOI = {10.1016/j.jsc.2014.09.024},
PUBLISHER = {Academic Press},
ADDRESS = {London},
YEAR = {2015},
DATE = {2015},
JOURNAL = {Journal of Symbolic Computation},
VOLUME = {70},
PAGES = {14--48},
}

Endnote

%0 Journal Article
%A Brown, Christopher W.
%A Košta, Marek
%+ External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
%T Constructing a Single Cell in Cylindrical Algebraic Decomposition :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0024-920D-7
%R 10.1016/j.jsc.2014.09.024
%7 2015
%D 2015
%J Journal of Symbolic Computation
%V 70
%& 14
%P 14 - 48
%I Academic Press
%C London
%@ false

Damm, W., Horbach, M., & Sofronie-Stokkermans, V. (2015a).

*Decidability of Verification of Safety Properties of Spatial Families of Linear Hybrid Automata*(No. ATR111). SFB/TR 14 AVACS.Export

BibTeX

@techreport{atr111,
TITLE = {Decidability of Verification of Safety Properties of Spatial Families of Linear Hybrid Automata},
AUTHOR = {Damm, Werner and Horbach, Matthias and Sofronie-Stokkermans, Viorica},
LANGUAGE = {eng},
ISSN = {1860-9821},
NUMBER = {ATR111},
INSTITUTION = {SFB/TR 14 AVACS},
YEAR = {2015},
TYPE = {AVACS Technical Report},
VOLUME = {111},
}

Endnote

%0 Report
%A Damm, Werner
%A Horbach, Matthias
%A Sofronie-Stokkermans, Viorica
%+ External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T Decidability of Verification of Safety Properties of Spatial Families of Linear Hybrid Automata :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-002A-0805-6
%Y SFB/TR 14 AVACS
%D 2015
%P 52 p.
%B AVACS Technical Report
%N 111
%@ false

Damm, W., Horbach, M., & Sofronie-Stokkermans, V. (2015b). Decidability of Verification of Safety Properties of Spatial Families of Linear Hybrid Automata. In

*Frontiers of Combining Systems (FroCoS 2015)*. Wrocław, Poland: Springer. doi:10.1007/978-3-319-24246-0_12Export

BibTeX

@inproceedings{DammFroCoS2015,
TITLE = {Decidability of Verification of Safety Properties of Spatial Families of Linear Hybrid Automata},
AUTHOR = {Damm, Werner and Horbach, Matthias and Sofronie-Stokkermans, Viorica},
LANGUAGE = {eng},
ISBN = {978-3-319-2424},
DOI = {10.1007/978-3-319-24246-0_12},
PUBLISHER = {Springer},
YEAR = {2015},
DATE = {2015},
BOOKTITLE = {Frontiers of Combining Systems (FroCoS 2015)},
EDITOR = {Lutz, Carsten and Ranise, Silvio},
PAGES = {186--202},
SERIES = {Lecture Notes in Artificial Intelligence},
VOLUME = {9322},
ADDRESS = {Wroc{\l}aw, Poland},
}

Endnote

%0 Conference Proceedings
%A Damm, Werner
%A Horbach, Matthias
%A Sofronie-Stokkermans, Viorica
%+ External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T Decidability of Verification of Safety Properties of Spatial Families of Linear Hybrid Automata :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0029-474D-8
%R 10.1007/978-3-319-24246-0_12
%D 2015
%B 10th International Symposium on Frontiers of Combining Systems
%Z date of event: 2015-09-21 - 2015-09-24
%C Wrocław, Poland
%B Frontiers of Combining Systems
%E Lutz, Carsten; Ranise, Silvio
%P 186 - 202
%I Springer
%@ 978-3-319-2424
%B Lecture Notes in Artificial Intelligence
%N 9322

Errami, H., Eiswirth, M., Grigoriev, D., Seiler, W. M., Sturm, T., & Weber, A. (2015). Detection of Hopf Bifurcations in Chemical Reaction Networks Using Convex Coordinates.

*Journal of Computational Physics*,*291*. doi:10.1016/j.jcp.2015.02.050Export

BibTeX

@article{ErramiEiswirth:15a,
TITLE = {Detection of {Hopf} Bifurcations in Chemical Reaction Networks Using Convex Coordinates},
AUTHOR = {Errami, Hassan and Eiswirth, Markus and Grigoriev, Dima and Seiler, Werner M. and Sturm, Thomas and Weber, Andreas},
LANGUAGE = {eng},
ISSN = {0021-9991},
DOI = {10.1016/j.jcp.2015.02.050},
PUBLISHER = {Elsevier},
ADDRESS = {Amsterdam},
YEAR = {2015},
DATE = {2015},
JOURNAL = {Journal of Computational Physics},
VOLUME = {291},
PAGES = {279--302},
}

Endnote

%0 Journal Article
%A Errami, Hassan
%A Eiswirth, Markus
%A Grigoriev, Dima
%A Seiler, Werner M.
%A Sturm, Thomas
%A Weber, Andreas
%+ External Organizations
External Organizations
External Organizations
External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
%T Detection of Hopf Bifurcations in Chemical Reaction Networks Using Convex Coordinates :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0024-E260-7
%R 10.1016/j.jcp.2015.02.050
%7 2015-03-16
%D 2015
%J Journal of Computational Physics
%V 291
%& 279
%P 279 - 302
%I Elsevier
%C Amsterdam
%@ false

Fontaine, P., Sturm, T., & Waldmann, U. (2015). Foreword to the Special Focus on Constraints and Combinations.

*Mathematics in Computer Science*,*9*(3). doi:10.1007/s11786-015-0239-8Export

BibTeX

@article{DBLP:journals/mics/FontaineSW15,
TITLE = {Foreword to the Special Focus on Constraints and Combinations},
AUTHOR = {Fontaine, Pascal and Sturm, Thomas and Waldmann, Uwe},
LANGUAGE = {eng},
ISSN = {1661-8270},
DOI = {10.1007/s11786-015-0239-8},
PUBLISHER = {Birkh{\"a}user},
ADDRESS = {Basel},
YEAR = {2015},
DATE = {2015},
JOURNAL = {Mathematics in Computer Science},
VOLUME = {9},
NUMBER = {3},
PAGES = {265--265},
}

Endnote

%0 Journal Article
%A Fontaine, Pascal
%A Sturm, Thomas
%A Waldmann, Uwe
%+ External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T Foreword to the Special Focus on Constraints and Combinations :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0029-661F-9
%R 10.1007/s11786-015-0239-8
%7 2015
%D 2015
%J Mathematics in Computer Science
%V 9
%N 3
%& 265
%P 265 - 265
%I Birkhäuser
%C Basel
%@ false

Hagemann, W. (2015).

*Symbolic Orthogonal Projections: A New Polyhedral Representation for Reachability Analysis of Hybrid Systems*. Universität des Saarlandes, Saarbrücken.Export

BibTeX

@phdthesis{HagemannPhd15,
TITLE = {Symbolic Orthogonal Projections: A New Polyhedral Representation for Reachability Analysis of Hybrid Systems},
AUTHOR = {Hagemann, Willem},
LANGUAGE = {eng},
SCHOOL = {Universit{\"a}t des Saarlandes},
ADDRESS = {Saarbr{\"u}cken},
YEAR = {2015},
DATE = {2015},
}

Endnote

%0 Thesis
%A Hagemann, Willem
%Y Weidenbach, Christoph
%A referee: Fränzle, Martin
%+ Automation of Logic, MPI for Informatics, Max Planck Society
International Max Planck Research School, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
%T Symbolic Orthogonal Projections: A New Polyhedral Representation for Reachability Analysis of Hybrid Systems :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0029-26AA-2
%I Universität des Saarlandes
%C Saarbrücken
%D 2015
%P XIII, 94 p.
%V phd
%9 phd
%U http://scidok.sulb.uni-saarland.de/volltexte/2015/6304/http://scidok.sulb.uni-saarland.de/doku/lic_ohne_pod.php?la=de

Hoeltgen, L., Mainberger, M., Hoffmann, S., Weickert, J., Tang, C. H., Setzer, S., … Doerr, B. (2015). Optimising Spatial and Tonal Data for PDE-based Inpainting. Retrieved from http://arxiv.org/abs/1506.04566

(arXiv: 1506.04566) Abstract

Some recent methods for lossy signal and image compression store only a few
selected pixels and fill in the missing structures by inpainting with a partial
differential equation (PDE). Suitable operators include the Laplacian, the
biharmonic operator, and edge-enhancing anisotropic diffusion (EED). The
quality of such approaches depends substantially on the selection of the data
that is kept. Optimising this data in the domain and codomain gives rise to
challenging mathematical problems that shall be addressed in our work.
In the 1D case, we prove results that provide insights into the difficulty of
this problem, and we give evidence that a splitting into spatial and tonal
(i.e. function value) optimisation does hardly deteriorate the results. In the
2D setting, we present generic algorithms that achieve a high reconstruction
quality even if the specified data is very sparse. To optimise the spatial
data, we use a probabilistic sparsification, followed by a nonlocal pixel
exchange that avoids getting trapped in bad local optima. After this spatial
optimisation we perform a tonal optimisation that modifies the function values
in order to reduce the global reconstruction error. For homogeneous diffusion
inpainting, this comes down to a least squares problem for which we prove that
it has a unique solution. We demonstrate that it can be found efficiently with
a gradient descent approach that is accelerated with fast explicit diffusion
(FED) cycles. Our framework allows to specify the desired density of the
inpainting mask a priori. Moreover, is more generic than other data
optimisation approaches for the sparse inpainting problem, since it can also be
extended to nonlinear inpainting operators such as EED. This is exploited to
achieve reconstructions with state-of-the-art quality.
We also give an extensive literature survey on PDE-based image compression
methods.

Export

BibTeX

@online{DBLP:journals/corr/HoeltgenMHWTSJN15,
TITLE = {Optimising Spatial and Tonal Data for {PDE}-based Inpainting},
AUTHOR = {Hoeltgen, Laurent and Mainberger, Markus and Hoffmann, Sebastian and Weickert, Joachim and Tang, Ching Hoo and Setzer, Simon and Johannsen, Daniel and Neumann, Frank and Doerr, Benjamin},
LANGUAGE = {eng},
URL = {http://arxiv.org/abs/1506.04566},
EPRINT = {1506.04566},
EPRINTTYPE = {arXiv},
YEAR = {2015},
ABSTRACT = {Some recent methods for lossy signal and image compression store only a few selected pixels and fill in the missing structures by inpainting with a partial differential equation (PDE). Suitable operators include the Laplacian, the biharmonic operator, and edge-enhancing anisotropic diffusion (EED). The quality of such approaches depends substantially on the selection of the data that is kept. Optimising this data in the domain and codomain gives rise to challenging mathematical problems that shall be addressed in our work. In the 1D case, we prove results that provide insights into the difficulty of this problem, and we give evidence that a splitting into spatial and tonal (i.e. function value) optimisation does hardly deteriorate the results. In the 2D setting, we present generic algorithms that achieve a high reconstruction quality even if the specified data is very sparse. To optimise the spatial data, we use a probabilistic sparsification, followed by a nonlocal pixel exchange that avoids getting trapped in bad local optima. After this spatial optimisation we perform a tonal optimisation that modifies the function values in order to reduce the global reconstruction error. For homogeneous diffusion inpainting, this comes down to a least squares problem for which we prove that it has a unique solution. We demonstrate that it can be found efficiently with a gradient descent approach that is accelerated with fast explicit diffusion (FED) cycles. Our framework allows to specify the desired density of the inpainting mask a priori. Moreover, is more generic than other data optimisation approaches for the sparse inpainting problem, since it can also be extended to nonlinear inpainting operators such as EED. This is exploited to achieve reconstructions with state-of-the-art quality. We also give an extensive literature survey on PDE-based image compression methods.},
}

Endnote

%0 Report
%A Hoeltgen, Laurent
%A Mainberger, Markus
%A Hoffmann, Sebastian
%A Weickert, Joachim
%A Tang, Ching Hoo
%A Setzer, Simon
%A Johannsen, Daniel
%A Neumann, Frank
%A Doerr, Benjamin
%+ External Organizations
External Organizations
External Organizations
External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
External Organizations
External Organizations
%T Optimising Spatial and Tonal Data for PDE-based Inpainting :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0029-661C-F
%U http://arxiv.org/abs/1506.04566
%D 2015
%X Some recent methods for lossy signal and image compression store only a few
selected pixels and fill in the missing structures by inpainting with a partial
differential equation (PDE). Suitable operators include the Laplacian, the
biharmonic operator, and edge-enhancing anisotropic diffusion (EED). The
quality of such approaches depends substantially on the selection of the data
that is kept. Optimising this data in the domain and codomain gives rise to
challenging mathematical problems that shall be addressed in our work.
In the 1D case, we prove results that provide insights into the difficulty of
this problem, and we give evidence that a splitting into spatial and tonal
(i.e. function value) optimisation does hardly deteriorate the results. In the
2D setting, we present generic algorithms that achieve a high reconstruction
quality even if the specified data is very sparse. To optimise the spatial
data, we use a probabilistic sparsification, followed by a nonlocal pixel
exchange that avoids getting trapped in bad local optima. After this spatial
optimisation we perform a tonal optimisation that modifies the function values
in order to reduce the global reconstruction error. For homogeneous diffusion
inpainting, this comes down to a least squares problem for which we prove that
it has a unique solution. We demonstrate that it can be found efficiently with
a gradient descent approach that is accelerated with fast explicit diffusion
(FED) cycles. Our framework allows to specify the desired density of the
inpainting mask a priori. Moreover, is more generic than other data
optimisation approaches for the sparse inpainting problem, since it can also be
extended to nonlinear inpainting operators such as EED. This is exploited to
achieve reconstructions with state-of-the-art quality.
We also give an extensive literature survey on PDE-based image compression
methods.
%K Computer Science, Computer Vision and Pattern Recognition, cs.CV,Mathematics, Optimization and Control, math.OC,

Jaroschek, M., Dobal, P. F., & Fontaine, P. (2015). Adapting Real Quantifier Elimination Methods for Conflict Set Computation. In

*Frontiers of Combining Systems (FroCoS 2015)*. Wrocław, Poland: Springer. doi:10.1007/978-3-319-24246-0_10Export

BibTeX

@inproceedings{JaroschekFroCoS2015,
TITLE = {Adapting Real Quantifier Elimination Methods for Conflict Set Computation},
AUTHOR = {Jaroschek, Maximilian and Dobal, Pablo Federico and Fontaine, Pascal},
LANGUAGE = {eng},
ISBN = {978-3-319-2424},
DOI = {10.1007/978-3-319-24246-0_10},
PUBLISHER = {Springer},
YEAR = {2015},
DATE = {2015},
BOOKTITLE = {Frontiers of Combining Systems (FroCoS 2015)},
EDITOR = {Lutz, Carsten and Ranise, Silvio},
PAGES = {151--166},
SERIES = {Lecture Notes in Artificial Intelligence},
VOLUME = {9322},
ADDRESS = {Wroc{\l}aw, Poland},
}

Endnote

%0 Conference Proceedings
%A Jaroschek, Maximilian
%A Dobal, Pablo Federico
%A Fontaine, Pascal
%+ Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T Adapting Real Quantifier Elimination Methods for Conflict Set Computation :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0029-4794-8
%R 10.1007/978-3-319-24246-0_10
%D 2015
%B 10th International Symposium on Frontiers of Combining Systems
%Z date of event: 2015-09-21 - 2015-09-24
%C Wrocław, Poland
%B Frontiers of Combining Systems
%E Lutz, Carsten; Ranise, Silvio
%P 151 - 166
%I Springer
%@ 978-3-319-2424
%B Lecture Notes in Artificial Intelligence
%N 9322

Junk, C., Rößger, R., Rock, G., Theis, K., Weidenbach, C., & Wischnewski, P. (2015). Model-Based Variant Management with v.control. In

*Transdisciplinary Lifecycle Analysis of Systems (ISPE CE 2015)*. Delft, The Netherlands: IOS Press. doi:10.3233/978-1-61499-544-9-194Export

BibTeX

@inproceedings{JunkISPECE2015,
TITLE = {Model-Based Variant Management with v.control},
AUTHOR = {Junk, Christopher and R{\"o}{\ss}ger, Robert and Rock, Georg and Theis, Karsten and Weidenbach, Christoph and Wischnewski, Patrick},
LANGUAGE = {eng},
ISBN = {978-1-61499-543-2},
DOI = {10.3233/978-1-61499-544-9-194},
PUBLISHER = {IOS Press},
YEAR = {2015},
DATE = {2015},
BOOKTITLE = {Transdisciplinary Lifecycle Analysis of Systems (ISPE CE 2015)},
EDITOR = {Curran, Richard and Wognum, Nel and Borsato, Milton and Stiepandic, Josip and Verhagen, Wim J. C.},
PAGES = {194--203},
SERIES = {Advances in Transdisciplinary Engineering},
VOLUME = {2},
ADDRESS = {Delft, The Netherlands},
}

Endnote

%0 Conference Proceedings
%A Junk, Christopher
%A Rößger, Robert
%A Rock, Georg
%A Theis, Karsten
%A Weidenbach, Christoph
%A Wischnewski, Patrick
%+ External Organizations
External Organizations
External Organizations
External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
%T Model-Based Variant Management with v.control :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0028-8F1F-5
%R 10.3233/978-1-61499-544-9-194
%D 2015
%B 22nd ISPE Inc. International Conference on Concurrent Engineering
%Z date of event: 2015-07-20 - 2015-07-23
%C Delft, The Netherlands
%B Transdisciplinary Lifecycle Analysis of Systems
%E Curran, Richard; Wognum, Nel; Borsato, Milton; Stiepandic, Josip; Verhagen, Wim J. C.
%P 194 - 203
%I IOS Press
%@ 978-1-61499-543-2
%B Advances in Transdisciplinary Engineering
%N 2

Kauers, M., Jaroschek, M., & Johannson, F. (2015). Ore Polynomials in Sage. In

*Computer Algebra and Polynomials*. Berlin: Springer. doi:10.1007/978-3-319-15081-9_6Export

BibTeX

@incollection{DBLP:series/lncs/KauersJJ15,
TITLE = {Ore Polynomials in {Sage}},
AUTHOR = {Kauers, Manuel and Jaroschek, Maximilian and Johannson, Frederik},
LANGUAGE = {eng},
ISBN = {978-3-319-15080-2},
DOI = {10.1007/978-3-319-15081-9_6},
PUBLISHER = {Springer},
ADDRESS = {Berlin},
YEAR = {2015},
DATE = {2015},
BOOKTITLE = {Computer Algebra and Polynomials},
EDITOR = {Gutierrez, Jaime and Schicho, Josef and Weiman, Martin},
PAGES = {105--125},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {8942},
}

Endnote

%0 Book Section
%A Kauers, Manuel
%A Jaroschek, Maximilian
%A Johannson, Frederik
%+ External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
%T Ore Polynomials in Sage :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0029-6633-A
%R 10.1007/978-3-319-15081-9_6
%D 2015
%B Computer Algebra and Polynomials
%E Gutierrez, Jaime; Schicho, Josef; Weiman, Martin
%P 105 - 125
%I Springer
%C Berlin
%@ 978-3-319-15080-2
%S Lecture Notes in Computer Science
%N 8942

Klein, F., & Zimmermann, M. (2015). How Much Lookahead is Needed to Win Infinite Games? In

*Automata, Languages, and Programming (ICALP 2015)*. Kyoto, Japan: Springer. doi:10.1007/978-3-662-47666-6_36Export

BibTeX

@inproceedings{Kleinlncs15,
TITLE = {How Much Lookahead is Needed to Win Infinite Games?},
AUTHOR = {Klein, Felix and Zimmermann, Martin},
LANGUAGE = {eng},
ISBN = {978-3-662-47665-9},
DOI = {10.1007/978-3-662-47666-6_36},
PUBLISHER = {Springer},
YEAR = {2015},
DATE = {2015},
BOOKTITLE = {Automata, Languages, and Programming (ICALP 2015)},
EDITOR = {Halld{\'o}rsson, Magnus M. and Iwama, Kazuo and Kobayashi, Naoki and Speckmann, Bettina},
PAGES = {452--463},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {9135},
ADDRESS = {Kyoto, Japan},
}

Endnote

%0 Conference Proceedings
%A Klein, Felix
%A Zimmermann, Martin
%+ Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
%T How Much Lookahead is Needed to Win Infinite Games? :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0029-6621-1
%R 10.1007/978-3-662-47666-6_36
%D 2015
%B 42nd International Colloquium on Automata, Languages, and Programming
%Z date of event: 2015-07-06 - 2015-07-10
%C Kyoto, Japan
%B Automata, Languages, and Programming
%E Halldórsson, Magnus M.; Iwama, Kazuo; Kobayashi, Naoki; Speckmann, Bettina
%P 452 - 463
%I Springer
%@ 978-3-662-47665-9
%B Lecture Notes in Computer Science
%N 9135

Klein, F., & Zimmerman, M. (2015). What are Strategies in Delay Games? Borel Determinacy for Games with Lookahead. In

*24th EACSL Annual Conference on Computer Science Logic*. Berlin, Germany: Wadern. doi:10.4230/LIPIcs.CSL.2015.519Export

BibTeX

@inproceedings{KleinZ15,
TITLE = {What are Strategies in Delay Games? {B}orel Determinacy for Games with Lookahead},
AUTHOR = {Klein, Felix and Zimmerman, Martin},
LANGUAGE = {eng},
ISSN = {1868-8969},
ISBN = {978-3-939897-90-3},
URL = {urn:nbn:de:0030-drops-54354},
DOI = {10.4230/LIPIcs.CSL.2015.519},
PUBLISHER = {Wadern},
YEAR = {2015},
BOOKTITLE = {24th EACSL Annual Conference on Computer Science Logic},
EDITOR = {Kreutzer, Stephan},
PAGES = {519--533},
SERIES = {Leibniz International Proceedings in Informatics},
VOLUME = {41},
ADDRESS = {Berlin, Germany},
}

Endnote

%0 Conference Proceedings
%A Klein, Felix
%A Zimmerman, Martin
%+ Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
%T What are Strategies in Delay Games? Borel Determinacy for Games with Lookahead :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0029-662F-5
%R 10.4230/LIPIcs.CSL.2015.519
%U urn:nbn:de:0030-drops-54354
%D 2015
%B 24th EACSL Annual Conference on Computer Science Logic
%Z date of event: 2015-09-07 - 2015-09-10
%C Berlin, Germany
%B 24th EACSL Annual Conference on Computer Science Logic
%E Kreutzer, Stephan
%P 519 - 533
%I Wadern
%@ 978-3-939897-90-3
%B Leibniz International Proceedings in Informatics
%N 41
%@ false
%U http://drops.dagstuhl.de/opus/volltexte/2015/5435/http://drops.dagstuhl.de/doku/urheberrecht1.html

Košta, M., & Sturm, T. (2015). A Generalized Framework for Virtual Substitution. Retrieved from http://arxiv.org/abs/1501.05826

(arXiv: 1501.05826) Abstract

We generalize the framework of virtual substitution for real quantifier
elimination to arbitrary but bounded degrees. We make explicit the
representation of test points in elimination sets using roots of parametric
univariate polynomials described by Thom codes. Our approach follows an early
suggestion by Weispfenning, which has never been carried out explicitly.
Inspired by virtual substitution for linear formulas, we show how to
systematically construct elimination sets containing only test points
representing lower bounds.

Export

BibTeX

@online{KostaSturmarXiv2015,
TITLE = {A Generalized Framework for Virtual Substitution},
AUTHOR = {Ko{\v s}ta, Marek and Sturm, Thomas},
LANGUAGE = {eng},
URL = {http://arxiv.org/abs/1501.05826},
EPRINT = {1501.05826},
EPRINTTYPE = {arXiv},
YEAR = {2015},
ABSTRACT = {We generalize the framework of virtual substitution for real quantifier elimination to arbitrary but bounded degrees. We make explicit the representation of test points in elimination sets using roots of parametric univariate polynomials described by Thom codes. Our approach follows an early suggestion by Weispfenning, which has never been carried out explicitly. Inspired by virtual substitution for linear formulas, we show how to systematically construct elimination sets containing only test points representing lower bounds.},
}

Endnote

%0 Report
%A Košta, Marek
%A Sturm, Thomas
%+ Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T A Generalized Framework for Virtual Substitution :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0024-A3C1-0
%U http://arxiv.org/abs/1501.05826
%D 2015
%X We generalize the framework of virtual substitution for real quantifier
elimination to arbitrary but bounded degrees. We make explicit the
representation of test points in elimination sets using roots of parametric
univariate polynomials described by Thom codes. Our approach follows an early
suggestion by Weispfenning, which has never been carried out explicitly.
Inspired by virtual substitution for linear formulas, we show how to
systematically construct elimination sets containing only test points
representing lower bounds.
%K Computer Science, Symbolic Computation, cs.SC,Computer Science, Logic in Computer Science, cs.LO

Košta, M., Sturm, T., & Dolzmann, A. (2015). Better Answers to Real Questions. Retrieved from http://arxiv.org/abs/1501.05098

(arXiv: 1501.05098) Abstract

We consider existential problems over the reals. Extended quantifier
elimination generalizes the concept of regular quantifier elimination by
providing in addition answers, which are descriptions of possible assignments
for the quantified variables. Implementations of extended quantifier
elimination via virtual substitution have been successfully applied to various
problems in science and engineering. So far, the answers produced by these
implementations included infinitesimal and infinite numbers, which are hard to
interpret in practice. We introduce here a post-processing procedure to
convert, for fixed parameters, all answers into standard real numbers. The
relevance of our procedure is demonstrated by application of our implementation
to various examples from the literature, where it significantly improves the
quality of the results.

Export

BibTeX

@online{KostaarXiv2015,
TITLE = {Better Answers to Real Questions},
AUTHOR = {Ko{\v s}ta, Marek and Sturm, Thomas and Dolzmann, Andreas},
LANGUAGE = {eng},
URL = {http://arxiv.org/abs/1501.05098},
EPRINT = {1501.05098},
EPRINTTYPE = {arXiv},
YEAR = {2015},
ABSTRACT = {We consider existential problems over the reals. Extended quantifier elimination generalizes the concept of regular quantifier elimination by providing in addition answers, which are descriptions of possible assignments for the quantified variables. Implementations of extended quantifier elimination via virtual substitution have been successfully applied to various problems in science and engineering. So far, the answers produced by these implementations included infinitesimal and infinite numbers, which are hard to interpret in practice. We introduce here a post-processing procedure to convert, for fixed parameters, all answers into standard real numbers. The relevance of our procedure is demonstrated by application of our implementation to various examples from the literature, where it significantly improves the quality of the results.},
}

Endnote

%0 Report
%A Košta, Marek
%A Sturm, Thomas
%A Dolzmann, Andreas
%+ Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
%T Better Answers to Real Questions :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0024-9D8E-2
%U http://arxiv.org/abs/1501.05098
%D 2015
%X We consider existential problems over the reals. Extended quantifier
elimination generalizes the concept of regular quantifier elimination by
providing in addition answers, which are descriptions of possible assignments
for the quantified variables. Implementations of extended quantifier
elimination via virtual substitution have been successfully applied to various
problems in science and engineering. So far, the answers produced by these
implementations included infinitesimal and infinite numbers, which are hard to
interpret in practice. We introduce here a post-processing procedure to
convert, for fixed parameters, all answers into standard real numbers. The
relevance of our procedure is demonstrated by application of our implementation
to various examples from the literature, where it significantly improves the
quality of the results.
%K Computer Science, Symbolic Computation, cs.SC,Computer Science, Logic in Computer Science, cs.LO

Lamotte-Schubert, M. (2015).

*Automatic Authorization Analysis*. Universität des Saarlandes, Saarbrücken. Retrieved from urn:nbn:de:bsz:291-scidok-62575Export

BibTeX

@phdthesis{LamottePhd15,
TITLE = {Automatic Authorization Analysis},
AUTHOR = {Lamotte-Schubert, Manuel},
LANGUAGE = {eng},
URL = {urn:nbn:de:bsz:291-scidok-62575},
SCHOOL = {Universit{\"a}t des Saarlandes},
ADDRESS = {Saarbr{\"u}cken},
YEAR = {2015},
DATE = {2015},
}

Endnote

%0 Thesis
%A Lamotte-Schubert, Manuel
%Y Weidenbach, Christoph
%A referee: Baumgartner, Peter
%+ Automation of Logic, MPI for Informatics, Max Planck Society
International Max Planck Research School, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
%T Automatic Authorization Analysis :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0028-FD0B-7
%U urn:nbn:de:bsz:291-scidok-62575
%I Universität des Saarlandes
%C Saarbrücken
%D 2015
%P 118 p.
%V phd
%9 phd
%U http://scidok.sulb.uni-saarland.de/volltexte/2015/6257/http://scidok.sulb.uni-saarland.de/doku/lic_ohne_pod.php?la=de

Reynolds, A., & Blanchette, J. C. (2015). A Decision Procedure for (Co)datatypes in SMT Solvers. In

*Automated Deduction -- CADE-25*. Berlin, Germany: Springer. doi:10.1007/978-3-319-21401-6_13Export

BibTeX

@inproceedings{ReynoldsCADE2015,
TITLE = {A Decision Procedure for (Co)datatypes in {SMT} Solvers},
AUTHOR = {Reynolds, Andrew and Blanchette, Jasmin Christian},
LANGUAGE = {eng},
ISBN = {978-3-319-21400-9},
DOI = {10.1007/978-3-319-21401-6_13},
PUBLISHER = {Springer},
YEAR = {2015},
DATE = {2015},
BOOKTITLE = {Automated Deduction -- CADE-25},
EDITOR = {Felty, Amy P. and Middeldorp, Aart},
PAGES = {197--213},
SERIES = {Lecture Notes in Artificial Intelligence},
VOLUME = {9195},
ADDRESS = {Berlin, Germany},
}

Endnote

%0 Conference Proceedings
%A Reynolds, Andrew
%A Blanchette, Jasmin Christian
%+ External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
%T A Decision Procedure for (Co)datatypes in SMT Solvers :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0029-07D5-9
%R 10.1007/978-3-319-21401-6_13
%D 2015
%B 25th International Conference on Automated Deduction
%Z date of event: 2015-08-01 - 2015-08-07
%C Berlin, Germany
%B Automated Deduction -- CADE-25
%E Felty, Amy P.; Middeldorp, Aart
%P 197 - 213
%I Springer
%@ 978-3-319-21400-9
%B Lecture Notes in Artificial Intelligence
%N 9195

Schmidt, R. A., & Waldmann, U. (2015a). Modal Tableau Systems with Blocking and Congruence Closure. In

*Automated Reasoning with Analytic Tableaux and Related Methods*. Wrocław, Poland: Springer. doi:10.1007/978-3-319-24312-2_4Export

BibTeX

@inproceedings{SchmidtTABLEAUX2015,
TITLE = {Modal Tableau Systems with Blocking and Congruence Closure},
AUTHOR = {Schmidt, Renate A. and Waldmann, Uwe},
LANGUAGE = {eng},
ISBN = {978-3-319-24311-5},
DOI = {10.1007/978-3-319-24312-2_4},
PUBLISHER = {Springer},
YEAR = {2015},
DATE = {2015},
BOOKTITLE = {Automated Reasoning with Analytic Tableaux and Related Methods},
EDITOR = {de Nivelle, Hans},
PAGES = {38--53},
SERIES = {Lecture Notes in Artificial Intelligence},
VOLUME = {9323},
ADDRESS = {Wroc{\l}aw, Poland},
}

Endnote

%0 Conference Proceedings
%A Schmidt, Renate A.
%A Waldmann, Uwe
%+ External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
%T Modal Tableau Systems with Blocking and Congruence Closure :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0029-4770-7
%R 10.1007/978-3-319-24312-2_4
%D 2015
%B 24th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
%Z date of event: 2015-09-21 - 2015-09-24
%C Wrocław, Poland
%B Automated Reasoning with Analytic Tableaux and Related Methods
%E de Nivelle, Hans
%P 38 - 53
%I Springer
%@ 978-3-319-24311-5
%B Lecture Notes in Artificial Intelligence
%N 9323

Schmidt, R. A., & Waldmann, U. (2015b).

*Modal Tableau Systems with Blocking and Congruence Closure*(No. uk-ac-man-scw:268816). Manchester: University of Manchester.Export

BibTeX

@techreport{SchmidtTR2015,
TITLE = {Modal Tableau Systems with Blocking and Congruence Closure},
AUTHOR = {Schmidt, Renate A. and Waldmann, Uwe},
LANGUAGE = {eng},
NUMBER = {uk-ac-man-scw:268816},
INSTITUTION = {University of Manchester},
ADDRESS = {Manchester},
YEAR = {2015},
TYPE = {eScholar},
}

Endnote

%0 Report
%A Schmidt, Renate A.
%A Waldmann, Uwe
%+ External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
%T Modal Tableau Systems with Blocking and Congruence Closure :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-002A-08BC-A
%Y University of Manchester
%C Manchester
%D 2015
%P 22 p.
%B eScholar
%U https://www.escholar.manchester.ac.uk/uk-ac-man-scw:268816https://www.research.manchester.ac.uk/portal/files/32297317/FULL_TEXT.PDF

Sofronie-Stokkermans, V. (2015). Hierarchical Reasoning in Local Theory Extensions and Applications. In

*SYNASC 2014*. Timisoara, Romania: IEEE Computer Society. doi:10.1109/SYNASC.2014.13Export

BibTeX

@inproceedings{sofronie-stokkermans-synasc2014,
TITLE = {Hierarchical Reasoning in Local Theory Extensions and Applications},
AUTHOR = {Sofronie-Stokkermans, Viorica},
LANGUAGE = {eng},
ISBN = {978-1-4799-8448-0},
DOI = {10.1109/SYNASC.2014.13},
PUBLISHER = {IEEE Computer Society},
YEAR = {2014},
DATE = {2015},
BOOKTITLE = {SYNASC 2014},
PAGES = {34--41},
ADDRESS = {Timisoara, Romania},
}

Endnote

%0 Conference Proceedings
%A Sofronie-Stokkermans, Viorica
%+ Automation of Logic, MPI for Informatics, Max Planck Society
%T Hierarchical Reasoning in Local Theory Extensions and Applications :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0024-C944-F
%R 10.1109/SYNASC.2014.13
%D 2015
%B 16th International Symposium on Symbolic and Numeric Algorithms
for Scientific Computing
%Z date of event: 2014-09-22 - 2014-09-25
%C Timisoara, Romania
%B SYNASC 2014
%P 34 - 41
%I IEEE Computer Society
%@ 978-1-4799-8448-0

Sturm, T. (2015a). Subtropical Real Root Finding. In

*ISSAC’15, 40th International Symposium on Symbolic and Algebraic Computation*. Bath, UK: ACM. doi:10.1145/2755996.2756677Export

BibTeX

@inproceedings{SturmISSAC2015,
TITLE = {Subtropical Real Root Finding},
AUTHOR = {Sturm, Thomas},
LANGUAGE = {eng},
ISBN = {978-1-4503-3435-8},
DOI = {10.1145/2755996.2756677},
PUBLISHER = {ACM},
YEAR = {2015},
DATE = {2015},
BOOKTITLE = {ISSAC'15, 40th International Symposium on Symbolic and Algebraic Computation},
EDITOR = {Robertz, Daniel},
PAGES = {347--354},
ADDRESS = {Bath, UK},
}

Endnote

%0 Conference Proceedings
%A Sturm, Thomas
%+ Automation of Logic, MPI for Informatics, Max Planck Society
%T Subtropical Real Root Finding :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0026-A50F-A
%R 10.1145/2755996.2756677
%D 2015
%B 40th International Symposium on Symbolic and Algebraic Computation
%Z date of event: 2015-07-06 - 2015-07-09
%C Bath, UK
%B ISSAC'15
%E Robertz, Daniel
%P 347 - 354
%I ACM
%@ 978-1-4503-3435-8

Sturm, T. (2015b). Subtropical Real Root Finding. Retrieved from http://arxiv.org/abs/1501.04836

(arXiv: 1501.04836) Abstract

We describe a new incomplete but terminating method for real root finding for
large multivariate polynomials. We take an abstract view of the polynomial as
the set of exponent vectors associated with sign information on the
coefficients. Then we employ linear programming to heuristically find roots.
There is a specialized variant for roots with exclusively positive coordinates,
which is of considerable interest for applications in chemistry and systems
biology. An implementation of our method combining the computer algebra system
Reduce with the linear programming solver Gurobi has been successfully applied
to input data originating from established mathematical models used in these
areas. We have solved several hundred problems with up to more than 800000
monomials in up to 10 variables with degrees up to 12. Our method has failed
due to its incompleteness in less than 8 percent of the cases.

Export

BibTeX

@online{SturmarXiv2015,
TITLE = {Subtropical Real Root Finding},
AUTHOR = {Sturm, Thomas},
LANGUAGE = {eng},
URL = {http://arxiv.org/abs/1501.04836},
EPRINT = {1501.04836},
EPRINTTYPE = {arXiv},
YEAR = {2015},
ABSTRACT = {We describe a new incomplete but terminating method for real root finding for large multivariate polynomials. We take an abstract view of the polynomial as the set of exponent vectors associated with sign information on the coefficients. Then we employ linear programming to heuristically find roots. There is a specialized variant for roots with exclusively positive coordinates, which is of considerable interest for applications in chemistry and systems biology. An implementation of our method combining the computer algebra system Reduce with the linear programming solver Gurobi has been successfully applied to input data originating from established mathematical models used in these areas. We have solved several hundred problems with up to more than 800000 monomials in up to 10 variables with degrees up to 12. Our method has failed due to its incompleteness in less than 8 percent of the cases.},
}

Endnote

%0 Report
%A Sturm, Thomas
%+ Automation of Logic, MPI for Informatics, Max Planck Society
%T Subtropical Real Root Finding :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0024-9D87-0
%U http://arxiv.org/abs/1501.04836
%D 2015
%X We describe a new incomplete but terminating method for real root finding for
large multivariate polynomials. We take an abstract view of the polynomial as
the set of exponent vectors associated with sign information on the
coefficients. Then we employ linear programming to heuristically find roots.
There is a specialized variant for roots with exclusively positive coordinates,
which is of considerable interest for applications in chemistry and systems
biology. An implementation of our method combining the computer algebra system
Reduce with the linear programming solver Gurobi has been successfully applied
to input data originating from established mathematical models used in these
areas. We have solved several hundred problems with up to more than 800000
monomials in up to 10 variables with degrees up to 12. Our method has failed
due to its incompleteness in less than 8 percent of the cases.
%K Computer Science, Symbolic Computation, cs.SC

Suda, M. (2015a).

*Resolution-based Methods for Linear Temporal Reasoning*. Universität des Saarlandes, Saarbrücken. Retrieved from urn:nbn:de:bsz:291-scidok-62747Export

BibTeX

@phdthesis{SudaPhd15,
TITLE = {Resolution-based Methods for Linear Temporal Reasoning},
AUTHOR = {Suda, Martin},
LANGUAGE = {eng},
URL = {urn:nbn:de:bsz:291-scidok-62747},
SCHOOL = {Universit{\"a}t des Saarlandes},
ADDRESS = {Saarbr{\"u}cken},
YEAR = {2015},
DATE = {2015},
}

Endnote

%0 Thesis
%A Suda, Martin
%Y Weidenbach, Christoph
%A referee: Hoffmann, Jörg
%+ Automation of Logic, MPI for Informatics, Max Planck Society
International Max Planck Research School, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
%T Resolution-based Methods for Linear Temporal Reasoning :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0028-FC90-3
%U urn:nbn:de:bsz:291-scidok-62747
%I Universität des Saarlandes
%C Saarbrücken
%D 2015
%P 233 p.
%V phd
%9 phd
%U http://scidok.sulb.uni-saarland.de/volltexte/2015/6274/http://scidok.sulb.uni-saarland.de/doku/lic_ohne_pod.php?la=de

Suda, M. (2015b). Variable and Clause Elimination for LTL Satisfiability Checking.

*Mathematics in Computer Science*,*9*(3). doi:10.1007/s11786-015-0240-2Export

BibTeX

@article{VCEforLTLmacis2015,
TITLE = {Variable and Clause Elimination for {LTL} Satisfiability Checking},
AUTHOR = {Suda, Martin},
LANGUAGE = {eng},
ISSN = {1661-8270},
DOI = {10.1007/s11786-015-0240-2},
PUBLISHER = {Springer},
ADDRESS = {Berlin},
YEAR = {2015},
DATE = {2015},
JOURNAL = {Mathematics in Computer Science},
VOLUME = {9},
NUMBER = {3},
PAGES = {327--344},
}

Endnote

%0 Journal Article
%A Suda, Martin
%+ Automation of Logic, MPI for Informatics, Max Planck Society
%T Variable and Clause Elimination for LTL Satisfiability Checking :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0029-4AAE-5
%R 10.1007/s11786-015-0240-2
%7 2015-09-25
%D 2015
%J Mathematics in Computer Science
%V 9
%N 3
%& 327
%P 327 - 344
%I Springer
%C Berlin
%@ false

Teucke, A., & Weidenbach, C. (2015a). First-Order Logic Theorem Proving and Model Building via Approximation and Instantiation. Retrieved from http://arxiv.org/abs/1503.02971

(arXiv: 1503.02971) Abstract

Counterexample-guided abstraction refinement is a well-established technique
in verification. In this paper we instantiate the idea for first-order logic
theorem proving. Given a clause set $N$ we propose its abstraction into a
clause set $N'$ belonging to a decidable first-order fragment. The abstraction
preserves satisfiability: if $N'$ is satisfiable, so is $N$. A refutation in
$N'$ can then either be lifted to a refutation in $N$, or it guides a
refinement of $N$ and its abstraction $N'$ excluding the previously found
refutation that is not liftable.

Export

BibTeX

@online{TeuckeWeidenbacharXiv2015,
TITLE = {First-Order Logic Theorem Proving and Model Building via Approximation and Instantiation},
AUTHOR = {Teucke, Andreas and Weidenbach, Christoph},
LANGUAGE = {eng},
URL = {http://arxiv.org/abs/1503.02971},
EPRINT = {1503.02971},
EPRINTTYPE = {arXiv},
YEAR = {2015},
ABSTRACT = {Counterexample-guided abstraction refinement is a well-established technique in verification. In this paper we instantiate the idea for first-order logic theorem proving. Given a clause set $N$ we propose its abstraction into a clause set $N'$ belonging to a decidable first-order fragment. The abstraction preserves satisfiability: if $N'$ is satisfiable, so is $N$. A refutation in $N'$ can then either be lifted to a refutation in $N$, or it guides a refinement of $N$ and its abstraction $N'$ excluding the previously found refutation that is not liftable.},
}

Endnote

%0 Report
%A Teucke, Andreas
%A Weidenbach, Christoph
%+ Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T First-Order Logic Theorem Proving and Model Building via Approximation and Instantiation :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0025-694C-5
%U http://arxiv.org/abs/1503.02971
%D 2015
%8 10.03.2015
%X Counterexample-guided abstraction refinement is a well-established technique
in verification. In this paper we instantiate the idea for first-order logic
theorem proving. Given a clause set $N$ we propose its abstraction into a
clause set $N'$ belonging to a decidable first-order fragment. The abstraction
preserves satisfiability: if $N'$ is satisfiable, so is $N$. A refutation in
$N'$ can then either be lifted to a refutation in $N$, or it guides a
refinement of $N$ and its abstraction $N'$ excluding the previously found
refutation that is not liftable.
%K Computer Science, Logic in Computer Science, cs.LO

Teucke, A., & Weidenbach, C. (2015b). First-order Logic Theorem Proving and Model Building via Approximation and Instantiation. In

*Frontiers of Combining Systems (FroCoS 2015)*. Wrocław, Poland: Springer. doi:10.1007/978-3-319-24246-0_6Export

BibTeX

@inproceedings{TeuckeFroCoS2015,
TITLE = {First-order Logic Theorem Proving and Model Building via Approximation and Instantiation},
AUTHOR = {Teucke, Andreas and Weidenbach, Christoph},
LANGUAGE = {eng},
ISBN = {978-3-319-2424},
DOI = {10.1007/978-3-319-24246-0_6},
PUBLISHER = {Springer},
YEAR = {2015},
DATE = {2015},
BOOKTITLE = {Frontiers of Combining Systems (FroCoS 2015)},
EDITOR = {Lutz, Carsten and Ranise, Silvio},
PAGES = {85--100},
SERIES = {Lecture Notes in Artificial Intelligence},
VOLUME = {9322},
ADDRESS = {Wroc{\l}aw, Poland},
}

Endnote

%0 Conference Proceedings
%A Teucke, Andreas
%A Weidenbach, Christoph
%+ Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T First-order Logic Theorem Proving and Model Building via Approximation and Instantiation :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0028-8F0B-2
%R 10.1007/978-3-319-24246-0_6
%D 2015
%B 10th International Symposium on Frontiers of Combining Systems
%Z date of event: 2015-09-21 - 2015-09-24
%C Wrocław, Poland
%B Frontiers of Combining Systems
%E Lutz, Carsten; Ranise, Silvio
%P 85 - 100
%I Springer
%@ 978-3-319-2424
%B Lecture Notes in Artificial Intelligence
%N 9322

Voigt, M., & Weidenbach, C. (2015). Bernays-Schönfinkel-Ramsey with Simple Bounds is NEXPTIME-complete. Retrieved from http://arxiv.org/abs/1501.07209

(arXiv: 1501.07209) Abstract

Linear arithmetic extended with free predicate symbols is undecidable, in
general. We show that the restriction of linear arithmetic inequations to
simple bounds extended with the Bernays-Sch\"onfinkel-Ramsey free first-order
fragment is decidable and NEXPTIME-complete. The result is almost tight because
the Bernays-Sch\"onfinkel-Ramsey fragment is undecidable in combination with
linear difference inequations, simple additive inequations, quotient
inequations and multiplicative inequations.

Export

BibTeX

@online{VoigtWeidenbacharXiv2015,
TITLE = {Bernays-Sch{\"o}nfinkel-Ramsey with Simple Bounds is {NEXPTIME}-complete},
AUTHOR = {Voigt, Marco and Weidenbach, Christoph},
URL = {http://arxiv.org/abs/1501.07209},
EPRINT = {1501.07209},
EPRINTTYPE = {arXiv},
YEAR = {2015},
ABSTRACT = {Linear arithmetic extended with free predicate symbols is undecidable, in general. We show that the restriction of linear arithmetic inequations to simple bounds extended with the Bernays-Sch\"onfinkel-Ramsey free first-order fragment is decidable and NEXPTIME-complete. The result is almost tight because the Bernays-Sch\"onfinkel-Ramsey fragment is undecidable in combination with linear difference inequations, simple additive inequations, quotient inequations and multiplicative inequations.},
}

Endnote

%0 Report
%A Voigt, Marco
%A Weidenbach, Christoph
%+ Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T Bernays-Schönfinkel-Ramsey with Simple Bounds is NEXPTIME-complete :
%U http://hdl.handle.net/11858/00-001M-0000-0024-AA87-2
%U http://arxiv.org/abs/1501.07209
%D 2015
%X Linear arithmetic extended with free predicate symbols is undecidable, in
general. We show that the restriction of linear arithmetic inequations to
simple bounds extended with the Bernays-Sch\"onfinkel-Ramsey free first-order
fragment is decidable and NEXPTIME-complete. The result is almost tight because
the Bernays-Sch\"onfinkel-Ramsey fragment is undecidable in combination with
linear difference inequations, simple additive inequations, quotient
inequations and multiplicative inequations.
%K Computer Science, Logic in Computer Science, cs.LO,Computer Science, Computational Complexity, cs.CC

Weidenbach, C. (2015). Automated Reasoning Building Blocks. In

*Correct System Design*. Oldenburg, Germany: Springer. doi:10.1007/978-3-319-23506-6_12Export

BibTeX

@inproceedings{WeidenbachCorrectSD2015,
TITLE = {Automated Reasoning Building Blocks},
AUTHOR = {Weidenbach, Christoph},
LANGUAGE = {eng},
ISBN = {978-3-319-23505-9},
DOI = {10.1007/978-3-319-23506-6_12},
PUBLISHER = {Springer},
YEAR = {2015},
DATE = {2015},
BOOKTITLE = {Correct System Design},
DEBUG = {author:
Wehrheim, Heike},
EDITOR = {Meyer, Roland and Platzer, Andr{\'e}},
PAGES = {172--188},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {9360},
ADDRESS = {Oldenburg, Germany},
}

Endnote

%0 Conference Proceedings
%A Weidenbach, Christoph
%+ Automation of Logic, MPI for Informatics, Max Planck Society
%T Automated Reasoning Building Blocks :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0028-8EBD-7
%R 10.1007/978-3-319-23506-6_12
%D 2015
%B Symposium in Honor of Ernst-Rüdiger Olderog on the Occasion of His 60th Birthday
%Z date of event: 2015-09-08 - 2015-09-09
%C Oldenburg, Germany
%B Correct System Design
%E Meyer, Roland; Platzer, André; Wehrheim, Heike
%P 172 - 188
%I Springer
%@ 978-3-319-23505-9
%B Lecture Notes in Computer Science
%N 9360

2014

Baumgartner, P., Bax, J., & Waldmann, U. (2014). Finite Quantification in Hierarchic Theorem Proving. In

*Automated Reasoning (IJCAR 2014)*. Vienna, Austria: Springer. doi:10.1007/978-3-319-08587-6_11Export

BibTeX

@inproceedings{BaumgartnerBaxWaldmann2014IJCAR,
TITLE = {Finite Quantification in Hierarchic Theorem Proving},
AUTHOR = {Baumgartner, Peter and Bax, Joshua and Waldmann, Uwe},
LANGUAGE = {eng},
ISBN = {978-3-319-08586-9},
DOI = {10.1007/978-3-319-08587-6_11},
PUBLISHER = {Springer},
YEAR = {2014},
DATE = {2014},
BOOKTITLE = {Automated Reasoning (IJCAR 2014)},
EDITOR = {Demri, Stephane and Kapur, Deepak and Weidenbach, Christoph},
PAGES = {152--167},
SERIES = {Lecture Notes in Artificial Intelligence},
VOLUME = {8562},
ADDRESS = {Vienna, Austria},
}

Endnote

%0 Conference Proceedings
%A Baumgartner, Peter
%A Bax, Joshua
%A Waldmann, Uwe
%+ External Organizations
External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
%T Finite Quantification in Hierarchic Theorem Proving :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0024-6C44-B
%R 10.1007/978-3-319-08587-6_11
%D 2014
%B 7th International Joint Conference on Automated Reasoning
%Z date of event: 2014-07-19 - 2014-07-22
%C Vienna, Austria
%B Automated Reasoning
%E Demri, Stephane; Kapur, Deepak; Weidenbach, Christoph
%P 152 - 167
%I Springer
%@ 978-3-319-08586-9
%B Lecture Notes in Artificial Intelligence
%N 8562

Bjørner, N., Hähnle, R., Nipkow, T., & Weidenbach, C. (Eds.). (2014).

*Deduction and Arithmetic*. Presented at the Dagstuhl Seminar 13411 “Deduction and Arithmetic,” Wadern, Germany: Schloss Dagstuhl. doi:10.4230/DagRep.3.10.1Abstract

This report documents the program and the outcomes of Dagstuhl Seminar 13411 "Deduction and Arithmetic". The aim of this seminar was to bring together researchers working in deduction and fields related to arithmetic constraint solving. Current research in deduction can be categorized in three main strands: SMT solvers, automated first-order provers, and interactive provers. Although dealing with arithmetic has been in focus of all three for some years, there is still need of much better support of arithmetic. Reasong about arithmetic will stay at the center of attention in all three main approaches to automated deduction during the coming five to ten years. The seminar was an important event for the subcommunities involved that made it possible to communicate with each other so as to avoid duplicate effort and to exploit synergies. It succeeded also in identifying a number of important trends and open problems.

Export

BibTeX

@proceedings{BjornerHNW13,
TITLE = {Deduction and Arithmetic (Dagstuhl Seminar 13411)},
EDITOR = {Bj{\o}rner, Nikolaj and H{\"a}hnle, Reiner and Nipkow, Tobias and Weidenbach, Christoph},
LANGUAGE = {eng},
ISSN = {2192-5283},
URL = {urn:nbn:de:0030-drops-44250},
DOI = {10.4230/DagRep.3.10.1},
PUBLISHER = {Schloss Dagstuhl},
YEAR = {2013},
DATE = {2014},
ABSTRACT = {This report documents the program and the outcomes of Dagstuhl Seminar 13411 "Deduction and Arithmetic". The aim of this seminar was to bring together researchers working in deduction and fields related to arithmetic constraint solving. Current research in deduction can be categorized in three main strands: SMT solvers, automated first-order provers, and interactive provers. Although dealing with arithmetic has been in focus of all three for some years, there is still need of much better support of arithmetic. Reasong about arithmetic will stay at the center of attention in all three main approaches to automated deduction during the coming five to ten years. The seminar was an important event for the subcommunities involved that made it possible to communicate with each other so as to avoid duplicate effort and to exploit synergies. It succeeded also in identifying a number of important trends and open problems.},
PAGES = {24 p.},
SERIES = {Dagstuhl Reports},
VOLUME = {3},
ISSUE = {10},
ADDRESS = {Wadern, Germany},
}

Endnote

%0 Conference Proceedings
%E Bjørner, Nikolaj
%E Hähnle, Reiner
%E Nipkow, Tobias
%E Weidenbach, Christoph
%+ External Organizations
External Organizations
External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
%T Deduction and Arithmetic :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0024-C36B-3
%R 10.4230/DagRep.3.10.1
%U urn:nbn:de:0030-drops-44250
%I Schloss Dagstuhl
%D 2014
%B Dagstuhl Seminar 13411 "Deduction and Arithmetic"
%Z date of event: 2013-10-06 - 2013-10-11
%D 2013
%C Wadern, Germany
%P 24 p.
%X This report documents the program and the outcomes of Dagstuhl Seminar 13411 "Deduction and Arithmetic". The aim of this seminar was to bring together researchers working in deduction and fields related to arithmetic constraint solving. Current research in deduction can be categorized in three main strands: SMT solvers, automated first-order provers, and interactive provers. Although dealing with arithmetic has been in focus of all three for some years, there is still need of much better support of arithmetic. Reasong about arithmetic will stay at the center of attention in all three main approaches to automated deduction during the coming five to ten years. The seminar was an important event for the subcommunities involved that made it possible to communicate with each other so as to avoid duplicate effort and to exploit synergies. It succeeded also in identifying a number of important trends and open problems.
%K Automated Deduction; Program Verification; Arithmetic Constraint Solving
%S Dagstuhl Reports
%V 3
%P 1 - 24
%@ false
%U http://drops.dagstuhl.de/opus/volltexte/2014/4425/

Demri, S., Kapur, D., & Weidenbach, C. (Eds.). (2014).

*Automated Reasoning*. Presented at the 7th International Joint Conference on Automated Reasoning, Vienna, Austria: Springer. doi:10.1007/978-3-319-08587-6Export

BibTeX

@proceedings{IJCAR2014Weidenbach,
TITLE = {Automated Reasoning (IJCAR 2014)},
EDITOR = {Demri, St{\'e}phane and Kapur, Deepak and Weidenbach, Christoph},
LANGUAGE = {eng},
ISBN = {978-3-319-08586-9},
DOI = {10.1007/978-3-319-08587-6},
PUBLISHER = {Springer},
YEAR = {2014},
DATE = {2014},
PAGES = {XV, 528 p.},
SERIES = {Lecture Notes in Artificial Intelligence},
VOLUME = {8562},
ADDRESS = {Vienna, Austria},
}

Endnote

%0 Conference Proceedings
%E Demri, Stéphane
%E Kapur, Deepak
%E Weidenbach, Christoph
%+ External Organizations
External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
%T Automated Reasoning : 7th International Joint Conference, IJCAR 2014 Held as Part of the Vienna Summer of Logic, VSL 2014 ; Vienna, Austria, July 19-22, 2014 ; Proceedings
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0024-535D-2
%@ 978-3-319-08586-9
%R 10.1007/978-3-319-08587-6
%I Springer
%D 2014
%B 7th International Joint Conference on Automated Reasoning
%Z date of event: 2014-07-19 - 2014-07-22
%D 2014
%C Vienna, Austria
%P XV, 528 p.
%S Lecture Notes in Artificial Intelligence
%V 8562

Fietzke, A. (2014).

*Labelled Superposition*. Universität des Saarlandes, Saarbrücken.Export

BibTeX

@phdthesis{Fietzke2014,
TITLE = {Labelled Superposition},
AUTHOR = {Fietzke, Arnaud},
LANGUAGE = {eng},
SCHOOL = {Universit{\"a}t des Saarlandes},
ADDRESS = {Saarbr{\"u}cken},
YEAR = {2014},
DATE = {2014},
}

Endnote

%0 Thesis
%A Fietzke, Arnaud
%Y Weidenbach, Christoph
%A referee: Hermanns, Holger
%+ Automation of Logic, MPI for Informatics, Max Planck Society
International Max Planck Research School, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
%T Labelled Superposition :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0024-96A6-D
%I Universität des Saarlandes
%C Saarbrücken
%D 2014
%P 176 p.
%V phd
%9 phd
%U http://scidok.sulb.uni-saarland.de/volltexte/2014/5825/http://scidok.sulb.uni-saarland.de/doku/lic_ohne_pod.php?la=de

Ghilardi, S., Sattler, U., & Sofronie-Stokkermans, V. (Eds.). (2014).

*Automated Deduction: Decidability, Complexity, Tractability*. Presented at the Automated Deduction: Decidability, Complexity, Tractability, Vienna, Austria: Universität Koblenz.Export

BibTeX

@proceedings{Sofronie-Stokkermans-addct114,
TITLE = {Automated Deduction: Decidability, Complexity, Tractability (ADDCT 2014)},
EDITOR = {Ghilardi, Silvio and Sattler, Ulrike and Sofronie-Stokkermans, Viorica},
LANGUAGE = {eng},
PUBLISHER = {Universit{\"a}t Koblenz},
YEAR = {2014},
DATE = {2014},
PAGES = {58 p.},
ADDRESS = {Vienna, Austria},
}

Endnote

%0 Conference Proceedings
%E Ghilardi, Silvio
%E Sattler, Ulrike
%E Sofronie-Stokkermans, Viorica
%+ External Organizations
External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
%T Automated Deduction: Decidability, Complexity, Tractability : IJCAR'14, 7th International Joint Conference on Automated Reasoning ; Workshop
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0024-C8EB-0
%I Universität Koblenz
%D 2014
%B Automated Deduction: Decidability, Complexity, Tractability
%Z date of event: 2014-07-18 - 2014-07-18
%D 2014
%C Vienna, Austria
%P 58 p.
%U http://userpages.uni-koblenz.de/~sofronie/addct-2014/proceedings-addct-2014.pdf

Horbach, M., & Sofronie-Stokkermans, V. (2014a). Locality Transfer: From Constrained Axiomatizations to Reachability Predicates. In

*Automated Reasoning (IJCAR 2014)*. Vienna, Austria: Springer. doi:10.1007/978-3-319-08587-6_14Export

BibTeX

@inproceedings{DBLP:conf/cade/HorbachS14,
TITLE = {Locality Transfer: {From} Constrained Axiomatizations to Reachability Predicates},
AUTHOR = {Horbach, Matthias and Sofronie-Stokkermans, Viorica},
LANGUAGE = {eng},
ISBN = {978-3-319-08586-9},
DOI = {10.1007/978-3-319-08587-6_14},
PUBLISHER = {Springer},
YEAR = {2014},
DATE = {2014},
BOOKTITLE = {Automated Reasoning (IJCAR 2014)},
EDITOR = {Demri, Stephane and Kapur, Deepak and Weidenbach, Christoph},
PAGES = {192--207},
SERIES = {Lecture Notes in Artificial Intelligence},
VOLUME = {8562},
ADDRESS = {Vienna, Austria},
}

Endnote

%0 Conference Proceedings
%A Horbach, Matthias
%A Sofronie-Stokkermans, Viorica
%+ Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T Locality Transfer: From Constrained Axiomatizations to Reachability Predicates :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0024-4DC5-0
%R 10.1007/978-3-319-08587-6_14
%D 2014
%B 7th International Joint Conference on Automated Reasoning
%Z date of event: 2014-07-19 - 2014-07-22
%C Vienna, Austria
%B Automated Reasoning
%E Demri, Stephane; Kapur, Deepak; Weidenbach, Christoph
%P 192 - 207
%I Springer
%@ 978-3-319-08586-9
%B Lecture Notes in Artificial Intelligence
%N 8562

Horbach, M., & Sofronie-Stokkermans, V. (2014b).

*Obtaining Finite Local Theory Axiomatizations via Saturation*(No. ATR93). SFB/TR 14 AVACS.Abstract

In this paper we study theory combinations over non-disjoint
signatures in which hierarchical and modular reasoning is
possible. We use a notion of locality of a theory extension
parameterized by a closure operator on ground terms.
We give criteria for recognizing these types of theory
extensions. We then show that combinations of extensions of
theories which are local in this extended sense have also a
locality property and hence allow modular and hierarchical
reasoning. We thus obtain parameterized decidability and
complexity results for many (combinations of) theories
important in verification.

Export

BibTeX

@techreport{atr093,
TITLE = {Obtaining Finite Local Theory Axiomatizations via Saturation},
AUTHOR = {Horbach, Matthias and Sofronie-Stokkermans, Viorica},
LANGUAGE = {eng},
ISSN = {1860-9821},
NUMBER = {ATR93},
INSTITUTION = {SFB/TR 14 AVACS},
YEAR = {2014},
ABSTRACT = {In this paper we study theory combinations over non-disjoint signatures in which hierarchical and modular reasoning is possible. We use a notion of locality of a theory extension parameterized by a closure operator on ground terms. We give criteria for recognizing these types of theory extensions. We then show that combinations of extensions of theories which are local in this extended sense have also a locality property and hence allow modular and hierarchical reasoning. We thus obtain parameterized decidability and complexity results for many (combinations of) theories important in verification.},
TYPE = {AVACS Technical Report},
VOLUME = {93},
}

Endnote

%0 Report
%A Horbach, Matthias
%A Sofronie-Stokkermans, Viorica
%+ Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T Obtaining Finite Local Theory Axiomatizations via Saturation :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0024-C90C-F
%Y SFB/TR 14 AVACS
%D 2014
%P 26 p.
%X In this paper we study theory combinations over non-disjoint
signatures in which hierarchical and modular reasoning is
possible. We use a notion of locality of a theory extension
parameterized by a closure operator on ground terms.
We give criteria for recognizing these types of theory
extensions. We then show that combinations of extensions of
theories which are local in this extended sense have also a
locality property and hence allow modular and hierarchical
reasoning. We thus obtain parameterized decidability and
complexity results for many (combinations of) theories
important in verification.
%B AVACS Technical Report
%N 93
%@ false
%U http://www.avacs.org/Publikationen/Open/avacs_technical_report_093.pdf

Korovin, K., Košta, M., & Sturm, T. (2014a). Towards Conflict-driven Learning for Virtual Substitution. In

*12th International Workshop on Satisfiability Modulo Theories (SMT 2014)*. Vienna, Austria: CEUR-WS.org. Retrieved from urn:nbn:de:0074-1163-4Export

BibTeX

@inproceedings{KorovinEtAl:2014b,
TITLE = {Towards Conflict-driven Learning for Virtual Substitution},
AUTHOR = {Korovin, Konstantin and Ko{\v s}ta, Marek and Sturm, Thomas},
LANGUAGE = {eng},
ISSN = {1613-0073},
URL = {urn:nbn:de:0074-1163-4},
PUBLISHER = {CEUR-WS.org},
YEAR = {2014},
BOOKTITLE = {12th International Workshop on Satisfiability Modulo Theories (SMT 2014)},
EDITOR = {R{\"u}mmer, Philipp and Wintersteiger, Christoph M.},
PAGES = {71--71},
SERIES = {CEUR Workshop Proceedings},
VOLUME = {1163},
ADDRESS = {Vienna, Austria},
}

Endnote

%0 Conference Proceedings
%A Korovin, Konstantin
%A Košta, Marek
%A Sturm, Thomas
%+ External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T Towards Conflict-driven Learning for Virtual Substitution :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0024-91EA-0
%D 2014
%B 12th International Workshop on Satisfiability Modulo Theories
%Z date of event: 2014-07-17 - 2014-07-18
%C Vienna, Austria
%B 12th International Workshop on Satisfiability Modulo Theories
%E Rümmer, Philipp; Wintersteiger, Christoph M.
%P 71 - 71
%I CEUR-WS.org
%B CEUR Workshop Proceedings
%N 1163
%@ false
%U http://ceur-ws.org/Vol-1163/paper-13.pdf

Korovin, K., Košta, M., & Sturm, T. (2014b). Towards Conflict-driven Learning for Virtual Substitution. In

*Computer Algebra in Scientific Computing (CASC 2014)*. Warsaw, Poland: Springer. doi:10.1007/978-3-319-10515-4_19Abstract

We consider satisfiability modulo theory-solving for linear real arithmetic. Inspired by related work for the Fourier–Motzkin method, we combine virtual substitution with learning strategies. For the first time, we present virtual substitution—including our learning strategies—as a formal calculus. We prove soundness and completeness for that calculus. Some standard linear programming benchmarks computed with an experimental implementation of our calculus show that the integration of learning techniques into virtual substitution gives rise to considerable speedups. Our implementation is open-source and freely available.

Export

BibTeX

@inproceedings{KorovinCASC2014,
TITLE = {Towards Conflict-driven Learning for Virtual Substitution},
AUTHOR = {Korovin, Konstantin and Ko{\v s}ta, Marek and Sturm, Thomas},
LANGUAGE = {eng},
ISBN = {978-3-319-10514-7},
DOI = {10.1007/978-3-319-10515-4_19},
PUBLISHER = {Springer},
YEAR = {2014},
DATE = {2014},
ABSTRACT = {We consider satisfiability modulo theory-solving for linear real arithmetic. Inspired by related work for the Fourier--Motzkin method, we combine virtual substitution with learning strategies. For the first time, we present virtual substitution---including our learning strategies---as a formal calculus. We prove soundness and completeness for that calculus. Some standard linear programming benchmarks computed with an experimental implementation of our calculus show that the integration of learning techniques into virtual substitution gives rise to considerable speedups. Our implementation is open-source and freely available.},
BOOKTITLE = {Computer Algebra in Scientific Computing (CASC 2014)},
EDITOR = {Gerdt, Vladimir P. and Koepf, Wolfram and Seiler, Werner M. and Vorozhtsov, Evgenii V.},
PAGES = {256--270},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {8660},
ADDRESS = {Warsaw, Poland},
}

Endnote

%0 Conference Proceedings
%A Korovin, Konstantin
%A Košta, Marek
%A Sturm, Thomas
%+ External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T Towards Conflict-driven Learning for Virtual Substitution :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0024-5369-6
%R 10.1007/978-3-319-10515-4_19
%D 2014
%B International Workshops on Computer Algebra in Scientific Computing
%Z date of event: 2014-09-08 - 2014-09-12
%C Warsaw, Poland
%X We consider satisfiability modulo theory-solving for linear real arithmetic. Inspired by related work for the Fourier–Motzkin method, we combine virtual substitution with learning strategies. For the first time, we present virtual substitution—including our learning strategies—as a formal calculus. We prove soundness and completeness for that calculus. Some standard linear programming benchmarks computed with an experimental implementation of our calculus show that the integration of learning techniques into virtual substitution gives rise to considerable speedups. Our implementation is open-source and freely available.
%B Computer Algebra in Scientific Computing
%E Gerdt, Vladimir P.; Koepf, Wolfram; Seiler, Werner M.; Vorozhtsov, Evgenii V.
%P 256 - 270
%I Springer
%@ 978-3-319-10514-7
%B Lecture Notes in Computer Science
%N 8660

Košta, M., Sturm, T., & Dolzmann, A. (2014). Better Answers to Real Questions. In

*12th International Workshop on Satisfiablity Modulo Theories (SMT 2014)*. Vienna, Austria: CEUR-WS.org. Retrieved from urn:nbn:de:0074-1163-4Export

BibTeX

@inproceedings{KostaEtAl:2014a,
TITLE = {Better Answers to Real Questions},
AUTHOR = {Ko{\v s}ta, Marek and Sturm, Thomas and Dolzmann, Andreas},
LANGUAGE = {eng},
ISSN = {1613-0073},
URL = {urn:nbn:de:0074-1163-4},
PUBLISHER = {CEUR-WS.org},
YEAR = {2014},
BOOKTITLE = {12th International Workshop on Satisfiablity Modulo Theories (SMT 2014)},
EDITOR = {R{\"u}mmer, Philipp and Wintersteiger, Christoph M.},
PAGES = {69--69},
SERIES = {CEUR Workshop Proceedings},
VOLUME = {1163},
ADDRESS = {Vienna, Austria},
}

Endnote

%0 Conference Proceedings
%A Košta, Marek
%A Sturm, Thomas
%A Dolzmann, Andreas
%+ Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
%T Better Answers to Real Questions :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0024-9131-C
%D 2014
%B 12th International Workshop on Satisfiability Modulo Theories
%Z date of event: 2014-07-17 - 2014-07-18
%C Vienna, Austria
%B 12th International Workshop on Satisfiablity Modulo Theories
%E Rümmer, Philipp; Wintersteiger, Christoph M.
%P 69 - 69
%I CEUR-WS.org
%B CEUR Workshop Proceedings
%N 1163
%@ false
%U http://ceur-ws.org/Vol-1163/paper-12.pdf

Song, L., Zhang, L., & Godskesen, J. C. (2014). Bisimulations and Logical Characterizations on Continuous-time Markov Decision Processes. In

*Verification, Model Checking, and Abstract Interpretation (VMCAI 2014)*. San Diego, CA, USA: Springer. doi:10.1007/978-3-642-54013-4_6Export

BibTeX

@inproceedings{LeiVMCAI2014,
TITLE = {Bisimulations and Logical Characterizations on Continuous-time {Markov} Decision Processes},
AUTHOR = {Song, Lei and Zhang, Lijun and Godskesen, Jens Chr.},
LANGUAGE = {eng},
ISBN = {978-3-642-54012-7},
DOI = {10.1007/978-3-642-54013-4_6},
PUBLISHER = {Springer},
YEAR = {2014},
DATE = {2014},
BOOKTITLE = {Verification, Model Checking, and Abstract Interpretation (VMCAI 2014)},
EDITOR = {McMillan, Kenneth L. and Rival, Xavier},
PAGES = {98--117},
SERIES = {Lecture Notes in computer Science},
VOLUME = {8318},
ADDRESS = {San Diego, CA, USA},
}

Endnote

%0 Conference Proceedings
%A Song, Lei
%A Zhang, Lijun
%A Godskesen, Jens Chr.
%+ Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T Bisimulations and Logical Characterizations on Continuous-time Markov Decision Processes :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0027-9CDE-0
%R 10.1007/978-3-642-54013-4_6
%D 2014
%B 15th International Conference on Verification, Model Checking, and Abstract Interpretation
%Z date of event: 2014-01-19 - 2014-01-21
%C San Diego, CA, USA
%B Verification, Model Checking, and Abstract Interpretation
%E McMillan, Kenneth L.; Rival, Xavier
%P 98 - 117
%I Springer
%@ 978-3-642-54012-7
%B Lecture Notes in computer Science
%N 8318

Suda, M. (2014). Property Directed Reachability for Automated Planning.

*Journal of Artificial Intelligence Research*,*50*. doi:10.1613/jair.4231Export

BibTeX

@article{SudaJAIR2014,
TITLE = {Property Directed Reachability for Automated Planning},
AUTHOR = {Suda, Martin},
LANGUAGE = {eng},
ISSN = {1076-9757},
DOI = {10.1613/jair.4231},
PUBLISHER = {AI Access Foundation},
ADDRESS = {S.l.},
YEAR = {2014},
DATE = {2014},
JOURNAL = {Journal of Artificial Intelligence Research},
VOLUME = {50},
PAGES = {265--319},
}

Endnote

%0 Journal Article
%A Suda, Martin
%+ Automation of Logic, MPI for Informatics, Max Planck Society
%T Property Directed Reachability for Automated Planning :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0024-3CF3-6
%F ISI: 000339311300001
%R 10.1613/jair.4231
%D 2014
%J Journal of Artificial Intelligence Research
%V 50
%& 265
%P 265 - 319
%I AI Access Foundation
%C S.l.
%@ false

Wand, D. (2014). Polymorphic+Typeclass Superposition. In

*4th Workshop on Practical Aspects of Automated Reasoning (PAAR 2014)*. Vienna, Austria.Export

BibTeX

@inproceedings{Wand2014PAAR,
TITLE = {{Polymorphic+Typeclass} Superposition},
AUTHOR = {Wand, Daniel},
LANGUAGE = {eng},
YEAR = {2014},
BOOKTITLE = {4th Workshop on Practical Aspects of Automated Reasoning (PAAR 2014)},
ADDRESS = {Vienna, Austria},
}

Endnote

%0 Conference Proceedings
%A Wand, Daniel
%+ Automation of Logic, MPI for Informatics, Max Planck Society
%T Polymorphic+Typeclass Superposition :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0024-E25C-4
%D 2014
%B 4th Workshop on Practical Aspects of Automated Reasoning
%Z date of event: 2014-07-23 - 2014-07-23
%C Vienna, Austria
%B 4th Workshop on Practical Aspects of Automated Reasoning

2013

Azmy, N., & Weidenbach, C. (2013). Computing Tiny Clause Normal Forms. In

*Automated Deduction - CADE-24*(Vol. 7898). Lake Placid, NY, USA: Springer. doi:10.1007/978-3-642-38574-2_7Export

BibTeX

@inproceedings{AzmyWeidenbach13,
TITLE = {Computing Tiny Clause Normal Forms},
AUTHOR = {Azmy, Noran and Weidenbach, Christoph},
LANGUAGE = {eng},
ISSN = {0302-9743},
ISBN = {978-3-642-38573-5},
DOI = {10.1007/978-3-642-38574-2_7},
PUBLISHER = {Springer},
YEAR = {2013},
DATE = {2013},
BOOKTITLE = {Automated Deduction -- CADE-24},
EDITOR = {Bonacina, Maria Paola},
VOLUME = {7898},
PAGES = {109--125},
SERIES = {Lecture Notes in Artificial Intelligence},
VOLUME = {7898},
ADDRESS = {Lake Placid, NY, USA},
}

Endnote

%0 Conference Proceedings
%A Azmy, Noran
%A Weidenbach, Christoph
%+ Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T Computing Tiny Clause Normal Forms :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0024-C37D-C
%R 10.1007/978-3-642-38574-2_7
%D 2013
%B 24th International Conference on Automated Deduction
%Z date of event: 2013-06-09 - 2013-06-14
%C Lake Placid, NY, USA
%B Automated Deduction - CADE-24
%E Bonacina, Maria Paola
%V 7898
%P 109 - 125
%I Springer
%@ 978-3-642-38573-5
%B Lecture Notes in Artificial Intelligence
%N 7898
%@ false

Baumgartner, P., & Waldmann, U. (2013a). Hierarchic Superposition with Weak Abstraction. In

*Automated Deduction - CADE-24*. Lake Placid, NY, USA: Springer. doi:10.1007/978-3-642-38574-2_3Abstract

In this paper we study possibilities of using methods for
hierarchical reasoning in local theory extensions for the
analysis and verification of parametric hybrid systems,
where the parameters can be either constants or functions.
Our goal is to automatically provide guarantees that such
systems satisfy certain safety or invariance conditions.
We first analyze the possibility of automatically generating
such guarantees in the form of constraints on parameters,
then show that we can also synthesise so-called criticality
functions, typically used for proving stability and/or
safety of hybrid systems.
We illustrate our methods on several examples.

Export

BibTeX

@inproceedings{BaumgartnerWaldmann2013CADE,
TITLE = {Hierarchic Superposition with Weak Abstraction},
AUTHOR = {Baumgartner, Peter and Waldmann, Uwe},
LANGUAGE = {eng},
ISSN = {0302-9743},
ISBN = {978-3-642-38573-5},
DOI = {10.1007/978-3-642-38574-2_3},
PUBLISHER = {Springer},
YEAR = {2013},
DATE = {2013},
ABSTRACT = {In this paper we study possibilities of using methods for hierarchical reasoning in local theory extensions for the analysis and verification of parametric hybrid systems, where the parameters can be either constants or functions. Our goal is to automatically provide guarantees that such systems satisfy certain safety or invariance conditions. We first analyze the possibility of automatically generating such guarantees in the form of constraints on parameters, then show that we can also synthesise so-called criticality functions, typically used for proving stability and/or safety of hybrid systems. We illustrate our methods on several examples.},
BOOKTITLE = {Automated Deduction -- CADE-24},
EDITOR = {Bonacina, Maria Paola},
PAGES = {39--57},
SERIES = {Lecture Notes in Artificial Intelligence},
VOLUME = {7898},
ADDRESS = {Lake Placid, NY, USA},
}

Endnote

%0 Conference Proceedings
%A Baumgartner, Peter
%A Waldmann, Uwe
%+ External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
%T Hierarchic Superposition with Weak Abstraction :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0024-6C42-F
%R 10.1007/978-3-642-38574-2_3
%D 2013
%B 24th International Conference on Automated Deduction
%Z date of event: 2013-06-09 - 2013-06-14
%C Lake Placid, NY, USA
%X In this paper we study possibilities of using methods for
hierarchical reasoning in local theory extensions for the
analysis and verification of parametric hybrid systems,
where the parameters can be either constants or functions.
Our goal is to automatically provide guarantees that such
systems satisfy certain safety or invariance conditions.
We first analyze the possibility of automatically generating
such guarantees in the form of constraints on parameters,
then show that we can also synthesise so-called criticality
functions, typically used for proving stability and/or
safety of hybrid systems.
We illustrate our methods on several examples.
%B Automated Deduction - CADE-24
%E Bonacina, Maria Paola
%P 39 - 57
%I Springer
%@ 978-3-642-38573-5
%B Lecture Notes in Artificial Intelligence
%N 7898
%@ false

Baumgartner, P., & Waldmann, U. (2013b).

*Hierarchic Superposition with Weak Abstraction*(No. MPI-I-2014-RG1-002). Saarbrücken: Max-Planck-Institut für Informatik.Abstract

Many applications of automated deduction require reasoning in
first-order logic modulo background theories, in particular some
form of integer arithmetic. A major unsolved research challenge
is to design theorem provers that are "reasonably complete"
even in the presence of free function symbols ranging into a
background theory sort. The hierarchic superposition calculus
of Bachmair, Ganzinger, and Waldmann already supports such
symbols, but, as we demonstrate, not optimally. This paper aims
to rectify the situation by introducing a novel form of clause
abstraction, a core component in the hierarchic superposition
calculus for transforming clauses into a form needed for internal
operation. We argue for the benefits of the resulting calculus
and provide a new completeness result for the fragment where
all background-sorted terms are ground.

Export

BibTeX

@techreport{Waldmann2013,
TITLE = {Hierarchic Superposition with Weak Abstraction},
AUTHOR = {Baumgartner, Peter and Waldmann, Uwe},
LANGUAGE = {eng},
ISSN = {0946-011X},
NUMBER = {MPI-I-2014-RG1-002},
INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
ADDRESS = {Saarbr{\"u}cken},
YEAR = {2013},
ABSTRACT = {Many applications of automated deduction require reasoning in first-order logic modulo background theories, in particular some form of integer arithmetic. A major unsolved research challenge is to design theorem provers that are "reasonably complete" even in the presence of free function symbols ranging into a background theory sort. The hierarchic superposition calculus of Bachmair, Ganzinger, and Waldmann already supports such symbols, but, as we demonstrate, not optimally. This paper aims to rectify the situation by introducing a novel form of clause abstraction, a core component in the hierarchic superposition calculus for transforming clauses into a form needed for internal operation. We argue for the benefits of the resulting calculus and provide a new completeness result for the fragment where all background-sorted terms are ground.},
TYPE = {Research Report},
}

Endnote

%0 Report
%A Baumgartner, Peter
%A Waldmann, Uwe
%+ External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
%T Hierarchic Superposition with Weak Abstraction :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0024-03A8-0
%Y Max-Planck-Institut für Informatik
%C Saarbrücken
%D 2013
%P 45 p.
%X Many applications of automated deduction require reasoning in
first-order logic modulo background theories, in particular some
form of integer arithmetic. A major unsolved research challenge
is to design theorem provers that are "reasonably complete"
even in the presence of free function symbols ranging into a
background theory sort. The hierarchic superposition calculus
of Bachmair, Ganzinger, and Waldmann already supports such
symbols, but, as we demonstrate, not optimally. This paper aims
to rectify the situation by introducing a novel form of clause
abstraction, a core component in the hierarchic superposition
calculus for transforming clauses into a form needed for internal
operation. We argue for the benefits of the resulting calculus
and provide a new completeness result for the fragment where
all background-sorted terms are ground.
%B Research Report
%@ false

Baumgartner, P., & Waldmann, U. (2013c). Hierarchic Superposition: Completeness without Compactness. In

*Proceedings of the Fifth International Conference on Mathematical Aspects of Computer and System Sciences (MACIS 2013)*. Nanning, China.Export

BibTeX

@inproceedings{BaumgartnerWaldmann2013MACIS,
TITLE = {Hierarchic Superposition: {Completeness} without Compactness},
AUTHOR = {Baumgartner, Peter and Waldmann, Uwe},
LANGUAGE = {eng},
YEAR = {2013},
DATE = {2013},
BOOKTITLE = {Proceedings of the Fifth International Conference on Mathematical Aspects of Computer and System Sciences (MACIS 2013)},
EDITOR = {Ko{\v s}ta, Marek and Sturm, Thomas},
PAGES = {8--12},
ADDRESS = {Nanning, China},
}

Endnote

%0 Conference Proceedings
%A Baumgartner, Peter
%A Waldmann, Uwe
%+ External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
%T Hierarchic Superposition: Completeness without Compactness :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0024-6C4E-8
%D 2013
%B Fifth International Conference on Mathematical Aspects of Computer and System Sciences
%Z date of event: 2013-12-11 - 2013-12-13
%C Nanning, China
%B Proceedings of the Fifth International Conference on Mathematical Aspects of Computer and System Sciences
%E Košta, Marek; Sturm, Thomas
%P 8 - 12

Bjørner, N., & Sofronie-Stokkermans, V. (2013). Preface: Special Issue of Selected Extended Papers of CADE-23.

*Journal of Automated Reasoning*,*51*(1). doi:10.1007/s10817-013-9282-9Export

BibTeX

@article{Sofronie-Stokkermans2013-jar-cade-special-issue,
TITLE = {Preface: {Special} Issue of Selected Extended Papers of {CADE-23}},
AUTHOR = {Bj{\o}rner, Nikolaj and Sofronie-Stokkermans, Viorica},
LANGUAGE = {eng},
ISSN = {0168-7433},
DOI = {10.1007/s10817-013-9282-9},
LOCALID = {Local-ID: 32215D5D874452C4C1257B1E006EA21B-Sofronie-Stokkermans2013-jar-cade-special-issue},
PUBLISHER = {Springer},
ADDRESS = {Berlin},
YEAR = {2013},
DATE = {2013},
JOURNAL = {Journal of Automated Reasoning},
VOLUME = {51},
NUMBER = {1},
PAGES = {1--2},
}

Endnote

%0 Journal Article
%A Bjørner, Nikolaj
%A Sofronie-Stokkermans, Viorica
%+ External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
%T Preface: Special Issue of Selected Extended Papers of CADE-23 :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0015-7949-7
%F OTHER: Local-ID: 32215D5D874452C4C1257B1E006EA21B-Sofronie-Stokkermans2013-jar-cade-special-issue
%R 10.1007/s10817-013-9282-9
%7 2013
%D 2013
%J Journal of Automated Reasoning
%V 51
%N 1
%& 1
%P 1 - 2
%I Springer
%C Berlin
%@ false

Dhungana, D., Tang, C. H., Weidenbach, C., & Wischnewski, P. (2013). Automated Verification of Interactive Rule-based Configuration Systems. In

*28th IEEE/ACM International Conference on Automated Software Engineering (ASE 2013)*. Palo Alto, CA, USA: IEEE. doi:10.1109/ASE.2013.6693112Abstract

Rule-based specifications of systems have again
become common in the context of product line variability modeling and
configuration systems. In this paper, we define a logical
foundation for rule-based specifications that has enough expressivity
and operational behavior to be
practically useful and at the same time enables decidability of
important overall properties such as consistency or cycle-freeness.
Our logic supports rule-based interactive user transitions as well as
the definition of a domain theory via rule transitions.
As a running example, we model DOPLER, a rule-based configuration system
currently in use at Siemens.

Export

BibTeX

@inproceedings{Dhungana2013,
TITLE = {Automated Verification of Interactive Rule-based Configuration Systems},
AUTHOR = {Dhungana, Deepak and Tang, Ching Hoo and Weidenbach, Christoph and Wischnewski, Patrick},
LANGUAGE = {eng},
ISBN = {978-1-4799-0215-6},
DOI = {10.1109/ASE.2013.6693112},
LOCALID = {Local-ID: 977B59458D5362E2C1257C6900520065-Dhungana2013},
PUBLISHER = {IEEE},
YEAR = {2013},
DATE = {2013},
ABSTRACT = {Rule-based specifications of systems have again become common in the context of product line variability modeling and configuration systems. In this paper, we define a logical foundation for rule-based specifications that has enough expressivity and operational behavior to be practically useful and at the same time enables decidability of important overall properties such as consistency or cycle-freeness. Our logic supports rule-based interactive user transitions as well as the definition of a domain theory via rule transitions. As a running example, we model DOPLER, a rule-based configuration system currently in use at Siemens.},
BOOKTITLE = {28th IEEE/ACM International Conference on Automated Software Engineering (ASE 2013)},
EDITOR = {Denney, Ewen and Bultan, Tevfik and Zeller, Andreas},
PAGES = {551--561},
ADDRESS = {Palo Alto, CA, USA},
}

Endnote

%0 Conference Proceedings
%A Dhungana, Deepak
%A Tang, Ching Hoo
%A Weidenbach, Christoph
%A Wischnewski, Patrick
%+ External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
%T Automated Verification of Interactive Rule-based Configuration Systems :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0015-794F-C
%F OTHER: Local-ID: 977B59458D5362E2C1257C6900520065-Dhungana2013
%R 10.1109/ASE.2013.6693112
%D 2013
%B 28th IEEE/ACM International Conference on Automated Software Engineering
%Z date of event: 2013-11-11 - 2013-11-15
%C Palo Alto, CA, USA
%X Rule-based specifications of systems have again
become common in the context of product line variability modeling and
configuration systems. In this paper, we define a logical
foundation for rule-based specifications that has enough expressivity
and operational behavior to be
practically useful and at the same time enables decidability of
important overall properties such as consistency or cycle-freeness.
Our logic supports rule-based interactive user transitions as well as
the definition of a domain theory via rule transitions.
As a running example, we model DOPLER, a rule-based configuration system
currently in use at Siemens.
%B 28th IEEE/ACM International Conference on Automated Software Engineering
%E Denney, Ewen; Bultan, Tevfik; Zeller, Andreas
%P 551 - 561
%I IEEE
%@ 978-1-4799-0215-6

Errami, H., Eiswirth, M., Grigoriev, D., Seiler, W. M., Sturm, T., & Weber, A. (2013). Efficient Methods to Compute Hopf Bifurcations in Chemical Reaction Networks Using Reaction Coordinates. In

*Computer Algebra in Scientific Computing*. Berlin: Springer. doi:10.1007/978-3-319-02297-0_7Export

BibTeX

@incollection{Sturm2013,
TITLE = {Efficient Methods to Compute {H}opf Bifurcations in Chemical Reaction Networks Using Reaction Coordinates},
AUTHOR = {Errami, Hassan and Eiswirth, Markus and Grigoriev, Dima and Seiler, Werner M. and Sturm, Thomas and Weber, Andreas},
LANGUAGE = {eng},
ISSN = {0302-9743},
ISBN = {978-3-319-02296-3; 978-3-319-02297-0},
DOI = {10.1007/978-3-319-02297-0_7},
PUBLISHER = {Springer},
ADDRESS = {Berlin},
YEAR = {2013},
DATE = {2013},
BOOKTITLE = {Computer Algebra in Scientific Computing},
EDITOR = {Gerdt, Vladimir P. and Koepf, Wolfram and Mayr, Ernst W. and Vorozhtsov, Evgenii V.},
PAGES = {88--99},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {8136},
}

Endnote

%0 Book Section
%A Errami, Hassan
%A Eiswirth, Markus
%A Grigoriev, Dima
%A Seiler, Werner M.
%A Sturm, Thomas
%A Weber, Andreas
%+ External Organizations
External Organizations
External Organizations
External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
%T Efficient Methods to Compute Hopf Bifurcations in Chemical Reaction Networks Using Reaction Coordinates :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0018-AD1A-A
%R 10.1007/978-3-319-02297-0_7
%D 2013
%* Review method: peer-reviewed
%B Computer Algebra in Scientific Computing
%E Gerdt, Vladimir P.; Koepf, Wolfram; Mayr, Ernst W.; Vorozhtsov, Evgenii V.
%P 88 - 99
%I Springer
%C Berlin
%@ 978-3-319-02296-3 978-3-319-02297-0
%S Lecture Notes in Computer Science
%N 8136
%@ false

Esquivel Pinto, C. S. (2013).

*Computing Variable Orders for SAT-Problems*. Universität des Saarlandes, Saarbrücken.Export

BibTeX

@mastersthesis{Esquivel13,
TITLE = {Computing Variable Orders for {SAT}-Problems},
AUTHOR = {Esquivel Pinto, Claudia Soa},
LANGUAGE = {eng},
LOCALID = {Local-ID: 9111BA971F345CCAC1257C66003D5892-Esquivel13},
SCHOOL = {Universit{\"a}t des Saarlandes},
ADDRESS = {Saarbr{\"u}cken},
YEAR = {2013},
DATE = {2013},
}

Endnote

%0 Thesis
%A Esquivel Pinto, Claudia Soa
%+ Automation of Logic, MPI for Informatics, Max Planck Society
%T Computing Variable Orders for SAT-Problems :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0015-7A2D-0
%F OTHER: Local-ID: 9111BA971F345CCAC1257C66003D5892-Esquivel13
%I Universität des Saarlandes
%C Saarbrücken
%D 2013
%P 66 p.
%V master
%9 master

Fietzke, A. L., & Weidenbach, C. (2013). Superposition as a Decision Procedure for Timed Automata.

*Mathematics in Computer Science*,*6*(4). doi:10.1007/s11786-012-0134-5Abstract

The success of superposition-based theorem proving in first-order logic relies
in particular on the fact that the superposition calculus can be turned into a
decision procedure for various decidable fragments of first-order logic and has
been successfully used to identify new decidable classes. In this paper, we
extend this story to the hierarchic combination of linear arithmetic and
first-order superposition. We show that decidability of reachability in timed
automata can be obtained by instantiation of an abstract termination result for
SUP(LA), the hierarchic combination of linear arithmetic and first-order
superposition.

Export

BibTeX

@article{FietzkeWeidenbachMCS2012,
TITLE = {Superposition as a Decision Procedure for Timed Automata},
AUTHOR = {Fietzke, Arnaud Luc and Weidenbach, Christoph},
ISSN = {1661-8289},
DOI = {10.1007/s11786-012-0134-5},
LOCALID = {Local-ID: C3E226157BA3C729C1257AED0052E27D-FietzkeWeidenbachMCS2012},
PUBLISHER = {Birkh{\"a}user},
ADDRESS = {Basel},
YEAR = {2013},
ABSTRACT = {The success of superposition-based theorem proving in first-order logic relies in particular on the fact that the superposition calculus can be turned into a decision procedure for various decidable fragments of first-order logic and has been successfully used to identify new decidable classes. In this paper, we extend this story to the hierarchic combination of linear arithmetic and first-order superposition. We show that decidability of reachability in timed automata can be obtained by instantiation of an abstract termination result for SUP(LA), the hierarchic combination of linear arithmetic and first-order superposition.},
JOURNAL = {Mathematics in Computer Science},
VOLUME = {6},
NUMBER = {4},
PAGES = {409--425},
}

Endnote

%0 Journal Article
%A Fietzke, Arnaud Luc
%A Weidenbach, Christoph
%+ Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T Superposition as a Decision Procedure for Timed Automata :
%U http://hdl.handle.net/11858/00-001M-0000-0014-B7C8-A
%R 10.1007/s11786-012-0134-5
%F OTHER: Local-ID: C3E226157BA3C729C1257AED0052E27D-FietzkeWeidenbachMCS2012
%7 2013-01-04
%D 2013
%8 04.01.2013
%X The success of superposition-based theorem proving in first-order logic relies
in particular on the fact that the superposition calculus can be turned into a
decision procedure for various decidable fragments of first-order logic and has
been successfully used to identify new decidable classes. In this paper, we
extend this story to the hierarchic combination of linear arithmetic and
first-order superposition. We show that decidability of reachability in timed
automata can be obtained by instantiation of an abstract termination result for
SUP(LA), the hierarchic combination of linear arithmetic and first-order
superposition.
%J Mathematics in Computer Science
%V 6
%N 4
%& 409
%P 409 - 425
%I Birkhäuser
%C Basel
%@ false

Ghilardi, S., Sattler, U., Sofronie-Stokkermans, V., & Tiwari, A. (Eds.). (2013).

*Automated Deduction: Decidability, Complexity, Tractability*. Presented at the Automated Deduction: Decidability, Complexity, Tractability, Lake Placid, NY, USA.Export

BibTeX

@proceedings{Sofronie-Stokkermans-addct13,
TITLE = {Automated Deduction: Decidability, Complexity, Tractability (ADDCT 2013)},
EDITOR = {Ghilardi, Silvio and Sattler, Ulrike and Sofronie-Stokkermans, Viorica and Tiwari, Ashish},
LANGUAGE = {eng},
YEAR = {2013},
DATE = {2013},
ADDRESS = {Lake Placid, NY, USA},
}

Endnote

%0 Conference Proceedings
%E Ghilardi, Silvio
%E Sattler, Ulrike
%E Sofronie-Stokkermans, Viorica
%E Tiwari, Ashish
%+ External Organizations
External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
%T Automated Deduction: Decidability, Complexity, Tractability : CADE-24, 24th International Conference on Automated Deduction ; Lake Placid, New York, 9-14 June, 2013 ; Workshop Program
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0024-C8B9-F
%D 2013
%B Automated Deduction: Decidability, Complexity, Tractability
%Z date of event: 2013-06-10 - 2013-06-10
%D 2013
%C Lake Placid, NY, USA
%U http://userpages.uni-koblenz.de/~sofronie/addct-2013/proceedings-addct-2013.pdf

Hillenbrand, T., Piskac, R., Waldmann, U., & Weidenbach, C. (2013). From Search to Computation: Redundancy Criteria and Simplification at Work. In

*Programming Logics*. Berlin: Springer. doi:10.1007/978-3-642-37651-1_7Export

BibTeX

@incollection{HillenbrandPiskacWaldmannWeidenbach2011,
TITLE = {From Search to Computation: Redundancy Criteria and Simplification at Work},
AUTHOR = {Hillenbrand, Thomas and Piskac, Ruzica and Waldmann, Uwe and Weidenbach, Christoph},
LANGUAGE = {eng},
ISSN = {0302-9743},
ISBN = {978-3-642-37650-4},
DOI = {10.1007/978-3-642-37651-1_7},
LOCALID = {Local-ID: EB42B8FF2A0632A0C125785B0056C554-HillenbrandPiskacWaldmannWeidenbach2011},
PUBLISHER = {Springer},
ADDRESS = {Berlin},
YEAR = {2013},
DATE = {2013},
BOOKTITLE = {Programming Logics},
EDITOR = {Voronkov, Andrei and Weidenbach, Christoph},
PAGES = {169--193},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {7797},
}

Endnote

%0 Book Section
%A Hillenbrand, Thomas
%A Piskac, Ruzica
%A Waldmann, Uwe
%A Weidenbach, Christoph
%+ Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T From Search to Computation: Redundancy Criteria and Simplification at Work :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0015-7972-B
%R 10.1007/978-3-642-37651-1_7
%F OTHER: Local-ID: EB42B8FF2A0632A0C125785B0056C554-HillenbrandPiskacWaldmannWeidenbach2011
%D 2013
%B Programming Logics
%E Voronkov, Andrei; Weidenbach, Christoph
%P 169 - 193
%I Springer
%C Berlin
%@ 978-3-642-37650-4
%S Lecture Notes in Computer Science
%N 7797
%@ false

Hillenbrand, T., & Weidenbach, C. (2013). Superposition for Bounded Domains. In

*Automated Reasoning and Mathematics*. Berlin: Springer. doi:10.1007/978-3-642-36675-8_4Export

BibTeX

@incollection{HillenbrandWeidenbach13,
TITLE = {Superposition for Bounded Domains},
AUTHOR = {Hillenbrand, Thomas and Weidenbach, Christoph},
LANGUAGE = {eng},
ISSN = {0302-9743},
ISBN = {978-3-642-36674-1},
DOI = {10.1007/978-3-642-36675-8_4},
LOCALID = {Local-ID: 89A2BD7B2848CEAFC1257B1D00703A22-HillenbrandWeidenbach13},
PUBLISHER = {Springer},
ADDRESS = {Berlin},
YEAR = {2013},
DATE = {2013},
BOOKTITLE = {Automated Reasoning and Mathematics},
EDITOR = {Bonacina, Maria Paola and Stickel, Mark},
PAGES = {68--100},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {7788},
}

Endnote

%0 Book Section
%A Hillenbrand, Thomas
%A Weidenbach, Christoph
%+ Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T Superposition for Bounded Domains :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0015-7978-0
%F OTHER: Local-ID: 89A2BD7B2848CEAFC1257B1D00703A22-HillenbrandWeidenbach13
%R 10.1007/978-3-642-36675-8_4
%D 2013
%B Automated Reasoning and Mathematics
%E Bonacina, Maria Paola; Stickel, Mark
%P 68 - 100
%I Springer
%C Berlin
%@ 978-3-642-36674-1
%S Lecture Notes in Computer Science
%N 7788
%@ false

Horbach, M. (2013).

*INFORMATIK 2013 - Informatik angepasst an Mensch, Organisation und Umwelt*. (M. Horbach, Ed.). Presented at the GI-Jahrestagung, Koblenz, Germany: Köllen.Export

BibTeX

@proceedings{Horbach2013Informatik,
TITLE = {{{INFORMATIK} 2013 -- Informatik angepasst an Mensch, Organisation und Umwelt}},
AUTHOR = {Horbach, Matthias},
EDITOR = {Horbach, Matthias},
LANGUAGE = {deu},
ISBN = {978-3-88579-614-5},
LOCALID = {Local-ID: C31A7116204D3B00C1257C69005253BC-Horbach2013Informatik},
PUBLISHER = {K{\"o}llen},
YEAR = {2013},
DATE = {2013},
PAGES = {CD-ROM},
SERIES = {Lecture Notes in Informatics},
VOLUME = {P-220},
ADDRESS = {Koblenz, Germany},
}

Endnote

%0 Conference Proceedings
%A Horbach, Matthias
%E Horbach, Matthias
%+ Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T INFORMATIK 2013 - Informatik angepasst an Mensch, Organisation und Umwelt :
%G deu
%U http://hdl.handle.net/11858/00-001M-0000-0015-7A08-2
%F OTHER: Local-ID: C31A7116204D3B00C1257C69005253BC-Horbach2013Informatik
%@ 978-3-88579-614-5
%I Köllen
%D 2013
%B GI-Jahrestagung
%Z date of event: 2013-09-16 - 2013-09-20
%D 2013
%C Koblenz, Germany
%P CD-ROM
%S Lecture Notes in Informatics
%V P-220

Horbach, M., & Sofronie-Stokkermans, V. (2013). Obtaining Finite Local Theory Axiomatizations via Saturation. In

*Frontiers of Combining Systems (FroCoS 2013)*. Nancy, France: Springer. doi:10.1007/978-3-642-40885-4_14Abstract

In this paper we present a method for obtaining local sets of clauses from
possibly non-local ones. For this, we follow the work of Basin and Ganzinger
and use saturation under a version of ordered resolution. In order to address
the fact that saturation can generate infinite sets of clauses, we use
constrained clauses and show that a link can be established
between saturation and locality also for constrained clauses:
This often allows us to give a finite representation
of possibly infinite saturated sets of clauses.

Export

BibTeX

@inproceedings{Sofronie-Stokkermans-frocos2013,
TITLE = {Obtaining Finite Local Theory Axiomatizations via Saturation},
AUTHOR = {Horbach, Matthias and Sofronie-Stokkermans, Viorica},
LANGUAGE = {eng},
ISSN = {0302-9743},
ISBN = {978-3-642-40884-7},
DOI = {10.1007/978-3-642-40885-4_14},
LOCALID = {Local-ID: D9058E034BD60D8DC1257C69004AE012-Sofronie-Stokkermans-frocos2013},
PUBLISHER = {Springer},
YEAR = {2013},
DATE = {2013},
ABSTRACT = {In this paper we present a method for obtaining local sets of clauses from possibly non-local ones. For this, we follow the work of Basin and Ganzinger and use saturation under a version of ordered resolution. In order to address the fact that saturation can generate infinite sets of clauses, we use constrained clauses and show that a link can be established between saturation and locality also for constrained clauses: This often allows us to give a finite representation of possibly infinite saturated sets of clauses.},
BOOKTITLE = {Frontiers of Combining Systems (FroCoS 2013)},
EDITOR = {Fontaine, Pascal and Ringeissen, Christophe and Schmidt, Renate A.},
PAGES = {198--213},
SERIES = {Lecture Notes in Artificial Intelligence},
VOLUME = {8152},
ADDRESS = {Nancy, France},
}

Endnote

%0 Conference Proceedings
%A Horbach, Matthias
%A Sofronie-Stokkermans, Viorica
%+ Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T Obtaining Finite Local Theory Axiomatizations via Saturation :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0015-797C-8
%F OTHER: Local-ID: D9058E034BD60D8DC1257C69004AE012-Sofronie-Stokkermans-frocos2013
%R 10.1007/978-3-642-40885-4_14
%D 2013
%B 9th International Symposium on Frontiers of Combining Systems
%Z date of event: 2013-09-18 - 2013-09-20
%C Nancy, France
%X In this paper we present a method for obtaining local sets of clauses from
possibly non-local ones. For this, we follow the work of Basin and Ganzinger
and use saturation under a version of ordered resolution. In order to address
the fact that saturation can generate infinite sets of clauses, we use
constrained clauses and show that a link can be established
between saturation and locality also for constrained clauses:
This often allows us to give a finite representation
of possibly infinite saturated sets of clauses.
%B Frontiers of Combining Systems
%E Fontaine, Pascal; Ringeissen, Christophe; Schmidt, Renate A.
%P 198 - 213
%I Springer
%@ 978-3-642-40884-7
%B Lecture Notes in Artificial Intelligence
%N 8152
%@ false

Kapur, D., Nieuwenhuis, R., Voronkov, A., Weidenbach, C., & Wilhelm, R. (2013). Harald Ganzinger’s Legacy: Contributions to Logics and Programming. In

*Programming Logics*. Berlin: Springer. doi:10.1007/978-3-642-37651-1_1Export

BibTeX

@incollection{VoronkovetAl13,
TITLE = {{Harald Ganzinger's} Legacy: Contributions to Logics and Programming},
AUTHOR = {Kapur, Deepak and Nieuwenhuis, Robert and Voronkov, Andrei and Weidenbach, Christoph and Wilhelm, Reinhard},
LANGUAGE = {eng},
ISSN = {0302-9743},
ISBN = {978-3-642-37650-4},
DOI = {10.1007/978-3-642-37651-1_1},
PUBLISHER = {Springer},
ADDRESS = {Berlin},
YEAR = {2013},
DATE = {2013},
BOOKTITLE = {Programming Logics},
EDITOR = {Voronkov, Andrei and Weidenbach, Christoph},
PAGES = {1--18},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {7797},
}

Endnote

%0 Book Section
%A Kapur, Deepak
%A Nieuwenhuis, Robert
%A Voronkov, Andrei
%A Weidenbach, Christoph
%A Wilhelm, Reinhard
%+ External Organizations
External Organizations
External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
%T Harald Ganzinger's Legacy: Contributions to Logics and Programming :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0015-79FE-2
%R 10.1007/978-3-642-37651-1_1
%F OTHER: Local_ID: 1B38D0934F61CD4EC1257C6A00501B2A-VoronkovetAl13
%D 2013
%B Programming Logics
%E Voronkov, Andrei; Weidenbach, Christoph
%P 1 - 18
%I Springer
%C Berlin
%@ 978-3-642-37650-4
%S Lecture Notes in Computer Science
%N 7797
%@ false

Karrenberg, R., Košta, M., & Sturm, T. (2013). Presburger Arithmetic in Memory Access Optimization for Data-parallel Languages. In

*Frontiers of Combining Systems (FroCoS 2013)*. Nancy, France: Springer. doi:10.1007/978-3-642-40885-4_5Abstract

Data-parallel languages like OpenCL and CUDA are an important means to exploit
the computational power of today's computing devices.
We consider the compilation of such languages for CPUs with SIMD instruction
sets.
To generate efficient code, one wants to statically decide whether or not
certain
memory operations access consecutive addresses.
We formalize the notion of consecutivity and algorithmically reduce the static
decision to satisfiability problems in Presburger Arithmetic.
We introduce a preprocessing technique on these SMT problems, which makes it
feasible to apply an off-the-shelf SMT solver.
We show that a prototypical OpenCL CPU driver based on our approach generates
more efficient code than any other state-of-the-art driver.

Export

BibTeX

@inproceedings{KarrenbergKostaSturm2013,
TITLE = {Presburger Arithmetic in Memory Access Optimization for Data-parallel Languages},
AUTHOR = {Karrenberg, Ralf and Ko{\v s}ta, Marek and Sturm, Thomas},
LANGUAGE = {eng},
ISSN = {0302-9743},
ISBN = {978-3-642-40884-7},
DOI = {10.1007/978-3-642-40885-4_5},
LOCALID = {Local-ID: 19E92F4A98DEF6D4C1257C6A00300DB4-KarrenbergKostaSturm2013},
PUBLISHER = {Springer},
YEAR = {2013},
DATE = {2013},
ABSTRACT = {Data-parallel languages like OpenCL and CUDA are an important means to exploit the computational power of today's computing devices. We consider the compilation of such languages for CPUs with SIMD instruction sets. To generate efficient code, one wants to statically decide whether or not certain memory operations access consecutive addresses. We formalize the notion of consecutivity and algorithmically reduce the static decision to satisfiability problems in Presburger Arithmetic. We introduce a preprocessing technique on these SMT problems, which makes it feasible to apply an off-the-shelf SMT solver. We show that a prototypical OpenCL CPU driver based on our approach generates more efficient code than any other state-of-the-art driver.},
BOOKTITLE = {Frontiers of Combining Systems (FroCoS 2013)},
EDITOR = {Fontaine, Pascal and Ringeissen, Christophe and Schmidt, Renate A.},
PAGES = {56--70},
SERIES = {Lecture Notes in Artificial Intelligence},
VOLUME = {8152},
ADDRESS = {Nancy, France},
}

Endnote

%0 Conference Proceedings
%A Karrenberg, Ralf
%A Košta, Marek
%A Sturm, Thomas
%+ External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T Presburger Arithmetic in Memory Access Optimization for Data-parallel Languages :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0015-7A11-C
%F OTHER: Local-ID: 19E92F4A98DEF6D4C1257C6A00300DB4-KarrenbergKostaSturm2013
%R 10.1007/978-3-642-40885-4_5
%D 2013
%B 9th International Symposium on Frontiers of Combining Systems
%Z date of event: 2013-09-18 - 2013-09-20
%C Nancy, France
%X Data-parallel languages like OpenCL and CUDA are an important means to exploit
the computational power of today's computing devices.
We consider the compilation of such languages for CPUs with SIMD instruction
sets.
To generate efficient code, one wants to statically decide whether or not
certain
memory operations access consecutive addresses.
We formalize the notion of consecutivity and algorithmically reduce the static
decision to satisfiability problems in Presburger Arithmetic.
We introduce a preprocessing technique on these SMT problems, which makes it
feasible to apply an off-the-shelf SMT solver.
We show that a prototypical OpenCL CPU driver based on our approach generates
more efficient code than any other state-of-the-art driver.
%B Frontiers of Combining Systems
%E Fontaine, Pascal; Ringeissen, Christophe; Schmidt, Renate A.
%P 56 - 70
%I Springer
%@ 978-3-642-40884-7
%B Lecture Notes in Artificial Intelligence
%N 8152
%@ false

Košta, M., & Sturm, T. (Eds.). (2013).

*Proceedings of the Fifth International Conference on Mathematical Aspects of Computer and Information Sciences*. Presented at the Fifth International Conference on Mathematical Aspects of Computer and Information Sciences, Nanning, China.Export

BibTeX

@proceedings{KostaSturmproc2013,
TITLE = {Proceedings of the Fifth International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS 2013)},
EDITOR = {Ko{\v s}ta, Marek and Sturm, Thomas},
LANGUAGE = {eng},
YEAR = {2013},
DATE = {2013},
ADDRESS = {Nanning, China},
}

Endnote

%0 Conference Proceedings
%E Košta, Marek
%E Sturm, Thomas
%+ Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T Proceedings of the Fifth International Conference on Mathematical Aspects of Computer and Information Sciences :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0026-A9D1-C
%D 2013
%B Fifth International Conference on Mathematical Aspects of Computer and Information Sciences
%Z date of event: 2013-12-11 - 2013-12-13
%D 2013
%C Nanning, China

Košta, M. (2013). SMT-based Compiler Support for Memory Access Optimization for Data-parallel Languages. In

*Proceedings of the Fifth International Conference on Mathematical Aspects of Computer and System Sciences (MACIS 2013)*. Nanning, China.Export

BibTeX

@inproceedings{Kosta2013a,
TITLE = {{SMT}-based Compiler Support for Memory Access Optimization for Data-parallel Languages},
AUTHOR = {Ko{\v s}ta, Marek},
LANGUAGE = {eng},
LOCALID = {Local-ID: EB045FCF8BF297B8C1257C6A007C8154-Kosta2013},
YEAR = {2013},
DATE = {2013},
BOOKTITLE = {Proceedings of the Fifth International Conference on Mathematical Aspects of Computer and System Sciences (MACIS 2013)},
EDITOR = {Ko{\v s}ta, Marek and Sturm, Thomas},
PAGES = {36--42},
ADDRESS = {Nanning, China},
}

Endnote

%0 Conference Proceedings
%A Košta, Marek
%+ Automation of Logic, MPI for Informatics, Max Planck Society
%T SMT-based Compiler Support for Memory Access Optimization for Data-parallel Languages :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0018-EF73-A
%F OTHER: Local-ID: EB045FCF8BF297B8C1257C6A007C8154-Kosta2013
%D 2013
%B Fifth International Conference on Mathematical Aspects of Computer and System Sciences
%Z date of event: 2013-12-11 - 2013-12-13
%C Nanning, China
%B Proceedings of the Fifth International Conference on Mathematical Aspects of Computer and System Sciences
%E Košta, Marek; Sturm, Thomas
%P 36 - 42

Kruglov, E. (2013).

*Superposition Modulo Theory*. Universität des Saarlandes, Saarbrücken. Retrieved from urn:nbn:de:bsz:291-scidok-55597Export

BibTeX

@phdthesis{KruglovDiss13,
TITLE = {Superposition Modulo Theory},
AUTHOR = {Kruglov, Evgeny},
LANGUAGE = {eng},
URL = {urn:nbn:de:bsz:291-scidok-55597},
LOCALID = {Local-ID: F58B326B7199622DC1257C66003BEFFF-KruglovDiss13},
SCHOOL = {Universit{\"a}t des Saarlandes},
ADDRESS = {Saarbr{\"u}cken},
YEAR = {2013},
DATE = {2013},
}

Endnote

%0 Thesis
%A Kruglov, Evgeny
%Y Althaus, Ernst
%A referee: Weidenbach, Christoph
%+ Automation of Logic, MPI for Informatics, Max Planck Society
International Max Planck Research School, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T Superposition Modulo Theory :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0015-7A1C-5
%F OTHER: Local-ID: F58B326B7199622DC1257C66003BEFFF-KruglovDiss13
%U urn:nbn:de:bsz:291-scidok-55597
%I Universität des Saarlandes
%C Saarbrücken
%D 2013
%P X, 229 p.
%V phd
%9 phd
%U http://scidok.sulb.uni-saarland.de/volltexte/2013/5559/http://scidok.sulb.uni-saarland.de/doku/lic_ohne_pod.php?la=de

Lamotte-Schubert, M., & Weidenbach, C. (2013). BDI: A New Decidable First-order Clause Class. In

*LPAR-19, 19th International Conference on Logic for Programming, Artificial Intelligence and Reasoning*. Stellenbosch, South Africa: EasyChair. Retrieved from http://www.easychair.org/publications/?page=1079461175Abstract

BDI (Bounded Depth Increase) is a new decidable first-order clause class. It strictly includes known classes such as PVD. The arity of function and predicate symbols as well as the shape of atoms is not restricted in BDI. Instead the shape of "cycles" in resolution inferences is restricted such that the depth of generated clauses may increase but is still finitely bound. The BDI class is motivated by real world problems where function terms are used to represent record structures.
We show that the hyper-resolution calculus modulo redundancy elimination terminates on BDI clause sets. Employing this result to the ordered resolution calculus, we can also prove termination of ordered resolution on BDI, yielding a more efficient decision procedure.

Export

BibTeX

@inproceedings{Lamotte-SchubertWeidenbach13,
TITLE = {{BDI}: A New Decidable First-order Clause Class},
AUTHOR = {Lamotte-Schubert, Manuel and Weidenbach, Christoph},
LANGUAGE = {eng},
ISSN = {2040-557X},
URL = {http://www.easychair.org/publications/?page=1079461175},
PUBLISHER = {EasyChair},
YEAR = {2013},
DATE = {2013},
ABSTRACT = {BDI (Bounded Depth Increase) is a new decidable first-order clause class. It strictly includes known classes such as PVD. The arity of function and predicate symbols as well as the shape of atoms is not restricted in BDI. Instead the shape of "cycles" in resolution inferences is restricted such that the depth of generated clauses may increase but is still finitely bound. The BDI class is motivated by real world problems where function terms are used to represent record structures. We show that the hyper-resolution calculus modulo redundancy elimination terminates on BDI clause sets. Employing this result to the ordered resolution calculus, we can also prove termination of ordered resolution on BDI, yielding a more efficient decision procedure.},
BOOKTITLE = {LPAR-19, 19th International Conference on Logic for Programming, Artificial Intelligence and Reasoning},
EDITOR = {McMillan, Ken and Middeldorp, Aart and Sutcliffe, Geoff and Voronkov, Andrei},
PAGES = {62--74},
SERIES = {EasyChair Proceedings in Computing},
VOLUME = {26},
ADDRESS = {Stellenbosch, South Africa},
}

Endnote

%0 Conference Proceedings
%A Lamotte-Schubert, Manuel
%A Weidenbach, Christoph
%+ Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T BDI: A New Decidable First-order Clause Class :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0024-C374-D
%U http://www.easychair.org/publications/?page=1079461175
%D 2013
%B 19th International Conference on Logic for Programming, Artificial Intelligence and Reasoning
%Z date of event: 2013-12-12 - 2013-12-17
%C Stellenbosch, South Africa
%X BDI (Bounded Depth Increase) is a new decidable first-order clause class. It strictly includes known classes such as PVD. The arity of function and predicate symbols as well as the shape of atoms is not restricted in BDI. Instead the shape of "cycles" in resolution inferences is restricted such that the depth of generated clauses may increase but is still finitely bound. The BDI class is motivated by real world problems where function terms are used to represent record structures.
We show that the hyper-resolution calculus modulo redundancy elimination terminates on BDI clause sets. Employing this result to the ordered resolution calculus, we can also prove termination of ordered resolution on BDI, yielding a more efficient decision procedure.
%B LPAR-19
%E McMillan, Ken; Middeldorp, Aart; Sutcliffe, Geoff; Voronkov, Andrei
%P 62 - 74
%I EasyChair
%B EasyChair Proceedings in Computing
%N 26
%@ false

Lu, T. (2013).

*Formal Verification of the Pastry Protocol*. Universität des Saarlandes, Saarbrücken. Retrieved from urn:nbn:de:bsz:291-scidok-55878Export

BibTeX

@phdthesis{LuDiss13,
TITLE = {Formal Verification of the {Pastry} Protocol},
AUTHOR = {Lu, Tianxiang},
LANGUAGE = {eng},
URL = {urn:nbn:de:bsz:291-scidok-55878},
LOCALID = {Local-ID: 53D311D21A10BD89C1257C66003CDFCF-LuDiss13},
SCHOOL = {Universit{\"a}t des Saarlandes},
ADDRESS = {Saarbr{\"u}cken},
YEAR = {2013},
DATE = {2013},
}

Endnote

%0 Thesis
%A Lu, Tianxiang
%Y Weidenbach, Christoph
%A referee: Schmitt, Peter
%+ Automation of Logic, MPI for Informatics, Max Planck Society
International Max Planck Research School, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
%T Formal Verification of the Pastry Protocol :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0015-7A22-6
%F OTHER: Local-ID: 53D311D21A10BD89C1257C66003CDFCF-LuDiss13
%U urn:nbn:de:bsz:291-scidok-55878
%I Universität des Saarlandes
%C Saarbrücken
%D 2013
%V phd
%9 phd
%U http://scidok.sulb.uni-saarland.de/volltexte/2013/5587/http://scidok.sulb.uni-saarland.de/doku/lic_ohne_pod.php?la=de

Reuter, J. (2013).

*Real Linear Quantifier Elimination*. Universität des Saarlandes, Saarbrücken.Export

BibTeX

@mastersthesis{Reuter13,
TITLE = {Real Linear Quantifier Elimination},
AUTHOR = {Reuter, Jochen},
LANGUAGE = {eng},
LOCALID = {Local-ID: F0C7E37C199F08D2C1257AF6004CE0B4-Reuter13},
SCHOOL = {Universit{\"a}t des Saarlandes},
ADDRESS = {Saarbr{\"u}cken},
YEAR = {2013},
DATE = {2013},
}

Endnote

%0 Thesis
%A Reuter, Jochen
%+ Automation of Logic, MPI for Informatics, Max Planck Society
%T Real Linear Quantifier Elimination :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0015-7A29-7
%F OTHER: Local-ID: F0C7E37C199F08D2C1257AF6004CE0B4-Reuter13
%I Universität des Saarlandes
%C Saarbrücken
%D 2013
%P 56 p.
%V master
%9 master

Sofronie-Stokkermans, V. (2013a). Hierarchical Reasoning and Model Generation for the Verification of Parametric Hybrid Systems. In

*Automated Deduction - CADE-24*. Lake Placid, NY, USA: Springer. doi:10.1007/978-3-642-38574-2_25Abstract

In this paper we study possibilities of using methods for
hierarchical reasoning in local theory extensions for the
analysis and verification of parametric hybrid systems,
where the parameters can be either constants or functions.
Our goal is to automatically provide guarantees that such
systems satisfy certain safety or invariance conditions.
We first analyze the possibility of automatically generating
such guarantees in the form of constraints on parameters,
then show that we can also synthesise so-called criticality
functions, typically used for proving stability and/or
safety of hybrid systems.
We illustrate our methods on several examples.

Export

BibTeX

@inproceedings{Sofronie-Stokkermans-2013,
TITLE = {Hierarchical Reasoning and Model Generation for the Verification of Parametric Hybrid Systems},
AUTHOR = {Sofronie-Stokkermans, Viorica},
LANGUAGE = {eng},
ISSN = {0302-9743},
ISBN = {978-3-642-38573-5},
DOI = {10.1007/978-3-642-38574-2_25},
LOCALID = {Local-ID: 96E145A424CFEEAAC1257B2C00472CCC-Sofronie-Stokkermans-2013},
PUBLISHER = {Springer},
YEAR = {2013},
DATE = {2013},
ABSTRACT = {In this paper we study possibilities of using methods for hierarchical reasoning in local theory extensions for the analysis and verification of parametric hybrid systems, where the parameters can be either constants or functions. Our goal is to automatically provide guarantees that such systems satisfy certain safety or invariance conditions. We first analyze the possibility of automatically generating such guarantees in the form of constraints on parameters, then show that we can also synthesise so-called criticality functions, typically used for proving stability and/or safety of hybrid systems. We illustrate our methods on several examples.},
BOOKTITLE = {Automated Deduction -- CADE-24},
EDITOR = {Bonacina, Maria Paola},
PAGES = {360--376},
SERIES = {Lecture Notes in Artificial Intelligence},
VOLUME = {7898},
ADDRESS = {Lake Placid, NY, USA},
}

Endnote

%0 Conference Proceedings
%A Sofronie-Stokkermans, Viorica
%+ Automation of Logic, MPI for Informatics, Max Planck Society
%T Hierarchical Reasoning and Model Generation for the Verification of Parametric Hybrid Systems :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0015-7A6E-F
%R 10.1007/978-3-642-38574-2_25
%F OTHER: Local-ID: 96E145A424CFEEAAC1257B2C00472CCC-Sofronie-Stokkermans-2013
%D 2013
%B 24th International Conference on Automated Deduction
%Z date of event: 2013-06-09 - 2013-06-14
%C Lake Placid, NY, USA
%X In this paper we study possibilities of using methods for
hierarchical reasoning in local theory extensions for the
analysis and verification of parametric hybrid systems,
where the parameters can be either constants or functions.
Our goal is to automatically provide guarantees that such
systems satisfy certain safety or invariance conditions.
We first analyze the possibility of automatically generating
such guarantees in the form of constraints on parameters,
then show that we can also synthesise so-called criticality
functions, typically used for proving stability and/or
safety of hybrid systems.
We illustrate our methods on several examples.
%B Automated Deduction - CADE-24
%E Bonacina, Maria Paola
%P 360 - 376
%I Springer
%@ 978-3-642-38573-5
%B Lecture Notes in Artificial Intelligence
%N 7898
%@ false

Sofronie-Stokkermans, V. (2013b). Locality and Applications to Subsumption Testing in EL and Some of its Extensions.

*Scientific Annals of Computer Science*,*23*(2). doi:10.7561/SACS.2013.2.251Abstract

In this paper we show that subsumption problems in the description logics EL and EL+ can be expressed as uniform word problems in classes of semilattices with monotone operators. We use possibilities of efficient local reasoning in such classes of algebras, to obtain uniform PTIME decision procedures for TBox and CBox subsumption in EL and EL+. These locality considerations allow us to present a new family of (possibly many-sorted) logics which extend EL and EL+ with n-ary roles and/or numerical domains.

Export

BibTeX

@article{Sofronie-Stokkermans-sacs2013,
TITLE = {Locality and Applications to Subsumption Testing in {EL} and Some of its Extensions},
AUTHOR = {Sofronie-Stokkermans, Viorica},
LANGUAGE = {eng},
ISSN = {2248 -- 2695},
DOI = {10.7561/SACS.2013.2.251},
LOCALID = {Local-ID: F840E3FA6E8F889BC1257C69004B4765-Sofronie-Stokkermans-sacs2013},
PUBLISHER = {Alexandru Ioan Cuza University},
ADDRESS = {Iasi},
YEAR = {2013},
DATE = {2013},
ABSTRACT = {In this paper we show that subsumption problems in the description logics EL and EL+ can be expressed as uniform word problems in classes of semilattices with monotone operators. We use possibilities of efficient local reasoning in such classes of algebras, to obtain uniform PTIME decision procedures for TBox and CBox subsumption in EL and EL+. These locality considerations allow us to present a new family of (possibly many-sorted) logics which extend EL and EL+ with n-ary roles and/or numerical domains.},
JOURNAL = {Scientific Annals of Computer Science},
VOLUME = {23},
NUMBER = {2},
PAGES = {251--284},
}

Endnote

%0 Journal Article
%A Sofronie-Stokkermans, Viorica
%+ Automation of Logic, MPI for Informatics, Max Planck Society
%T Locality and Applications to Subsumption Testing in EL and Some of its Extensions :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0017-BD75-C
%F OTHER: Local-ID: F840E3FA6E8F889BC1257C69004B4765-Sofronie-Stokkermans-sacs2013
%R 10.7561/SACS.2013.2.251
%7 2013-12
%D 2013
%X In this paper we show that subsumption problems in the description logics EL and EL+ can be expressed as uniform word problems in classes of semilattices with monotone operators. We use possibilities of efficient local reasoning in such classes of algebras, to obtain uniform PTIME decision procedures for TBox and CBox subsumption in EL and EL+. These locality considerations allow us to present a new family of (possibly many-sorted) logics which extend EL and EL+ with n-ary roles and/or numerical domains.
%J Scientific Annals of Computer Science
%V 23
%N 2
%& 251
%P 251 - 284
%I Alexandru Ioan Cuza University
%C Iasi
%@ false

Sofronie-Stokkermans, V. (2013c). On Combinations of Local Theory Extensions. In

*Programming Logics*. Berlin: Springer. doi:10.1007/978-3-642-37651-1_16Abstract

Many problems in mathematics and computer science can be
reduced to proving the satisfiability of conjunctions of
literals in a background theory which is often the extension
of a base theory with additional functions or a combination
of theories.
It is therefore important to have efficient procedures for
checking satisfiability of conjunctions of ground literals
in extensions and combinations of theories.
For a special type of theory extensions, namely \em local
extensions, hierarchic reasoning, in which a theorem prover
for the base theory can be used as a ``black box'',
is possible. Many theories used in computer science or
mathematics are local extensions of a base theory.
However, often it is necessary to consider complex extensions
of a theory, with various types of functions.
In this paper we identify situations in which
a combination of local extensions of a base theory
is guaranteed to be again a local extension of the base theory.
We thus obtain criteria both for recognizing wider classes of
local theory extensions, and for modular reasoning in
combinations of theories over non-disjoint signatures.

Export

BibTeX

@incollection{Sofronie-wlphg11,
TITLE = {On Combinations of Local Theory Extensions},
AUTHOR = {Sofronie-Stokkermans, Viorica},
LANGUAGE = {eng},
ISSN = {0302-9743},
ISBN = {978-3-642-37650-4},
DOI = {10.1007/978-3-642-37651-1_16},
LOCALID = {Local-ID: 4D6F77024162244BC125784C00552BF9-Sofronie-wlphg11},
PUBLISHER = {Springer},
ADDRESS = {Berlin},
YEAR = {2013},
DATE = {2013},
ABSTRACT = {Many problems in mathematics and computer science can be reduced to proving the satisfiability of conjunctions of literals in a background theory which is often the extension of a base theory with additional functions or a combination of theories. It is therefore important to have efficient procedures for checking satisfiability of conjunctions of ground literals in extensions and combinations of theories. For a special type of theory extensions, namely \em local extensions, hierarchic reasoning, in which a theorem prover for the base theory can be used as a ``black box'', is possible. Many theories used in computer science or mathematics are local extensions of a base theory. However, often it is necessary to consider complex extensions of a theory, with various types of functions. In this paper we identify situations in which a combination of local extensions of a base theory is guaranteed to be again a local extension of the base theory. We thus obtain criteria both for recognizing wider classes of local theory extensions, and for modular reasoning in combinations of theories over non-disjoint signatures.},
BOOKTITLE = {Programming Logics},
EDITOR = {Voronkov, Andrei and Weidenbach, Christoph},
PAGES = {392--413},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {7797},
}

Endnote

%0 Book Section
%A Sofronie-Stokkermans, Viorica
%+ Automation of Logic, MPI for Informatics, Max Planck Society
%T On Combinations of Local Theory Extensions :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0015-7A6C-4
%F OTHER: Local-ID: 4D6F77024162244BC125784C00552BF9-Sofronie-wlphg11
%R 10.1007/978-3-642-37651-1_16
%D 2013
%X Many problems in mathematics and computer science can be
reduced to proving the satisfiability of conjunctions of
literals in a background theory which is often the extension
of a base theory with additional functions or a combination
of theories.
It is therefore important to have efficient procedures for
checking satisfiability of conjunctions of ground literals
in extensions and combinations of theories.
For a special type of theory extensions, namely \em local
extensions, hierarchic reasoning, in which a theorem prover
for the base theory can be used as a ``black box'',
is possible. Many theories used in computer science or
mathematics are local extensions of a base theory.
However, often it is necessary to consider complex extensions
of a theory, with various types of functions.
In this paper we identify situations in which
a combination of local extensions of a base theory
is guaranteed to be again a local extension of the base theory.
We thus obtain criteria both for recognizing wider classes of
local theory extensions, and for modular reasoning in
combinations of theories over non-disjoint signatures.
%B Programming Logics
%E Voronkov, Andrei; Weidenbach, Christoph
%P 392 - 413
%I Springer
%C Berlin
%@ 978-3-642-37650-4
%S Lecture Notes in Computer Science
%N 7797
%@ false

Suda, M. (2013a). Triggered Clause Pushing for IC3. Retrieved from http://arxiv.org/abs/1307.4966

(arXiv: 1307.4966) Abstract

We propose an improvement of the famous IC3 algorithm for model checking
safety properties of finite state systems. We collect models computed by the
SAT-solver during the clause propagation phase of the algorithm and use them as
witnesses for why the respective clauses could not be pushed forward. It only
makes sense to recheck a particular clause for pushing when its witnessing
model falsifies a newly added clause. Since this trigger test is both
computationally cheap and sufficiently precise, we can afford to keep clauses
pushed as far as possible at all times. Experiments indicate that this strategy
considerably improves IC3's performance.

Export

BibTeX

@online{DBLP:journals/corr/Suda13a,
TITLE = {Triggered Clause Pushing for {IC3}},
AUTHOR = {Suda, Martin},
LANGUAGE = {eng},
URL = {http://arxiv.org/abs/1307.4966},
EPRINT = {1307.4966},
EPRINTTYPE = {arXiv},
YEAR = {2013},
ABSTRACT = {We propose an improvement of the famous IC3 algorithm for model checking safety properties of finite state systems. We collect models computed by the SAT-solver during the clause propagation phase of the algorithm and use them as witnesses for why the respective clauses could not be pushed forward. It only makes sense to recheck a particular clause for pushing when its witnessing model falsifies a newly added clause. Since this trigger test is both computationally cheap and sufficiently precise, we can afford to keep clauses pushed as far as possible at all times. Experiments indicate that this strategy considerably improves IC3's performance.},
}

Endnote

%0 Report
%A Suda, Martin
%+ Automation of Logic, MPI for Informatics, Max Planck Society
%T Triggered Clause Pushing for IC3 :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0024-9F0F-1
%U http://arxiv.org/abs/1307.4966
%D 2013
%X We propose an improvement of the famous IC3 algorithm for model checking
safety properties of finite state systems. We collect models computed by the
SAT-solver during the clause propagation phase of the algorithm and use them as
witnesses for why the respective clauses could not be pushed forward. It only
makes sense to recheck a particular clause for pushing when its witnessing
model falsifies a newly added clause. Since this trigger test is both
computationally cheap and sufficiently precise, we can afford to keep clauses
pushed as far as possible at all times. Experiments indicate that this strategy
considerably improves IC3's performance.
%K Computer Science, Logic in Computer Science, cs.LO

Suda, M. (2013b). Variable and Clause Elimination for LTL Satisfiability Checking. In

*Proceedings of the Fifth International Conference on Mathematical Aspects of Computer and System Sciences (MACIS 2013)*. Nanning, China.Export

BibTeX

@inproceedings{VCEforLTLmacis2013,
TITLE = {Variable and Clause Elimination for {LTL} Satisfiability Checking},
AUTHOR = {Suda, Martin},
LANGUAGE = {eng},
YEAR = {2013},
DATE = {2013},
BOOKTITLE = {Proceedings of the Fifth International Conference on Mathematical Aspects of Computer and System Sciences (MACIS 2013)},
EDITOR = {Ko{\v s}ta, Marek and Sturm, Thomas},
PAGES = {60--74},
ADDRESS = {Nanning, China},
}

Endnote

%0 Conference Proceedings
%A Suda, Martin
%+ Automation of Logic, MPI for Informatics, Max Planck Society
%T Variable and Clause Elimination for LTL Satisfiability Checking :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0024-9F19-9
%D 2013
%B Fifth International Conference on Mathematical Aspects of Computer and System Sciences
%Z date of event: 2013-12-11 - 2013-12-13
%C Nanning, China
%B Proceedings of the Fifth International Conference on Mathematical Aspects of Computer and System Sciences
%E Košta, Marek; Sturm, Thomas
%P 60 - 74

Teucke, A. (2013).

*CDCL with Reduction*. Universität des Saarlandes, Saarbrücken.Export

BibTeX

@mastersthesis{Teucke13,
TITLE = {{CDCL} with Reduction},
AUTHOR = {Teucke, Andreas},
LANGUAGE = {eng},
SCHOOL = {Universit{\"a}t des Saarlandes},
ADDRESS = {Saarbr{\"u}cken},
YEAR = {2013},
DATE = {2013},
}

Endnote

%0 Thesis
%A Teucke, Andreas
%+ Automation of Logic, MPI for Informatics, Max Planck Society
%T CDCL with Reduction :
%O {CDCL} with Reduction
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0015-7A32-2
%F OTHER: Local-ID : 2CADB201C14614B8C1257C66003EDCEF-Teucke13
%I Universität des Saarlandes
%C Saarbrücken
%D 2013
%P 70 p.
%V master
%9 master

Voronkov, A., & Weidenbach, C. (Eds.). (2013).

*Programming Logics*. Berlin: Springer. doi:10.1007/978-3-642-37651-1Export

BibTeX

@book{VoronkovWeidenbach13,
TITLE = {Programming Logics},
EDITOR = {Voronkov, Andrei and Weidenbach, Christoph},
LANGUAGE = {eng},
ISBN = {978-3-642-37650-4},
DOI = {10.1007/978-3-642-37651-1},
LOCALID = {Local-ID: F189ECDDE309058BC1257C6A004F80BC-VoronkovWeidenbach13},
PUBLISHER = {Springer},
ADDRESS = {Berlin},
YEAR = {2013},
DATE = {2013},
PAGES = {445},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {7797},
}

Endnote

%0 Edited Book
%A Voronkov, Andrei
%A Weidenbach, Christoph
%+ External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
%T Programming Logics : Essays in Memory of Harald Ganzinger
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0015-7A6A-8
%F OTHER: Local-ID: F189ECDDE309058BC1257C6A004F80BC-VoronkovWeidenbach13
%R 10.1007/978-3-642-37651-1
%I Springer
%C Berlin
%D 2013
%P 445
%B Lecture Notes in Computer Science
%N 7797
%@ 978-3-642-37650-4

2012

Azmy, N. (2012).

*Formula Renaming with Generalizations*. Universität des Saarlandes, Saarbrücken.Export

BibTeX

@mastersthesis{Azmy12,
TITLE = {Formula Renaming with Generalizations},
AUTHOR = {Azmy, Noran},
LANGUAGE = {eng},
LOCALID = {Local-ID: DF824D161A8C2600C1257AF6004FEBFF-Azmy12},
SCHOOL = {Universit{\"a}t des Saarlandes},
ADDRESS = {Saarbr{\"u}cken},
YEAR = {2012},
DATE = {2012},
}

Endnote

%0 Thesis
%A Azmy, Noran
%Y Weidenbach, Christoph
%A referee: Werner, Stephan
%+ Automation of Logic, MPI for Informatics, Max Planck Society
International Max Planck Research School, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
%T Formula Renaming with Generalizations :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0014-B40C-0
%F OTHER: Local-ID: DF824D161A8C2600C1257AF6004FEBFF-Azmy12
%I Universität des Saarlandes
%C Saarbrücken
%D 2012
%V master
%9 master

Blanchette, J. C., Popescu, A., Wand, D., & Weidenbach, C. (2012). More SPASS with Isabelle : Superposition with Hard Sorts and Configurable Simplification. In

*Interactive Theorem Proving (ITP 2012)*. Princeton, NJ: Springer. doi:10.1007/978-3-642-32347-8_24Export

BibTeX

@inproceedings{Wand2012,
TITLE = {More {SPASS} with {Isabelle} : Superposition with Hard Sorts and Configurable Simplification},
AUTHOR = {Blanchette, Jasmin Christian and Popescu, Andrei and Wand, Daniel and Weidenbach, Christoph},
LANGUAGE = {eng},
ISBN = {978-3-642-32346-1},
DOI = {10.1007/978-3-642-32347-8_24},
LOCALID = {Local-ID: E8D9DE077D054C23C12579FB0041779E-Wand2012},
PUBLISHER = {Springer},
YEAR = {2012},
DATE = {2012},
BOOKTITLE = {Interactive Theorem Proving (ITP 2012)},
EDITOR = {Beringer, Lennart and Felty, Amy},
PAGES = {345--360},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {7406},
ADDRESS = {Princeton, NJ},
}

Endnote

%0 Conference Proceedings
%A Blanchette, Jasmin Christian
%A Popescu, Andrei
%A Wand, Daniel
%A Weidenbach, Christoph
%+ External Organizations
External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T More SPASS with Isabelle : Superposition with Hard Sorts and Configurable Simplification :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0014-B7E8-2
%R 10.1007/978-3-642-32347-8_24
%F OTHER: Local-ID: E8D9DE077D054C23C12579FB0041779E-Wand2012
%D 2012
%B Third International Conference on Interactive Theorem Proving
%Z date of event: 2012-08-13 - 2012-08-15
%C Princeton, NJ
%B Interactive Theorem Proving
%E Beringer, Lennart; Felty, Amy
%P 345 - 360
%I Springer
%@ 978-3-642-32346-1
%B Lecture Notes in Computer Science
%N 7406

Bromberger, M. (2012).

*Adapting the Simplex Algorithm for Superposition Modulo Linear Arithmetic*. Universität des Saarlandes, Saarbrücken.Export

BibTeX

@mastersthesis{Bromberger12,
TITLE = {Adapting the Simplex Algorithm for Superposition Modulo Linear Arithmetic},
AUTHOR = {Bromberger, Martin},
LANGUAGE = {eng},
LOCALID = {Local-ID: 9B349224CA2F4709C1257AF6004C972F-Bromberger12},
SCHOOL = {Universit{\"a}t des Saarlandes},
ADDRESS = {Saarbr{\"u}cken},
YEAR = {2012},
DATE = {2012},
TYPE = {Bachelor's thesis},
}

Endnote

%0 Thesis
%A Bromberger, Martin
%+ Automation of Logic, MPI for Informatics, Max Planck Society
%T Adapting the Simplex Algorithm for Superposition Modulo Linear Arithmetic :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0014-B75F-9
%F OTHER: Local-ID: 9B349224CA2F4709C1257AF6004C972F-Bromberger12
%I Universität des Saarlandes
%C Saarbrücken
%D 2012
%V bachelor
%9 bachelor

Damm, W., Dierks, H., Disch, S., Hagemann, W., Pigorsch, F., Scholl, C., … Wirtz, B. (2012). Exact and Fully Symbolic Verification of Linear Hybrid Automata with Large Discrete State Spaces.

*Science of Computer Programming*,*77*. doi:10.1016/j.scico.2011.07.006Export

BibTeX

@article{DammDierksDischEtAl2011,
TITLE = {Exact and Fully Symbolic Verification of Linear Hybrid Automata with Large Discrete State Spaces},
AUTHOR = {Damm, Werner and Dierks, Henning and Disch, Stefan and Hagemann, Willem and Pigorsch, Florian and Scholl, Christoph and Waldmann, Uwe and Wirtz, Boris},
LANGUAGE = {eng},
ISSN = {0167-6423},
URL = {http://dx.doi.org/10.1016/j.scico.2011.07.006},
DOI = {10.1016/j.scico.2011.07.006},
LOCALID = {Local-ID: C125716C0050FB51-84433C7FC34FC48BC125781B004BC664-DammDierksDischEtAl2011},
PUBLISHER = {Elsevier},
ADDRESS = {Amsterdam},
YEAR = {2012},
DATE = {2012},
JOURNAL = {Science of Computer Programming},
VOLUME = {77},
PAGES = {1122--1150},
}

Endnote

%0 Journal Article
%A Damm, Werner
%A Dierks, Henning
%A Disch, Stefan
%A Hagemann, Willem
%A Pigorsch, Florian
%A Scholl, Christoph
%A Waldmann, Uwe
%A Wirtz, Boris
%+ External Organizations
External Organizations
External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
%T Exact and Fully Symbolic Verification of Linear Hybrid Automata with Large Discrete State Spaces :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0010-14F1-8
%F EDOC: 619009
%R 10.1016/j.scico.2011.07.006
%U http://dx.doi.org/10.1016/j.scico.2011.07.006
%F OTHER: Local-ID: C125716C0050FB51-84433C7FC34FC48BC125781B004BC664-DammDierksDischEtAl2011
%7 2011-07-20
%D 2012
%J Science of Computer Programming
%V 77
%& 1122
%P 1122 - 1150
%I Elsevier
%C Amsterdam
%@ false

Fietzke, A., Kruglov, E., & Weidenbach, C. (2012a). Automatic Generation of Invariants for Circular Derivations in SUP(LA). In

*Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2012)*. Mérida, Venezuela: Springer. doi:10.1007/978-3-642-28717-6_17Abstract

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.

Export

BibTeX

@inproceedings{FietzkeKruglovWeidenbach2012a,
TITLE = {Automatic Generation of Invariants for Circular Derivations in {SUP(LA)}},
AUTHOR = {Fietzke, Arnaud and Kruglov, Evgeny and Weidenbach, Christoph},
LANGUAGE = {eng},
ISSN = {0302-9743},
ISBN = {978-3-642-28716-9},
DOI = {10.1007/978-3-642-28717-6_17},
LOCALID = {Local-ID: 97F000051AE9CBD9C12579FB003F6F27-FietzkeKruglovWeidenbach2012},
PUBLISHER = {Springer},
YEAR = {2012},
DATE = {2012},
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.},
BOOKTITLE = {Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2012)},
EDITOR = {Bj{\o}rner, Nikolaj and Voronkov, Andrei},
PAGES = {197--211},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {7180},
ADDRESS = {M{\'e}rida, Venezuela},
}

Endnote

%0 Conference Proceedings
%A Fietzke, Arnaud
%A Kruglov, Evgeny
%A Weidenbach, Christoph
%+ Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T Automatic Generation of Invariants for Circular Derivations in SUP(LA) :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0014-B7F8-D
%R 10.1007/978-3-642-28717-6_17
%F OTHER: Local-ID: 97F000051AE9CBD9C12579FB003F6F27-FietzkeKruglovWeidenbach2012
%D 2012
%B 18th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
%Z date of event: 2012-03-11 - 2012-03-15
%C Mérida, Venezuela
%X 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.
%B Logic for Programming, Artificial Intelligence, and Reasoning
%E Bjørner, Nikolaj; Voronkov, Andrei
%P 197 - 211
%I Springer
%@ 978-3-642-28716-9
%B Lecture Notes in Computer Science
%N 7180
%@ false

Fietzke, A., Kruglov, E., & Weidenbach, C. (2012b).

*Automatic Generation of Invariants for Circular Derivations in SUP(LA) 1*(No. MPI-I-2012-RG1-002). Saarbrücken: Max-Planck-Institut für Informatik.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.

Export

BibTeX

@techreport{FietzkeKruglovWeidenbach2012,
TITLE = {Automatic Generation of Invariants for Circular Derivations in {SUP(LA)} 1},
AUTHOR = {Fietzke, Arnaud and Kruglov, Evgeny and Weidenbach, Christoph},
LANGUAGE = {eng},
ISSN = {0946-011X},
NUMBER = {MPI-I-2012-RG1-002},
INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
ADDRESS = {Saarbr{\"u}cken},
YEAR = {2012},
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.},
TYPE = {Research Report},
}

Endnote

%0 Report
%A Fietzke, Arnaud
%A Kruglov, Evgeny
%A Weidenbach, Christoph
%+ Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T Automatic Generation of Invariants for Circular Derivations in SUP(LA) 1 :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0024-03CF-9
%Y Max-Planck-Institut für Informatik
%C Saarbrücken
%D 2012
%P 26 p.
%X 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.
%B Research Report
%@ false

Fontaine, P., Merz, S., & Weidenbach, C. (2012). Combination of Disjoint Theories: Beyond Decidability. In

*Automated Reasoning*. Machnester, UK: Springer. doi:10.1007/978-3-642-31365-3_21Export

BibTeX

@inproceedings{FontaineMerzWeidenbach12,
TITLE = {Combination of Disjoint Theories: Beyond Decidability},
AUTHOR = {Fontaine, Pascal and Merz, Stephan and Weidenbach, Christoph},
LANGUAGE = {eng},
ISSN = {0302-9743},
ISBN = {978-3-642-31364-6},
DOI = {10.1007/978-3-642-31365-3_21},
LOCALID = {Local-ID: 71B57E225528E4E0C1257B50002E86AE-FontaineMerzWeidenbach12},
PUBLISHER = {Springer},
YEAR = {2012},
DATE = {2012},
BOOKTITLE = {Automated Reasoning},
DEBUG = {author:
Sattler, Uli},
EDITOR = {Gramlich, Bernhard and Miller, Dale},
PAGES = {256--270},
SERIES = {Lecture Notes in Artificial Intelligence},
VOLUME = {7364},
ADDRESS = {Machnester, UK},
}

Endnote

%0 Conference Proceedings
%A Fontaine, Pascal
%A Merz, Stephan
%A Weidenbach, Christoph
%+ External Organizations
External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
%T Combination of Disjoint Theories: Beyond Decidability :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0014-B3C4-7
%F OTHER: Local-ID: 71B57E225528E4E0C1257B50002E86AE-FontaineMerzWeidenbach12
%R 10.1007/978-3-642-31365-3_21
%D 2012
%B 6th International Joint Conference on Automated Reasoning
%Z date of event: 2012-06-26 - 2012-06-29
%C Machnester, UK
%B Automated Reasoning
%E Gramlich, Bernhard; Miller, Dale; Sattler, Uli
%P 256 - 270
%I Springer
%@ 978-3-642-31364-6
%B Lecture Notes in Artificial Intelligence
%N 7364
%@ false

Kruglov, E., & Weidenbach, C. (2012). Superposition Decides the First-order Logic Fragment Over Ground Theories.

*Mathematics in Computer Science*,*6*(4). doi:10.1007/s11786-012-0135-4Abstract

The hierarchic superposition calculus over a theory T, called SUP(T), enables
sound reasoning on the hierarchic combination
of a theory T with full first-order logic, FOL(T). If a FOL(T) clause set
enjoys a sufficient completeness criterion,
the calculus is even complete. Clause sets over the ground fragment of FOL(T)
are not sufficiently complete, in general.
In this paper we show that any clause set over the ground FOL(T) fragment can
be transformed into a sufficiently complete one,
and prove that SUP(T) terminates on the transformed clause set, hence
constitutes a decision procedure provided the
existential fragment of the theory T is decidable. Thanks to the hierarchic
design of SUP(T), the decidability result
can be extended beyond the ground case. We show SUP(T) is a decision procedure
for the non-ground FOL fragment
plus a theory T, if every non-constant function symbol from the underlying FOL
signature ranges into the sort of the theory T,
and every term of the theory sort is ground. Examples for T are in particular
decidable fragments of arithmetic.

Export

BibTeX

@article{KruglovWeidenbachMCS2012,
TITLE = {Superposition Decides the First-order Logic Fragment Over Ground Theories},
AUTHOR = {Kruglov, Evgeny and Weidenbach, Christoph},
LANGUAGE = {eng},
ISSN = {1661-8270},
DOI = {10.1007/s11786-012-0135-4},
LOCALID = {Local-ID: 3AA49DC7DD31016FC1257B1100638146-KruglovWeidenbachMCS2012},
PUBLISHER = {Birkh{\"a}user},
ADDRESS = {Basel},
YEAR = {2012},
DATE = {2012},
ABSTRACT = {The hierarchic superposition calculus over a theory T, called SUP(T), enables sound reasoning on the hierarchic combination of a theory T with full first-order logic, FOL(T). If a FOL(T) clause set enjoys a sufficient completeness criterion, the calculus is even complete. Clause sets over the ground fragment of FOL(T) are not sufficiently complete, in general. In this paper we show that any clause set over the ground FOL(T) fragment can be transformed into a sufficiently complete one, and prove that SUP(T) terminates on the transformed clause set, hence constitutes a decision procedure provided the existential fragment of the theory T is decidable. Thanks to the hierarchic design of SUP(T), the decidability result can be extended beyond the ground case. We show SUP(T) is a decision procedure for the non-ground FOL fragment plus a theory T, if every non-constant function symbol from the underlying FOL signature ranges into the sort of the theory T, and every term of the theory sort is ground. Examples for T are in particular decidable fragments of arithmetic.},
JOURNAL = {Mathematics in Computer Science},
VOLUME = {6},
NUMBER = {4},
PAGES = {427--456},
}

Endnote

%0 Journal Article
%A Kruglov, Evgeny
%A Weidenbach, Christoph
%+ Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T Superposition Decides the First-order Logic Fragment Over Ground Theories :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0014-B3CE-4
%R 10.1007/s11786-012-0135-4
%F OTHER: Local-ID: 3AA49DC7DD31016FC1257B1100638146-KruglovWeidenbachMCS2012
%7 2012-12
%D 2012
%X The hierarchic superposition calculus over a theory T, called SUP(T), enables
sound reasoning on the hierarchic combination
of a theory T with full first-order logic, FOL(T). If a FOL(T) clause set
enjoys a sufficient completeness criterion,
the calculus is even complete. Clause sets over the ground fragment of FOL(T)
are not sufficiently complete, in general.
In this paper we show that any clause set over the ground FOL(T) fragment can
be transformed into a sufficiently complete one,
and prove that SUP(T) terminates on the transformed clause set, hence
constitutes a decision procedure provided the
existential fragment of the theory T is decidable. Thanks to the hierarchic
design of SUP(T), the decidability result
can be extended beyond the ground case. We show SUP(T) is a decision procedure
for the non-ground FOL fragment
plus a theory T, if every non-constant function symbol from the underlying FOL
signature ranges into the sort of the theory T,
and every term of the theory sort is ground. Examples for T are in particular
decidable fragments of arithmetic.
%J Mathematics in Computer Science
%V 6
%N 4
%& 427
%P 427 - 456
%I Birkhäuser
%C Basel
%@ false

Peltier, N., & Sofronie-Stokkermans, V. (2012). First-order Theorem Proving: Foreword.

*Journal of Symbolic Computation*,*47*(9). doi:10.1016/j.jsc.2011.12.030Export

BibTeX

@article{Sofronie-Stokkermans2012-jsc-ftp,
TITLE = {First-order Theorem Proving: Foreword},
AUTHOR = {Peltier, Nicolas and Sofronie-Stokkermans, Viorica},
LANGUAGE = {eng},
ISSN = {0747-7171},
DOI = {10.1016/j.jsc.2011.12.030},
LOCALID = {Local-ID: 71B57E225528E4E0C1257B50002E86AE-FontaineMerzWeidenbach12},
PUBLISHER = {Elsevier},
ADDRESS = {Amsterdam},
YEAR = {2012},
DATE = {2012},
JOURNAL = {Journal of Symbolic Computation},
VOLUME = {47},
NUMBER = {9},
PAGES = {1009--1010},
}

Endnote

%0 Journal Article
%A Peltier, Nicolas
%A Sofronie-Stokkermans, Viorica
%+ External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
%T First-order Theorem Proving: Foreword :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0014-B3CB-A
%R 10.1016/j.jsc.2011.12.030
%F OTHER: Local-ID: 71B57E225528E4E0C1257B50002E86AE-FontaineMerzWeidenbach12
%7 2012-01-28
%D 2012
%J Journal of Symbolic Computation
%V 47
%N 9
%& 1009
%P 1009 - 1010
%I Elsevier
%C Amsterdam
%@ false

Suda, M., & Weidenbach, C. (2012a). A PLTL-Prover Based on Labelled Superposition with Partial Model Guidance. In

*Automated Reasoning (IJCAR 2012)*. Manchester, UK: Springer. doi:10.1007/978-3-642-31365-3_42Abstract

Labelled superposition (LPSup) is a new calculus for PLTL. One of its
distinguishing features, in comparison to other resolution-based approaches, is
its ability to construct partial models on the fly. We use this feature to
design a new decision procedure for the logic, where the models are effectively
used to guide the search. On a representative set of benchmarks, our
implementation is then shown to considerably advance the state of the art.

Export

BibTeX

@inproceedings{SudaWeidenbachIJCAR2012,
TITLE = {A {PLTL}-Prover Based on Labelled Superposition with Partial Model Guidance},
AUTHOR = {Suda, Martin and Weidenbach, Christoph},
LANGUAGE = {eng},
ISSN = {0302-9743},
ISBN = {978-3-642-31364-6},
DOI = {10.1007/978-3-642-31365-3_42},
LOCALID = {Local-ID: BED98A2F132CC156C1257AD10038A23D-SudaWeidenbachIJCAR2012},
PUBLISHER = {Springer},
YEAR = {2012},
DATE = {2012},
ABSTRACT = {Labelled superposition (LPSup) is a new calculus for PLTL. One of its distinguishing features, in comparison to other resolution-based approaches, is its ability to construct partial models on the fly. We use this feature to design a new decision procedure for the logic, where the models are effectively used to guide the search. On a representative set of benchmarks, our implementation is then shown to considerably advance the state of the art.},
BOOKTITLE = {Automated Reasoning (IJCAR 2012)},
EDITOR = {Gramlich, Bernhard and Miller, Dale and Sattler, Uli},
PAGES = {537--543},
SERIES = {Lecture Notes in Artificial Intelligence},
VOLUME = {7364},
ADDRESS = {Manchester, UK},
}

Endnote

%0 Conference Proceedings
%A Suda, Martin
%A Weidenbach, Christoph
%+ Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T A PLTL-Prover Based on Labelled Superposition with Partial Model Guidance :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0014-B7CC-2
%R 10.1007/978-3-642-31365-3_42
%F OTHER: Local-ID: BED98A2F132CC156C1257AD10038A23D-SudaWeidenbachIJCAR2012
%D 2012
%B 6th International Joint Conference on Automated Reasoning
%Z date of event: 2012-06-26 - 2012-06-29
%C Manchester, UK
%X Labelled superposition (LPSup) is a new calculus for PLTL. One of its
distinguishing features, in comparison to other resolution-based approaches, is
its ability to construct partial models on the fly. We use this feature to
design a new decision procedure for the logic, where the models are effectively
used to guide the search. On a representative set of benchmarks, our
implementation is then shown to considerably advance the state of the art.
%B Automated Reasoning
%E Gramlich, Bernhard; Miller, Dale; Sattler, Uli
%P 537 - 543
%I Springer
%@ 978-3-642-31364-6
%B Lecture Notes in Artificial Intelligence
%N 7364
%@ false

Suda, M., & Weidenbach, C. (2012b). Labelled Superposition for PLTL. In

*Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2012)*. Mérida, Venezuela: Springer. doi:10.1007/978-3-642-28717-6_31Abstract

This paper introduces a new decision procedure for PLTL based on labelled
superposition.
Its main idea is to treat temporal formulas as infinite sets of purely
propositional clauses over an extended signature. These infinite sets are then
represented by finite sets of labelled propositional clauses. The new
representation enables the replacement of the complex temporal resolution
rule, suggested by existing resolution calculi for PLTL, by a fine grained
repetition check of finitely saturated labelled clause sets followed by a
simple inference. The completeness argument is based on the standard model
building idea from superposition. It inherently justifies ordering
restrictions, redundancy elimination and effective partial model building. The
latter can be directly used to effectively generate counterexamples of
non-valid PLTL conjectures out of saturated labelled clause sets in a
straightforward way.

Export

BibTeX

@inproceedings{SudaWeidenbachLPAR2012,
TITLE = {Labelled Superposition for {PLTL}},
AUTHOR = {Suda, Martin and Weidenbach, Christoph},
LANGUAGE = {eng},
ISSN = {0302-9743},
ISBN = {978-3-642-28716-9},
DOI = {10.1007/978-3-642-28717-6_31},
LOCALID = {Local-ID: CA616B5FF5079264C1257AD10036F1E5-SudaWeidenbachLPAR2012},
PUBLISHER = {Springer},
YEAR = {2012},
DATE = {2012},
ABSTRACT = {This paper introduces a new decision procedure for PLTL based on labelled superposition. Its main idea is to treat temporal formulas as infinite sets of purely propositional clauses over an extended signature. These infinite sets are then represented by finite sets of labelled propositional clauses. The new representation enables the replacement of the complex temporal resolution rule, suggested by existing resolution calculi for PLTL, by a fine grained repetition check of finitely saturated labelled clause sets followed by a simple inference. The completeness argument is based on the standard model building idea from superposition. It inherently justifies ordering restrictions, redundancy elimination and effective partial model building. The latter can be directly used to effectively generate counterexamples of non-valid PLTL conjectures out of saturated labelled clause sets in a straightforward way.},
BOOKTITLE = {Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2012)},
EDITOR = {Bj{\o}rner, Nikolaj and Voronkov, Andrei},
PAGES = {391--405},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {7180},
ADDRESS = {M{\'e}rida, Venezuela},
}

Endnote

%0 Conference Proceedings
%A Suda, Martin
%A Weidenbach, Christoph
%+ Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T Labelled Superposition for PLTL :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0014-B7E3-C
%R 10.1007/978-3-642-28717-6_31
%F OTHER: Local-ID: CA616B5FF5079264C1257AD10036F1E5-SudaWeidenbachLPAR2012
%D 2012
%B 18th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
%Z date of event: 2012-03-11 - 2012-03-15
%C Mérida, Venezuela
%X This paper introduces a new decision procedure for PLTL based on labelled
superposition.
Its main idea is to treat temporal formulas as infinite sets of purely
propositional clauses over an extended signature. These infinite sets are then
represented by finite sets of labelled propositional clauses. The new
representation enables the replacement of the complex temporal resolution
rule, suggested by existing resolution calculi for PLTL, by a fine grained
repetition check of finitely saturated labelled clause sets followed by a
simple inference. The completeness argument is based on the standard model
building idea from superposition. It inherently justifies ordering
restrictions, redundancy elimination and effective partial model building. The
latter can be directly used to effectively generate counterexamples of
non-valid PLTL conjectures out of saturated labelled clause sets in a
straightforward way.
%B Logic for Programming, Artificial Intelligence, and Reasoning
%E Bjørner, Nikolaj; Voronkov, Andrei
%P 391 - 405
%I Springer
%@ 978-3-642-28716-9
%B Lecture Notes in Computer Science
%N 7180
%@ false

Suda, M., & Weidenbach, C. (2012c).

*Labelled Superposition for PLTL*(No. MPI-I-2012-RG1-001). Saarbrücken: Max-Planck-Institut für Informatik.Abstract

This paper introduces a new decision procedure for PLTL based on labelled
superposition.
Its main idea is to treat temporal formulas as infinite sets of purely
propositional clauses over an extended signature. These infinite sets are then
represented by finite sets of labelled propositional clauses. The new
representation enables the replacement of the complex temporal resolution
rule, suggested by existing resolution calculi for PLTL, by a fine grained
repetition check of finitely saturated labelled clause sets followed by a
simple inference. The completeness argument is based on the standard model
building idea from superposition. It inherently justifies ordering
restrictions, redundancy elimination and effective partial model building. The
latter can be directly used to effectively generate counterexamples of
non-valid PLTL conjectures out of saturated labelled clause sets in a
straightforward way.

Export

BibTeX

@techreport{SudaWeidenbachLPAR2012,
TITLE = {Labelled Superposition for {PLTL}},
AUTHOR = {Suda, Martin and Weidenbach, Christoph},
LANGUAGE = {eng},
ISSN = {0946-011X},
NUMBER = {MPI-I-2012-RG1-001},
INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
ADDRESS = {Saarbr{\"u}cken},
YEAR = {2012},
ABSTRACT = {This paper introduces a new decision procedure for PLTL based on labelled superposition. Its main idea is to treat temporal formulas as infinite sets of purely propositional clauses over an extended signature. These infinite sets are then represented by finite sets of labelled propositional clauses. The new representation enables the replacement of the complex temporal resolution rule, suggested by existing resolution calculi for PLTL, by a fine grained repetition check of finitely saturated labelled clause sets followed by a simple inference. The completeness argument is based on the standard model building idea from superposition. It inherently justifies ordering restrictions, redundancy elimination and effective partial model building. The latter can be directly used to effectively generate counterexamples of non-valid PLTL conjectures out of saturated labelled clause sets in a straightforward way.},
TYPE = {Research Reports},
}

Endnote

%0 Report
%A Suda, Martin
%A Weidenbach, Christoph
%+ Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T Labelled Superposition for PLTL :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0024-03DC-B
%Y Max-Planck-Institut für Informatik
%C Saarbrücken
%D 2012
%P 42 p.
%X This paper introduces a new decision procedure for PLTL based on labelled
superposition.
Its main idea is to treat temporal formulas as infinite sets of purely
propositional clauses over an extended signature. These infinite sets are then
represented by finite sets of labelled propositional clauses. The new
representation enables the replacement of the complex temporal resolution
rule, suggested by existing resolution calculi for PLTL, by a fine grained
repetition check of finitely saturated labelled clause sets followed by a
simple inference. The completeness argument is based on the standard model
building idea from superposition. It inherently justifies ordering
restrictions, redundancy elimination and effective partial model building. The
latter can be directly used to effectively generate counterexamples of
non-valid PLTL conjectures out of saturated labelled clause sets in a
straightforward way.
%B Research Reports
%@ false

Weidenbach, C., & Wischnewski, P. (2012). Satisfiability Checking and Query Answering for Large Ontologies. In

*PAAR-2012, Third Workshop on Practical Aspects of Automated Reasoning*. Manchester, UK: PAAR-2012.Export

BibTeX

@inproceedings{WeidenbachWischnewski2012,
TITLE = {Satisfiability Checking and Query Answering for Large Ontologies},
AUTHOR = {Weidenbach, Christoph and Wischnewski, Patrick},
LANGUAGE = {eng},
LOCALID = {Local-ID: 5E99662BAF13EEB8C1257AF000400A53-WeidenbachWischnewski2012},
PUBLISHER = {PAAR-2012},
YEAR = {2012},
BOOKTITLE = {PAAR-2012, Third Workshop on Practical Aspects of Automated Reasoning},
PAGES = {163--177},
ADDRESS = {Manchester, UK},
}

Endnote

%0 Conference Proceedings
%A Weidenbach, Christoph
%A Wischnewski, Patrick
%+ Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T Satisfiability Checking and Query Answering for Large Ontologies :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0014-B7A6-7
%F OTHER: Local-ID: 5E99662BAF13EEB8C1257AF000400A53-WeidenbachWischnewski2012
%D 2012
%B Third Workshop on Practical Aspects of Automated Reasoning
%Z date of event: 2012-06-30 - 2012-07-01
%C Manchester, UK
%B PAAR-2012
%P 163 - 177
%I PAAR-2012
%U http://www.eprover.org/EVENTS/PAAR-2012/PAAR2012.pdf

Wischnewski, P. (2012).

*Efficient Reasoning Procedures for Complex First-order Theories*. Universität des Saarlandes, Saarbrücken. Retrieved from urn:nbn:de:bsz:291-scidok-49961Export

BibTeX

@phdthesis{Wischnewski12,
TITLE = {Efficient Reasoning Procedures for Complex First-order Theories},
AUTHOR = {Wischnewski, Patrick},
LANGUAGE = {eng},
URL = {urn:nbn:de:bsz:291-scidok-49961},
LOCALID = {Local-ID: 09A72B09A52B038AC1257AF00040853F-Wischnewski12},
SCHOOL = {Universit{\"a}t des Saarlandes},
ADDRESS = {Saarbr{\"u}cken},
YEAR = {2012},
DATE = {2012},
}

Endnote

%0 Thesis
%A Wischnewski, Patrick
%Y Weidenbach, Christoph
%A referee: Weikum, Gerhard
%A referee: Schaub, Torsten
%+ Automation of Logic, MPI for Informatics, Max Planck Society
International Max Planck Research School, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
Databases and Information Systems, MPI for Informatics, Max Planck Society
External Organizations
%T Efficient Reasoning Procedures for Complex First-order Theories :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0014-B792-4
%U urn:nbn:de:bsz:291-scidok-49961
%F OTHER: Local-ID: 09A72B09A52B038AC1257AF00040853F-Wischnewski12
%I Universität des Saarlandes
%C Saarbrücken
%D 2012
%V phd
%9 phd
%U http://scidok.sulb.uni-saarland.de/volltexte/2012/4996/http://scidok.sulb.uni-saarland.de/doku/lic_ohne_pod.php?la=de

2011

Baumgartner, P., & Waldmann, U. (2011). A Combined Superposition and Model Evolution Calculus.

*Journal of Automated Reasoning*,*47*(2). doi:10.1007/s10817-010-9214-xAbstract

We present a new calculus for first-order theorem proving with equality,
ME+Sup, which generalizes both the Superposition calculus and the Model
Evolution calculus (with equality) by integrating their inference rules and
redundancy criteria in a non-trivial way. The main motivation is to combine the
advantageous features of these two rather complementary calculi in a single
framework. In particular, Model Evolution, as a lifted version of the
propositional DPLL procedure, contributes a non-ground splitting rule that
effectively permits to split a clause into \emph{non} variable disjoint
subclauses. In the paper we present the calculus in detail. Our main result is
its completeness under semantically justified redundancy criteria and
simplification rules. We also show how under certain assumptions the model
representation computed by a (finite and fair) derivation can be queried in an
effective way.

Export

BibTeX

@article{BaumgartnerWaldmann2011,
TITLE = {A Combined Superposition and Model Evolution Calculus},
AUTHOR = {Baumgartner, Peter and Waldmann, Uwe},
LANGUAGE = {eng},
ISSN = {0168-7433},
URL = {http://dx.doi.org/10.1007/s10817-010-9214-x},
DOI = {10.1007/s10817-010-9214-x},
LOCALID = {Local-ID: C125716C0050FB51-7A229209F0F88A46C12578410073AE24-BaumgartnerWaldmann2011},
PUBLISHER = {Springer},
ADDRESS = {Dordrecht},
YEAR = {2011},
DATE = {2011},
ABSTRACT = {We present a new calculus for first-order theorem proving with equality, ME+Sup, which generalizes both the Superposition calculus and the Model Evolution calculus (with equality) by integrating their inference rules and redundancy criteria in a non-trivial way. The main motivation is to combine the advantageous features of these two rather complementary calculi in a single framework. In particular, Model Evolution, as a lifted version of the propositional DPLL procedure, contributes a non-ground splitting rule that effectively permits to split a clause into \emph{non} variable disjoint subclauses. In the paper we present the calculus in detail. Our main result is its completeness under semantically justified redundancy criteria and simplification rules. We also show how under certain assumptions the model representation computed by a (finite and fair) derivation can be queried in an effective way.},
JOURNAL = {Journal of Automated Reasoning},
VOLUME = {47},
NUMBER = {2},
PAGES = {191--227},
}

Endnote

%0 Journal Article
%A Baumgartner, Peter
%A Waldmann, Uwe
%+ External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
%T A Combined Superposition and Model Evolution Calculus :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0010-14E0-E
%F EDOC: 619011
%R 10.1007/s10817-010-9214-x
%U http://dx.doi.org/10.1007/s10817-010-9214-x
%F OTHER: Local-ID: C125716C0050FB51-7A229209F0F88A46C12578410073AE24-BaumgartnerWaldmann2011
%D 2011
%* Review method: peer-reviewed
%X We present a new calculus for first-order theorem proving with equality,
ME+Sup, which generalizes both the Superposition calculus and the Model
Evolution calculus (with equality) by integrating their inference rules and
redundancy criteria in a non-trivial way. The main motivation is to combine the
advantageous features of these two rather complementary calculi in a single
framework. In particular, Model Evolution, as a lifted version of the
propositional DPLL procedure, contributes a non-ground splitting rule that
effectively permits to split a clause into \emph{non} variable disjoint
subclauses. In the paper we present the calculus in detail. Our main result is
its completeness under semantically justified redundancy criteria and
simplification rules. We also show how under certain assumptions the model
representation computed by a (finite and fair) derivation can be queried in an
effective way.
%J Journal of Automated Reasoning
%V 47
%N 2
%& 191
%P 191 - 227
%I Springer
%C Dordrecht
%@ false

Bjørner, N., & Sofronie-Stokkermans, V. (Eds.). (2011).

*Automated Deduction - CADE-23 : 23rd International Conference on Automated Deduction*. Springer. doi:10.1007/978-3-642-22438-6Export

BibTeX

@proceedings{Sofronie-Stokkermans-cade-2011,
TITLE = {Automated Deduction -- CADE-23 : 23rd International Conference on Automated Deduction},
EDITOR = {Bj{\o}rner, Nikolaj and Sofronie-Stokkermans, Viorica},
LANGUAGE = {eng},
ISBN = {978-3-642-22437-9},
URL = {http://dx.doi.org/10.1007/978-3-642-22438-6},
DOI = {10.1007/978-3-642-22438-6},
LOCALID = {Local-ID: C125716C0050FB51-E9D0E28A5AE75EECC1257921007520A4-Sofronie-Stokkermans-cade-2011},
PUBLISHER = {Springer},
YEAR = {2011},
DATE = {2011},
PAGES = {1-505},
}

Endnote

%0 Conference Proceedings
%E Bjørner, Nikolaj
%E Sofronie-Stokkermans, Viorica
%+ External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
%T Automated Deduction - CADE-23 : 23rd International Conference on Automated Deduction :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0010-14E4-6
%F EDOC: 619016
%@ 978-3-642-22437-9
%R 10.1007/978-3-642-22438-6
%U http://dx.doi.org/10.1007/978-3-642-22438-6
%F OTHER: Local-ID: C125716C0050FB51-E9D0E28A5AE75EECC1257921007520A4-Sofronie-Stokkermans-cade-2011
%I Springer
%D 2011
%B Untitled Event
%Z date of event: 2011-07-31 - 2011-08-05
%D 2011
%C Wroclaw, Poland
%P 1-505

Burel, G. (2011). Efficiently Simulating Higher-Order Arithmetic by a First-Order Theory Modulo.

*Logical Methods in Computer Science*,*7*(1). doi:10.2168/LMCS-7 (1:3) 2011Abstract

In deduction modulo, a theory is not represented by a set of axioms but by a
congruence on propositions modulo which the inference rules of standard
deductive systems---such as for instance natural deduction---are applied.
Therefore, the reasoning that is intrinsic of the theory does not appear in the
length of proofs. In general, the congruence is defined through a rewrite
system over terms and propositions. We define a rigorous framework to study
proof lengths in deduction modulo, where the congruence must be computed in
polynomial time. We show that even very simple rewrite systems lead to
arbitrary proof-length speed-ups in deduction modulo, compared to using axioms.
As higher-order logic can be encoded as a first-order theory in deduction
modulo, we also study how to reinterpret, thanks to deduction modulo, the
speed-ups between higher-order and first-order arithmetics that were stated by
G\"odel. We define a first-order rewrite system with a congruence decidable in
polynomial time such that proofs of higher-order arithmetic can be linearly
translated into first-order arithmetic modulo that system. We also present the
whole higher-order arithmetic as a first-order system without resorting to any
axiom, where proofs have the same length as in the axiomatic presentation.

Export

BibTeX

@article{Burel2010a,
TITLE = {Efficiently Simulating Higher-Order Arithmetic by a First-Order Theory Modulo},
AUTHOR = {Burel, Guillaume},
LANGUAGE = {eng},
ISSN = {1860-5974},
URL = {http://arxiv.org/pdf/0805.1464v4},
DOI = {10.2168/LMCS-7 (1:3) 2011},
LOCALID = {Local-ID: C125716C0050FB51-3D13ACDE62D02282C125783F0031B40F-Burel2010a},
PUBLISHER = {Department of Theoretical Computer Science, Technical University of Braunschweig},
ADDRESS = {Braunschweig},
YEAR = {2011},
DATE = {2011},
ABSTRACT = {In deduction modulo, a theory is not represented by a set of axioms but by a congruence on propositions modulo which the inference rules of standard deductive systems---such as for instance natural deduction---are applied. Therefore, the reasoning that is intrinsic of the theory does not appear in the length of proofs. In general, the congruence is defined through a rewrite system over terms and propositions. We define a rigorous framework to study proof lengths in deduction modulo, where the congruence must be computed in polynomial time. We show that even very simple rewrite systems lead to arbitrary proof-length speed-ups in deduction modulo, compared to using axioms. As higher-order logic can be encoded as a first-order theory in deduction modulo, we also study how to reinterpret, thanks to deduction modulo, the speed-ups between higher-order and first-order arithmetics that were stated by G\"odel. We define a first-order rewrite system with a congruence decidable in polynomial time such that proofs of higher-order arithmetic can be linearly translated into first-order arithmetic modulo that system. We also present the whole higher-order arithmetic as a first-order system without resorting to any axiom, where proofs have the same length as in the axiomatic presentation.},
JOURNAL = {Logical Methods in Computer Science},
VOLUME = {7},
NUMBER = {1},
PAGES = {3:1--3:31},
EID = {3},
}

Endnote

%0 Journal Article
%A Burel, Guillaume
%+ Automation of Logic, MPI for Informatics, Max Planck Society
%T Efficiently Simulating Higher-Order Arithmetic by a First-Order Theory Modulo :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0010-14EC-5
%F EDOC: 619010
%R 10.2168/LMCS-7 (1:3) 2011
%U http://arxiv.org/pdf/0805.1464v4
%F OTHER: Local-ID: C125716C0050FB51-3D13ACDE62D02282C125783F0031B40F-Burel2010a
%7 2011
%D 2011
%X In deduction modulo, a theory is not represented by a set of axioms but by a
congruence on propositions modulo which the inference rules of standard
deductive systems---such as for instance natural deduction---are applied.
Therefore, the reasoning that is intrinsic of the theory does not appear in the
length of proofs. In general, the congruence is defined through a rewrite
system over terms and propositions. We define a rigorous framework to study
proof lengths in deduction modulo, where the congruence must be computed in
polynomial time. We show that even very simple rewrite systems lead to
arbitrary proof-length speed-ups in deduction modulo, compared to using axioms.
As higher-order logic can be encoded as a first-order theory in deduction
modulo, we also study how to reinterpret, thanks to deduction modulo, the
speed-ups between higher-order and first-order arithmetics that were stated by
G\"odel. We define a first-order rewrite system with a congruence decidable in
polynomial time such that proofs of higher-order arithmetic can be linearly
translated into first-order arithmetic modulo that system. We also present the
whole higher-order arithmetic as a first-order system without resorting to any
axiom, where proofs have the same length as in the axiomatic presentation.
%J Logical Methods in Computer Science
%V 7
%N 1
%& 3:1
%P 3:1 - 3:31
%Z sequence number: 3
%I Department of Theoretical Computer Science, Technical University of Braunschweig
%C Braunschweig
%@ false

Damm, W., Disch, S., Hagemann, W., Scholl, C., Waldmann, U., & Wirtz, B. (2011).

*Integrating Incremental Flow Pipes into a Symbolic Model Checker for Hybrid Systems*(No. ATR76). (B. Becker, W. Damm, B. Finkbeiner, M. Fränzle, E.-R. Olderog, & A. Podelski, Eds.). Saarbrücken: SFB/TR 14 AVACS.Abstract

We describe an approach to integrate incremental ow pipe computation into a
fully symbolic backward model checker for hybrid systems. Our method combines
the advantages of symbolic state set representation, such as the ability to
deal with large numbers of boolean variables, with an effcient way to handle
continuous ows dened by linear differential equations, possibly including
bounded disturbances.

Export

BibTeX

@techreport{DammDierksHagemannEtAl2011,
TITLE = {Integrating Incremental Flow Pipes into a Symbolic Model Checker for Hybrid Systems},
AUTHOR = {Damm, Werner and Disch, Stefan and Hagemann, Willem and Scholl, Christoph and Waldmann, Uwe and Wirtz, Boris},
EDITOR = {Becker, Bernd and Damm, Werner and Finkbeiner, Bernd and Fr{\"a}nzle, Martin and Olderog, Ernst-R{\"u}diger and Podelski, Andreas},
LANGUAGE = {eng},
ISSN = {1860-9821},
NUMBER = {ATR76},
INSTITUTION = {SFB/TR 14 AVACS},
ADDRESS = {Saarbr{\"u}cken},
YEAR = {2011},
DATE = {2011},
ABSTRACT = {We describe an approach to integrate incremental ow pipe computation into a fully symbolic backward model checker for hybrid systems. Our method combines the advantages of symbolic state set representation, such as the ability to deal with large numbers of boolean variables, with an effcient way to handle continuous ows dened by linear differential equations, possibly including bounded disturbances.},
TYPE = {AVACS Technical Report},
VOLUME = {76},
}

Endnote

%0 Report
%A Damm, Werner
%A Disch, Stefan
%A Hagemann, Willem
%A Scholl, Christoph
%A Waldmann, Uwe
%A Wirtz, Boris
%E Becker, Bernd
%E Damm, Werner
%E Finkbeiner, Bernd
%E Fränzle, Martin
%E Olderog, Ernst-Rüdiger
%E Podelski, Andreas
%+ External Organizations
External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
%T Integrating Incremental Flow Pipes into a Symbolic Model Checker for Hybrid Systems :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-001A-150E-7
%Y SFB/TR 14 AVACS
%C Saarbrücken
%D 2011
%X We describe an approach to integrate incremental ow pipe computation into a
fully symbolic backward model checker for hybrid systems. Our method combines
the advantages of symbolic state set representation, such as the ability to
deal with large numbers of boolean variables, with an effcient way to handle
continuous ows dened by linear differential equations, possibly including
bounded disturbances.
%B AVACS Technical Report
%N 76
%@ false

Damm, W., Ihlemann, C., & Sofronie-Stokkermans, V. (2011a). Decidability and complexity for the verification of safety properties of reasonable linear hybrid automata. In

*HSCC’11 : Proceedings of the 2011 ACM/SIGBED Hybrid Systems: Computation and Control*. ACM. doi:10.1145/1967701.1967714Abstract

We study linear hybrid automata with dynamics of the form
$\sum a_i x_i \leq a$ and $\sum b_i {\dot x_i} \leq b$.
We show that verification of safety properties for reasonable
classes of such systems can be reduced to invariant checking
and bounded model checking and, ultimately, to checking the
validity of certain formulae (obtained using a polynomial
reduction).
We show that the problem of checking the validity of the formulae
obtained this way is typically in NP, and identify verification
tasks which can be performed in PTIME.
These reductions can also be used for parametric systems, both
for checking safety properties given constraints on parameters,
and for deriving constraints of parameters that guarantee that
safety properties hold.

Export

BibTeX

@inproceedings{Damm-Ihlemann-Sofronie-Stokkermans2011,
TITLE = {Decidability and complexity for the verification of safety properties of reasonable linear hybrid automata},
AUTHOR = {Damm, Werner and Ihlemann, Carsten and Sofronie-Stokkermans, Viorica},
LANGUAGE = {eng},
ISBN = {978-1-4503-0629-4},
URL = {http://doi.acm.org/10.1145/1967701.1967714},
DOI = {10.1145/1967701.1967714},
LOCALID = {Local-ID: C125716C0050FB51-14754FD9A7E29655C12577FF005852C8-Damm-Ihlemann-Sofronie-Stokkermans2011},
PUBLISHER = {ACM},
YEAR = {2011},
DATE = {2011},
ABSTRACT = {We study linear hybrid automata with dynamics of the form $\sum a_i x_i \leq a$ and $\sum b_i {\dot x_i} \leq b$. We show that verification of safety properties for reasonable classes of such systems can be reduced to invariant checking and bounded model checking and, ultimately, to checking the validity of certain formulae (obtained using a polynomial reduction). We show that the problem of checking the validity of the formulae obtained this way is typically in NP, and identify verification tasks which can be performed in PTIME. These reductions can also be used for parametric systems, both for checking safety properties given constraints on parameters, and for deriving constraints of parameters that guarantee that safety properties hold.},
BOOKTITLE = {HSCC{\textquoteright}11 : Proceedings of the 2011 ACM/SIGBED Hybrid Systems: Computation and Control},
EDITOR = {Frazzoli, Emilio and Grosu, Radu},
PAGES = {73--82},
}

Endnote

%0 Conference Proceedings
%A Damm, Werner
%A Ihlemann, Carsten
%A Sofronie-Stokkermans, Viorica
%+ External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T Decidability and complexity for the verification of safety properties of reasonable linear hybrid automata :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0010-14EA-9
%F EDOC: 619008
%R 10.1145/1967701.1967714
%U http://doi.acm.org/10.1145/1967701.1967714
%F OTHER: Local-ID: C125716C0050FB51-14754FD9A7E29655C12577FF005852C8-Damm-Ihlemann-Sofronie-Stokkermans2011
%D 2011
%B Untitled Event
%Z date of event: 2011-04-12 - 2011-04-14
%C Chicago, Ill.
%X We study linear hybrid automata with dynamics of the form
$\sum a_i x_i \leq a$ and $\sum b_i {\dot x_i} \leq b$.
We show that verification of safety properties for reasonable
classes of such systems can be reduced to invariant checking
and bounded model checking and, ultimately, to checking the
validity of certain formulae (obtained using a polynomial
reduction).
We show that the problem of checking the validity of the formulae
obtained this way is typically in NP, and identify verification
tasks which can be performed in PTIME.
These reductions can also be used for parametric systems, both
for checking safety properties given constraints on parameters,
and for deriving constraints of parameters that guarantee that
safety properties hold.
%B HSCC’11 : Proceedings of the 2011 ACM/SIGBED Hybrid Systems: Computation and Control
%E Frazzoli, Emilio; Grosu, Radu
%P 73 - 82
%I ACM
%@ 978-1-4503-0629-4

Damm, W., Ihlemann, C., & Sofronie-Stokkermans, V. (2011b).

*PTIME Parametric Verification of Safety Properties for Reasonable Linear Hybrid Automata*(No. ATR70). SFB/TR 14 AVACS.Abstract

This paper identifies an industrially relevant class of
linear hybrid automata (LHA) called reasonable LHA for
which parametric verification of convex safety properties
with exhaustive entry states can be verified in polynomial
time and time-bounded reachability can be decided
in nondeterministic polynomial time for non-parametric
verification and in exponential time for
parametric verification. Properties with exhaustive entry
states are restricted to runs originating in
a (specified) inner envelope of some mode-invariant.
Deciding whether an LHA is reasonable is
shown to be decidable in polynomial time.

Export

BibTeX

@techreport{Damm-Ihlemann-Sofronie-Stokkermans2011-report,
TITLE = {{PTIME} Parametric Verification of Safety Properties for Reasonable Linear Hybrid Automata},
AUTHOR = {Damm, Werner and Ihlemann, Carsten and Sofronie-Stokkermans, Viorica},
LANGUAGE = {eng},
ISSN = {1860-9821},
NUMBER = {ATR70},
LOCALID = {Local-ID: C125716C0050FB51-DEB90D4E9EAE27B7C1257855003AF8EE-Damm-Ihlemann-Sofronie-Stokkermans2011-report},
INSTITUTION = {SFB/TR 14 AVACS},
YEAR = {2011},
DATE = {2011},
ABSTRACT = {This paper identifies an industrially relevant class of linear hybrid automata (LHA) called reasonable LHA for which parametric verification of convex safety properties with exhaustive entry states can be verified in polynomial time and time-bounded reachability can be decided in nondeterministic polynomial time for non-parametric verification and in exponential time for parametric verification. Properties with exhaustive entry states are restricted to runs originating in a (specified) inner envelope of some mode-invariant. Deciding whether an LHA is reasonable is shown to be decidable in polynomial time.},
TYPE = {AVACS Technical Report},
VOLUME = {70},
}

Endnote

%0 Report
%A Damm, Werner
%A Ihlemann, Carsten
%A Sofronie-Stokkermans, Viorica
%+ External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T PTIME Parametric Verification of Safety Properties for Reasonable Linear Hybrid Automata :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0010-14F5-F
%F EDOC: 619013
%F OTHER: Local-ID: C125716C0050FB51-DEB90D4E9EAE27B7C1257855003AF8EE-Damm-Ihlemann-Sofronie-Stokkermans2011-report
%Y SFB/TR 14 AVACS
%D 2011
%P 31 p.
%X This paper identifies an industrially relevant class of
linear hybrid automata (LHA) called reasonable LHA for
which parametric verification of convex safety properties
with exhaustive entry states can be verified in polynomial
time and time-bounded reachability can be decided
in nondeterministic polynomial time for non-parametric
verification and in exponential time for
parametric verification. Properties with exhaustive entry
states are restricted to runs originating in
a (specified) inner envelope of some mode-invariant.
Deciding whether an LHA is reasonable is
shown to be decidable in polynomial time.
%B AVACS Technical Report
%N 70
%@ false
%U http://www.avacs.org/fileadmin/Publikationen/Open/avacs_technical_report_070.pdf

Damm, W., Ihlemann, C., & Sofronie-Stokkermans, V. (2011c). PTIME parametric verification of safety properties for reasonable linear hybrid automata.

*Mathematics in Computer Science*,*5*(4). doi:10.1007/s11786-011-0098-xAbstract

This paper identifies an industrially relevant class of
linear hybrid automata (LHA) called reasonable LHA for
which parametric verification of convex safety properties
with exhaustive entry states can be verified in polynomial
time and time-bounded reachability can be decided
in nondeterministic polynomial time for non-parametric
verification and in exponential time for
parametric verification. Properties with exhaustive entry
states are restricted to runs originating in
a (specified) inner envelope of some mode-invariant.
Deciding whether an LHA is reasonable is
shown to be decidable in polynomial time.

Export

BibTeX

@article{Damm-Ihlemann-Sofronie-Stokkermans2011-msc,
TITLE = {{PTIME} parametric verification of safety properties for reasonable linear hybrid automata},
AUTHOR = {Damm, Werner and Ihlemann, Carsten and Sofronie-Stokkermans, Viorica},
LANGUAGE = {eng},
ISSN = {1661-8270},
URL = {http://dx.doi.org/10.1007/s11786-011-0098-x},
DOI = {10.1007/s11786-011-0098-x},
LOCALID = {Local-ID: C125716C0050FB51-933697580C59ACEEC1257853005850F7-Damm-Ihlemann-Sofronie-Stokkermans2011-msc},
PUBLISHER = {Birkh{\"a}user},
ADDRESS = {Basel},
YEAR = {2011},
DATE = {2011},
ABSTRACT = {This paper identifies an industrially relevant class of linear hybrid automata (LHA) called reasonable LHA for which parametric verification of convex safety properties with exhaustive entry states can be verified in polynomial time and time-bounded reachability can be decided in nondeterministic polynomial time for non-parametric verification and in exponential time for parametric verification. Properties with exhaustive entry states are restricted to runs originating in a (specified) inner envelope of some mode-invariant. Deciding whether an LHA is reasonable is shown to be decidable in polynomial time.},
JOURNAL = {Mathematics in Computer Science},
VOLUME = {5},
NUMBER = {4},
PAGES = {469--497},
}

Endnote

%0 Journal Article
%A Damm, Werner
%A Ihlemann, Carsten
%A Sofronie-Stokkermans, Viorica
%+ External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T PTIME parametric verification of safety properties for reasonable linear hybrid automata :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0010-14F3-4
%F EDOC: 619012
%R 10.1007/s11786-011-0098-x
%U http://dx.doi.org/10.1007/s11786-011-0098-x
%F OTHER: Local-ID: C125716C0050FB51-933697580C59ACEEC1257853005850F7-Damm-Ihlemann-Sofronie-Stokkermans2011-msc
%D 2011
%* Review method: peer-reviewed
%X This paper identifies an industrially relevant class of
linear hybrid automata (LHA) called reasonable LHA for
which parametric verification of convex safety properties
with exhaustive entry states can be verified in polynomial
time and time-bounded reachability can be decided
in nondeterministic polynomial time for non-parametric
verification and in exponential time for
parametric verification. Properties with exhaustive entry
states are restricted to runs originating in
a (specified) inner envelope of some mode-invariant.
Deciding whether an LHA is reasonable is
shown to be decidable in polynomial time.
%J Mathematics in Computer Science
%V 5
%N 4
%& 469
%P 469 - 497
%I Birkhäuser
%C Basel
%@ false

Eggers, A., Kruglov, E., Kupferschmid, S., Scheibler, K., Teige, T., & Weidenbach, C. (2011). Superposition Modulo Non-linear Arithmetic. In

*Frontiers of Combining Systems (FroCoS 2011)*. Saarbruecken, Germany: Springer. doi:10.1007/978-3-642-24364-6_9Abstract

The first-order theory over non-linear arithmetic
including transcendental functions (NLA) is undecidable.
Nevertheless, in this paper we show that a particular combination
with superposition leads to a sound and complete calculus that
is useful in practice. We follow basically the ideas
of the SUP(LA) combination, but have to take care
of undecidability, resulting in ``unknown'' answers by
the NLA reasoning procedure. A pipeline
of NLA constraint simplification techniques related to
the SUP(NLA) framework significantly decreases the number of ``unknown''
answers.
The resulting approach is implemented as SUP(NLA) by a system combination
of SPASS and iSAT. Applied to various scenarios
of traffic collision avoidance protocols, we show by experiments
that SPASS(iSAT) can fully automatically proof and disproof safety
properties of such protocols using the very same formalization.

Export

BibTeX

@inproceedings{KruglovFroCoS2011,
TITLE = {Superposition Modulo Non-linear Arithmetic},
AUTHOR = {Eggers, Andreas and Kruglov, Evgeny and Kupferschmid, Stefan and Scheibler, Karsten and Teige, Teige and Weidenbach, Christoph},
LANGUAGE = {eng},
ISBN = {978-3-642-24363-9},
DOI = {10.1007/978-3-642-24364-6_9},
PUBLISHER = {Springer},
YEAR = {2011},
DATE = {2011},
ABSTRACT = {The first-order theory over non-linear arithmetic including transcendental functions (NLA) is undecidable. Nevertheless, in this paper we show that a particular combination with superposition leads to a sound and complete calculus that is useful in practice. We follow basically the ideas of the SUP(LA) combination, but have to take care of undecidability, resulting in ``unknown'' answers by the NLA reasoning procedure. A pipeline of NLA constraint simplification techniques related to the SUP(NLA) framework significantly decreases the number of ``unknown'' answers. The resulting approach is implemented as SUP(NLA) by a system combination of SPASS and iSAT. Applied to various scenarios of traffic collision avoidance protocols, we show by experiments that SPASS(iSAT) can fully automatically proof and disproof safety properties of such protocols using the very same formalization.},
BOOKTITLE = {Frontiers of Combining Systems (FroCoS 2011)},
EDITOR = {Sofronie-Stokkermans, Viorica and Tinelli, Cesare},
PAGES = {119--134},
SERIES = {Lecture Notes in Artificial Intelligence},
VOLUME = {6989},
ADDRESS = {Saarbruecken, Germany},
}

Endnote

%0 Conference Proceedings
%A Eggers, Andreas
%A Kruglov, Evgeny
%A Kupferschmid, Stefan
%A Scheibler, Karsten
%A Teige, Teige
%A Weidenbach, Christoph
%+ External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
%T Superposition Modulo Non-linear Arithmetic :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-001A-1529-9
%R 10.1007/978-3-642-24364-6_9
%D 2011
%B 8th International Symposium on Frontiers of Combining Systems
%Z date of event: 2011-10-05 - 2011-10-07
%C Saarbruecken, Germany
%X The first-order theory over non-linear arithmetic
including transcendental functions (NLA) is undecidable.
Nevertheless, in this paper we show that a particular combination
with superposition leads to a sound and complete calculus that
is useful in practice. We follow basically the ideas
of the SUP(LA) combination, but have to take care
of undecidability, resulting in ``unknown'' answers by
the NLA reasoning procedure. A pipeline
of NLA constraint simplification techniques related to
the SUP(NLA) framework significantly decreases the number of ``unknown''
answers.
The resulting approach is implemented as SUP(NLA) by a system combination
of SPASS and iSAT. Applied to various scenarios
of traffic collision avoidance protocols, we show by experiments
that SPASS(iSAT) can fully automatically proof and disproof safety
properties of such protocols using the very same formalization.
%B Frontiers of Combining Systems
%E Sofronie-Stokkermans, Viorica; Tinelli, Cesare
%P 119 - 134
%I Springer
%@ 978-3-642-24363-9
%B Lecture Notes in Artificial Intelligence
%N 6989

Gasse, F., & Sofronie-Stokkermans, V. (2011). Efficient TBox Subsumption Checking in Combinations of EL and (fragments of) FL0. In

*Proceedings of the 2011 International Workshop on Description Logics (DL-2011)*. CEUR Workshop Proceedings. Retrieved from http://ceur-ws.org/Vol-745/paper_50.pdfAbstract

We study possibilities of combining (fragments) of the lightweight description
logics ${\cal F}{\cal L}_0$ and
${\cal E}{\cal L}$, and identify classes of subsumption
problems in a combination of ${\cal E}{\cal L}$ and
Horn-${\cal F}{\cal L}_0$, which can be
checked in PSPACE resp. PTIME.
Since ${\cal F}{\cal L}_0$ allows universal role restrictions
and ${\cal E}{\cal L}$ allows existential role restrictions,
we thus have a framework where subsumption between
expressions including both types
of role restrictions (but for disjoint sets of roles) can be checked in
polynomial
space or time.

Export

BibTeX

@inproceedings{Gasse-Sofronie-Stokkermans-dl2011,
TITLE = {Efficient {TBox} Subsumption Checking in Combinations of {EL} and (fragments of) {FL0}},
AUTHOR = {Gasse, Francis and Sofronie-Stokkermans, Viorica},
LANGUAGE = {eng},
URL = {http://ceur-ws.org/Vol-745/paper_50.pdf},
LOCALID = {Local-ID: C125716C0050FB51-4926854F23FED981C12578C60036D515-Gasse-Sofronie-Stokkermans-dl2011},
PUBLISHER = {CEUR Workshop Proceedings},
YEAR = {2011},
DATE = {2011},
ABSTRACT = {We study possibilities of combining (fragments) of the lightweight description logics ${\cal F}{\cal L}_0$ and ${\cal E}{\cal L}$, and identify classes of subsumption problems in a combination of ${\cal E}{\cal L}$ and Horn-${\cal F}{\cal L}_0$, which can be checked in PSPACE resp. PTIME. Since ${\cal F}{\cal L}_0$ allows universal role restrictions and ${\cal E}{\cal L}$ allows existential role restrictions, we thus have a framework where subsumption between expressions including both types of role restrictions (but for disjoint sets of roles) can be checked in polynomial space or time.},
BOOKTITLE = {Proceedings of the 2011 International Workshop on Description Logics (DL-2011)},
EDITOR = {Rosati, Riccardo and Rudolph, Sebastian and Zakharyaschev, Michael},
PAGES = {125--135},
SERIES = {CEUR Workshop Proceedings},
}

Endnote

%0 Conference Proceedings
%A Gasse, Francis
%A Sofronie-Stokkermans, Viorica
%+ Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T Efficient TBox Subsumption Checking in Combinations of EL and (fragments of) FL0 :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0010-14EE-1
%F EDOC: 619015
%U http://ceur-ws.org/Vol-745/paper_50.pdf
%F OTHER: Local-ID: C125716C0050FB51-4926854F23FED981C12578C60036D515-Gasse-Sofronie-Stokkermans-dl2011
%D 2011
%B Untitled Event
%Z date of event: 2011-07-13 - 2011-07-16
%C Barcelona, Spain
%X We study possibilities of combining (fragments) of the lightweight description
logics ${\cal F}{\cal L}_0$ and
${\cal E}{\cal L}$, and identify classes of subsumption
problems in a combination of ${\cal E}{\cal L}$ and
Horn-${\cal F}{\cal L}_0$, which can be
checked in PSPACE resp. PTIME.
Since ${\cal F}{\cal L}_0$ allows universal role restrictions
and ${\cal E}{\cal L}$ allows existential role restrictions,
we thus have a framework where subsumption between
expressions including both types
of role restrictions (but for disjoint sets of roles) can be checked in
polynomial
space or time.
%B Proceedings of the 2011 International Workshop on Description Logics (DL-2011)
%E Rosati, Riccardo; Rudolph, Sebastian; Zakharyaschev, Michael
%P 125 - 135
%I CEUR Workshop Proceedings
%B CEUR Workshop Proceedings

Lasaruk, A., & Sturm, T. (2011). Automatic Verification of the Adequacy of Models for Families of Geometric Objects. In

*Automated Deduction in Geometry (ADG 2008)*. Shanghai, China: Springer. doi:10.1007/978-3-642-21046-4_6Abstract

We consider parametric families of semi-algebraic geometric objects, each
implicitly defined by a first-order formula. Given an unambiguous description
of such an object family and an intended alternative description we
automatically construct a first-order formula which is true if and only if our
alternative description uniquely describes geometric objects of the reference
description. We can decide this formula by applying real quantifier
elimination. In the positive case we furthermore derive the defining
first-order formulas corresponding to our new description. In the negative case
we can produce sample points establishing a counterexample for the uniqueness.
We demonstrate our method by automatically proving uniqueness theorems for
characterizations of several geometric primitives and simple complex objects.
Finally, we focus on tori, characterizations of which can be applied in spline
approximation theory with toric segments. Although we cannot yet practically
solve the fundamental open questions in this area within reasonable time and
space, we demonstrate that they can be formulated in our framework. In addition
this points at an interesting and practically relevant challenge problem for
automated deduction in geometry in general.

Export

BibTeX

@inproceedings{LasarukSturm:11a,
TITLE = {Automatic Verification of the Adequacy of Models for Families of Geometric Objects},
AUTHOR = {Lasaruk, Aless and Sturm, Thomas},
LANGUAGE = {eng},
ISBN = {978-3-642-21045-7},
URL = {http://www.springerlink.com/content/6n473q44l527qmw7/fulltext.pdf},
DOI = {10.1007/978-3-642-21046-4_6},
LOCALID = {Local-ID: C125716C0050FB51-6C7DAF04032485E3C1257987003DD415-LasarukSturm:11a},
PUBLISHER = {Springer},
YEAR = {2008},
DATE = {2011},
ABSTRACT = {We consider parametric families of semi-algebraic geometric objects, each implicitly defined by a first-order formula. Given an unambiguous description of such an object family and an intended alternative description we automatically construct a first-order formula which is true if and only if our alternative description uniquely describes geometric objects of the reference description. We can decide this formula by applying real quantifier elimination. In the positive case we furthermore derive the defining first-order formulas corresponding to our new description. In the negative case we can produce sample points establishing a counterexample for the uniqueness. We demonstrate our method by automatically proving uniqueness theorems for characterizations of several geometric primitives and simple complex objects. Finally, we focus on tori, characterizations of which can be applied in spline approximation theory with toric segments. Although we cannot yet practically solve the fundamental open questions in this area within reasonable time and space, we demonstrate that they can be formulated in our framework. In addition this points at an interesting and practically relevant challenge problem for automated deduction in geometry in general.},
BOOKTITLE = {Automated Deduction in Geometry (ADG 2008)},
EDITOR = {Sturm, Thomas and Zengler, Christoph},
PAGES = {116--140},
SERIES = {Lecture Notes in Artificial Intelligence},
VOLUME = {6301},
ADDRESS = {Shanghai, China},
}

Endnote

%0 Conference Proceedings
%A Lasaruk, Aless
%A Sturm, Thomas
%+ External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
%T Automatic Verification of the Adequacy of Models for Families of Geometric Objects :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0010-14E8-D
%F EDOC: 619018
%R 10.1007/978-3-642-21046-4_6
%U http://www.springerlink.com/content/6n473q44l527qmw7/fulltext.pdf
%F OTHER: Local-ID: C125716C0050FB51-6C7DAF04032485E3C1257987003DD415-LasarukSturm:11a
%D 2011
%B 7th International Workshop on Automated Deduction in Geometry
%Z date of event: 2008-09-22 - 2008-09-24
%C Shanghai, China
%X We consider parametric families of semi-algebraic geometric objects, each
implicitly defined by a first-order formula. Given an unambiguous description
of such an object family and an intended alternative description we
automatically construct a first-order formula which is true if and only if our
alternative description uniquely describes geometric objects of the reference
description. We can decide this formula by applying real quantifier
elimination. In the positive case we furthermore derive the defining
first-order formulas corresponding to our new description. In the negative case
we can produce sample points establishing a counterexample for the uniqueness.
We demonstrate our method by automatically proving uniqueness theorems for
characterizations of several geometric primitives and simple complex objects.
Finally, we focus on tori, characterizations of which can be applied in spline
approximation theory with toric segments. Although we cannot yet practically
solve the fundamental open questions in this area within reasonable time and
space, we demonstrate that they can be formulated in our framework. In addition
this points at an interesting and practically relevant challenge problem for
automated deduction in geometry in general.
%B Automated Deduction in Geometry
%E Sturm, Thomas; Zengler, Christoph
%P 116 - 140
%I Springer
%@ 978-3-642-21045-7
%B Lecture Notes in Artificial Intelligence
%N 6301

Lu, T., Merz, S., & Weidenbach, C. (2011a).

*Towards Verification of the Pastry Protocol using TLA+*(No. MPI-I-2011-RG1-002). Saarbrücken: Max-Planck-Institut für Informatik. Retrieved from http://domino.mpi-inf.mpg.de/internet/reports.nsf/NumberView/2011-RG1-002Abstract

Pastry is an algorithm that provides a scalable distributed hash table over
an underlying P2P network. Several implementations of Pastry are available
and have been applied in practice, but no attempt has so far been made to
formally describe the algorithm or to verify its properties. Since Pastry combines
rather complex data structures, asynchronous communication, concurrency,
resilience to churn and fault tolerance, it makes an interesting target
for verication. We have modeled Pastry's core routing algorithms and communication
protocol in the specication language TLA+. In order to validate
the model and to search for bugs we employed the TLA+ model checker tlc
to analyze several qualitative properties. We obtained non-trivial insights in
the behavior of Pastry through the model checking analysis. Furthermore,
we started to verify Pastry using the very same model and the interactive
theorem prover tlaps for TLA+. A rst result is the reduction of global
Pastry correctness properties to invariants of the underlying data structures.

Export

BibTeX

@techreport{LuMerzWeidenbach2011,
TITLE = {Towards Verification of the {Pastry} Protocol using {TLA+}},
AUTHOR = {Lu, Tianxiang and Merz, Stephan and Weidenbach, Christoph},
LANGUAGE = {eng},
URL = {http://domino.mpi-inf.mpg.de/internet/reports.nsf/NumberView/2011-RG1-002},
NUMBER = {MPI-I-2011-RG1-002},
INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
ADDRESS = {Saarbr{\"u}cken},
YEAR = {2011},
DATE = {2011},
ABSTRACT = {Pastry is an algorithm that provides a scalable distributed hash table over an underlying P2P network. Several implementations of Pastry are available and have been applied in practice, but no attempt has so far been made to formally describe the algorithm or to verify its properties. Since Pastry combines rather complex data structures, asynchronous communication, concurrency, resilience to churn and fault tolerance, it makes an interesting target for verication. We have modeled Pastry's core routing algorithms and communication protocol in the specication language TLA+. In order to validate the model and to search for bugs we employed the TLA+ model checker tlc to analyze several qualitative properties. We obtained non-trivial insights in the behavior of Pastry through the model checking analysis. Furthermore, we started to verify Pastry using the very same model and the interactive theorem prover tlaps for TLA+. A rst result is the reduction of global Pastry correctness properties to invariants of the underlying data structures.},
TYPE = {Research Report},
}

Endnote

%0 Report
%A Lu, Tianxiang
%A Merz, Stephan
%A Weidenbach, Christoph
%+ Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
%T Towards Verification of the Pastry Protocol using TLA+ :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0014-6975-A
%U http://domino.mpi-inf.mpg.de/internet/reports.nsf/NumberView/2011-RG1-002
%Y Max-Planck-Institut für Informatik
%C Saarbrücken
%D 2011
%P 51 p.
%X Pastry is an algorithm that provides a scalable distributed hash table over
an underlying P2P network. Several implementations of Pastry are available
and have been applied in practice, but no attempt has so far been made to
formally describe the algorithm or to verify its properties. Since Pastry combines
rather complex data structures, asynchronous communication, concurrency,
resilience to churn and fault tolerance, it makes an interesting target
for verication. We have modeled Pastry's core routing algorithms and communication
protocol in the specication language TLA+. In order to validate
the model and to search for bugs we employed the TLA+ model checker tlc
to analyze several qualitative properties. We obtained non-trivial insights in
the behavior of Pastry through the model checking analysis. Furthermore,
we started to verify Pastry using the very same model and the interactive
theorem prover tlaps for TLA+. A rst result is the reduction of global
Pastry correctness properties to invariants of the underlying data structures.
%B Research Report

Lu, T., Merz, S., & Weidenbach, C. (2011b). Towards Verification of the Pastry Routing Protocol using TLA+. In

*Formal Techniques for Distributed Systems (FMOODS 2011)*. Reykjavik, Iceland: Springer. doi:10.1007/978-3-642-21461-5_16Export

BibTeX

@inproceedings{LuTlaPastryForte2011,
TITLE = {Towards Verification of the {Pastry} Routing Protocol using {TLA+}},
AUTHOR = {Lu, Tianxiang and Merz, Stephan and Weidenbach, Christoph},
LANGUAGE = {eng},
ISBN = {978-3-642-21460-8},
DOI = {10.1007/978-3-642-21461-5_16},
LOCALID = {Local-ID: C125716C0050FB51-3A4D1F5C6FC10A4BC125785A003BAB25-LuTlaPastryForte2011},
PUBLISHER = {Springer},
YEAR = {2011},
DATE = {2011},
BOOKTITLE = {Formal Techniques for Distributed Systems (FMOODS 2011)},
EDITOR = {Bruni, Roberto and Dingel, Juergen},
PAGES = {244--258},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {6722},
ADDRESS = {Reykjavik, Iceland},
}

Endnote

%0 Conference Proceedings
%A Lu, Tianxiang
%A Merz, Stephan
%A Weidenbach, Christoph
%+ Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
%T Towards Verification of the Pastry Routing Protocol using TLA+ :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0010-14F7-B
%F EDOC: 619014
%R 10.1007/978-3-642-21461-5_16
%F OTHER: Local-ID: C125716C0050FB51-3A4D1F5C6FC10A4BC125785A003BAB25-LuTlaPastryForte2011
%D 2011
%B Joint 13th IFIP WG 6.1 International Conference
%Z date of event: 2011-06-06 - 2011-06-08
%C Reykjavik, Iceland
%B Formal Techniques for Distributed Systems
%E Bruni, Roberto; Dingel, Juergen
%P 244 - 258
%I Springer
%@ 978-3-642-21460-8
%B Lecture Notes in Computer Science
%N 6722

Sturm, T., & Zengler, C. (Eds.). (2011).

*Automated Deduction in Geometry : 7th International Workshop, ADG 2008*. Presented at the 7th International Workshop on Automated Deduction in Geometry, Shanghai, China: Springer. doi:10.1007/978-3-642-21046-4Export

BibTeX

@proceedings{SturmZengler2011,
TITLE = {Automated Deduction in Geometry : 7th International Workshop, ADG 2008},
EDITOR = {Sturm, Thomas and Zengler, Christoph},
LANGUAGE = {eng},
ISBN = {978-3-642-21045-7},
URL = {http://dx.doi.org/10.1007/978-3-642-21046-4},
DOI = {10.1007/978-3-642-21046-4},
LOCALID = {Local-ID: C125716C0050FB51-19039A4D3799AF97C12579880036C296-SturmZengler2011},
PUBLISHER = {Springer},
YEAR = {2008},
DATE = {2011},
PAGES = {225 p.},
SERIES = {Lecture Notes in Artificial Intelligence},
VOLUME = {6301},
ADDRESS = {Shanghai, China},
}

Endnote

%0 Conference Proceedings
%E Sturm, Thomas
%E Zengler, Christoph
%+ Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
%T Automated Deduction in Geometry : 7th International Workshop, ADG 2008 :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0010-14E6-2
%F EDOC: 619020
%@ 978-3-642-21045-7
%R 10.1007/978-3-642-21046-4
%U http://dx.doi.org/10.1007/978-3-642-21046-4
%F OTHER: Local-ID: C125716C0050FB51-19039A4D3799AF97C12579880036C296-SturmZengler2011
%I Springer
%D 2011
%B 7th International Workshop on Automated Deduction in Geometry
%Z date of event: 2008-09-22 - 2008-09-24
%D 2008
%C Shanghai, China
%P 225 p.
%S Lecture Notes in Artificial Intelligence
%V 6301

Sturm, T., & Tiwari, A. (2011). Verification and Synthesis Using Real Quantifier Elimination. In

*ISSAC 2011*. San Jose, CA: ACM. doi:10.1145/1993886.1993935Abstract

We present the application of real quantifier elimination to formal
verification and synthesis of continuous and switched dynamical systems.
Through a series of case studies, we show how first-order formulas over the
reals arise when formally analyzing models of complex control systems. Existing
off-the-shelf quantifier elimination procedures are not successful in
eliminating quantifiers from many of our benchmarks. We therefore automatically
combine three established software components: virtual subtitution based
quantifier elimination in Reduce/Redlog, cylindrical algebraic decomposition
implemented in Qepcad, and the simplifier Slfq implemented on top of Qepcad. We
use this combination to successfully analyze various models of systems
including adaptive cruise control in automobiles, adaptive flight control
system, and the classical inverted pendulum problem studied in control theory.

Export

BibTeX

@inproceedings{SturmTiwari:11a,
TITLE = {Verification and Synthesis Using Real Quantifier Elimination},
AUTHOR = {Sturm, Thomas and Tiwari, Ashish},
LANGUAGE = {eng},
ISBN = {978-1-4503-0675-1},
URL = {http://dl.acm.org/ft_gateway.cfm?id=1993935&ftid=983740&dwn=1&CFID=78354182&CFTOKEN=89999428},
DOI = {10.1145/1993886.1993935},
LOCALID = {Local-ID: C125716C0050FB51-7E61E0C62FFBF07EC1257987003B0382-SturmTiwari:11a},
PUBLISHER = {ACM},
YEAR = {2011},
DATE = {2011},
ABSTRACT = {We present the application of real quantifier elimination to formal verification and synthesis of continuous and switched dynamical systems. Through a series of case studies, we show how first-order formulas over the reals arise when formally analyzing models of complex control systems. Existing off-the-shelf quantifier elimination procedures are not successful in eliminating quantifiers from many of our benchmarks. We therefore automatically combine three established software components: virtual subtitution based quantifier elimination in Reduce/Redlog, cylindrical algebraic decomposition implemented in Qepcad, and the simplifier Slfq implemented on top of Qepcad. We use this combination to successfully analyze various models of systems including adaptive cruise control in automobiles, adaptive flight control system, and the classical inverted pendulum problem studied in control theory.},
BOOKTITLE = {ISSAC 2011},
EDITOR = {Leykin, Anton},
PAGES = {329--336},
ADDRESS = {San Jose, CA},
}

Endnote

%0 Conference Proceedings
%A Sturm, Thomas
%A Tiwari, Ashish
%+ Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
%T Verification and Synthesis Using Real Quantifier Elimination :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0010-14F9-7
%F EDOC: 619017
%R 10.1145/1993886.1993935
%U http://dl.acm.org/ft_gateway.cfm?id=1993935&ftid=983740&dwn=1&CFID=78354182&CFTOKEN=89999428
%F OTHER: Local-ID: C125716C0050FB51-7E61E0C62FFBF07EC1257987003B0382-SturmTiwari:11a
%D 2011
%B 36th International Symposium on Symbolic and Algebraic Computation
%Z date of event: 2011-06-08 - 2011-06-11
%C San Jose, CA
%X We present the application of real quantifier elimination to formal
verification and synthesis of continuous and switched dynamical systems.
Through a series of case studies, we show how first-order formulas over the
reals arise when formally analyzing models of complex control systems. Existing
off-the-shelf quantifier elimination procedures are not successful in
eliminating quantifiers from many of our benchmarks. We therefore automatically
combine three established software components: virtual subtitution based
quantifier elimination in Reduce/Redlog, cylindrical algebraic decomposition
implemented in Qepcad, and the simplifier Slfq implemented on top of Qepcad. We
use this combination to successfully analyze various models of systems
including adaptive cruise control in automobiles, adaptive flight control
system, and the classical inverted pendulum problem studied in control theory.
%B ISSAC 2011
%E Leykin, Anton
%P 329 - 336
%I ACM
%@ 978-1-4503-0675-1

Tinelli, C., & Sofronie-Stokkermans, V. (Eds.). (2011).

*Frontiers of Combining Systems*. Presented at the 8th International Symposium on Frontiers of Combining Systems, Saarbrücken: Springer. doi:10.1007/978-3-642-24364-6Export

BibTeX

@proceedings{Sofronie-Stokkermans-frocos-2011,
TITLE = {Frontiers of Combining Systems},
EDITOR = {Tinelli, Cesare and Sofronie-Stokkermans, Viorica},
LANGUAGE = {eng},
ISBN = {978-3-642-24363-9},
DOI = {10.1007/978-3-642-24364-6},
PUBLISHER = {Springer},
YEAR = {2011},
DATE = {2011},
PAGES = {275 p.},
SERIES = {Lecture Notes in Artificial Intelligence},
VOLUME = {6989},
ADDRESS = {Saarbr{\"u}cken},
}

Endnote

%0 Conference Proceedings
%E Tinelli, Cesare
%E Sofronie-Stokkermans, Viorica
%+ External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
%T Frontiers of Combining Systems : 8th International Symposium, FroCoS 2011, Saarbrücken, Germany, October 5-7, 2011. Proceedings
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-001A-226F-6
%@ 978-3-642-24363-9
%R 10.1007/978-3-642-24364-6
%I Springer
%D 2011
%B 8th International Symposium on Frontiers of Combining Systems
%Z date of event: 2011-10-05 - 2011-10-07
%D 2011
%C Saarbrücken
%P 275 p.
%S Lecture Notes in Artificial Intelligence
%V 6989

Weber, A., Sturm, T., & Abdel-Rahman, E. O. (2011). Algorithmic Global Criteria for Excluding Oscillations.

*Bulletin of Mathematical Biology*,*73*(4). doi:10.1007/s11538-010-9618-0Abstract

We investigate algorithmic methods to tackle the following problem: Given a
system of parametric ordinary differential equations built by a biological
model, does there exist ranges of values for the model parameters and variables
which are both meaningful from a biological point of view and where oscillating
trajectories, can be found? We show that in the common case of polynomial
vector fields known criteria excluding the existence of non-constant limit
cycles lead to quantifier elimination problems over the reals. We apply these
criteria to various models that have been previously investigated in the
context of algebraic biology.

Export

BibTeX

@article{WeberSturm:11a,
TITLE = {Algorithmic Global Criteria for Excluding Oscillations},
AUTHOR = {Weber, Andreas and Sturm, Thomas and Abdel-Rahman, Essam O.},
LANGUAGE = {eng},
ISSN = {0092-8240},
URL = {http://www.springerlink.com/content/5238455w344h1066/fulltext.pdf},
DOI = {10.1007/s11538-010-9618-0},
LOCALID = {Local-ID: C125716C0050FB51-BF20726C557FAF02C1257987003F79BE-WeberSturm:11a},
PUBLISHER = {Springer},
ADDRESS = {New York, NY},
YEAR = {2011},
DATE = {2011},
ABSTRACT = {We investigate algorithmic methods to tackle the following problem: Given a system of parametric ordinary differential equations built by a biological model, does there exist ranges of values for the model parameters and variables which are both meaningful from a biological point of view and where oscillating trajectories, can be found? We show that in the common case of polynomial vector fields known criteria excluding the existence of non-constant limit cycles lead to quantifier elimination problems over the reals. We apply these criteria to various models that have been previously investigated in the context of algebraic biology.},
JOURNAL = {Bulletin of Mathematical Biology},
VOLUME = {73},
NUMBER = {4},
PAGES = {899--916},
}

Endnote

%0 Journal Article
%A Weber, Andreas
%A Sturm, Thomas
%A Abdel-Rahman, Essam O.
%+ External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
%T Algorithmic Global Criteria for Excluding Oscillations :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0010-14E2-A
%F EDOC: 619019
%R 10.1007/s11538-010-9618-0
%U http://www.springerlink.com/content/5238455w344h1066/fulltext.pdf
%F OTHER: Local-ID: C125716C0050FB51-BF20726C557FAF02C1257987003F79BE-WeberSturm:11a
%7 2011
%D 2011
%* Review method: peer-reviewed
%X We investigate algorithmic methods to tackle the following problem: Given a
system of parametric ordinary differential equations built by a biological
model, does there exist ranges of values for the model parameters and variables
which are both meaningful from a biological point of view and where oscillating
trajectories, can be found? We show that in the common case of polynomial
vector fields known criteria excluding the existence of non-constant limit
cycles lead to quantifier elimination problems over the reals. We apply these
criteria to various models that have been previously investigated in the
context of algebraic biology.
%J Bulletin of Mathematical Biology
%V 73
%N 4
%& 899
%P 899 - 916
%I Springer
%C New York, NY
%@ false

2010

Burel, G. (2010). Embedding Deduction Modulo into a Prover. In

*Computer Science Logic (CSL 2010)*. Brno, Czech Republic: Springer. doi:10.1007/978-3-642-15205-4Abstract

Deduction modulo consists in presenting a theory through rewrite
rules to support automatic and interactive proof search. It induces
proof search methods based on narrowing, such as the polarized
resolution modulo. We show how to combine this method with more
traditional ordering restrictions. Interestingly, no compatibility
between the rewriting and the ordering is requested to ensure
completeness. We also show that some simplification rules, such as
strict subsumption eliminations and demodulations, preserve
completeness. For this purpose, we use a new framework based on a
proof ordering. These results show that polarized resolution modulo
can be integrated into existing provers, where these restrictions
and simplifications are present. We also discuss how this
integration can actually be done by diverting the main algorithm of
state-of-the-art provers.

Export

BibTeX

@inproceedings{Burel2010,
TITLE = {Embedding Deduction Modulo into a Prover},
AUTHOR = {Burel, Guillaume},
LANGUAGE = {eng},
ISBN = {978-3-642-15204-7},
URL = {http://www.springerlink.com/content/0g30v1n222448385/fulltext.pdf},
DOI = {10.1007/978-3-642-15205-4},
LOCALID = {Local-ID: C125716C0050FB51-BADAB1F96C57125DC12577EE002D46B1-Burel2010},
PUBLISHER = {Springer},
YEAR = {2010},
DATE = {2010},
ABSTRACT = {Deduction modulo consists in presenting a theory through rewrite rules to support automatic and interactive proof search. It induces proof search methods based on narrowing, such as the polarized resolution modulo. We show how to combine this method with more traditional ordering restrictions. Interestingly, no compatibility between the rewriting and the ordering is requested to ensure completeness. We also show that some simplification rules, such as strict subsumption eliminations and demodulations, preserve completeness. For this purpose, we use a new framework based on a proof ordering. These results show that polarized resolution modulo can be integrated into existing provers, where these restrictions and simplifications are present. We also discuss how this integration can actually be done by diverting the main algorithm of state-of-the-art provers.},
BOOKTITLE = {Computer Science Logic (CSL 2010)},
EDITOR = {Dawar, Anuj and Veith, Helmut},
PAGES = {155--169},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {6247},
ADDRESS = {Brno, Czech Republic},
}

Endnote

%0 Conference Proceedings
%A Burel, Guillaume
%+ Automation of Logic, MPI for Informatics, Max Planck Society
%T Embedding Deduction Modulo into a Prover :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-000F-14AE-7
%F EDOC: 536346
%R 10.1007/978-3-642-15205-4
%U http://www.springerlink.com/content/0g30v1n222448385/fulltext.pdf
%F OTHER: Local-ID: C125716C0050FB51-BADAB1F96C57125DC12577EE002D46B1-Burel2010
%D 2010
%B 24th International Workshop on Computer Science Logic
%Z date of event: 2010-08-23 - 2010-08-27
%C Brno, Czech Republic
%X Deduction modulo consists in presenting a theory through rewrite
rules to support automatic and interactive proof search. It induces
proof search methods based on narrowing, such as the polarized
resolution modulo. We show how to combine this method with more
traditional ordering restrictions. Interestingly, no compatibility
between the rewriting and the ordering is requested to ensure
completeness. We also show that some simplification rules, such as
strict subsumption eliminations and demodulations, preserve
completeness. For this purpose, we use a new framework based on a
proof ordering. These results show that polarized resolution modulo
can be integrated into existing provers, where these restrictions
and simplifications are present. We also discuss how this
integration can actually be done by diverting the main algorithm of
state-of-the-art provers.
%B Computer Science Logic
%E Dawar, Anuj; Veith, Helmut
%P 155 - 169
%I Springer
%@ 978-3-642-15204-7
%B Lecture Notes in Computer Science
%N 6247

Faber, J., Ihlemann, C., Jacobs, S., & Sofronie-Stokkermans, V. (2010a). Automatic Verification of Parametric Specifications with Complex Topologies. In

*Integrated Formal Methods (IFM 2010)*. Nancy, France: Springer. doi:10.1007/978-3-642-16265-7_12Abstract

The focus of this paper is on reducing the complexity in
verification by exploiting modularity at various levels:
in specification, in verification, and structurally.
\begin{itemize}
\item For specifications, we use the modular language CSP-OZ-DC,
which allows us to decouple verification tasks concerning
data from those concerning durations.
\item At the verification level, we exploit modularity in
theorem proving for rich data structures and use this for
invariant checking.
\item At the structural level, we analyze possibilities
for modular verification of systems consisting of various
components which interact.
\end{itemize}
We illustrate these ideas by automatically verifying safety
properties of a case study from the European Train Control
System standard, which extends previous examples by comprising a
complex track topology with lists of track segments and trains
with different routes.

Export

BibTeX

@inproceedings{faber-ihlemann-jacobs-sofronieStokkermans-ifm-2010,
TITLE = {Automatic Verification of Parametric Specifications with Complex Topologies},
AUTHOR = {Faber, Johannes and Ihlemann, Carsten and Jacobs, Swen and Sofronie-Stokkermans, Viorica},
LANGUAGE = {eng},
ISBN = {978-3-642-16264-0},
URL = {http://dx.doi.org/10.1007/978-3-642-16265-7_12},
DOI = {10.1007/978-3-642-16265-7_12},
LOCALID = {Local-ID: C125716C0050FB51-80C9C07C12B21C86C1257782003F6A72-faber-ihlemann-jacobs-sofronieStokkermans-ifm-2010},
PUBLISHER = {Springer},
YEAR = {2010},
DATE = {2010},
ABSTRACT = {The focus of this paper is on reducing the complexity in verification by exploiting modularity at various levels: in specification, in verification, and structurally. \begin{itemize} \item For specifications, we use the modular language CSP-OZ-DC, which allows us to decouple verification tasks concerning data from those concerning durations. \item At the verification level, we exploit modularity in theorem proving for rich data structures and use this for invariant checking. \item At the structural level, we analyze possibilities for modular verification of systems consisting of various components which interact. \end{itemize} We illustrate these ideas by automatically verifying safety properties of a case study from the European Train Control System standard, which extends previous examples by comprising a complex track topology with lists of track segments and trains with different routes.},
BOOKTITLE = {Integrated Formal Methods (IFM 2010)},
EDITOR = {Mery, Dominique and Merz, Stephan},
PAGES = {152--167},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {6396},
ADDRESS = {Nancy, France},
}

Endnote

%0 Conference Proceedings
%A Faber, Johannes
%A Ihlemann, Carsten
%A Jacobs, Swen
%A Sofronie-Stokkermans, Viorica
%+ Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T Automatic Verification of Parametric Specifications with Complex Topologies :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-000F-14A8-4
%F EDOC: 536349
%R 10.1007/978-3-642-16265-7_12
%U http://dx.doi.org/10.1007/978-3-642-16265-7_12
%F OTHER: Local-ID: C125716C0050FB51-80C9C07C12B21C86C1257782003F6A72-faber-ihlemann-jacobs-sofronieStokkermans-ifm-2010
%D 2010
%B 8th International Conference on Integrated Formal Methods
%Z date of event: 2010-10-11 - 2010-10-14
%C Nancy, France
%X The focus of this paper is on reducing the complexity in
verification by exploiting modularity at various levels:
in specification, in verification, and structurally.
\begin{itemize}
\item For specifications, we use the modular language CSP-OZ-DC,
which allows us to decouple verification tasks concerning
data from those concerning durations.
\item At the verification level, we exploit modularity in
theorem proving for rich data structures and use this for
invariant checking.
\item At the structural level, we analyze possibilities
for modular verification of systems consisting of various
components which interact.
\end{itemize}
We illustrate these ideas by automatically verifying safety
properties of a case study from the European Train Control
System standard, which extends previous examples by comprising a
complex track topology with lists of track segments and trains
with different routes.
%B Integrated Formal Methods
%E Mery, Dominique; Merz, Stephan
%P 152 - 167
%I Springer
%@ 978-3-642-16264-0
%B Lecture Notes in Computer Science
%N 6396

Faber, J., Ihlemann, C., Jacobs, S., & Sofronie-Stokkermans, V. (2010b).

*Automatic Verification of Parametric Specifications with Complex Topologies*(No. ATR66). SFB/TR 14 AVACS.Abstract

The focus of this paper is on reducing the complexity in
verification by exploiting modularity at various levels:
in specification, in verification, and structurally.
\begin{itemize}
\item For specifications, we use the modular language CSP-OZ-DC,
which allows us to decouple verification tasks concerning
data from those concerning durations.
\item At the verification level, we exploit modularity in
theorem proving for rich data structures and use this for
invariant checking.
\item At the structural level, we analyze possibilities
for modular verification of systems consisting of various
components which interact.
\end{itemize}
We illustrate these ideas by automatically verifying safety
properties of a case study from the European Train Control
System standard, which extends previous examples by comprising a
complex track topology with lists of track segments and trains
with different routes.

Export

BibTeX

@techreport{faber-ihlemann-jacobs-sofronie-2010-report,
TITLE = {Automatic Verification of Parametric Specifications with Complex Topologies},
AUTHOR = {Faber, Johannes and Ihlemann, Carsten and Jacobs, Swen and Sofronie-Stokkermans, Viorica},
LANGUAGE = {eng},
ISSN = {1860-9821},
NUMBER = {ATR66},
LOCALID = {Local-ID: C125716C0050FB51-2E8AD7BA67FF4CB5C12577B4004D8EF8-faber-ihlemann-jacobs-sofronie-2010-report},
INSTITUTION = {SFB/TR 14 AVACS},
YEAR = {2010},
DATE = {2010},
ABSTRACT = {The focus of this paper is on reducing the complexity in verification by exploiting modularity at various levels: in specification, in verification, and structurally. \begin{itemize} \item For specifications, we use the modular language CSP-OZ-DC, which allows us to decouple verification tasks concerning data from those concerning durations. \item At the verification level, we exploit modularity in theorem proving for rich data structures and use this for invariant checking. \item At the structural level, we analyze possibilities for modular verification of systems consisting of various components which interact. \end{itemize} We illustrate these ideas by automatically verifying safety properties of a case study from the European Train Control System standard, which extends previous examples by comprising a complex track topology with lists of track segments and trains with different routes.},
TYPE = {AVACS Technical Report},
VOLUME = {66},
}

Endnote

%0 Report
%A Faber, Johannes
%A Ihlemann, Carsten
%A Jacobs, Swen
%A Sofronie-Stokkermans, Viorica
%+ Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T Automatic Verification of Parametric Specifications with Complex Topologies :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-000F-14A6-8
%F EDOC: 536341
%F OTHER: Local-ID: C125716C0050FB51-2E8AD7BA67FF4CB5C12577B4004D8EF8-faber-ihlemann-jacobs-sofronie-2010-report
%Y SFB/TR 14 AVACS
%D 2010
%P 40 p.
%X The focus of this paper is on reducing the complexity in
verification by exploiting modularity at various levels:
in specification, in verification, and structurally.
\begin{itemize}
\item For specifications, we use the modular language CSP-OZ-DC,
which allows us to decouple verification tasks concerning
data from those concerning durations.
\item At the verification level, we exploit modularity in
theorem proving for rich data structures and use this for
invariant checking.
\item At the structural level, we analyze possibilities
for modular verification of systems consisting of various
components which interact.
\end{itemize}
We illustrate these ideas by automatically verifying safety
properties of a case study from the European Train Control
System standard, which extends previous examples by comprising a
complex track topology with lists of track segments and trains
with different routes.
%B AVACS Technical Report
%N 66
%@ false

Fietzke, A., Hermanns, H., & Weidenbach, C. (2010). Superposition-Based Analysis of First-Order Probabilistic Timed Automata. In

*Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2010)*. Yogyakarta, Indonesia: Springer. doi:10.1007/978-3-642-16242-8Abstract

This paper discusses the analysis of first-order probabilistic
timed automata (FPTA) by a combination of hierarchic first-order
superposition-based theorem proving and probabilistic model checking.
We develop the overall semantics of FPTAs and prove soundness and
completeness of our method for reachability properties. Basically, we decompose
FPTAs into their time plus first-order logic aspects on the one
hand, and their probabilistic aspects on the other hand. Then we exploit
the time plus first-order behavior by hierarchic superposition over
linear arithmetic. The result of this analysis is the basis for the construction
of a reachability equivalent (to the original FPTA) probabilistic
timed automaton to which probabilistic model checking is finally applied.
The hierarchic superposition calculus required for the analysis is
sound and complete on the first-order formulas generated from FPTAs.
It even works well in practice. We illustrate the potential behind it with
a real-life DHCP protocol example, which we analyze by means of tool
chain support.

Export

BibTeX

@inproceedings{FietzkeWeidenbach2010,
TITLE = {Superposition-Based Analysis of First-Order Probabilistic Timed Automata},
AUTHOR = {Fietzke, Arnaud and Hermanns, Holger and Weidenbach, Christoph},
LANGUAGE = {eng},
ISBN = {978-3-642-16241-1},
URL = {http://dx.doi.org/10.1007/978-3-642-16242-8_22},
DOI = {10.1007/978-3-642-16242-8},
LOCALID = {Local-ID: C125716C0050FB51-A58766A53216A228C12577EE0045E1FE-FietzkeWeidenbach2010},
PUBLISHER = {Springer},
YEAR = {2010},
DATE = {2010},
ABSTRACT = {This paper discusses the analysis of first-order probabilistic timed automata (FPTA) by a combination of hierarchic first-order superposition-based theorem proving and probabilistic model checking. We develop the overall semantics of FPTAs and prove soundness and completeness of our method for reachability properties. Basically, we decompose FPTAs into their time plus first-order logic aspects on the one hand, and their probabilistic aspects on the other hand. Then we exploit the time plus first-order behavior by hierarchic superposition over linear arithmetic. The result of this analysis is the basis for the construction of a reachability equivalent (to the original FPTA) probabilistic timed automaton to which probabilistic model checking is finally applied. The hierarchic superposition calculus required for the analysis is sound and complete on the first-order formulas generated from FPTAs. It even works well in practice. We illustrate the potential behind it with a real-life DHCP protocol example, which we analyze by means of tool chain support.},
BOOKTITLE = {Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2010)},
EDITOR = {Ferm{\"u}ller, Christian G. and Voronkov, Andrei},
PAGES = {302--316},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {6397},
ADDRESS = {Yogyakarta, Indonesia},
}

Endnote

%0 Conference Proceedings
%A Fietzke, Arnaud
%A Hermanns, Holger
%A Weidenbach, Christoph
%+ Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
%T Superposition-Based Analysis of First-Order Probabilistic Timed Automata :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-000F-14C1-A
%F EDOC: 536347
%R 10.1007/978-3-642-16242-8
%U http://dx.doi.org/10.1007/978-3-642-16242-8_22
%F OTHER: Local-ID: C125716C0050FB51-A58766A53216A228C12577EE0045E1FE-FietzkeWeidenbach2010
%D 2010
%B 17th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
%Z date of event: 2010-10-10 - 2010-10-15
%C Yogyakarta, Indonesia
%X This paper discusses the analysis of first-order probabilistic
timed automata (FPTA) by a combination of hierarchic first-order
superposition-based theorem proving and probabilistic model checking.
We develop the overall semantics of FPTAs and prove soundness and
completeness of our method for reachability properties. Basically, we decompose
FPTAs into their time plus first-order logic aspects on the one
hand, and their probabilistic aspects on the other hand. Then we exploit
the time plus first-order behavior by hierarchic superposition over
linear arithmetic. The result of this analysis is the basis for the construction
of a reachability equivalent (to the original FPTA) probabilistic
timed automaton to which probabilistic model checking is finally applied.
The hierarchic superposition calculus required for the analysis is
sound and complete on the first-order formulas generated from FPTAs.
It even works well in practice. We illustrate the potential behind it with
a real-life DHCP protocol example, which we analyze by means of tool
chain support.
%B Logic for Programming, Artificial Intelligence, and Reasoning
%E Fermüller, Christian G.; Voronkov, Andrei
%P 302 - 316
%I Springer
%@ 978-3-642-16241-1
%B Lecture Notes in Computer Science
%N 6397

Ghilardi, S., Sattler, U., Sofronie-Stokkermans, V., & Tiwari, A. (2010). Special Issue on Automated Deduction: Decidability, complexity, tractability.

*Journal of Symbolic Computation*,*45*(2). doi:10.1016/j.jsc.2009.05.006Export

BibTeX

@article{Sofronie-Stokkermans2009-jsc-addct,
TITLE = {Special Issue on Automated Deduction: Decidability, complexity, tractability},
AUTHOR = {Ghilardi, Silvio and Sattler, Ulrike and Sofronie-Stokkermans, Viorica and Tiwari, Ashish},
LANGUAGE = {eng},
ISSN = {0747-7171},
URL = {http//dx.doi.org/10.1016/j.jsc.2009.05.006},
DOI = {10.1016/j.jsc.2009.05.006},
LOCALID = {Local-ID: C125716C0050FB51-1631E1CA39BB1166C1257624002FD3D3-Sofronie-Stokkermans2009-jsc-addct},
PUBLISHER = {Elsevier},
ADDRESS = {Amsterdam},
YEAR = {2010},
DATE = {2010},
JOURNAL = {Journal of Symbolic Computation},
VOLUME = {45},
NUMBER = {2},
PAGES = {151--152},
EID = {-},
}

Endnote

%0 Journal Article
%A Ghilardi, Silvio
%A Sattler, Ulrike
%A Sofronie-Stokkermans, Viorica
%A Tiwari, Ashish
%+ External Organizations
External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
%T Special Issue on Automated Deduction: Decidability, complexity, tractability :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-000F-14BD-5
%F EDOC: 536333
%R 10.1016/j.jsc.2009.05.006
%U http//dx.doi.org/10.1016/j.jsc.2009.05.006
%F OTHER: Local-ID: C125716C0050FB51-1631E1CA39BB1166C1257624002FD3D3-Sofronie-Stokkermans2009-jsc-addct
%7 2010
%D 2010
%* Review method: peer-reviewed
%J Journal of Symbolic Computation
%V 45
%N 2
%& 151
%P 151 - 152
%Z sequence number: -
%I Elsevier
%C Amsterdam
%@ false

Horbach, M. (2010a). Disunification for Ultimately Periodic Interpretations. In

*Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2010)*. Dakar, Senegal: Springer. doi:10.1007/978-3-642-17511-4_17Export

BibTeX

@inproceedings{Horbach2010,
TITLE = {Disunification for Ultimately Periodic Interpretations},
AUTHOR = {Horbach, Matthias},
LANGUAGE = {eng},
ISBN = {978-3-642-17510-7},
URL = {http://dx.doi.org/10.1007/978-3-642-17511-4_17},
DOI = {10.1007/978-3-642-17511-4_17},
LOCALID = {Local-ID: C125716C0050FB51-2F29F3FAA25D6A80C12577EC003546AD-Horbach2010},
PUBLISHER = {Springer},
YEAR = {2010},
DATE = {2010},
BOOKTITLE = {Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2010)},
EDITOR = {Clarke, Edmund M. and Voronkov, Andrei},
PAGES = {290--311},
SERIES = {Lecture Notes in Artificial Intelligence},
VOLUME = {6355},
ADDRESS = {Dakar, Senegal},
}

Endnote

%0 Conference Proceedings
%A Horbach, Matthias
%+ Automation of Logic, MPI for Informatics, Max Planck Society
%T Disunification for Ultimately Periodic Interpretations :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-000F-14AC-B
%F EDOC: 536342
%R 10.1007/978-3-642-17511-4_17
%U http://dx.doi.org/10.1007/978-3-642-17511-4_17
%F OTHER: Local-ID: C125716C0050FB51-2F29F3FAA25D6A80C12577EC003546AD-Horbach2010
%D 2010
%B 6th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
%Z date of event: 2010-04-25 - 2010-05-01
%C Dakar, Senegal
%B Logic for Programming, Artificial Intelligence, and Reasoning
%E Clarke, Edmund M.; Voronkov, Andrei
%P 290 - 311
%I Springer
%@ 978-3-642-17510-7
%B Lecture Notes in Artificial Intelligence
%N 6355

Horbach, M. (2010b).

*Saturation-based Decision Procedures for Fixed Domain and Minimal Model Semantics*. Universität des Saarlandes, Saarbrücken. Retrieved from urn:nbn:de:bsz:291-scidok-32826Abstract

Superposition is an established decision procedure for a variety of first-order
logic theories represented by sets of clauses. A satisfiable theory, saturated
by superposition, implicitly defines a minimal Herbrand model for the theory.
This raises the question in how far superposition calculi can be employed for
reasoning about such minimal models. This is indeed often possible when
existential properties are considered. However, proving universal properties
directly leads to a modification of the minimal model's term-generated domain,
as new Skolem functions are introduced. For many applications, this is not
desired because it changes the problem.
In this thesis, I propose the first superposition calculus that can explicitly
represent existentially quantified variables and can thus compute with respect
to a given fixed domain. It does not eliminate existential variables by
Skolemization, but handles them using additional constraints with which each
clause is annotated. This calculus is sound and refutationally complete in the
limit for a fixed domain semantics. For saturated Horn theories and classes of
positive formulas, the calculus is even complete for proving properties of the
minimal model itself, going beyond the scope of known superposition-based
approaches.
The calculus is applicable to every set of clauses with equality and does not
rely on any syntactic restrictions of the input. Extensions of the calculus
lead to various new decision procedures for minimal model validity. A main
feature of these decision procedures is that even the validity of queries
containing one quantifier alternation can be decided. In particular, I prove
that the validity of any formula with at most one quantifier alternation is
decidable in models represented by a finite set of atoms and that the validity
of several classes of such formulas is decidable in models represented by
so-called disjunctions of implicit generalizations. Moreover, I show that the
decision of minimal model validity can be reduced to the superposition-based
decision of first-order validity for models of a class of predicative Horn
clauses where all function symbols are at most unary.

Export

BibTeX

@phdthesis{Horbach2010PhD,
TITLE = {Saturation-based Decision Procedures for Fixed Domain and Minimal Model Semantics},
AUTHOR = {Horbach, Matthias},
LANGUAGE = {eng},
URL = {urn:nbn:de:bsz:291-scidok-32826},
LOCALID = {Local-ID: C125716C0050FB51-8C390F163CB3D25AC12577EC0037127A-Horbach2010PhD},
SCHOOL = {Universit{\"a}t des Saarlandes},
ADDRESS = {Saarbr{\"u}cken},
YEAR = {2010},
DATE = {2010},
ABSTRACT = {Superposition is an established decision procedure for a variety of first-order logic theories represented by sets of clauses. A satisfiable theory, saturated by superposition, implicitly defines a minimal Herbrand model for the theory. This raises the question in how far superposition calculi can be employed for reasoning about such minimal models. This is indeed often possible when existential properties are considered. However, proving universal properties directly leads to a modification of the minimal model's term-generated domain, as new Skolem functions are introduced. For many applications, this is not desired because it changes the problem. In this thesis, I propose the first superposition calculus that can explicitly represent existentially quantified variables and can thus compute with respect to a given fixed domain. It does not eliminate existential variables by Skolemization, but handles them using additional constraints with which each clause is annotated. This calculus is sound and refutationally complete in the limit for a fixed domain semantics. For saturated Horn theories and classes of positive formulas, the calculus is even complete for proving properties of the minimal model itself, going beyond the scope of known superposition-based approaches. The calculus is applicable to every set of clauses with equality and does not rely on any syntactic restrictions of the input. Extensions of the calculus lead to various new decision procedures for minimal model validity. A main feature of these decision procedures is that even the validity of queries containing one quantifier alternation can be decided. In particular, I prove that the validity of any formula with at most one quantifier alternation is decidable in models represented by a finite set of atoms and that the validity of several classes of such formulas is decidable in models represented by so-called disjunctions of implicit generalizations. Moreover, I show that the decision of minimal model validity can be reduced to the superposition-based decision of first-order validity for models of a class of predicative Horn clauses where all function symbols are at most unary.},
}

Endnote

%0 Thesis
%A Horbach, Matthias
%Y Weidenbach, Christoph
%+ Automation of Logic, MPI for Informatics, Max Planck Society
International Max Planck Research School, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T Saturation-based Decision Procedures for Fixed Domain and Minimal Model Semantics :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-000F-1453-F
%F EDOC: 536344
%F OTHER: Local-ID: C125716C0050FB51-8C390F163CB3D25AC12577EC0037127A-Horbach2010PhD
%U urn:nbn:de:bsz:291-scidok-32826
%I Universität des Saarlandes
%C Saarbrücken
%D 2010
%V phd
%9 phd
%X Superposition is an established decision procedure for a variety of first-order
logic theories represented by sets of clauses. A satisfiable theory, saturated
by superposition, implicitly defines a minimal Herbrand model for the theory.
This raises the question in how far superposition calculi can be employed for
reasoning about such minimal models. This is indeed often possible when
existential properties are considered. However, proving universal properties
directly leads to a modification of the minimal model's term-generated domain,
as new Skolem functions are introduced. For many applications, this is not
desired because it changes the problem.
In this thesis, I propose the first superposition calculus that can explicitly
represent existentially quantified variables and can thus compute with respect
to a given fixed domain. It does not eliminate existential variables by
Skolemization, but handles them using additional constraints with which each
clause is annotated. This calculus is sound and refutationally complete in the
limit for a fixed domain semantics. For saturated Horn theories and classes of
positive formulas, the calculus is even complete for proving properties of the
minimal model itself, going beyond the scope of known superposition-based
approaches.
The calculus is applicable to every set of clauses with equality and does not
rely on any syntactic restrictions of the input. Extensions of the calculus
lead to various new decision procedures for minimal model validity. A main
feature of these decision procedures is that even the validity of queries
containing one quantifier alternation can be decided. In particular, I prove
that the validity of any formula with at most one quantifier alternation is
decidable in models represented by a finite set of atoms and that the validity
of several classes of such formulas is decidable in models represented by
so-called disjunctions of implicit generalizations. Moreover, I show that the
decision of minimal model validity can be reduced to the superposition-based
decision of first-order validity for models of a class of predicative Horn
clauses where all function symbols are at most unary.
%U http://scidok.sulb.uni-saarland.de/volltexte/2010/3282/http://scidok.sulb.uni-saarland.de/doku/lic_ohne_pod.php?la=de

Horbach, M., & Weidenbach, C. (2010). Superposition for Fixed Domains.

*ACM Transactions on Computational Logic*,*11*(4). doi:10.1145/1805950.1805957Abstract

Disunification is an extension of unification to first-order formulae over
syntactic equality atoms. Instead of considering only syntactic equality, I
extend a disunification algorithm by Comon and Delor to ultimately periodic
interpretations, i.e.~minimal many-sorted Herbrand models of predicative Horn
clauses and, for some sorts, equations of the form $s^\upmb(x)\eq s^\upma(x)$.
The extended algorithm is terminating and correct for ultimately periodic
interpretations over a finite signature and gives rise to a decision procedure
for the satisfiability of equational formulae in ultimately periodic
interpretations.
As an application, I show how to apply disunification to compute the completion
of predicates with respect to an ultimately periodic interpretation. Such
completions are a key ingredient to several inductionless induction methods.

Export

BibTeX

@article{HorbachWeidenbach2010,
TITLE = {Superposition for Fixed Domains},
AUTHOR = {Horbach, Matthias and Weidenbach, Christoph},
LANGUAGE = {eng},
ISSN = {1529-3785},
URL = {http://doi.acm.org/10.1145/1805950.1805957},
DOI = {10.1145/1805950.1805957},
LOCALID = {Local-ID: C125716C0050FB51-DC99658FD9996B09C12577EC003612CE-HorbachWeidenbach2010},
PUBLISHER = {ACM},
ADDRESS = {New York, NY},
YEAR = {2010},
DATE = {2010},
ABSTRACT = {Disunification is an extension of unification to first-order formulae over syntactic equality atoms. Instead of considering only syntactic equality, I extend a disunification algorithm by Comon and Delor to ultimately periodic interpretations, i.e.~minimal many-sorted Herbrand models of predicative Horn clauses and, for some sorts, equations of the form $s^\upmb(x)\eq s^\upma(x)$. The extended algorithm is terminating and correct for ultimately periodic interpretations over a finite signature and gives rise to a decision procedure for the satisfiability of equational formulae in ultimately periodic interpretations. As an application, I show how to apply disunification to compute the completion of predicates with respect to an ultimately periodic interpretation. Such completions are a key ingredient to several inductionless induction methods.},
JOURNAL = {ACM Transactions on Computational Logic},
VOLUME = {11},
NUMBER = {4},
PAGES = {27,1--27,35},
EID = {27},
}

Endnote

%0 Journal Article
%A Horbach, Matthias
%A Weidenbach, Christoph
%+ Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T Superposition for Fixed Domains :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-000F-14C3-6
%F EDOC: 536343
%R 10.1145/1805950.1805957
%U http://doi.acm.org/10.1145/1805950.1805957
%F OTHER: Local-ID: C125716C0050FB51-DC99658FD9996B09C12577EC003612CE-HorbachWeidenbach2010
%D 2010
%* Review method: peer-reviewed
%X Disunification is an extension of unification to first-order formulae over
syntactic equality atoms. Instead of considering only syntactic equality, I
extend a disunification algorithm by Comon and Delor to ultimately periodic
interpretations, i.e.~minimal many-sorted Herbrand models of predicative Horn
clauses and, for some sorts, equations of the form $s^\upmb(x)\eq s^\upma(x)$.
The extended algorithm is terminating and correct for ultimately periodic
interpretations over a finite signature and gives rise to a decision procedure
for the satisfiability of equational formulae in ultimately periodic
interpretations.
As an application, I show how to apply disunification to compute the completion
of predicates with respect to an ultimately periodic interpretation. Such
completions are a key ingredient to several inductionless induction methods.
%J ACM Transactions on Computational Logic
%V 11
%N 4
%& 27,1
%P 27,1 - 27,35
%Z sequence number: 27
%I ACM
%C New York, NY
%@ false

Ihlemann, C., & Sofronie-Stokkermans, V. (2010a). On Hierarchical Reasoning in Combinations of Theories. In

*Automated Reasoning (IJCAR 2010)*. Edinburgh, UK: Springer. doi:10.1007/978-3-642-14203-1_4Abstract

In this paper we study theory combinations over non-disjoint
signatures in which hierarchical and modular reasoning is
possible. We use a notion of locality of a theory extension
parameterized by a closure operator on ground terms.
We give criteria for recognizing these types of theory
extensions. We then show that combinations of extensions of
theories which are local in this extended sense also have a
locality property and hence allow modular and hierarchical
reasoning. We thus obtain parameterized decidability and
complexity results for many (combinations of) theories
important in verification.

Export

BibTeX

@inproceedings{Ihlemann-Sofronie-Stokkermans-ijcar-2010,
TITLE = {On Hierarchical Reasoning in Combinations of Theories},
AUTHOR = {Ihlemann, Carsten and Sofronie-Stokkermans, Viorica},
LANGUAGE = {eng},
ISSN = {0302-9743},
ISBN = {978-3-642-14202-4},
URL = {http://dx.doi.org/10.1007/978-3-642-14203-1_4},
DOI = {10.1007/978-3-642-14203-1_4},
LOCALID = {Local-ID: C125716C0050FB51-0972BB8F272A7400C125773E00499A74-Ihlemann-Sofronie-Stokkermans-ijcar-2010},
PUBLISHER = {Springer},
YEAR = {2010},
DATE = {2010},
ABSTRACT = {In this paper we study theory combinations over non-disjoint signatures in which hierarchical and modular reasoning is possible. We use a notion of locality of a theory extension parameterized by a closure operator on ground terms. We give criteria for recognizing these types of theory extensions. We then show that combinations of extensions of theories which are local in this extended sense also have a locality property and hence allow modular and hierarchical reasoning. We thus obtain parameterized decidability and complexity results for many (combinations of) theories important in verification.},
BOOKTITLE = {Automated Reasoning (IJCAR 2010)},
EDITOR = {Giesl, J{\"u}rgen and H{\"a}hnle, Reiner},
PAGES = {30--45},
SERIES = {Lecture Notes in Artificial Intelligence},
VOLUME = {6173},
ADDRESS = {Edinburgh, UK},
}

Endnote

%0 Conference Proceedings
%A Ihlemann, Carsten
%A Sofronie-Stokkermans, Viorica
%+ Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T On Hierarchical Reasoning in Combinations of Theories :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-000F-14B9-D
%F EDOC: 536338
%R 10.1007/978-3-642-14203-1_4
%U http://dx.doi.org/10.1007/978-3-642-14203-1_4
%F OTHER: Local-ID: C125716C0050FB51-0972BB8F272A7400C125773E00499A74-Ihlemann-Sofronie-Stokkermans-ijcar-2010
%D 2010
%B 5th International Joint Conference on Automated Reasoning
%Z date of event: 2010-07-16 - 2010-07-19
%C Edinburgh, UK
%X In this paper we study theory combinations over non-disjoint
signatures in which hierarchical and modular reasoning is
possible. We use a notion of locality of a theory extension
parameterized by a closure operator on ground terms.
We give criteria for recognizing these types of theory
extensions. We then show that combinations of extensions of
theories which are local in this extended sense also have a
locality property and hence allow modular and hierarchical
reasoning. We thus obtain parameterized decidability and
complexity results for many (combinations of) theories
important in verification.
%B Automated Reasoning
%E Giesl, Jürgen; Hähnle, Reiner
%P 30 - 45
%I Springer
%@ 978-3-642-14202-4
%B Lecture Notes in Artificial Intelligence
%N 6173
%@ false

Ihlemann, C., & Sofronie-Stokkermans, V. (2010b).

*On Hierarchical Reasoning in Combinations of Theories*(No. ATR60). SFB/TR 14 AVACS.Abstract

In this paper we study theory combinations over non-disjoint
signatures in which hierarchical and modular reasoning is
possible. We use a notion of locality of a theory extension
parameterized by a closure operator on ground terms.
We give criteria for recognizing these types of theory
extensions. We then show that combinations of extensions of
theories which are local in this extended sense have also a
locality property and hence allow modular and hierarchical
reasoning. We thus obtain parameterized decidability and
complexity results for many (combinations of) theories
important in verification.

Export

BibTeX

@techreport{Ihlemann-Sofronie-Stokkermans-atr60-2010,
TITLE = {On Hierarchical Reasoning in Combinations of Theories},
AUTHOR = {Ihlemann, Carsten and Sofronie-Stokkermans, Viorica},
LANGUAGE = {eng},
ISSN = {1860-9821},
NUMBER = {ATR60},
LOCALID = {Local-ID: C125716C0050FB51-8E77AFE123C76116C1257782003FEBDA-Ihlemann-Sofronie-Stokkermans-atr60-2010},
INSTITUTION = {SFB/TR 14 AVACS},
YEAR = {2010},
DATE = {2010},
ABSTRACT = {In this paper we study theory combinations over non-disjoint signatures in which hierarchical and modular reasoning is possible. We use a notion of locality of a theory extension parameterized by a closure operator on ground terms. We give criteria for recognizing these types of theory extensions. We then show that combinations of extensions of theories which are local in this extended sense have also a locality property and hence allow modular and hierarchical reasoning. We thus obtain parameterized decidability and complexity results for many (combinations of) theories important in verification.},
TYPE = {AVACS Technical Report},
VOLUME = {60},
}

Endnote

%0 Report
%A Ihlemann, Carsten
%A Sofronie-Stokkermans, Viorica
%+ Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T On Hierarchical Reasoning in Combinations of Theories :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-000F-14B7-2
%F EDOC: 536339
%F OTHER: Local-ID: C125716C0050FB51-8E77AFE123C76116C1257782003FEBDA-Ihlemann-Sofronie-Stokkermans-atr60-2010
%Y SFB/TR 14 AVACS
%D 2010
%P 26 p.
%X In this paper we study theory combinations over non-disjoint
signatures in which hierarchical and modular reasoning is
possible. We use a notion of locality of a theory extension
parameterized by a closure operator on ground terms.
We give criteria for recognizing these types of theory
extensions. We then show that combinations of extensions of
theories which are local in this extended sense have also a
locality property and hence allow modular and hierarchical
reasoning. We thus obtain parameterized decidability and
complexity results for many (combinations of) theories
important in verification.
%B AVACS Technical Report
%N 60
%@ false
%U http://www.avacs.org/Publikationen/Open/avacs_technical_report_060.pdf

Ihlemann, C. (2010).

*Reasoning in Combinations of Theories*. Universität des Saarlandes, Saarbrücken. Retrieved from http://scidok.sulb.uni-saarland.de/volltexte/2010/3472/Abstract

Verification problems are often expressed in a language which mixes several
theories.
A natural question to ask is whether one can use decision procedures for
individual theories to construct a decision procedure for the union theory.
In the cases where this is possible one has a powerful method at hand to handle
complex theories effectively.
The setup considered in this thesis is that of one base theory which is
extended by one or more theories.
The question is if and when a given ground satisfiability problem in the
extended setting can be
effectively reduced to an equi-satisfiable
problem
over the base theory. A case where this reductive approach is always possible
is that of so-called \emph{local theory extensions.}
The theory of local extensions is developed and some applications concerning
monotone functions are given.
Then the theory of local theory extensions is generalized in order to deal with
data structures that
exhibit local behavior.
It will be shown that a suitable fragment of both the theory of arrays and the
theory of pointers
is local in this broader sense.
%
Finally, the case of more than one theory extension is discussed.
In particular, a \emph{modularity} result is given that under certain
circumstances the locality of each of the extensions
lifts to locality of the entire extension.
The reductive approach outlined above has become particularly relevant
in recent years due to the rise of powerful solvers for background
theories common in verification tasks. These so-called SMT-solvers
effectively handle theories such as real linear or integer arithmetic.
As part of this thesis, a program called \emph{\mbox{H-PILoT}} was
implemented which carries out reductive reasoning for local theory
extensions. H-PILoT found applications in mathematics, multiple-valued
logics, data-structures and reasoning in complex systems.

Export

BibTeX

@phdthesis{IhlemannDiss2010,
TITLE = {Reasoning in Combinations of Theories},
AUTHOR = {Ihlemann, Carsten},
LANGUAGE = {eng},
URL = {http://scidok.sulb.uni-saarland.de/volltexte/2010/3472/},
LOCALID = {Local-ID: C125716C0050FB51-82ED9E54BEB32A4AC12577FF00605F42-IhlemannDiss2010},
SCHOOL = {Universit{\"a}t des Saarlandes},
ADDRESS = {Saarbr{\"u}cken},
YEAR = {2010},
DATE = {2010},
ABSTRACT = {Verification problems are often expressed in a language which mixes several theories. A natural question to ask is whether one can use decision procedures for individual theories to construct a decision procedure for the union theory. In the cases where this is possible one has a powerful method at hand to handle complex theories effectively. The setup considered in this thesis is that of one base theory which is extended by one or more theories. The question is if and when a given ground satisfiability problem in the extended setting can be effectively reduced to an equi-satisfiable problem over the base theory. A case where this reductive approach is always possible is that of so-called \emph{local theory extensions.} The theory of local extensions is developed and some applications concerning monotone functions are given. Then the theory of local theory extensions is generalized in order to deal with data structures that exhibit local behavior. It will be shown that a suitable fragment of both the theory of arrays and the theory of pointers is local in this broader sense. % Finally, the case of more than one theory extension is discussed. In particular, a \emph{modularity} result is given that under certain circumstances the locality of each of the extensions lifts to locality of the entire extension. The reductive approach outlined above has become particularly relevant in recent years due to the rise of powerful solvers for background theories common in verification tasks. These so-called SMT-solvers effectively handle theories such as real linear or integer arithmetic. As part of this thesis, a program called \emph{\mbox{H-PILoT}} was implemented which carries out reductive reasoning for local theory extensions. H-PILoT found applications in mathematics, multiple-valued logics, data-structures and reasoning in complex systems.},
}

Endnote

%0 Thesis
%A Ihlemann, Carsten
%Y Sofronie-Stokkermans, Viorica
%A referee: Ghilardi, Silvio
%+ Automation of Logic, MPI for Informatics, Max Planck Society
International Max Planck Research School, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
%T Reasoning in Combinations of Theories :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-000F-144B-3
%F EDOC: 536351
%U http://scidok.sulb.uni-saarland.de/volltexte/2010/3472/
%F OTHER: Local-ID: C125716C0050FB51-82ED9E54BEB32A4AC12577FF00605F42-IhlemannDiss2010
%I Universität des Saarlandes
%C Saarbrücken
%D 2010
%V phd
%9 phd
%X Verification problems are often expressed in a language which mixes several
theories.
A natural question to ask is whether one can use decision procedures for
individual theories to construct a decision procedure for the union theory.
In the cases where this is possible one has a powerful method at hand to handle
complex theories effectively.
The setup considered in this thesis is that of one base theory which is
extended by one or more theories.
The question is if and when a given ground satisfiability problem in the
extended setting can be
effectively reduced to an equi-satisfiable
problem
over the base theory. A case where this reductive approach is always possible
is that of so-called \emph{local theory extensions.}
The theory of local extensions is developed and some applications concerning
monotone functions are given.
Then the theory of local theory extensions is generalized in order to deal with
data structures that
exhibit local behavior.
It will be shown that a suitable fragment of both the theory of arrays and the
theory of pointers
is local in this broader sense.
%
Finally, the case of more than one theory extension is discussed.
In particular, a \emph{modularity} result is given that under certain
circumstances the locality of each of the extensions
lifts to locality of the entire extension.
The reductive approach outlined above has become particularly relevant
in recent years due to the rise of powerful solvers for background
theories common in verification tasks. These so-called SMT-solvers
effectively handle theories such as real linear or integer arithmetic.
As part of this thesis, a program called \emph{\mbox{H-PILoT}} was
implemented which carries out reductive reasoning for local theory
extensions. H-PILoT found applications in mathematics, multiple-valued
logics, data-structures and reasoning in complex systems.
%U http://scidok.sulb.uni-saarland.de/volltexte/2010/3472/http://scidok.sulb.uni-saarland.de/doku/lic_ohne_pod.php?la=de

Ihlemann, C., & Sofronie-Stokkermans, V. (2010c).

*System Description: H-PILoT (Version 1.9)*(No. ATR61). SFB/TR 14 AVACS.Abstract

This system description provides an overview of H-PILoT
(Hierarchical Proving by Instantiation in Local Theory
extensions), a program for hierarchical reasoning in
extensions of logical theories.
H-PILoT reduces deduction problems in the theory extension
to deduction problems in the base theory.
Specialized provers and standard SMT solvers can be used
for testing the satisfiability of the formulae obtained
after the reduction. For a certain type of theory extension
(namely for {\em local theory extensions}) this
hierarchical reduction is sound and complete and --
if the formulae obtained this way belong to a fragment
decidable in the base theory -- H-PILoT provides a decision
procedure for testing satisfiability of ground formulae,
and can also be used for model generation.

Export

BibTeX

@techreport{Ihlemann-Sofronie-Stokkermans-atr61-2010,
TITLE = {System Description: H-{PILoT} (Version 1.9)},
AUTHOR = {Ihlemann, Carsten and Sofronie-Stokkermans, Viorica},
LANGUAGE = {eng},
ISSN = {1860-9821},
NUMBER = {ATR61},
LOCALID = {Local-ID: C125716C0050FB51-5F53450808E13ED9C125778C00501AE6-Ihlemann-Sofronie-Stokkermans-atr61-2010},
INSTITUTION = {SFB/TR 14 AVACS},
YEAR = {2010},
DATE = {2010},
ABSTRACT = {This system description provides an overview of H-PILoT (Hierarchical Proving by Instantiation in Local Theory extensions), a program for hierarchical reasoning in extensions of logical theories. H-PILoT reduces deduction problems in the theory extension to deduction problems in the base theory. Specialized provers and standard SMT solvers can be used for testing the satisfiability of the formulae obtained after the reduction. For a certain type of theory extension (namely for {\em local theory extensions}) this hierarchical reduction is sound and complete and -- if the formulae obtained this way belong to a fragment decidable in the base theory -- H-PILoT provides a decision procedure for testing satisfiability of ground formulae, and can also be used for model generation.},
TYPE = {AVACS Technical Report},
VOLUME = {61},
}

Endnote

%0 Report
%A Ihlemann, Carsten
%A Sofronie-Stokkermans, Viorica
%+ Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T System Description: H-PILoT (Version 1.9) :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-000F-14C5-2
%F EDOC: 536340
%F OTHER: Local-ID: C125716C0050FB51-5F53450808E13ED9C125778C00501AE6-Ihlemann-Sofronie-Stokkermans-atr61-2010
%Y SFB/TR 14 AVACS
%D 2010
%P 45 p.
%X This system description provides an overview of H-PILoT
(Hierarchical Proving by Instantiation in Local Theory
extensions), a program for hierarchical reasoning in
extensions of logical theories.
H-PILoT reduces deduction problems in the theory extension
to deduction problems in the base theory.
Specialized provers and standard SMT solvers can be used
for testing the satisfiability of the formulae obtained
after the reduction. For a certain type of theory extension
(namely for {\em local theory extensions}) this
hierarchical reduction is sound and complete and --
if the formulae obtained this way belong to a fragment
decidable in the base theory -- H-PILoT provides a decision
procedure for testing satisfiability of ground formulae,
and can also be used for model generation.
%B AVACS Technical Report
%N 61
%@ false

Jacobs, S. (2010).

*Hierarchic Decision Procedures for Verification*. Universität des Saarlandes, Saarbrücken. Retrieved from urn:nbn:de:bsz:291-scidok-29478Export

BibTeX

@phdthesis{JacobsDiss2010,
TITLE = {Hierarchic Decision Procedures for Verification},
AUTHOR = {Jacobs, Swen},
LANGUAGE = {eng},
URL = {urn:nbn:de:bsz:291-scidok-29478},
SCHOOL = {Universit{\"a}t des Saarlandes},
ADDRESS = {Saarbr{\"u}cken},
YEAR = {2010},
DATE = {2010},
}

Endnote

%0 Thesis
%A Jacobs, Swen
%Y Sofronie-Stokkermans, Viorica
%A referee: Kunca, Victor
%+ Automation of Logic, MPI for Informatics, Max Planck Society
International Max Planck Research School, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
%T Hierarchic Decision Procedures for Verification :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-001A-16E7-6
%U urn:nbn:de:bsz:291-scidok-29478
%I Universität des Saarlandes
%C Saarbrücken
%D 2010
%P 121 p.
%V phd
%9 phd
%U http://scidok.sulb.uni-saarland.de/volltexte/2010/2947/http://scidok.sulb.uni-saarland.de/doku/lic_ohne_pod.php?la=de

Lu, T., Merz, S., & Weidenbach, C. (2010). Model Checking the Pastry Routing Protocol. In

*Proceedings of the 10th International Workshop Automatic Verification of Critical Systems (AVOCS 2010)*. Düsseldorf, Germany: Universität Düsseldorf.Abstract

Pastry is an algorithm for implementing a scalable distributed hash table over
an underlying P2P network, an active area of research in distributed systems.
Several implementations of Pastry are available and have been applied in
practice, but no attempt has so far been made to formally describe the
algorithm or to verify its properties. Since Pastry combines rather complex
data structures, asynchronous communication, concurrency, resilience to
\emph{churn} and fault tolerance, it makes an interesting target for
verification. We have modeled Pastry's core routing algorithms in the
specification language \texorpdfstring{\textrm{\upshape
TLA\textsuperscript{+}}}{TLA+} and used its model checker \textsc{tlc} to
analyze qualitative properties of Pastry such as \emph{correctness} and
\emph{consistency}.

Export

BibTeX

@inproceedings{LuTX2009,
TITLE = {Model Checking the {Pastry} Routing Protocol},
AUTHOR = {Lu, Tianxiang and Merz, Stephan and Weidenbach, Christoph},
LANGUAGE = {eng},
LOCALID = {Local-ID: C125716C0050FB51-7C1D8D3EC22CF667C12577ED00339DE6-LuTX2009},
PUBLISHER = {Universit{\"a}t D{\"u}sseldorf},
YEAR = {2010},
DATE = {2010},
ABSTRACT = {Pastry is an algorithm for implementing a scalable distributed hash table over an underlying P2P network, an active area of research in distributed systems. Several implementations of Pastry are available and have been applied in practice, but no attempt has so far been made to formally describe the algorithm or to verify its properties. Since Pastry combines rather complex data structures, asynchronous communication, concurrency, resilience to \emph{churn} and fault tolerance, it makes an interesting target for verification. We have modeled Pastry's core routing algorithms in the specification language \texorpdfstring{\textrm{\upshape TLA\textsuperscript{+}}}{TLA+} and used its model checker \textsc{tlc} to analyze qualitative properties of Pastry such as \emph{correctness} and \emph{consistency}.},
BOOKTITLE = {Proceedings of the 10th International Workshop Automatic Verification of Critical Systems (AVOCS 2010)},
EDITOR = {Bendisposto, Jens and Leuschel, Michael and Roggenbach, Markus},
PAGES = {19--21},
ADDRESS = {D{\"u}sseldorf, Germany},
}

Endnote

%0 Conference Proceedings
%A Lu, Tianxiang
%A Merz, Stephan
%A Weidenbach, Christoph
%+ Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
%T Model Checking the Pastry Routing Protocol :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-000F-14B5-6
%F EDOC: 536345
%F OTHER: Local-ID: C125716C0050FB51-7C1D8D3EC22CF667C12577ED00339DE6-LuTX2009
%D 2010
%B 10th International Workshop Automatic Verification of Critical Systems
%Z date of event: 2010-09-20 - 2010-09-23
%C Düsseldorf, Germany
%X Pastry is an algorithm for implementing a scalable distributed hash table over
an underlying P2P network, an active area of research in distributed systems.
Several implementations of Pastry are available and have been applied in
practice, but no attempt has so far been made to formally describe the
algorithm or to verify its properties. Since Pastry combines rather complex
data structures, asynchronous communication, concurrency, resilience to
\emph{churn} and fault tolerance, it makes an interesting target for
verification. We have modeled Pastry's core routing algorithms in the
specification language \texorpdfstring{\textrm{\upshape
TLA\textsuperscript{+}}}{TLA+} and used its model checker \textsc{tlc} to
analyze qualitative properties of Pastry such as \emph{correctness} and
\emph{consistency}.
%B Proceedings of the 10th International Workshop Automatic Verification of Critical Systems
%E Bendisposto, Jens; Leuschel, Michael; Roggenbach, Markus
%P 19 - 21
%I Universität Düsseldorf

Peltier, N., & Sofronie-Stokkermans, V. (Eds.). (2010).

*FTP 2009 First-Order Theorem Proving*. Presented at the 7th International Workshop on First-Order Theorem Proving, Oslo, Norway: CEUR- WS.org. Retrieved from http://CEUR-WS.org/Vol-556/Export

BibTeX

@proceedings{Sofronie-Stokkermans-ceur2010,
TITLE = {FTP 2009 First-Order Theorem Proving},
EDITOR = {Peltier, Nicolas and Sofronie-Stokkermans, Viorica},
LANGUAGE = {eng},
ISSN = {1613-0073},
URL = {http://CEUR-WS.org/Vol-556/},
LOCALID = {Local-ID: C125716C0050FB51-0FB81A4A18F81FA3C12576EA00497A0F-Sofronie-Stokkermans-ceur2010},
PUBLISHER = {CEUR- WS.org},
YEAR = {2009},
PAGES = {139 p.},
SERIES = {CEUR Workshop Proceedings},
VOLUME = {556},
ADDRESS = {Oslo, Norway},
}

Endnote

%0 Conference Proceedings
%E Peltier, Nicolas
%E Sofronie-Stokkermans, Viorica
%+ External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
%T FTP 2009 First-Order Theorem Proving : Proceedings of the 7th International Workshop on First-Order Theorem Proving (FTP'09)
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-000F-14B0-0
%F EDOC: 536335
%U http://CEUR-WS.org/Vol-556/
%F OTHER: Local-ID: C125716C0050FB51-0FB81A4A18F81FA3C12576EA00497A0F-Sofronie-Stokkermans-ceur2010
%I CEUR- WS.org
%D 2010
%B 7th International Workshop on First-Order Theorem Proving
%Z date of event: 2009-07-06 - 2009-07-07
%D 2009
%C Oslo, Norway
%P 139 p.
%S CEUR Workshop Proceedings
%V 556
%@ false
%U http://CEUR-WS.org/Vol-556/

Rybalchenko, A., & Sofronie-Stokkermans, V. (2010). Constraint Solving for Interpolation.

*Journal of Symbolic Computation*,*45*(11). doi:101016/j.jsc.2010.06.005Abstract

Interpolation is an important component of recent methods for
program verification. It provides a natural and effective means
for computing the separation between the sets of ‘good’ and
‘bad’ states. The existing algorithms for interpolant generation
are proof-based: They require explicit construction of proofs,
from which interpolants can be computed. Construction of such
proofs is a difficult task. We propose an algorithm for the
generation of interpolants for the combined theory of linear
arithmetic and uninterpreted function symbols that does not
require a priori constructed proofs to derive interpolants. It
uses a reduction of the problem to constraint solving in linear
arithmetic, which allows application of existing highly
optimized Linear Programming solvers in a black-box fashion.
We provide experimental evidence of the practical applicability
of our algorithm.

Export

BibTeX

@article{Sofronie-Stokkermans-2010-jsc,
TITLE = {Constraint Solving for Interpolation},
AUTHOR = {Rybalchenko, Andrey and Sofronie-Stokkermans, Viorica},
LANGUAGE = {eng},
ISSN = {0747-7171},
URL = {http://www.sciencedirect.com/science/article/B6WM7-50C71T0-3/2/4b391bab5e3621ac8fc979af3874cbaf},
DOI = {101016/j.jsc.2010.06.005},
LOCALID = {Local-ID: C125716C0050FB51-45F6E8A7C90A3899C12576D600448047-Sofronie-Stokkermans-2010-jsc},
PUBLISHER = {Elsevier},
ADDRESS = {Amsterdam},
YEAR = {2010},
DATE = {2010},
ABSTRACT = {Interpolation is an important component of recent methods for program verification. It provides a natural and effective means for computing the separation between the sets of {\textquoteleft}good{\textquoteright} and {\textquoteleft}bad{\textquoteright} states. The existing algorithms for interpolant generation are proof-based: They require explicit construction of proofs, from which interpolants can be computed. Construction of such proofs is a difficult task. We propose an algorithm for the generation of interpolants for the combined theory of linear arithmetic and uninterpreted function symbols that does not require a priori constructed proofs to derive interpolants. It uses a reduction of the problem to constraint solving in linear arithmetic, which allows application of existing highly optimized Linear Programming solvers in a black-box fashion. We provide experimental evidence of the practical applicability of our algorithm.},
JOURNAL = {Journal of Symbolic Computation},
VOLUME = {45},
NUMBER = {11},
PAGES = {1212--1233},
}

Endnote

%0 Journal Article
%A Rybalchenko, Andrey
%A Sofronie-Stokkermans, Viorica
%+ Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T Constraint Solving for Interpolation :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-000F-14AA-F
%F EDOC: 536334
%R 101016/j.jsc.2010.06.005
%U http://www.sciencedirect.com/science/article/B6WM7-50C71T0-3/2/4b391bab5e3621ac8fc979af3874cbaf
%F OTHER: Local-ID: C125716C0050FB51-45F6E8A7C90A3899C12576D600448047-Sofronie-Stokkermans-2010-jsc
%7 2010
%D 2010
%* Review method: peer-reviewed
%X Interpolation is an important component of recent methods for
program verification. It provides a natural and effective means
for computing the separation between the sets of ‘good’ and
‘bad’ states. The existing algorithms for interpolant generation
are proof-based: They require explicit construction of proofs,
from which interpolants can be computed. Construction of such
proofs is a difficult task. We propose an algorithm for the
generation of interpolants for the combined theory of linear
arithmetic and uninterpreted function symbols that does not
require a priori constructed proofs to derive interpolants. It
uses a reduction of the problem to constraint solving in linear
arithmetic, which allows application of existing highly
optimized Linear Programming solvers in a black-box fashion.
We provide experimental evidence of the practical applicability
of our algorithm.
%J Journal of Symbolic Computation
%V 45
%N 11
%& 1212
%P 1212 - 1233
%I Elsevier
%C Amsterdam
%@ false

Sofronie-Stokkermans, V. (2010a). Automated Reasoning in Extensions of Theories of Constructors with Recursively Defined Functions and Homomorphisms. In

*Interaction versus Automation : the two Faces of Deduction*. Schloss Dagstuhl, Wadern: Schloss Dagstuhl. Retrieved from http://drops.dagstuhl.de/opus/volltexte/2010/2424/pdf/09411.SofronieStokkermansViorica.Paper.2424.pdfAbstract

We study possibilities of reasoning about extensions of base
theories with functions which satisfy certain recursion and
homomorphism properties. Our focus is on emphasizing
possibilities of hierarchical and modular reasoning in such
extensions and combinations thereof.
\begin{itemize}
\item[(1)] We show that the theory of absolutely free
constructors is local, and locality is preserved also in the
presence of selectors. These results are consistent with
existing decision procedures for this theory (e.g. by Oppen).
\item[(2)] We show that, under certain assumptions, extensions
of the theory of absolutely free constructors with functions
satisfying a certain type of recursion axioms satisfy locality
properties, and show that for functions with values in an
ordered domain we can combine recursive definitions with
boundedness axioms without sacrificing locality. We also address
the problem of only considering models whose data part is
the {em initial} term algebra of such theories.
\item[(3)] We analyze conditions which ensure that similar
results can be obtained if we relax some assumptions about the
absolute freeness of the underlying theory of data types, and
illustrate the ideas on an example from cryptography.
\end{itemize}
The locality results we establish allow us to reduce the task of
reasoning about the class of recursive functions we consider to
reasoning in the underlying theory of data structures (possibly
combined with the theories associated with the co-domains of
the recursive functions).
As a by-product, the methods we use provide a possibility of
presenting in a different light (and in a different form)
locality phenomena studied in cryp-to-gra-phy; we believe that
they will allow to better separate rewriting from proving, and
thus to give simpler proofs.

Export

BibTeX

@inproceedings{Sofronie-Stokkermans-dagstuhl-2010,
TITLE = {Automated Reasoning in Extensions of Theories of Constructors with Recursively Defined Functions and Homomorphisms},
AUTHOR = {Sofronie-Stokkermans, Viorica},
LANGUAGE = {eng},
ISSN = {1862-4405},
URL = {http://drops.dagstuhl.de/opus/volltexte/2010/2424/pdf/09411.SofronieStokkermansViorica.Paper.2424.pdf},
LOCALID = {Local-ID: C125716C0050FB51-36DE00D5AA94A519C12576E1004B89B9-Sofronie-Stokkermans-dagstuhl-2010},
PUBLISHER = {Schloss Dagstuhl},
YEAR = {2009},
ABSTRACT = {We study possibilities of reasoning about extensions of base theories with functions which satisfy certain recursion and homomorphism properties. Our focus is on emphasizing possibilities of hierarchical and modular reasoning in such extensions and combinations thereof. \begin{itemize} \item[(1)] We show that the theory of absolutely free constructors is local, and locality is preserved also in the presence of selectors. These results are consistent with existing decision procedures for this theory (e.g. by Oppen). \item[(2)] We show that, under certain assumptions, extensions of the theory of absolutely free constructors with functions satisfying a certain type of recursion axioms satisfy locality properties, and show that for functions with values in an ordered domain we can combine recursive definitions with boundedness axioms without sacrificing locality. We also address the problem of only considering models whose data part is the {em initial} term algebra of such theories. \item[(3)] We analyze conditions which ensure that similar results can be obtained if we relax some assumptions about the absolute freeness of the underlying theory of data types, and illustrate the ideas on an example from cryptography. \end{itemize} The locality results we establish allow us to reduce the task of reasoning about the class of recursive functions we consider to reasoning in the underlying theory of data structures (possibly combined with the theories associated with the co-domains of the recursive functions). As a by-product, the methods we use provide a possibility of presenting in a different light (and in a different form) locality phenomena studied in cryp-to-gra-phy; we believe that they will allow to better separate rewriting from proving, and thus to give simpler proofs.},
BOOKTITLE = {Interaction versus Automation : the two Faces of Deduction},
EDITOR = {Ball, Thomas and Giesl, J{\"u}rgen and H{\"a}hnle, Reiner and Nipkow, Tobias},
PAGES = {1--33},
SERIES = {Dagstuhl Seminar Proceedings},
VOLUME = {09411},
ADDRESS = {Schloss Dagstuhl, Wadern},
}

Endnote

%0 Conference Proceedings
%A Sofronie-Stokkermans, Viorica
%+ Automation of Logic, MPI for Informatics, Max Planck Society
%T Automated Reasoning in Extensions of Theories of Constructors with Recursively Defined Functions and Homomorphisms :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-000F-1966-E
%F EDOC: 536348
%U http://drops.dagstuhl.de/opus/volltexte/2010/2424/pdf/09411.SofronieStokkermansViorica.Paper.2424.pdf
%F OTHER: Local-ID: C125716C0050FB51-36DE00D5AA94A519C12576E1004B89B9-Sofronie-Stokkermans-dagstuhl-2010
%D 2010
%B Interaction versus Automation: The two Faces of Deduction (Dagstuhl Seminar 09411)
%Z date of event: 2009-10-04 - 2009-10-09
%C Schloss Dagstuhl, Wadern
%X We study possibilities of reasoning about extensions of base
theories with functions which satisfy certain recursion and
homomorphism properties. Our focus is on emphasizing
possibilities of hierarchical and modular reasoning in such
extensions and combinations thereof.
\begin{itemize}
\item[(1)] We show that the theory of absolutely free
constructors is local, and locality is preserved also in the
presence of selectors. These results are consistent with
existing decision procedures for this theory (e.g. by Oppen).
\item[(2)] We show that, under certain assumptions, extensions
of the theory of absolutely free constructors with functions
satisfying a certain type of recursion axioms satisfy locality
properties, and show that for functions with values in an
ordered domain we can combine recursive definitions with
boundedness axioms without sacrificing locality. We also address
the problem of only considering models whose data part is
the {em initial} term algebra of such theories.
\item[(3)] We analyze conditions which ensure that similar
results can be obtained if we relax some assumptions about the
absolute freeness of the underlying theory of data types, and
illustrate the ideas on an example from cryptography.
\end{itemize}
The locality results we establish allow us to reduce the task of
reasoning about the class of recursive functions we consider to
reasoning in the underlying theory of data structures (possibly
combined with the theories associated with the co-domains of
the recursive functions).
As a by-product, the methods we use provide a possibility of
presenting in a different light (and in a different form)
locality phenomena studied in cryp-to-gra-phy; we believe that
they will allow to better separate rewriting from proving, and
thus to give simpler proofs.
%B Interaction versus Automation : the two Faces of Deduction
%E Ball, Thomas; Giesl, Jürgen; Hähnle, Reiner; Nipkow, Tobias
%P 1 - 33
%I Schloss Dagstuhl
%B Dagstuhl Seminar Proceedings
%N 09411
%@ false
%U http://drops.dagstuhl.de/opus/volltexte/2010/2424/

Sofronie-Stokkermans, V. (2010b). Hierarchical Reasoning for the Verification of Parametric Systems. In

*Automated Reasoning (IJCAR 2010)*. Edinburgh, UK: Springer. doi:10.1007/978-3-642-14203-1_15Abstract

We study certain classes of verification problems for parametric
reactive and hybrid systems, and identify the types of logical
theories which can be used for modeling such systems and the
reasoning tasks which need to be solved in this context.
We identify properties of the underlying theories which ensure
that these classes of verification problems can be solved
efficiently, give examples of theories with the desired
properties, and illustrate the methods we use on several
examples.

Export

BibTeX

@inproceedings{Sofronie-Stokkermans2010-ijcar,
TITLE = {Hierarchical Reasoning for the Verification of Parametric Systems},
AUTHOR = {Sofronie-Stokkermans, Viorica},
LANGUAGE = {eng},
ISSN = {0302-9743},
ISBN = {978-3-642-14202-4},
URL = {http://dx.doi.org/10.1007/978-3-642-14203-1_15},
DOI = {10.1007/978-3-642-14203-1_15},
LOCALID = {Local-ID: C125716C0050FB51-6177B09015F62C65C125773E00491841-Sofronie-Stokkermans2010-ijcar},
PUBLISHER = {Springer},
YEAR = {2010},
DATE = {2010},
ABSTRACT = {We study certain classes of verification problems for parametric reactive and hybrid systems, and identify the types of logical theories which can be used for modeling such systems and the reasoning tasks which need to be solved in this context. We identify properties of the underlying theories which ensure that these classes of verification problems can be solved efficiently, give examples of theories with the desired properties, and illustrate the methods we use on several examples.},
BOOKTITLE = {Automated Reasoning (IJCAR 2010)},
EDITOR = {Giesl, J{\"u}rgen and H{\"a}hnle, Reiner},
PAGES = {171--187},
SERIES = {Lecture Notes in Artificial Intelligence},
VOLUME = {6173},
ADDRESS = {Edinburgh, UK},
}

Endnote

%0 Conference Proceedings
%A Sofronie-Stokkermans, Viorica
%+ Automation of Logic, MPI for Informatics, Max Planck Society
%T Hierarchical Reasoning for the Verification of Parametric Systems :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-000F-14B2-C
%F EDOC: 536337
%R 10.1007/978-3-642-14203-1_15
%U http://dx.doi.org/10.1007/978-3-642-14203-1_15
%F OTHER: Local-ID: C125716C0050FB51-6177B09015F62C65C125773E00491841-Sofronie-Stokkermans2010-ijcar
%D 2010
%B 5th International Joint Conference on Automated Reasoning
%Z date of event: 2010-07-16 - 2010-07-19
%C Edinburgh, UK
%X We study certain classes of verification problems for parametric
reactive and hybrid systems, and identify the types of logical
theories which can be used for modeling such systems and the
reasoning tasks which need to be solved in this context.
We identify properties of the underlying theories which ensure
that these classes of verification problems can be solved
efficiently, give examples of theories with the desired
properties, and illustrate the methods we use on several
examples.
%B Automated Reasoning
%E Giesl, Jürgen; Hähnle, Reiner
%P 171 - 187
%I Springer
%@ 978-3-642-14202-4
%B Lecture Notes in Artificial Intelligence
%N 6173
%@ false

Suda, M., Weidenbach, C., & Wischnewski, P. (2010a).

*On the saturation of YAGO*(No. MPI-I-2010-RG1-001). Saarbrücken: Max-Planck-Institut für Informatik. Retrieved from http://domino.mpi-inf.mpg.de/internet/reports.nsf/NumberView/2010-RG1-001Export

BibTeX

@techreport{SudaWischnewski2010,
TITLE = {On the saturation of {YAGO}},
AUTHOR = {Suda, Martin and Weidenbach, Christoph and Wischnewski, Patrick},
LANGUAGE = {eng},
URL = {http://domino.mpi-inf.mpg.de/internet/reports.nsf/NumberView/2010-RG1-001},
NUMBER = {MPI-I-2010-RG1-001},
INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
ADDRESS = {Saarbr{\"u}cken},
YEAR = {2010},
DATE = {2010},
TYPE = {Research Report},
}

Endnote

%0 Report
%A Suda, Martin
%A Weidenbach, Christoph
%A Wischnewski, Patrick
%+ Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T On the saturation of YAGO :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0014-6584-2
%U http://domino.mpi-inf.mpg.de/internet/reports.nsf/NumberView/2010-RG1-001
%Y Max-Planck-Institut für Informatik
%C Saarbrücken
%D 2010
%P 50 p.
%B Research Report

Suda, M., Weidenbach, C., & Wischnewski, P. (2010b). On the Saturation of YAGO. In

*Automated Reasoning (IJCAR 2010)*. Edinburgh, UK: Springer. doi:10.1007/978-3-642-14203-1_38Abstract

YAGO is an automatically generated ontology out of Wikipedia
and WordNet. It is eventually represented in a proprietary
flat text file format and a core comprises 10 million facts
and formulas. We present a translation of YAGO into the
Bernays-Sch¨onfinkel Horn class with equality. A new
variant of the superposition calculus is sound, complete
and terminating for this class. Together with extended term
indexing data structures the new calculus is implemented in
Spass-YAGO. YAGO can be finitely saturated by Spass-YAGO in
about 1 hour.We have found 49 inconsistencies in the original
generated ontology which we have fixed. Spass-YAGO can then
prove non-trivial conjectures with respect to the resulting
saturated and consistent clause set of about 1.4 GB in less
than one second.

Export

BibTeX

@inproceedings{SudaWeidenbachWischnewskiIJCAR10,
TITLE = {On the Saturation of {YAGO}},
AUTHOR = {Suda, Martin and Weidenbach, Christoph and Wischnewski, Patrick},
LANGUAGE = {eng},
ISBN = {978-3-642-14202-4},
URL = {http://dx.doi.org/10.1007/978-3-642-14203-1_38},
DOI = {10.1007/978-3-642-14203-1_38},
LOCALID = {Local-ID: C125716C0050FB51-65DE042829479597C12577EE004666CD-SudaWeidenbachWischnewskiIJCAR10},
PUBLISHER = {Springer},
YEAR = {2010},
DATE = {2010},
ABSTRACT = {YAGO is an automatically generated ontology out of Wikipedia and WordNet. It is eventually represented in a proprietary flat text file format and a core comprises 10 million facts and formulas. We present a translation of YAGO into the Bernays-Sch¨onfinkel Horn class with equality. A new variant of the superposition calculus is sound, complete and terminating for this class. Together with extended term indexing data structures the new calculus is implemented in Spass-YAGO. YAGO can be finitely saturated by Spass-YAGO in about 1 hour.We have found 49 inconsistencies in the original generated ontology which we have fixed. Spass-YAGO can then prove non-trivial conjectures with respect to the resulting saturated and consistent clause set of about 1.4 GB in less than one second.},
BOOKTITLE = {Automated Reasoning (IJCAR 2010)},
EDITOR = {Giesl, J{\"u}rgen and H{\"a}hnle, Reiner},
PAGES = {441--456},
SERIES = {Lecture Notes in Artificial Intelligence},
VOLUME = {6173},
ADDRESS = {Edinburgh, UK},
}

Endnote

%0 Conference Proceedings
%A Suda, Martin
%A Weidenbach, Christoph
%A Wischnewski, Patrick
%+ Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T On the Saturation of YAGO :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-000F-14BB-9
%F EDOC: 536350
%R 10.1007/978-3-642-14203-1_38
%U http://dx.doi.org/10.1007/978-3-642-14203-1_38
%F OTHER: Local-ID: C125716C0050FB51-65DE042829479597C12577EE004666CD-SudaWeidenbachWischnewskiIJCAR10
%D 2010
%B 5th International Joint Conference on Automated Reasoning
%Z date of event: 2010-07-16 - 2010-07-19
%C Edinburgh, UK
%X YAGO is an automatically generated ontology out of Wikipedia
and WordNet. It is eventually represented in a proprietary
flat text file format and a core comprises 10 million facts
and formulas. We present a translation of YAGO into the
Bernays-Sch¨onfinkel Horn class with equality. A new
variant of the superposition calculus is sound, complete
and terminating for this class. Together with extended term
indexing data structures the new calculus is implemented in
Spass-YAGO. YAGO can be finitely saturated by Spass-YAGO in
about 1 hour.We have found 49 inconsistencies in the original
generated ontology which we have fixed. Spass-YAGO can then
prove non-trivial conjectures with respect to the resulting
saturated and consistent clause set of about 1.4 GB in less
than one second.
%B Automated Reasoning
%E Giesl, Jürgen; Hähnle, Reiner
%P 441 - 456
%I Springer
%@ 978-3-642-14202-4
%B Lecture Notes in Artificial Intelligence
%N 6173

Sutcliffe, G., Suda, M., Teyssandier, A., Dellis, N., & de Melo, G. (2010). Progress Towards Effective Automated Reasoning with World Knowledge. In

*Proceedings of the Twenty-Third International Florida Artificial Intelligence Research Society Conference (FLAIRS 2010)*. Daytona Beach, FL, USA: AAAI Press.Export

BibTeX

@inproceedings{SutcliffeEtAl2010,
TITLE = {Progress Towards Effective Automated Reasoning with World Knowledge},
AUTHOR = {Sutcliffe, Geoff and Suda, Martin and Teyssandier, Alexandra and Dellis, Nelson and de Melo, Gerard},
LANGUAGE = {eng},
ISBN = {978-1-57735-447-5},
LOCALID = {Local-ID: C1256DBF005F876D-65A3B2AD63BB42C0C125781A0054B352-SutcliffeEtAl2010},
PUBLISHER = {AAAI Press},
YEAR = {2010},
DATE = {2010},
BOOKTITLE = {Proceedings of the Twenty-Third International Florida Artificial Intelligence Research Society Conference (FLAIRS 2010)},
EDITOR = {Guesgen, Hans W. and Murray, R. Charles},
PAGES = {110--115},
ADDRESS = {Daytona Beach, FL, USA},
}

Endnote

%0 Conference Proceedings
%A Sutcliffe, Geoff
%A Suda, Martin
%A Teyssandier, Alexandra
%A Dellis, Nelson
%A de Melo, Gerard
%+ Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
Databases and Information Systems, MPI for Informatics, Max Planck Society
%T Progress Towards Effective Automated Reasoning with World Knowledge :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-000F-1523-4
%F EDOC: 536394
%F OTHER: Local-ID: C1256DBF005F876D-65A3B2AD63BB42C0C125781A0054B352-SutcliffeEtAl2010
%D 2010
%B Twenty-Third International Florida Artificial Intelligence Research Society Conference
%Z date of event: 2010-05-19 - 2010-05-21
%C Daytona Beach, FL, USA
%B Proceedings of the Twenty-Third International Florida Artificial Intelligence Research Society Conference
%E Guesgen, Hans W.; Murray, R. Charles
%P 110 - 115
%I AAAI Press
%@ 978-1-57735-447-5

Tran, D.-K., Ringeissen, C., Ranise, S., & Kirchner, H. (2010). Combinations of Convex Theories: Modularity, Deduction Completeness and Explanation.

*Journal of Symbolic Computation*,*45*(2). doi:doi:10.1016/j.jsc.2008.10.006Abstract

Decision procedures are key components of theorem provers and
constraint satisfaction systems. Their modular combination is of
prime interest for building efficient systems, but their effective
use is often limited by poor interface capabilities, when such
procedures only provide a simple ``sat/unsat'' answer. In this
paper, we develop a framework to design cooperation schemas between
such procedures while maintaining modularity of their
interfaces. First, we use the framework to specify and prove the
correctness of classic combination schemas by Nelson-Oppen and
Shostak. Second, we introduce the concept of deduction complete
satisfiability procedures, we show how to build them for large
classes of theories, then we provide a schema to modularly
combine them. Third, we consider the problem of modularly
constructing explanations for combinations by re-using available
proof-producing procedures for the component theories.

Export

BibTeX

@article{tran-decproc-jsc,
TITLE = {Combinations of Convex Theories: Modularity, Deduction Completeness and Explanation},
AUTHOR = {Tran, Duc-Khanh and Ringeissen, Christopher and Ranise, Silvio and Kirchner, Helene},
LANGUAGE = {eng},
ISSN = {0747-7171},
DOI = {doi:10.1016/j.jsc.2008.10.006},
LOCALID = {Local-ID: C125716C0050FB51-7E5292801CABC2A8C12575860058A53F-tran-decproc-jsc},
PUBLISHER = {Elsevier},
ADDRESS = {Amsterdam},
YEAR = {2010},
DATE = {2010},
ABSTRACT = {Decision procedures are key components of theorem provers and constraint satisfaction systems. Their modular combination is of prime interest for building efficient systems, but their effective use is often limited by poor interface capabilities, when such procedures only provide a simple ``sat/unsat'' answer. In this paper, we develop a framework to design cooperation schemas between such procedures while maintaining modularity of their interfaces. First, we use the framework to specify and prove the correctness of classic combination schemas by Nelson-Oppen and Shostak. Second, we introduce the concept of deduction complete satisfiability procedures, we show how to build them for large classes of theories, then we provide a schema to modularly combine them. Third, we consider the problem of modularly constructing explanations for combinations by re-using available proof-producing procedures for the component theories.},
JOURNAL = {Journal of Symbolic Computation},
VOLUME = {45},
NUMBER = {2},
PAGES = {261--268},
}

Endnote

%0 Journal Article
%A Tran, Duc-Khanh
%A Ringeissen, Christopher
%A Ranise, Silvio
%A Kirchner, Helene
%+ Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
External Organizations
%T Combinations of Convex Theories: Modularity, Deduction Completeness and Explanation :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-000F-1A46-E
%F EDOC: 521085
%F OTHER: Local-ID: C125716C0050FB51-7E5292801CABC2A8C12575860058A53F-tran-decproc-jsc
%R doi:10.1016/j.jsc.2008.10.006
%7 2009-06-18
%D 2010
%* Review method: peer-reviewed
%X Decision procedures are key components of theorem provers and
constraint satisfaction systems. Their modular combination is of
prime interest for building efficient systems, but their effective
use is often limited by poor interface capabilities, when such
procedures only provide a simple ``sat/unsat'' answer. In this
paper, we develop a framework to design cooperation schemas between
such procedures while maintaining modularity of their
interfaces. First, we use the framework to specify and prove the
correctness of classic combination schemas by Nelson-Oppen and
Shostak. Second, we introduce the concept of deduction complete
satisfiability procedures, we show how to build them for large
classes of theories, then we provide a schema to modularly
combine them. Third, we consider the problem of modularly
constructing explanations for combinations by re-using available
proof-producing procedures for the component theories.
%J Journal of Symbolic Computation
%V 45
%N 2
%& 261
%P 261 - 268
%I Elsevier
%C Amsterdam
%@ false

Weidenbach, C., & Wischnewski, P. (2010). Subterm Contextual Rewriting.

*AI Communications*,*23*(2-3). doi:10.3233/AIC-2010-0459Export

BibTeX

@article{WeidenbachWischnewskiAICom10,
TITLE = {Subterm Contextual Rewriting},
AUTHOR = {Weidenbach, Christoph and Wischnewski, Patrick},
LANGUAGE = {eng},
ISSN = {0921-7126},
URL = {http://dx.doi.org/10.3233/AIC-2010-0459},
DOI = {10.3233/AIC-2010-0459},
LOCALID = {Local-ID: C125716C0050FB51-421249855453568AC125770B0045FA04-WeidenbachWischnewskiAICom10},
PUBLISHER = {IOS Press},
ADDRESS = {Amsterdam},
YEAR = {2010},
DATE = {2010},
JOURNAL = {AI Communications},
VOLUME = {23},
NUMBER = {2-3},
PAGES = {97--109},
}

Endnote

%0 Journal Article
%A Weidenbach, Christoph
%A Wischnewski, Patrick
%+ Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T Subterm Contextual Rewriting :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-000F-14BF-1
%F EDOC: 536336
%R 10.3233/AIC-2010-0459
%U http://dx.doi.org/10.3233/AIC-2010-0459
%F OTHER: Local-ID: C125716C0050FB51-421249855453568AC125770B0045FA04-WeidenbachWischnewskiAICom10
%D 2010
%* Review method: peer-reviewed
%J AI Communications
%V 23
%N 2-3
%& 97
%P 97 - 109
%I IOS Press
%C Amsterdam
%@ false

2009

Althaus, E., Kruglov, E., & Weidenbach, C. (2009). Superposition Modulo Linear Arithmetic SUP(LA). In

*Frontiers of Combining Systems (FroCos 2009)*. Trento, Italy: Springer. doi:10.1007/978-3-642-04222-5_5Export

BibTeX

@inproceedings{AlthausEtAlFrocos2009,
TITLE = {Superposition Modulo Linear Arithmetic {SUP(LA)}},
AUTHOR = {Althaus, Ernst and Kruglov, Evgeny and Weidenbach, Christoph},
LANGUAGE = {eng},
DOI = {10.1007/978-3-642-04222-5_5},
LOCALID = {Local-ID: C125716C0050FB51-63E91C2AD1A898ABC125762A004A746E-AlthausEtAlFrocos2009},
PUBLISHER = {Springer},
YEAR = {2009},
DATE = {2009},
BOOKTITLE = {Frontiers of Combining Systems (FroCos 2009)},
EDITOR = {Ghilardi, Silvio and Sebastiani, Roberto},
PAGES = {84--99},
SERIES = {Lecture Notes in Artificial Intelligence},
VOLUME = {5749},
ADDRESS = {Trento, Italy},
}

Endnote

%0 Conference Proceedings
%A Althaus, Ernst
%A Kruglov, Evgeny
%A Weidenbach, Christoph
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T Superposition Modulo Linear Arithmetic SUP(LA) :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-000F-1A73-8
%F EDOC: 521101
%F OTHER: Local-ID: C125716C0050FB51-63E91C2AD1A898ABC125762A004A746E-AlthausEtAlFrocos2009
%R 10.1007/978-3-642-04222-5_5
%D 2009
%B 7th international Symposium on Frontiers of Combining Systems
%Z date of event: 2009-09-16 - 2009-09-18
%C Trento, Italy
%B Frontiers of Combining Systems
%E Ghilardi, Silvio; Sebastiani, Roberto
%P 84 - 99
%I Springer
%B Lecture Notes in Artificial Intelligence
%N 5749

Baumgartner, P., & Waldmann, U. (2009). Superposition and Model Evolution Combined. In

*Automated Deduction, CADE-22, 22nd International Conference on Automated Deduction*. Springer. doi:10.1007/978-3-642-02959-2_2Abstract

We present a new calculus for first-order theorem proving with equality,
ME+Sup, which generalizes both the Superposition calculus and the Model
Evolution calculus (with equality) by integrating their inference rules and
redundancy criteria in a non-trivial way. The main motivation is to combine the
advantageous features of both---rather complementary---calculi in a single
framework. For instance, Model Evolution, as a lifted version of the
propositional DPLL procedure, contributes a non-ground splitting rule that
effectively permits to split a clause into non variable disjoint subclauses. In
the paper we present the calculus in detail. Our main result is its
completeness under semantically justified redundancy criteria and
simplification rules.

Export

BibTeX

@inproceedings{BaumgartnerWaldmann2009CADE,
TITLE = {Superposition and Model Evolution Combined},
AUTHOR = {Baumgartner, Peter and Waldmann, Uwe},
LANGUAGE = {eng},
ISBN = {3-642-02958-2},
DOI = {10.1007/978-3-642-02959-2_2},
LOCALID = {Local-ID: C125716C0050FB51-92B160DE1648AAE5C125761C0065FC7C-BaumgartnerWaldmann2009CADE},
PUBLISHER = {Springer},
YEAR = {2009},
DATE = {2009},
ABSTRACT = {We present a new calculus for first-order theorem proving with equality, ME+Sup, which generalizes both the Superposition calculus and the Model Evolution calculus (with equality) by integrating their inference rules and redundancy criteria in a non-trivial way. The main motivation is to combine the advantageous features of both---rather complementary---calculi in a single framework. For instance, Model Evolution, as a lifted version of the propositional DPLL procedure, contributes a non-ground splitting rule that effectively permits to split a clause into non variable disjoint subclauses. In the paper we present the calculus in detail. Our main result is its completeness under semantically justified redundancy criteria and simplification rules.},
BOOKTITLE = {Automated Deduction, CADE-22, 22nd International Conference on Automated Deduction},
EDITOR = {Schmidt, Renate A.},
PAGES = {17--34},
SERIES = {Lecture Notes in Artificial Intelligence},
}

Endnote

%0 Conference Proceedings
%A Baumgartner, Peter
%A Waldmann, Uwe
%+ Automation of Logic, MPI for Informatics, Max Planck Society
%T Superposition and Model Evolution Combined :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-000F-1A6C-9
%F EDOC: 521103
%R 10.1007/978-3-642-02959-2_2
%F OTHER: Local-ID: C125716C0050FB51-92B160DE1648AAE5C125761C0065FC7C-BaumgartnerWaldmann2009CADE
%D 2009
%B Untitled Event
%Z date of event: 2009-08-02 - 2009-08-07
%C Montreal, Canada
%X We present a new calculus for first-order theorem proving with equality,
ME+Sup, which generalizes both the Superposition calculus and the Model
Evolution calculus (with equality) by integrating their inference rules and
redundancy criteria in a non-trivial way. The main motivation is to combine the
advantageous features of both---rather complementary---calculi in a single
framework. For instance, Model Evolution, as a lifted version of the
propositional DPLL procedure, contributes a non-ground splitting rule that
effectively permits to split a clause into non variable disjoint subclauses. In
the paper we present the calculus in detail. Our main result is its
completeness under semantically justified redundancy criteria and
simplification rules.
%B Automated Deduction, CADE-22, 22nd International Conference on Automated Deduction
%E Schmidt, Renate A.
%P 17 - 34
%I Springer
%@ 3-642-02958-2
%B Lecture Notes in Artificial Intelligence

Dimova, D. (2009).

*On the Translation of Timed Automata into First-order Logic*. Universität des Saarlandes, Saarbrücken.Export

BibTeX

@mastersthesis{Dimova09,
TITLE = {On the Translation of Timed Automata into First-order Logic},
AUTHOR = {Dimova, Dilyana},
LANGUAGE = {eng},
LOCALID = {Local-ID: C125716C0050FB51-EEB120213787E56EC125761E0046D1EF-Dimova09},
SCHOOL = {Universit{\"a}t des Saarlandes},
ADDRESS = {Saarbr{\"u}cken},
YEAR = {2009},
DATE = {2009},
}

Endnote

%0 Thesis
%A Dimova, Dilyana
%+ Automation of Logic, MPI for Informatics, Max Planck Society
%T On the Translation of Timed Automata into First-order Logic :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-000F-1A64-A
%F EDOC: 521090
%F OTHER: Local-ID: C125716C0050FB51-EEB120213787E56EC125761E0046D1EF-Dimova09
%I Universität des Saarlandes
%C Saarbrücken
%D 2009
%V master
%9 master

Dreßler, C. (2009).

*Automatic Analysis of Tree-Based Feature Models with SPASS*. Universität des Saarlandes, Saarbrücken.Export

BibTeX

@mastersthesis{Dressler09,
TITLE = {Automatic Analysis of Tree-Based Feature Models with {SPASS}},
AUTHOR = {Dre{\ss}ler, Christian},
LANGUAGE = {eng},
LOCALID = {Local-ID: C125716C0050FB51-9E84B48A6F3365D0C125761E00465569-Dreßler09},
SCHOOL = {Universit{\"a}t des Saarlandes},
ADDRESS = {Saarbr{\"u}cken},
YEAR = {2009},
DATE = {2009},
}

Endnote

%0 Thesis
%A Dreßler, Christian
%+ Automation of Logic, MPI for Informatics, Max Planck Society
%T Automatic Analysis of Tree-Based Feature Models with SPASS :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-000F-1A44-1
%F EDOC: 521088
%F OTHER: Local-ID: C125716C0050FB51-9E84B48A6F3365D0C125761E00465569-Dreßler09
%I Universität des Saarlandes
%C Saarbrücken
%D 2009
%V master
%9 master

Fietzke, A., & Weidenbach, C. (2009). Labelled Splitting.

*Annals of Mathematics and Artificial Intelligence*,*55*(1-2). doi:10.1007/s10472-009-9150-9Export

BibTeX

@article{FietzkeWeidenbach09,
TITLE = {Labelled Splitting},
AUTHOR = {Fietzke, Arnaud and Weidenbach, Christoph},
LANGUAGE = {eng},
ISSN = {1012-2443},
DOI = {10.1007/s10472-009-9150-9},
LOCALID = {Local-ID: C125716C0050FB51-50A4618C20F819F4C1257638004B9368-FietzkeWeidenbach09},
PUBLISHER = {J.C. Baltzer},
ADDRESS = {Basel, Switzerland},
YEAR = {2009},
DATE = {2009},
JOURNAL = {Annals of Mathematics and Artificial Intelligence},
VOLUME = {55},
NUMBER = {1-2},
PAGES = {3--33},
}

Endnote

%0 Journal Article
%A Fietzke, Arnaud
%A Weidenbach, Christoph
%+ Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T Labelled Splitting :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-000F-1A60-1
%F EDOC: 521095
%F OTHER: Local-ID: C125716C0050FB51-50A4618C20F819F4C1257638004B9368-FietzkeWeidenbach09
%R 10.1007/s10472-009-9150-9
%D 2009
%* Review method: peer-reviewed
%J Annals of Mathematics and Artificial Intelligence
%V 55
%N 1-2
%& 3
%P 3 - 33
%I J.C. Baltzer
%C Basel, Switzerland
%@ false

Horbach, M., & Weidenbach, C. (2009a).

*Decidability Results for Saturation-based Model Building*(No. MPI-I-2009-RG1-004). Saarbrücken: Max-Planck-Institut für Informatik. Retrieved from http://domino.mpi-inf.mpg.de/internet/reports.nsf/NumberView/2009-RG1-004Abstract

Saturation-based calculi such as superposition can be
successfully instantiated to decision procedures for many decidable
fragments of first-order logic. In case of termination without
generating an empty clause, a saturated clause set implicitly represents
a minimal model for all clauses, based on the underlying term ordering
of the superposition calculus. In general, it is not decidable whether a
ground atom, a clause or even a formula holds in this minimal model of a
satisfiable saturated clause set.
Based on an extension of our superposition calculus for fixed domains
with syntactic disequality constraints in a non-equational setting, we
describe models given by ARM (Atomic Representations of term Models) or
DIG (Disjunctions of Implicit Generalizations) representations as
minimal models of finite saturated clause sets. This allows us to
present several new decidability results for validity in such models.
These results extend in particular the known decidability results for
ARM and DIG representations.

Export

BibTeX

@techreport{HorbachWeidenbach2010,
TITLE = {Decidability Results for Saturation-based Model Building},
AUTHOR = {Horbach, Matthias and Weidenbach, Christoph},
LANGUAGE = {eng},
ISSN = {0946-011X},
URL = {http://domino.mpi-inf.mpg.de/internet/reports.nsf/NumberView/2009-RG1-004},
NUMBER = {MPI-I-2009-RG1-004},
INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
ADDRESS = {Saarbr{\"u}cken},
YEAR = {2009},
DATE = {2009},
ABSTRACT = {Saturation-based calculi such as superposition can be successfully instantiated to decision procedures for many decidable fragments of first-order logic. In case of termination without generating an empty clause, a saturated clause set implicitly represents a minimal model for all clauses, based on the underlying term ordering of the superposition calculus. In general, it is not decidable whether a ground atom, a clause or even a formula holds in this minimal model of a satisfiable saturated clause set. Based on an extension of our superposition calculus for fixed domains with syntactic disequality constraints in a non-equational setting, we describe models given by ARM (Atomic Representations of term Models) or DIG (Disjunctions of Implicit Generalizations) representations as minimal models of finite saturated clause sets. This allows us to present several new decidability results for validity in such models. These results extend in particular the known decidability results for ARM and DIG representations.},
TYPE = {Research Report},
}

Endnote

%0 Report
%A Horbach, Matthias
%A Weidenbach, Christoph
%+ Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T Decidability Results for Saturation-based Model Building :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0014-6659-B
%U http://domino.mpi-inf.mpg.de/internet/reports.nsf/NumberView/2009-RG1-004
%Y Max-Planck-Institut für Informatik
%C Saarbrücken
%D 2009
%P 38 p.
%X Saturation-based calculi such as superposition can be
successfully instantiated to decision procedures for many decidable
fragments of first-order logic. In case of termination without
generating an empty clause, a saturated clause set implicitly represents
a minimal model for all clauses, based on the underlying term ordering
of the superposition calculus. In general, it is not decidable whether a
ground atom, a clause or even a formula holds in this minimal model of a
satisfiable saturated clause set.
Based on an extension of our superposition calculus for fixed domains
with syntactic disequality constraints in a non-equational setting, we
describe models given by ARM (Atomic Representations of term Models) or
DIG (Disjunctions of Implicit Generalizations) representations as
minimal models of finite saturated clause sets. This allows us to
present several new decidability results for validity in such models.
These results extend in particular the known decidability results for
ARM and DIG representations.
%B Research Report
%@ false

Horbach, M., & Weidenbach, C. (2009b). Deciding the Inductive Validity of FOR ALL THERE EXISTS * Queries. In

*CSL*. Springer.Export

BibTeX

@inproceedings{HorbachWeidenbachCSL09,
TITLE = {Deciding the Inductive Validity of {FOR} {ALL} {THERE} {EXISTS} * Queries},
AUTHOR = {Horbach, Matthias and Weidenbach, Christoph},
LANGUAGE = {eng},
LOCALID = {Local-ID: C125716C0050FB51-3FC412B69BC2B8D5C1257658004A1BA8-HorbachWeidenbachCSL09},
PUBLISHER = {Springer},
YEAR = {2009},
DATE = {2009},
BOOKTITLE = {CSL},
PAGES = {332--347},
SERIES = {Lecture Notes in Computer Science},
}

Endnote

%0 Conference Proceedings
%A Horbach, Matthias
%A Weidenbach, Christoph
%+ Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T Deciding the Inductive Validity of FOR ALL THERE EXISTS * Queries :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-000F-1A53-0
%F EDOC: 521097
%F OTHER: Local-ID: C125716C0050FB51-3FC412B69BC2B8D5C1257658004A1BA8-HorbachWeidenbachCSL09
%D 2009
%B Untitled Event
%Z date of event: 2009-09-07 - 2009-09-11
%C Coimbra, Portugal
%B CSL
%P 332 - 347
%I Springer
%B Lecture Notes in Computer Science

Horbach, M., & Weidenbach, C. (2009c).

*Deciding the Inductive Validity of Forall Exists* Queries*(No. MPI-I-2009-RG1-001).Abstract

We present a new saturation-based decidability result for inductive validity.
Let $\Sigma$ be a finite signature in which all function symbols are at most
unary and let $N$ be a satisfiable Horn clause set without equality in which
all positive literals are linear.
If $N\cup\{A_1,\ldots,A_n\rightarrow\}$ belongs to a finitely saturating clause
class, then it is decidable whether a sentence of the form $\forall\exists^*
(A_1\wedge\ldots\wedge A_n)$ is valid in the minimal model of $N$.

Export

BibTeX

@techreport{HorbachWeidenbach2009,
TITLE = {Deciding the Inductive Validity of Forall Exists* Queries},
AUTHOR = {Horbach, Matthias and Weidenbach, Christoph},
LANGUAGE = {eng},
NUMBER = {MPI-I-2009-RG1-001},
LOCALID = {Local-ID: C125716C0050FB51-F9BA0666A42B8463C12576AF002882D7-Horbach2009TR1},
YEAR = {2009},
DATE = {2009},
ABSTRACT = {We present a new saturation-based decidability result for inductive validity. Let $\Sigma$ be a finite signature in which all function symbols are at most unary and let $N$ be a satisfiable Horn clause set without equality in which all positive literals are linear. If $N\cup\{A_1,\ldots,A_n\rightarrow\}$ belongs to a finitely saturating clause class, then it is decidable whether a sentence of the form $\forall\exists^* (A_1\wedge\ldots\wedge A_n)$ is valid in the minimal model of $N$.},
}

Endnote

%0 Report
%A Horbach, Matthias
%A Weidenbach, Christoph
%+ Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T Deciding the Inductive Validity of Forall Exists* Queries :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-000F-1A51-3
%F EDOC: 521099
%F OTHER: Local-ID: C125716C0050FB51-F9BA0666A42B8463C12576AF002882D7-Horbach2009TR1
%D 2009
%X We present a new saturation-based decidability result for inductive validity.
Let $\Sigma$ be a finite signature in which all function symbols are at most
unary and let $N$ be a satisfiable Horn clause set without equality in which
all positive literals are linear.
If $N\cup\{A_1,\ldots,A_n\rightarrow\}$ belongs to a finitely saturating clause
class, then it is decidable whether a sentence of the form $\forall\exists^*
(A_1\wedge\ldots\wedge A_n)$ is valid in the minimal model of $N$.

Horbach, M., & Weidenbach, C. (2009d).

*Superposition for Fixed Domains*(No. MPI-I-2009-RG1-005). Saarbrücken: Max-Planck-Institut für Informatik.Abstract

Superposition is an established decision procedure for a variety of first-order
logic theories represented by sets of clauses. A satisfiable theory, saturated
by superposition, implicitly defines a minimal term-generated model for the
theory.
Proving universal properties with respect to a saturated theory directly leads
to a modification of the minimal model's term-generated domain, as new Skolem
functions are introduced. For many applications, this is not desired.
Therefore, we propose the first superposition calculus that can explicitly
represent existentially quantified variables and can thus compute with respect
to a given domain. This calculus is sound and refutationally complete in the
limit for a first-order fixed domain semantics.
For saturated Horn theories and classes of positive formulas, we can even
employ the calculus to prove properties of the minimal model itself, going
beyond the scope of known superposition-based approaches.

Export

BibTeX

@techreport{Horbach2009TR2,
TITLE = {Superposition for Fixed Domains},
AUTHOR = {Horbach, Matthias and Weidenbach, Christoph},
LANGUAGE = {eng},
ISSN = {0946-011X},
NUMBER = {MPI-I-2009-RG1-005},
LOCALID = {Local-ID: C125716C0050FB51-5DDBBB1B134360CFC12576AF0028D299-Horbach2009TR2},
INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
ADDRESS = {Saarbr{\"u}cken},
YEAR = {2009},
DATE = {2009},
ABSTRACT = {Superposition is an established decision procedure for a variety of first-order logic theories represented by sets of clauses. A satisfiable theory, saturated by superposition, implicitly defines a minimal term-generated model for the theory. Proving universal properties with respect to a saturated theory directly leads to a modification of the minimal model's term-generated domain, as new Skolem functions are introduced. For many applications, this is not desired. Therefore, we propose the first superposition calculus that can explicitly represent existentially quantified variables and can thus compute with respect to a given domain. This calculus is sound and refutationally complete in the limit for a first-order fixed domain semantics. For saturated Horn theories and classes of positive formulas, we can even employ the calculus to prove properties of the minimal model itself, going beyond the scope of known superposition-based approaches.},
TYPE = {Research Report},
}

Endnote

%0 Report
%A Horbach, Matthias
%A Weidenbach, Christoph
%+ Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T Superposition for Fixed Domains :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-000F-1A71-C
%F EDOC: 521100
%F OTHER: Local-ID: C125716C0050FB51-5DDBBB1B134360CFC12576AF0028D299-Horbach2009TR2
%Y Max-Planck-Institut für Informatik
%C Saarbrücken
%D 2009
%P 49 p.
%X Superposition is an established decision procedure for a variety of first-order
logic theories represented by sets of clauses. A satisfiable theory, saturated
by superposition, implicitly defines a minimal term-generated model for the
theory.
Proving universal properties with respect to a saturated theory directly leads
to a modification of the minimal model's term-generated domain, as new Skolem
functions are introduced. For many applications, this is not desired.
Therefore, we propose the first superposition calculus that can explicitly
represent existentially quantified variables and can thus compute with respect
to a given domain. This calculus is sound and refutationally complete in the
limit for a first-order fixed domain semantics.
For saturated Horn theories and classes of positive formulas, we can even
employ the calculus to prove properties of the minimal model itself, going
beyond the scope of known superposition-based approaches.
%B Research Report
%@ false

Horbach, M., & Weidenbach, C. (2009e). Decidability Results for Saturation-Based Model Building. In

*22nd International Conference on Automated Deduction (CADE-22)*. Springer.Abstract

Saturation-based calculi such as superposition can be successfully instantiated
to decision procedures for many decidable fragments of first-order logic. In
case of termination without generating an empty clause, a saturated clause set
implicitly represents a minimal model for all clauses, based on the underlying
term ordering of the superposition calculus. In general, it is not decidable
whether a ground atom, a clause or even a formula holds in this minimal model
of a satisfiable saturated clause set.
We extend our superposition calculus for fixed domains with syntactic
disequality constraints in a non-equational setting. Based on this calculus, we
present several new decidability results for validity in the minimal model of a
satisfiable finitely saturated clause set that in particular extend the
decidability results known for ARM (Atomic Representations of term Models) and
DIG (Disjunctions of Implicit Generalizations) model representations.

Export

BibTeX

@inproceedings{HorbachWeidenbach2009CADE,
TITLE = {Decidability Results for Saturation-Based Model Building},
AUTHOR = {Horbach, Matthias and Weidenbach, Christoph},
LANGUAGE = {eng},
LOCALID = {Local-ID: C125716C0050FB51-960E286C41E4B7F4C12575A20036CB2F-HorbachWeidenbach2009CADE},
PUBLISHER = {Springer},
YEAR = {2009},
DATE = {2009},
ABSTRACT = {Saturation-based calculi such as superposition can be successfully instantiated to decision procedures for many decidable fragments of first-order logic. In case of termination without generating an empty clause, a saturated clause set implicitly represents a minimal model for all clauses, based on the underlying term ordering of the superposition calculus. In general, it is not decidable whether a ground atom, a clause or even a formula holds in this minimal model of a satisfiable saturated clause set. We extend our superposition calculus for fixed domains with syntactic disequality constraints in a non-equational setting. Based on this calculus, we present several new decidability results for validity in the minimal model of a satisfiable finitely saturated clause set that in particular extend the decidability results known for ARM (Atomic Representations of term Models) and DIG (Disjunctions of Implicit Generalizations) model representations.},
BOOKTITLE = {22nd International Conference on Automated Deduction (CADE-22)},
EDITOR = {Schmidt, Renate},
PAGES = {404--420},
SERIES = {Lecture Notes in Computer Science},
}

Endnote

%0 Conference Proceedings
%A Horbach, Matthias
%A Weidenbach, Christoph
%+ Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T Decidability Results for Saturation-Based Model Building :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-000F-1A4E-D
%F EDOC: 521087
%F OTHER: Local-ID: C125716C0050FB51-960E286C41E4B7F4C12575A20036CB2F-HorbachWeidenbach2009CADE
%D 2009
%B Untitled Event
%Z date of event: 2009-08-02 - 2009-08-07
%C Montreal, Canada
%X Saturation-based calculi such as superposition can be successfully instantiated
to decision procedures for many decidable fragments of first-order logic. In
case of termination without generating an empty clause, a saturated clause set
implicitly represents a minimal model for all clauses, based on the underlying
term ordering of the superposition calculus. In general, it is not decidable
whether a ground atom, a clause or even a formula holds in this minimal model
of a satisfiable saturated clause set.
We extend our superposition calculus for fixed domains with syntactic
disequality constraints in a non-equational setting. Based on this calculus, we
present several new decidability results for validity in the minimal model of a
satisfiable finitely saturated clause set that in particular extend the
decidability results known for ARM (Atomic Representations of term Models) and
DIG (Disjunctions of Implicit Generalizations) model representations.
%B 22nd International Conference on Automated Deduction (CADE-22)
%E Schmidt, Renate
%P 404 - 420
%I Springer
%B Lecture Notes in Computer Science

Ihlemann, C., & Sofronie-Stokkermans, V. (2009). System Description: H-PILoT. In

*Automated Deduction - CADE-22*. Montreal, Canada: Springer. doi:10.1007/978-3-642-02959-2_9Abstract

H-PILoT (Hierarchical Proving by Instantiation in Local Theory extensions)
is a program for hierarchical reasoning in extensions of logical theories with
additional functions axiomatized by a set of (universally quantified) clauses:
deduction problems in the theory extension are reduced to deduction problems
in the base theory. Specialized provers, as well as standard SMT solvers, are
then used for testing the satisfiability of the formulae obtained after the
reduction. The hierarchical reduction used in H-PILoT is always sound; it
is complete for the class of so-called local extensions of a base theory.
If the clauses obtained by this reduction belong to a fragment decidable in
the base theory, H-PILoT provides a decision procedure for testing
satisfiability of ground formulae w.r.t.\ a theory extension, and can also
be used for model generation. This is the major advantage of H-PILoT compared
with other state-of-the art SMT solvers. H-PILoT can alternatively be used as
a tool for ``steering'' the instantiation mechanism of standard SMT provers,
in order to provide decision procedures in the case of local theory extensions.
This system description provides an overview of H-PILoT and illustrates on
some examples the main advantage of using H-PILoT for satisfiability
checking in local extensions, in comparison with the performance of general
state of the art SMT-provers.

Export

BibTeX

@inproceedings{hpilot2009,
TITLE = {System Description: {H-PILoT}},
AUTHOR = {Ihlemann, Carsten and Sofronie-Stokkermans, Viorica},
LANGUAGE = {eng},
ISSN = {0302-9743},
ISBN = {978-3-642-02958-5},
DOI = {10.1007/978-3-642-02959-2_9},
LOCALID = {Local-ID: C125716C0050FB51-4D901D8754AEDFA9C12575A0003BDE0D-hpilot2009},
PUBLISHER = {Springer},
YEAR = {2009},
DATE = {2009},
ABSTRACT = {H-PILoT (Hierarchical Proving by Instantiation in Local Theory extensions) is a program for hierarchical reasoning in extensions of logical theories with additional functions axiomatized by a set of (universally quantified) clauses: deduction problems in the theory extension are reduced to deduction problems in the base theory. Specialized provers, as well as standard SMT solvers, are then used for testing the satisfiability of the formulae obtained after the reduction. The hierarchical reduction used in H-PILoT is always sound; it is complete for the class of so-called local extensions of a base theory. If the clauses obtained by this reduction belong to a fragment decidable in the base theory, H-PILoT provides a decision procedure for testing satisfiability of ground formulae w.r.t.\ a theory extension, and can also be used for model generation. This is the major advantage of H-PILoT compared with other state-of-the art SMT solvers. H-PILoT can alternatively be used as a tool for ``steering'' the instantiation mechanism of standard SMT provers, in order to provide decision procedures in the case of local theory extensions. This system description provides an overview of H-PILoT and illustrates on some examples the main advantage of using H-PILoT for satisfiability checking in local extensions, in comparison with the performance of general state of the art SMT-provers.},
BOOKTITLE = {Automated Deduction -- CADE-22},
EDITOR = {Schmidt, Renate},
PAGES = {131--139},
SERIES = {Lecture Notes in Artificial Intelligence},
VOLUME = {5663},
ADDRESS = {Montreal, Canada},
}

Endnote

%0 Conference Proceedings
%A Ihlemann, Carsten
%A Sofronie-Stokkermans, Viorica
%+ Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T System Description: H-PILoT :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-000F-1A75-4
%F EDOC: 521092
%F OTHER: Local-ID: C125716C0050FB51-4D901D8754AEDFA9C12575A0003BDE0D-hpilot2009
%R 10.1007/978-3-642-02959-2_9
%D 2009
%B 22nd International Conference on Automated Deduction
%Z date of event: 2009-08-02 - 2009-08-07
%C Montreal, Canada
%X H-PILoT (Hierarchical Proving by Instantiation in Local Theory extensions)
is a program for hierarchical reasoning in extensions of logical theories with
additional functions axiomatized by a set of (universally quantified) clauses:
deduction problems in the theory extension are reduced to deduction problems
in the base theory. Specialized provers, as well as standard SMT solvers, are
then used for testing the satisfiability of the formulae obtained after the
reduction. The hierarchical reduction used in H-PILoT is always sound; it
is complete for the class of so-called local extensions of a base theory.
If the clauses obtained by this reduction belong to a fragment decidable in
the base theory, H-PILoT provides a decision procedure for testing
satisfiability of ground formulae w.r.t.\ a theory extension, and can also
be used for model generation. This is the major advantage of H-PILoT compared
with other state-of-the art SMT solvers. H-PILoT can alternatively be used as
a tool for ``steering'' the instantiation mechanism of standard SMT provers,
in order to provide decision procedures in the case of local theory extensions.
This system description provides an overview of H-PILoT and illustrates on
some examples the main advantage of using H-PILoT for satisfiability
checking in local extensions, in comparison with the performance of general
state of the art SMT-provers.
%B Automated Deduction - CADE-22
%E Schmidt, Renate
%P 131 - 139
%I Springer
%@ 978-3-642-02958-5
%B Lecture Notes in Artificial Intelligence
%N 5663
%@ false

Jacobs, S. (2009). Incremental Instance Generation in Local Reasoning. In

*Computer Aided Verification (CAV 2009)*. Grenoble, France: Springer. doi:10.1007/978-3-642-02658-4_29Abstract

Many verification approaches use SMT solvers in some form, and are limited by
their incomplete handling of quantified formulas. Local reasoning allows to
handle SMT problems involving a certain class of
universally quantified formulas in a complete way by instantiation to a finite
set of ground formulas. We present a method to generate these instances
incrementally, in order to provide a more efficient way of solving these
satisfiability problems. The incremental instantiation is guided semantically,
inspired by the instance generation approach to first-order theorem proving. Our
method is sound and complete, and terminates on both satisfiable and
unsatisfiable input after generating a subset of the instances needed in
standard local reasoning. Experimental results show that for a large class of
examples the incremental approach is substantially more efficient than eager
generation of all instances.

Export

BibTeX

@inproceedings{Jacobs2009,
TITLE = {Incremental Instance Generation in Local Reasoning},
AUTHOR = {Jacobs, Swen},
LANGUAGE = {eng},
DOI = {10.1007/978-3-642-02658-4_29},
LOCALID = {Local-ID: C125716C0050FB51-F509A9DD2C874B41C1257583002A503E-Jacobs2009},
PUBLISHER = {Springer},
YEAR = {2009},
DATE = {2009},
ABSTRACT = {Many verification approaches use SMT solvers in some form, and are limited by their incomplete handling of quantified formulas. Local reasoning allows to handle SMT problems involving a certain class of universally quantified formulas in a complete way by instantiation to a finite set of ground formulas. We present a method to generate these instances incrementally, in order to provide a more efficient way of solving these satisfiability problems. The incremental instantiation is guided semantically, inspired by the instance generation approach to first-order theorem proving. Our method is sound and complete, and terminates on both satisfiable and unsatisfiable input after generating a subset of the instances needed in standard local reasoning. Experimental results show that for a large class of examples the incremental approach is substantially more efficient than eager generation of all instances.},
BOOKTITLE = {Computer Aided Verification (CAV 2009)},
EDITOR = {Bouajjani, Ahmed and Maler, Oded},
PAGES = {368--382},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {5643},
ADDRESS = {Grenoble, France},
}

Endnote

%0 Conference Proceedings
%A Jacobs, Swen
%+ Automation of Logic, MPI for Informatics, Max Planck Society
%T Incremental Instance Generation in Local Reasoning :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-000F-1A5C-D
%F EDOC: 521107
%F OTHER: Local-ID: C125716C0050FB51-F509A9DD2C874B41C1257583002A503E-Jacobs2009
%R 10.1007/978-3-642-02658-4_29
%D 2009
%B CAV 2009
%Z date of event: 2009-06-29 - 2009-07-02
%C Grenoble, France
%X Many verification approaches use SMT solvers in some form, and are limited by
their incomplete handling of quantified formulas. Local reasoning allows to
handle SMT problems involving a certain class of
universally quantified formulas in a complete way by instantiation to a finite
set of ground formulas. We present a method to generate these instances
incrementally, in order to provide a more efficient way of solving these
satisfiability problems. The incremental instantiation is guided semantically,
inspired by the instance generation approach to first-order theorem proving. Our
method is sound and complete, and terminates on both satisfiable and
unsatisfiable input after generating a subset of the instances needed in
standard local reasoning. Experimental results show that for a large class of
examples the incremental approach is substantially more efficient than eager
generation of all instances.
%B Computer Aided Verification
%E Bouajjani, Ahmed; Maler, Oded
%P 368 - 382
%I Springer
%B Lecture Notes in Computer Science
%N 5643

Lamotte-Schubert, M., & Weidenbach, C. (2009a). Analysis of Authorizations in SAP R/3. In

*Proceedings of the 7th International Workshop on First-Order Theorem Proving (FTP’09)*. Oslo, Norway.Abstract

Today many companies use an ERP (Enterprise Resource Planning) system such as
SAP R/3 to run their daily business ranging from financial issues down to the
actual control of a production line. Already due to their sheer size, these
systems are very complex. In particular, developing and maintaining the
authorization setup is a challenge. The goal of our effort is to automatically
analyze the authorization setup of an SAP R/3 system against business policies.
To this end we formalize the processes, authorization setup as well as the
business policies in first-order logic. Then, properties can be (dis)proven
fully automatically with our theorem prover Spass. We exemplify our approach
on the purchase process, a typical constituent of any SAP R/3 installation.

Export

BibTeX

@inproceedings{Lamotte-SchubertWeidenbachFTP09CEUR,
TITLE = {Analysis of Authorizations in {SAP R/3}},
AUTHOR = {Lamotte-Schubert, Manuel and Weidenbach, Christoph},
LANGUAGE = {eng},
ISSN = {1613-0073},
LOCALID = {Local-ID: C125716C0050FB51-8152CA6AC59E2010C12576BD0028CDDE-Lamotte-SchubertWeidenbachFTP09CEUR},
YEAR = {2009},
DATE = {2009},
ABSTRACT = {Today many companies use an ERP (Enterprise Resource Planning) system such as SAP R/3 to run their daily business ranging from financial issues down to the actual control of a production line. Already due to their sheer size, these systems are very complex. In particular, developing and maintaining the authorization setup is a challenge. The goal of our effort is to automatically analyze the authorization setup of an SAP R/3 system against business policies. To this end we formalize the processes, authorization setup as well as the business policies in first-order logic. Then, properties can be (dis)proven fully automatically with our theorem prover Spass. We exemplify our approach on the purchase process, a typical constituent of any SAP R/3 installation.},
BOOKTITLE = {Proceedings of the 7th International Workshop on First-Order Theorem Proving (FTP'09)},
PAGES = {90--104},
SERIES = {CEUR Workshop Proceedings},
VOLUME = {556},
ADDRESS = {Oslo, Norway},
}

Endnote

%0 Conference Proceedings
%A Lamotte-Schubert, Manuel
%A Weidenbach, Christoph
%+ Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T Analysis of Authorizations in SAP R/3 :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-000F-1A3F-F
%F EDOC: 521083
%F OTHER: Local-ID: C125716C0050FB51-8152CA6AC59E2010C12576BD0028CDDE-Lamotte-SchubertWeidenbachFTP09CEUR
%D 2009
%B FTP 2009
%Z date of event: 2009-07-06 - 2009-07-07
%C Oslo, Norway
%X Today many companies use an ERP (Enterprise Resource Planning) system such as
SAP R/3 to run their daily business ranging from financial issues down to the
actual control of a production line. Already due to their sheer size, these
systems are very complex. In particular, developing and maintaining the
authorization setup is a challenge. The goal of our effort is to automatically
analyze the authorization setup of an SAP R/3 system against business policies.
To this end we formalize the processes, authorization setup as well as the
business policies in first-order logic. Then, properties can be (dis)proven
fully automatically with our theorem prover Spass. We exemplify our approach
on the purchase process, a typical constituent of any SAP R/3 installation.
%B Proceedings of the 7th International Workshop on First-Order Theorem Proving (FTP'09)
%P 90 - 104
%B CEUR Workshop Proceedings
%N 556
%@ false

Lamotte-Schubert, M., & Weidenbach, C. (2009b). Analysis of Authorizations in SAP R/3. In

*FTP 2009 Workshop Proceedings*.Abstract

Today many companies use an ERP (Enterprise Resource Planning) system
such as SAP R/3~to run their daily business ranging from
financial issues down to the actual control of a production line.
Already due to their sheer size, these systems are very complex.
In particular, developing and maintaining the authorization setup
is a challenge.
The goal of our effort is to automatically analyze the authorization
setup of an SAP R/3~system against business policies.
To this end we formalize the processes, authorization setup
as well as the business policies
in first-order logic. Then, properties can be (dis)proven fully automatically
with our theorem prover \textsc{Spass}. We exemplify our approach
on the purchase process, a typical constituent of any SAP R/3~installation.

Export

BibTeX

@inproceedings{Lamotte-SchubertWeidenbachFTP09,
TITLE = {Analysis of Authorizations in {SAP} R/3},
AUTHOR = {Lamotte-Schubert, Manuel and Weidenbach, Christoph},
LANGUAGE = {eng},
ISBN = {82-7368-347-8},
LOCALID = {Local-ID: C125716C0050FB51-ED45C8048F046139C125762A00455D7F-Lamotte-SchubertWeidenbachFTP09},
YEAR = {2009},
DATE = {2009},
ABSTRACT = {Today many companies use an ERP (Enterprise Resource Planning) system such as SAP R/3~to run their daily business ranging from financial issues down to the actual control of a production line. Already due to their sheer size, these systems are very complex. In particular, developing and maintaining the authorization setup is a challenge. The goal of our effort is to automatically analyze the authorization setup of an SAP R/3~system against business policies. To this end we formalize the processes, authorization setup as well as the business policies in first-order logic. Then, properties can be (dis)proven fully automatically with our theorem prover \textsc{Spass}. We exemplify our approach on the purchase process, a typical constituent of any SAP R/3~installation.},
BOOKTITLE = {FTP 2009 Workshop Proceedings},
PAGES = {90--104},
SERIES = {University Oslo Research Report},
}

Endnote

%0 Conference Proceedings
%A Lamotte-Schubert, Manuel
%A Weidenbach, Christoph
%+ Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T Analysis of Authorizations in SAP R/3 :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-000F-1A42-5
%F EDOC: 521084
%F OTHER: Local-ID: C125716C0050FB51-ED45C8048F046139C125762A00455D7F-Lamotte-SchubertWeidenbachFTP09
%D 2009
%B Untitled Event
%Z date of event: 2009-07-06 - 2009-07-07
%C Oslo, Norway
%X Today many companies use an ERP (Enterprise Resource Planning) system
such as SAP R/3~to run their daily business ranging from
financial issues down to the actual control of a production line.
Already due to their sheer size, these systems are very complex.
In particular, developing and maintaining the authorization setup
is a challenge.
The goal of our effort is to automatically analyze the authorization
setup of an SAP R/3~system against business policies.
To this end we formalize the processes, authorization setup
as well as the business policies
in first-order logic. Then, properties can be (dis)proven fully automatically
with our theorem prover \textsc{Spass}. We exemplify our approach
on the purchase process, a typical constituent of any SAP R/3~installation.
%B FTP 2009 Workshop Proceedings
%P 90 - 104
%@ 82-7368-347-8
%B University Oslo Research Report

Lee, C. S. (2009). Ranking Functions for Size‐change Termination.

*ACM Transactions on Programming Languages and Systems*,*31*(3). doi:10.1145/1498926.1498928Export

BibTeX

@article{Lee2009,
TITLE = {Ranking Functions for Size-change Termination},
AUTHOR = {Lee, Chin Soon},
LANGUAGE = {eng},
ISSN = {0164-0925},
DOI = {10.1145/1498926.1498928},
PUBLISHER = {Association for Computing Machinery, Inc.},
ADDRESS = {New York},
YEAR = {2009},
DATE = {2009},
JOURNAL = {ACM Transactions on Programming Languages and Systems},
VOLUME = {31},
NUMBER = {3},
PAGES = {10:1--10:42},
}

Endnote

%0 Journal Article
%A Lee, Chin Soon
%+ Programming Logics, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T Ranking Functions for Size‐change Termination :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0023-C436-4
%R 10.1145/1498926.1498928
%7 2009
%D 2009
%J ACM Transactions on Programming Languages and Systems
%V 31
%N 3
%& 10:1
%P 10:1 - 10:42
%I Association for Computing Machinery, Inc.
%C New York
%@ false

Lynch, C., Paliath, N., Baader, F., Ghilardi, S., Hermann, M., Sofronie-Stokkermans, V., & Tiwari, A. (Eds.). (2009).

*Joint proceedings of UNIF 2009 (23nd International Workshop on Unification) and ADDCT 2009 (Automated Deduction: Decidability, Complexity, Tractability)*. -.Export

BibTeX

@proceedings{Sofronie-Stokkermans2009-addct-unif,
TITLE = {Joint proceedings of UNIF 2009 (23nd International Workshop on Unification) and ADDCT 2009 (Automated Deduction: Decidability, Complexity, Tractability)},
EDITOR = {Lynch, Christopher and Paliath, Narendran and Baader, Franz and Ghilardi, Silvio and Hermann, Miki and Sofronie-Stokkermans, Viorica and Tiwari, Ashish},
LANGUAGE = {eng},
LOCALID = {Local-ID: C125716C0050FB51-02E3DF72DE53873AC1257624002F0F9C-Sofronie-Stokkermans2009-addct-unif},
PUBLISHER = {-},
YEAR = {1899},
DATE = {2009},
PAGES = {1-87},
}

Endnote

%0 Conference Proceedings
%E Lynch, Christopher
%E Paliath, Narendran
%E Baader, Franz
%E Ghilardi, Silvio
%E Hermann, Miki
%E Sofronie-Stokkermans, Viorica
%E Tiwari, Ashish
%+ Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
External Organizations
External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
%T Joint proceedings of UNIF 2009 (23nd International Workshop on Unification) and ADDCT 2009 (Automated Deduction: Decidability, Complexity, Tractability) :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-000F-1A5E-9
%F EDOC: 521094
%F OTHER: Local-ID: C125716C0050FB51-02E3DF72DE53873AC1257624002F0F9C-Sofronie-Stokkermans2009-addct-unif
%I -
%D 2009
%B Untitled Event
%Z date of event: 1899-12-30 -
%D 1899
%C McGill University, Montreal, Canada
%P 1-87

Peltier, N., & Sofronie-Stokkermans, V. (Eds.). (2009).

*First-Order Theorem Proving: FTP 2009 Workshop Proceedings*. University of Oslo, Department of Informatics.Export

BibTeX

@proceedings{ftp09,
TITLE = {First-Order Theorem Proving: FTP 2009 Workshop Proceedings},
EDITOR = {Peltier, Nicolas and Sofronie-Stokkermans, Viorica},
LANGUAGE = {eng},
ISBN = {82-7368-347-8},
LOCALID = {Local-ID: C125716C0050FB51-22A1FAF7516D91CDC12575E1004CEE6B-ftp09},
PUBLISHER = {University of Oslo, Department of Informatics},
YEAR = {1899},
DATE = {2009},
PAGES = {151},
}

Endnote

%0 Conference Proceedings
%E Peltier, Nicolas
%E Sofronie-Stokkermans, Viorica
%+ External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
%T First-Order Theorem Proving: FTP 2009 Workshop Proceedings :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-000F-1A59-4
%F EDOC: 521102
%@ 82-7368-347-8
%F OTHER: Local-ID: C125716C0050FB51-22A1FAF7516D91CDC12575E1004CEE6B-ftp09
%I University of Oslo, Department of Informatics
%D 2009
%B Untitled Event
%Z date of event: 1899-12-30 -
%D 1899
%C Oslo, Norway
%P 151

Rybalchenko, A., & Sofronie-Stokkermans, V. (2009).

*Constraint Solving for Interpolation*.Export

BibTeX

@techreport{Rybalchenko-Sofronie-Stokkermans-2009,
TITLE = {Constraint Solving for Interpolation},
AUTHOR = {Rybalchenko, Andrey and Sofronie-Stokkermans, Viorica},
LANGUAGE = {eng},
LOCALID = {Local-ID: C125716C0050FB51-7BE33255DCBCF2AAC1257650004B7C65-Rybalchenko-Sofronie-Stokkermans-2009},
YEAR = {2009},
DATE = {2009},
}

Endnote

%0 Report
%A Rybalchenko, Andrey
%A Sofronie-Stokkermans, Viorica
%+ Automation of Logic, MPI for Informatics, Max Planck Society
%T Constraint Solving for Interpolation :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-000F-1A4A-6
%F EDOC: 521091
%F OTHER: Local-ID: C125716C0050FB51-7BE33255DCBCF2AAC1257650004B7C65-Rybalchenko-Sofronie-Stokkermans-2009
%D 2009

Sofronie-Stokkermans, V. (2009a). Locality results for certain extensions of theories with bridging functions. In

*Automated Deduction - CADE-22*. Montreal, Canada: Springer. doi:10.1007/978-3-642-02959-2_5Abstract

n this paper we study possibilities of reasoning about
functions over theories of data types which satisfy
certain recursion (or homomorphism) properties, with a
focus on emphasizing possibilities of hierarchical and
modular reasoning in such extensions and combinations thereof.
We start by considering theories of absolutely free data
structures, and continue by studying extensions of such
theories with selectors, with functions which attach scalar
data to the data structures and with additional functions
defined using a certain type of recursion axioms (possibly
having values in a different -- e.g.\ numeric -- domain).
We show that in these cases locality results can be established.
This allows us to reduce the task of reasoning about the class
of recursive functions we consider to reasoning in the
underlying theory of absolutely free data structures
(resp. in a combination of the theory of absolutely free data
structures with the theory attached with the domains of the
additional functions). We then show that similar results can be
obtained if we relax some assumptions about the absolute
freeness of the underlying theory of data types. We investigate
the applications of these ideas in verification and cryptography.

Export

BibTeX

@inproceedings{Sofronie-Stokkermans-cade09,
TITLE = {Locality results for certain extensions of theories with bridging functions},
AUTHOR = {Sofronie-Stokkermans, Viorica},
LANGUAGE = {eng},
DOI = {10.1007/978-3-642-02959-2_5},
LOCALID = {Local-ID: C125716C0050FB51-33993A1B73DCBEECC12575A000419048-Sofronie-Stokkermans-cade09},
PUBLISHER = {Springer},
YEAR = {2009},
DATE = {2009},
ABSTRACT = {n this paper we study possibilities of reasoning about functions over theories of data types which satisfy certain recursion (or homomorphism) properties, with a focus on emphasizing possibilities of hierarchical and modular reasoning in such extensions and combinations thereof. We start by considering theories of absolutely free data structures, and continue by studying extensions of such theories with selectors, with functions which attach scalar data to the data structures and with additional functions defined using a certain type of recursion axioms (possibly having values in a different -- e.g.\ numeric -- domain). We show that in these cases locality results can be established. This allows us to reduce the task of reasoning about the class of recursive functions we consider to reasoning in the underlying theory of absolutely free data structures (resp. in a combination of the theory of absolutely free data structures with the theory attached with the domains of the additional functions). We then show that similar results can be obtained if we relax some assumptions about the absolute freeness of the underlying theory of data types. We investigate the applications of these ideas in verification and cryptography.},
BOOKTITLE = {Automated Deduction -- CADE-22},
EDITOR = {Schmidt, Renate A.},
SERIES = {Lecture Notes in Artificial Intelligence},
VOLUME = {5663},
ADDRESS = {Montreal, Canada},
}

Endnote

%0 Conference Proceedings
%A Sofronie-Stokkermans, Viorica
%+ Automation of Logic, MPI for Informatics, Max Planck Society
%T Locality results for certain extensions of theories with bridging functions :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-000F-1A62-E
%F EDOC: 521086
%F OTHER: Local-ID: C125716C0050FB51-33993A1B73DCBEECC12575A000419048-Sofronie-Stokkermans-cade09
%R 10.1007/978-3-642-02959-2_5
%D 2009
%B CADE 2009
%Z date of event: 2009-08-02 - 2009-08-07
%C Montreal, Canada
%X n this paper we study possibilities of reasoning about
functions over theories of data types which satisfy
certain recursion (or homomorphism) properties, with a
focus on emphasizing possibilities of hierarchical and
modular reasoning in such extensions and combinations thereof.
We start by considering theories of absolutely free data
structures, and continue by studying extensions of such
theories with selectors, with functions which attach scalar
data to the data structures and with additional functions
defined using a certain type of recursion axioms (possibly
having values in a different -- e.g.\ numeric -- domain).
We show that in these cases locality results can be established.
This allows us to reduce the task of reasoning about the class
of recursive functions we consider to reasoning in the
underlying theory of absolutely free data structures
(resp. in a combination of the theory of absolutely free data
structures with the theory attached with the domains of the
additional functions). We then show that similar results can be
obtained if we relax some assumptions about the absolute
freeness of the underlying theory of data types. We investigate
the applications of these ideas in verification and cryptography.
%B Automated Deduction - CADE-22
%E Schmidt, Renate A.
%I Springer
%B Lecture Notes in Artificial Intelligence
%N 5663

Sofronie-Stokkermans, V. (2009b). Reasoning in Complex Theories and Applications. Advanced Lecture, ESSLLI 2009. ESSLLI 2009 CDrom.

Export

BibTeX

@misc{Sofronie-Stokkermans-esslli09,
TITLE = {Reasoning in Complex Theories and Applications. Advanced Lecture, {ESSLLI} 2009},
AUTHOR = {Sofronie-Stokkermans, Viorica},
LANGUAGE = {eng},
LOCALID = {Local-ID: C125716C0050FB51-7815252D88DBB87FC125763C004BE8D5-Sofronie-Stokkermans-esslli09},
PUBLISHER = {ESSLLI 2009 CDrom},
YEAR = {2009},
DATE = {2009},
}

Endnote

%0 Generic
%A Sofronie-Stokkermans, Viorica
%+ Automation of Logic, MPI for Informatics, Max Planck Society
%T Reasoning in Complex Theories and Applications. Advanced Lecture, ESSLLI 2009 :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-000F-1A66-6
%F EDOC: 521089
%F OTHER: Local-ID: C125716C0050FB51-7815252D88DBB87FC125763C004BE8D5-Sofronie-Stokkermans-esslli09
%I ESSLLI 2009 CDrom
%D 2009

Sofronie-Stokkermans, V. (2009c). Sheaves and geometric logic and applications to modular verification of complex systems.

*Electronic Notes in Theoretical Computer Science*,*230*. doi:10.1016/j.entcs.2009.02.024Abstract

In this paper we show that states, transitions and behavior of
concurrent systems can often be modeled as sheaves over a
suitable topological space.
In this context, geometric logic can be used to describe which
local properties, of individual systems, are preserved, at a
global level, when interconnecting the systems.
The main area of application is to modular verification
of complex systems. We illustrate our ideas by means of an
example involving a family of interacting controllers for
trains on a rail track.

Export

BibTeX

@article{Sofronie-getco06-entcs,
TITLE = {Sheaves and geometric logic and applications to modular verification of complex systems},
AUTHOR = {Sofronie-Stokkermans, Viorica},
LANGUAGE = {eng},
ISSN = {1571-0661},
DOI = {10.1016/j.entcs.2009.02.024},
LOCALID = {Local-ID: C125716C0050FB51-0AFF1E71AF63B543C125729F005B4C3A-Sofronie-getco06-entcs},
YEAR = {2009},
DATE = {2009},
ABSTRACT = {In this paper we show that states, transitions and behavior of concurrent systems can often be modeled as sheaves over a suitable topological space. In this context, geometric logic can be used to describe which local properties, of individual systems, are preserved, at a global level, when interconnecting the systems. The main area of application is to modular verification of complex systems. We illustrate our ideas by means of an example involving a family of interacting controllers for trains on a rail track.},
JOURNAL = {Electronic Notes in Theoretical Computer Science},
VOLUME = {230},
PAGES = {161--187},
}

Endnote

%0 Journal Article
%A Sofronie-Stokkermans, Viorica
%+ Automation of Logic, MPI for Informatics, Max Planck Society
%T Sheaves and geometric logic and applications to modular verification of complex systems :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-000F-1A68-2
%F EDOC: 521104
%R 10.1016/j.entcs.2009.02.024
%F OTHER: Local-ID: C125716C0050FB51-0AFF1E71AF63B543C125729F005B4C3A-Sofronie-getco06-entcs
%D 2009
%X In this paper we show that states, transitions and behavior of
concurrent systems can often be modeled as sheaves over a
suitable topological space.
In this context, geometric logic can be used to describe which
local properties, of individual systems, are preserved, at a
global level, when interconnecting the systems.
The main area of application is to modular verification
of complex systems. We illustrate our ideas by means of an
example involving a family of interacting controllers for
trains on a rail track.
%J Electronic Notes in Theoretical Computer Science
%V 230
%& 161
%P 161 - 187
%@ false

Suda, M., Wischnewski, P., Lamotte-Schubert, M., & de Melo, G. (2009). External Sources of Axioms in Automated Theorem Proving. In

*KI 2009: Advances in Artificial Intelligence*. Paderborn, Germany: Springer. doi:10.1007/978-3-642-04617-9_36Abstract

In recent years there has been a growing demand for Automated
Theorem Proving (ATP) in large theories, which often have more
axioms than can be handled effectively as normal internal axioms. This
work addresses the issues of accessing \emph{external sources of axioms} from a
first-order logic ATP system, and presents an implemented ATP system
that retrieves external axioms asynchronously, on demand.

Export

BibTeX

@inproceedings{SudaSutcliffeWischnewskiLamotteKI2009,
TITLE = {External Sources of Axioms in Automated Theorem Proving},
AUTHOR = {Suda, Martin and Wischnewski, Patrick and Lamotte-Schubert, Manuel and de Melo, Gerard},
LANGUAGE = {eng},
ISBN = {978-3-642-04616-2},
DOI = {10.1007/978-3-642-04617-9_36},
LOCALID = {Local-ID: C125716C0050FB51-5F9C30C56EF6409EC12576BD002A2CED-SudaSutcliffeWischnewskiLamotteKI2009},
PUBLISHER = {Springer},
YEAR = {2009},
DATE = {2009},
ABSTRACT = {In recent years there has been a growing demand for Automated Theorem Proving (ATP) in large theories, which often have more axioms than can be handled effectively as normal internal axioms. This work addresses the issues of accessing \emph{external sources of axioms} from a first-order logic ATP system, and presents an implemented ATP system that retrieves external axioms asynchronously, on demand.},
BOOKTITLE = {KI 2009: Advances in Artificial Intelligence},
PAGES = {281--288},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {5803},
ADDRESS = {Paderborn, Germany},
}

Endnote

%0 Conference Proceedings
%A Suda, Martin
%A Wischnewski, Patrick
%A Lamotte-Schubert, Manuel
%A de Melo, Gerard
%+ Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
Databases and Information Systems, MPI for Informatics, Max Planck Society
%T External Sources of Axioms in Automated Theorem Proving :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-000F-1A56-A
%F EDOC: 521096
%F OTHER: Local-ID: C125716C0050FB51-5F9C30C56EF6409EC12576BD002A2CED-SudaSutcliffeWischnewskiLamotteKI2009
%R 10.1007/978-3-642-04617-9_36
%D 2009
%B 32nd Annual German Conference on AI
%Z date of event: 2009-09-15 - 2009-09-18
%C Paderborn, Germany
%X In recent years there has been a growing demand for Automated
Theorem Proving (ATP) in large theories, which often have more
axioms than can be handled effectively as normal internal axioms. This
work addresses the issues of accessing \emph{external sources of axioms} from a
first-order logic ATP system, and presents an implemented ATP system
that retrieves external axioms asynchronously, on demand.
%B KI 2009: Advances in Artificial Intelligence
%P 281 - 288
%I Springer
%@ 978-3-642-04616-2
%B Lecture Notes in Computer Science
%N 5803

Weidenbach, C., Dimova, D., Fietzke, A., Suda, M., & Wischnewski, P. (2009). SPASS Version 3.5. In

*22nd International Conference on Automated Deduction (CADE-22)*. Springer.Export

BibTeX

@inproceedings{WeidenbachEtAlSpass2009,
TITLE = {{SPASS} Version 3.5},
AUTHOR = {Weidenbach, Christoph and Dimova, Dilyana and Fietzke, Arnaud and Suda, Martin and Wischnewski, Patrick},
LANGUAGE = {eng},
LOCALID = {Local-ID: C125716C0050FB51-7B5109775A15D687C125762A00458A44-WeidenbachEtAlSpass2009},
PUBLISHER = {Springer},
YEAR = {2009},
DATE = {2009},
BOOKTITLE = {22nd International Conference on Automated Deduction (CADE-22)},
EDITOR = {Schmidt, Renate A.},
PAGES = {140--145},
SERIES = {Lecture Notes in Artificial Intelligence},
}

Endnote

%0 Conference Proceedings
%A Weidenbach, Christoph
%A Dimova, Dilyana
%A Fietzke, Arnaud
%A Suda, Martin
%A Wischnewski, Patrick
%+ Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T SPASS Version 3.5 :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-000F-1A6A-D
%F EDOC: 521093
%F OTHER: Local-ID: C125716C0050FB51-7B5109775A15D687C125762A00458A44-WeidenbachEtAlSpass2009
%D 2009
%B Untitled Event
%Z date of event: 2009-08-02 - 2009-08-07
%C Montreal, Canada
%B 22nd International Conference on Automated Deduction (CADE-22)
%E Schmidt, Renate A.
%P 140 - 145
%I Springer
%B Lecture Notes in Artificial Intelligence

Weidenbach, C., & Wischnewski, P. (2009).

*Contextual Rewriting*(No. MPI-I-2009-RG1-002).Export

BibTeX

@techreport{WischnewskiWeidenbach2009,
TITLE = {Contextual Rewriting},
AUTHOR = {Weidenbach, Christoph and Wischnewski, Patrick},
LANGUAGE = {eng},
NUMBER = {MPI-I-2009-RG1-002},
LOCALID = {Local-ID: C125716C0050FB51-DD89BAB0441DE797C125757F0034B8CB-WeidenbachWischnewskiReport2009},
YEAR = {2009},
DATE = {2009},
}

Endnote

%0 Report
%A Weidenbach, Christoph
%A Wischnewski, Patrick
%+ Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T Contextual Rewriting :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-000F-1A4C-2
%F EDOC: 521106
%F OTHER: Local-ID: C125716C0050FB51-DD89BAB0441DE797C125757F0034B8CB-WeidenbachWischnewskiReport2009
%D 2009

2008

Baader, F., Ghilardi, S., Hermann, M., Sattler, U., & Sofronie-Stokkermans, V. (Eds.). (2008).

*Workshop: Complexity, Expressibility, and Decidability in Automated Reasoning - CEDAR’08*. CEDAR. Retrieved from http://www.mpi-inf.mpg.de/~sofronie/proceedings-cedar08.pdfExport

BibTeX

@proceedings{Sofronie-Stokkermans-cedar2008,
TITLE = {Workshop: Complexity, Expressibility, and Decidability in Automated Reasoning -- CEDAR'08},
EDITOR = {Baader, Franz and Ghilardi, Silvio and Hermann, Miki and Sattler, Ulrike and Sofronie-Stokkermans, Viorica},
LANGUAGE = {eng},
URL = {http://www.mpi-inf.mpg.de/~sofronie/proceedings-cedar08.pdf},
LOCALID = {Local-ID: C125756E0038A185-4EDEFAD7D52C81B2C12574A2004C4649-Sofronie-Stokkermans-cedar2008},
PUBLISHER = {CEDAR},
YEAR = {2008},
DATE = {2008},
PAGES = {72},
}

Endnote

%0 Conference Proceedings
%E Baader, Franz
%E Ghilardi, Silvio
%E Hermann, Miki
%E Sattler, Ulrike
%E Sofronie-Stokkermans, Viorica
%+ External Organizations
External Organizations
External Organizations
External Organizations
Automation of Logic, MPI for Informatics, Max Planck Society
%T Workshop: Complexity, Expressibility, and Decidability in Automated Reasoning - CEDAR'08 :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-000F-1D64-7
%F EDOC: 428266
%U http://www.mpi-inf.mpg.de/~sofronie/proceedings-cedar08.pdf
%F OTHER: Local-ID: C125756E0038A185-4EDEFAD7D52C81B2C12574A2004C4649-Sofronie-Stokkermans-cedar2008
%I CEDAR
%D 2008
%B Untitled Event
%Z date of event: 2008-08-10 - 2008-08-15
%D 2008
%C Sydney, Australia
%P 72

Fietzke, A. L., & Weidenbach, C. (2008a).

*Labelled splitting*(No. MPI-I-2008-RG1-001). Saarbrücken: Max-Planck-Institut für Informatik. Retrieved from http://domino.mpi-inf.mpg.de/internet/reports.nsf/NumberView/2008-RG1-001Abstract

We define a superposition calculus with explicit splitting and
an explicit, new backtracking rule on the basis of labelled clauses.
For the first time we show a superposition calculus with explicit
backtracking rule sound and complete. The new backtracking rule advances
backtracking with branch condensing known from SPASS.
An experimental evaluation of an implementation of the new rule
shows that it improves considerably the
previous SPASS splitting implementation.
Finally, we discuss the relationship between labelled first-order
splitting and DPLL style splitting with intelligent backtracking
and clause learning.

Export

BibTeX

@techreport{FietzkeWeidenbach2008,
TITLE = {Labelled splitting},
AUTHOR = {Fietzke, Arnaud Luc and Weidenbach, Christoph},
LANGUAGE = {eng},
URL = {http://domino.mpi-inf.mpg.de/internet/reports.nsf/NumberView/2008-RG1-001},
NUMBER = {MPI-I-2008-RG1-001},
INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
ADDRESS = {Saarbr{\"u}cken},
YEAR = {2008},
DATE = {2008},
ABSTRACT = {We define a superposition calculus with explicit splitting and an explicit, new backtracking rule on the basis of labelled clauses. For the first time we show a superposition calculus with explicit backtracking rule sound and complete. The new backtracking rule advances backtracking with branch condensing known from SPASS. An experimental evaluation of an implementation of the new rule shows that it improves considerably the previous SPASS splitting implementation. Finally, we discuss the relationship between labelled first-order splitting and DPLL style splitting with intelligent backtracking and clause learning.},
TYPE = {Research Report},
}

Endnote

%0 Report
%A Fietzke, Arnaud Luc
%A Weidenbach, Christoph
%+ Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T Labelled splitting :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-0014-6674-D
%U http://domino.mpi-inf.mpg.de/internet/reports.nsf/NumberView/2008-RG1-001
%Y Max-Planck-Institut für Informatik
%C Saarbrücken
%D 2008
%P 45 p.
%X We define a superposition calculus with explicit splitting and
an explicit, new backtracking rule on the basis of labelled clauses.
For the first time we show a superposition calculus with explicit
backtracking rule sound and complete. The new backtracking rule advances
backtracking with branch condensing known from SPASS.
An experimental evaluation of an implementation of the new rule
shows that it improves considerably the
previous SPASS splitting implementation.
Finally, we discuss the relationship between labelled first-order
splitting and DPLL style splitting with intelligent backtracking
and clause learning.
%B Research Report

Fietzke, A. L., & Weidenbach, C. (2008b). Labelled Splitting. In

*Automated Reasoning (IJCAR 2008)*. Sydney, Australia: Springer. doi:10.1007/978-3-540-71070-7_39Export

BibTeX

@inproceedings{FietzkeWeidenbachCADE08,
TITLE = {Labelled Splitting},
AUTHOR = {Fietzke, Arnaud Luc and Weidenbach, Christoph},
LANGUAGE = {eng},
ISBN = {978-3-540-71069-1},
URL = {http://dx.doi.org/10.1007/978-3-540-71070-7_39},
DOI = {10.1007/978-3-540-71070-7_39},
LOCALID = {Local-ID: C125756E0038A185-5B043813DEEEADF7C12575380046EAEE-FietzkeWeidenbachCADE08},
PUBLISHER = {Springer},
YEAR = {2008},
DATE = {2008},
BOOKTITLE = {Automated Reasoning (IJCAR 2008)},
EDITOR = {Armando, Allesandro and Baumgartner, Peter and Dowek, Gilles},
PAGES = {459--474},
SERIES = {Lecture Notes in Artificial Intelligence},
VOLUME = {5195},
ADDRESS = {Sydney, Australia},
}

Endnote

%0 Conference Proceedings
%A Fietzke, Arnaud Luc
%A Weidenbach, Christoph
%+ Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T Labelled Splitting :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-000F-1C08-E
%F EDOC: 428071
%R 10.1007/978-3-540-71070-7_39
%U http://dx.doi.org/10.1007/978-3-540-71070-7_39
%F OTHER: Local-ID: C125756E0038A185-5B043813DEEEADF7C12575380046EAEE-FietzkeWeidenbachCADE08
%D 2008
%B IJCAR 2008
%Z date of event: 2008-08-12 - 2008-08-15
%C Sydney, Australia
%B Automated Reasoning
%E Armando, Allesandro; Baumgartner, Peter; Dowek, Gilles
%P 459 - 474
%I Springer
%@ 978-3-540-71069-1
%B Lecture Notes in Artificial Intelligence
%N 5195

Hillenbrand, T. (2008).

*Superposition and Decision Procedures - Back and Forth*. Universität des Saarlandes, Saarbrücken.Abstract

Two apparently different approaches to automating deduction are mentioned in
the title; they are the subject of a debate on ``big engines vs.\ little
engines of proof''. The contributions in this thesis advocate that these two
strands of research can interplay in subtle and sometimes unexpected ways, such
that mutual pervasion can lead to intriguing results: Firstly, superposition
can be run on top of decision procedures. This we demonstrate for the class of
Shostak theories, incorporating a little engine into a big one. As another
instance of decision procedures within superposition, we show that ground
confluent rewrite systems, which decide entailment problems in equational
logic, can be harnessed for detecting redundancies in superposition
derivations. Secondly, superposition can be employed as proof-theoretic means
underneath combined decision procedures: We re-establish the correctness of the
Nelson-Oppen procedure as an instance of the completeness of superposition.
Thirdly, superposition can be used as a decision procedure for many interesting
theories, turning a big engine into a little one. For the theory of bits and of
fixed-size bitvectors, we suggest a rephrased axiomatization combined with a
transformation of conjectures, based on which superposition decides the
universal fragment. Furthermore, with a modification of lifting, we adapt
superposition to the theory of bounded domains and give a decision procedure,
which captures the Bernays-Schönfinkel class as well.

Export

BibTeX

@phdthesis{HillenbrandDiss2008,
TITLE = {Superposition and Decision Procedures -- Back and Forth},
AUTHOR = {Hillenbrand, Thomas},
LANGUAGE = {eng},
SCHOOL = {Universit{\"a}t des Saarlandes},
ADDRESS = {Saarbr{\"u}cken},
YEAR = {2008},
DATE = {2008},
ABSTRACT = {Two apparently different approaches to automating deduction are mentioned in the title; they are the subject of a debate on ``big engines vs.\ little engines of proof''. The contributions in this thesis advocate that these two strands of research can interplay in subtle and sometimes unexpected ways, such that mutual pervasion can lead to intriguing results: Firstly, superposition can be run on top of decision procedures. This we demonstrate for the class of Shostak theories, incorporating a little engine into a big one. As another instance of decision procedures within superposition, we show that ground confluent rewrite systems, which decide entailment problems in equational logic, can be harnessed for detecting redundancies in superposition derivations. Secondly, superposition can be employed as proof-theoretic means underneath combined decision procedures: We re-establish the correctness of the Nelson-Oppen procedure as an instance of the completeness of superposition. Thirdly, superposition can be used as a decision procedure for many interesting theories, turning a big engine into a little one. For the theory of bits and of fixed-size bitvectors, we suggest a rephrased axiomatization combined with a transformation of conjectures, based on which superposition decides the universal fragment. Furthermore, with a modification of lifting, we adapt superposition to the theory of bounded domains and give a decision procedure, which captures the Bernays-Sch{\"o}nfinkel class as well.},
}

Endnote

%0 Thesis
%A Hillenbrand, Thomas
%Y Weidenbach, Christoph
%A referee: Finkbeiner, Bernd
%+ Automation of Logic, MPI for Informatics, Max Planck Society
International Max Planck Research School, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
External Organizations
%T Superposition and Decision Procedures - Back and Forth :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-001A-21ED-0
%I Universität des Saarlandes
%C Saarbrücken
%D 2008
%V phd
%9 phd
%X Two apparently different approaches to automating deduction are mentioned in
the title; they are the subject of a debate on ``big engines vs.\ little
engines of proof''. The contributions in this thesis advocate that these two
strands of research can interplay in subtle and sometimes unexpected ways, such
that mutual pervasion can lead to intriguing results: Firstly, superposition
can be run on top of decision procedures. This we demonstrate for the class of
Shostak theories, incorporating a little engine into a big one. As another
instance of decision procedures within superposition, we show that ground
confluent rewrite systems, which decide entailment problems in equational
logic, can be harnessed for detecting redundancies in superposition
derivations. Secondly, superposition can be employed as proof-theoretic means
underneath combined decision procedures: We re-establish the correctness of the
Nelson-Oppen procedure as an instance of the completeness of superposition.
Thirdly, superposition can be used as a decision procedure for many interesting
theories, turning a big engine into a little one. For the theory of bits and of
fixed-size bitvectors, we suggest a rephrased axiomatization combined with a
transformation of conjectures, based on which superposition decides the
universal fragment. Furthermore, with a modification of lifting, we adapt
superposition to the theory of bounded domains and give a decision procedure,
which captures the Bernays-Schönfinkel class as well.
%U http://scidok.sulb.uni-saarland.de/volltexte/2009/2419/http://scidok.sulb.uni-saarland.de/doku/lic_ohne_pod.php?la=de

Horbach, M., & Weidenbach, C. (2008). Superposition for Fixed Domains. In

*Computer Science Logic : 22nd International Workshop, CSL 2008, 17th Annual Conference of the EACSL*. Springer. doi:10.1007/978-3-540-87531-4_22Export

BibTeX

@inproceedings{HorbachWeidenbachCSL08,
TITLE = {Superposition for Fixed Domains},
AUTHOR = {Horbach, Matthias and Weidenbach, Christoph},
LANGUAGE = {eng},
ISBN = {978-3-540-87530-7},
URL = {http://dx.doi.org/10.1007/978-3-540-87531-4_22},
DOI = {10.1007/978-3-540-87531-4_22},
LOCALID = {Local-ID: C125756E0038A185-FF87221C4DBD886CC12575380042F020-HorbachWeidenbachCSL08},
PUBLISHER = {Springer},
YEAR = {2008},
DATE = {2008},
BOOKTITLE = {Computer Science Logic : 22nd International Workshop, CSL 2008, 17th Annual Conference of the EACSL},
EDITOR = {Kaminski, Michael and Martini, Simone},
PAGES = {293--307},
SERIES = {Lecture Notes in Computer Science},
}

Endnote

%0 Conference Proceedings
%A Horbach, Matthias
%A Weidenbach, Christoph
%+ Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T Superposition for Fixed Domains :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-000F-1D18-2
%F EDOC: 428106
%R 10.1007/978-3-540-87531-4_22
%U http://dx.doi.org/10.1007/978-3-540-87531-4_22
%F OTHER: Local-ID: C125756E0038A185-FF87221C4DBD886CC12575380042F020-HorbachWeidenbachCSL08
%D 2008
%B Untitled Event
%Z date of event: 2008-09-16 - 2008-09-19
%C Bertinoro, Italy
%B Computer Science Logic : 22nd International Workshop, CSL 2008,
17th Annual Conference of the EACSL
%E Kaminski, Michael; Martini, Simone
%P 293 - 307
%I Springer
%@ 978-3-540-87530-7
%B Lecture Notes in Computer Science

Ihlemann, C., Jacobs, S., & Sofronie-Stokkermans, V. (2008). On local reasoning in verification. In

*Tools and Algorithms for the Construction and Analysis of Systems : 14th International Conference, TACAS 2008 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2008*. Springer. doi:10.1007/978-3-540-78800-3_19Abstract

We present a general framework which allows to identify complex theories
important in verification for which efficient reasoning methods exist. The
framework we present is based on a general notion of locality. We show that
locality considerations allow us to obtain parameterized decidability and
complexity results for many (combinations of) theories important in
verification in general and in the verification of parametric systems in
particular. We give numerous examples; in particular we show that several
theories of data structures studied in the verification literature are local
extensions of a base theory. The general framework we use allows us to identify
situations in which some of the syntactical restrictions imposed in previous
papers can be relaxed.

Export

BibTeX

@inproceedings{ihlemann-jacobs-sofronie-tacas2008,
TITLE = {On local reasoning in verification},
AUTHOR = {Ihlemann, Carsten and Jacobs, Swen and Sofronie-Stokkermans, Viorica},
LANGUAGE = {eng},
ISBN = {978-3-540-78799-0},
URL = {http://dx.doi.org/10.1007/978-3-540-78800-3_19},
DOI = {10.1007/978-3-540-78800-3_19},
LOCALID = {Local-ID: C125756E0038A185-0445FFD4A7C94F83C12573AD0044C8AE-ihlemann-jacobs-sofronie-tacas2008},
PUBLISHER = {Springer},
YEAR = {2008},
DATE = {2008},
ABSTRACT = {We present a general framework which allows to identify complex theories important in verification for which efficient reasoning methods exist. The framework we present is based on a general notion of locality. We show that locality considerations allow us to obtain parameterized decidability and complexity results for many (combinations of) theories important in verification in general and in the verification of parametric systems in particular. We give numerous examples; in particular we show that several theories of data structures studied in the verification literature are local extensions of a base theory. The general framework we use allows us to identify situations in which some of the syntactical restrictions imposed in previous papers can be relaxed.},
BOOKTITLE = {Tools and Algorithms for the Construction and Analysis of Systems : 14th International Conference, TACAS 2008 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2008},
EDITOR = {Ramakrishnan, C. R. and Rehof, Jakob},
PAGES = {265--281},
SERIES = {Lecture Notes in Computer Science},
}

Endnote

%0 Conference Proceedings
%A Ihlemann, Carsten
%A Jacobs, Swen
%A Sofronie-Stokkermans, Viorica
%+ Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
Automation of Logic, MPI for Informatics, Max Planck Society
%T On local reasoning in verification :
%G eng
%U http://hdl.handle.net/11858/00-001M-0000-000F-1C78-1
%F EDOC: 428112
%R 10.1007/978-3-540-78800-3_19
%U http://dx.doi.org/10.1007/978-3-540-78800-3_19
%F OTHER: Local-ID: C125756E0038A185-0445FFD4A7C94F83C12573AD0044C8AE-ihlemann-jacobs-sofronie-tacas2008
%D 2008
%B Untitled Event
%Z date of event: 2008-03-29 - 2008-04-06
%C Budapest, Hungary
%X We present a general framework which allows to identify complex theories
important in verification for which efficient reasoning methods exist. The
framework we present is based on a general notion of locality. We show that
locality considerations allow us to obtain parameterized decidability and
complexity results for many (combinations of) theories important in
verification in general and in the verification of parametric systems in
particular. We give numerous examples; in particular we show that several
theories of data structures studied in the verification literature are local
extensions of a base theory. The general framework we use allows us to identify
situations in which some of the syntactical restrictions imposed in previous
papers can be relaxed.
%B Tools and Algorithms for the Construction and Analysis of Systems : 14th International Conference, TACAS 2008 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2008
%E Ramakrishnan, C. R.; Rehof, Jakob
%P 265 - 281
%I Springer
%@ 978-3-540-78799-0
%B Lecture Notes in Computer Science