Reformulation of SAT into a Polynomial Box-Constrained Optimization Problem
In order to leverage the capacities of non-linear constraint solvers, we propose a reformulation of SAT into a box-constrained optimization problem where the objective function is polynomial. We prove that any optimal solution of the numerical problem cor
- PDF / 19,523,918 Bytes
- 460 Pages / 439.37 x 666.142 pts Page_size
- 32 Downloads / 191 Views
Brijesh Dongol Elena Troubitsyna (Eds.)
Integrated Formal Methods 16th International Conference, IFM 2020 Lugano, Switzerland, November 16–20, 2020 Proceedings
Lecture Notes in Computer Science Founding Editors Gerhard Goos, Germany Juris Hartmanis, USA
Editorial Board Members Elisa Bertino, USA Wen Gao, China Bernhard Steffen , Germany
Gerhard Woeginger , Germany Moti Yung, USA
Formal Methods Subline of Lectures Notes in Computer Science Subline Series Editors Ana Cavalcanti, University of York, UK Marie-Claude Gaudel, Université de Paris-Sud, France
Subline Advisory Board Manfred Broy, TU Munich, Germany Annabelle McIver, Macquarie University, Sydney, NSW, Australia Peter Müller, ETH Zurich, Switzerland Erik de Vink, Eindhoven University of Technology, The Netherlands Pamela Zave, AT&T Laboratories Research, Bedminster, NJ, USA
12546
More information about this series at http://www.springer.com/series/7408
Brijesh Dongol Elena Troubitsyna (Eds.) •
Integrated Formal Methods 16th International Conference, IFM 2020 Lugano, Switzerland, November 16–20, 2020 Proceedings
123
Editors Brijesh Dongol University of Surrey Guildford, UK
Elena Troubitsyna Royal Institute of Technology - KTH Stockholm, Sweden
ISSN 0302-9743 ISSN 1611-3349 (electronic) Lecture Notes in Computer Science ISBN 978-3-030-63460-5 ISBN 978-3-030-63461-2 (eBook) https://doi.org/10.1007/978-3-030-63461-2 LNCS Sublibrary: SL2 – Programming and Software Engineering © Springer Nature Switzerland AG 2020 This work is subject to copyright. All rights are reserved by the Publisher, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission or information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed. The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. The publisher, the authors and the editors are safe to assume that the advice and information in this book are believed to be true and accurate at the date of publication. Neither the publisher nor the authors or the editors give a warranty, expressed or implied, with respect to the material contained herein or for any errors or omissions that may have been made. The publisher remains neutral with regard to jurisdictional claims in published maps and institutional affiliations. This Springer imprint is published by the registered company Springer Nature Switzerland AG The registered company address is: Gewerbestrasse 11, 6330 Cham, Switzerland
Preface
In recent years, we have witnessed a proliferation of approaches that integrate several modeling, verification, and simulation techniques, facilitating more ver
Data Loading...
