Filters








13,982 Hits in 3.8 sec

Satisfiability modulo theories for process systems engineering

Miten Mistry, Andrea Callia D'Iddio, Michael Huth, Ruth Misener
2018 Computers and Chemical Engineering  
In particular, we propose satisfiability modulo theories (SMT) for process systems engineering applications.  ...  Process systems engineers have long recognized the importance of both logic and optimization for automated decision-making.  ...  In particular, we propose satisfiability modulo theories (SMT) for process systems engineering applications.  ... 
doi:10.1016/j.compchemeng.2018.03.004 fatcat:nzsk67klpbeghi52m4fs367n4a

Splitting on Demand in SAT Modulo Theories [chapter]

Clark Barrett, Robert Nieuwenhuis, Albert Oliveras, Cesare Tinelli
2006 Lecture Notes in Computer Science  
Lazy algorithms for Satisfiability Modulo Theories (SMT) combine a generic DPLL-based SAT engine with a theory solver for the given theory T that can decide the T -consistency of conjunctions of ground  ...  For many theories of interest, theory solvers need to reason by performing internal case splits. Here we argue that it is more convenient to delegate these case splits to the DPLL engine instead.  ...  We first show how to obtain an Abstract DPLL Modulo Theories transition system for the combined theory T as a refinement of the system XT described in Section 2 using only the solvers of the theories T  ... 
doi:10.1007/11916277_35 fatcat:h4k5y2bw7ffaxh2tui2zvcbuua

ThEodorE: a Trace Checker for CPS Properties

Claudio Menghi, Enrico Vigano, Domenico Bianculli, Lionel C. Briand
2021 2021 IEEE/ACM 43rd International Conference on Software Engineering: Companion Proceedings (ICSE-Companion)  
Modulo Theories (SMT) solvers.  ...  ThEodorE is a trace checker for Cyber-Physical systems (CPS).  ...  ThEodorE reduces the problem of checking an HLS property on a trace to a satisfiability problem, which can be solved using off-the-shelf Satisfiability Modulo Theories (SMT) solvers.  ... 
doi:10.1109/icse-companion52605.2021.00079 fatcat:gv4xg3cl4fbkdeqpi4jajyzr5i

On SAT Modulo Theories and Optimization Problems [chapter]

Robert Nieuwenhuis, Albert Oliveras
2006 Lecture Notes in Computer Science  
For this purpose, we introduce a variant of SMT where the theory T becomes progressively stronger, and prove it correct using the Abstract DPLL Modulo Theories framework.  ...  Solvers for SAT Modulo Theories (SMT) can nowadays handle large industrial (e.g., formal hardware and software verification) problems over theories such as the integers, arrays, or equality.  ...  Currently most SMT solvers follow the so-called lazy approach to SMT, combining (i) theory solvers to process conjunctions of literals over the given theory T , with (ii) DPLL-based engines for dealing  ... 
doi:10.1007/11814948_18 fatcat:duswvxjgm5ftvdxtkrsrs64vn4

On a Rewriting Approach to Satisfiability Procedures: Extension, Combination of Theories and an Experimental Appraisal [chapter]

Alessandro Armando, Maria Paola Bonacina, Silvio Ranise, Stephan Schulz
2005 Lecture Notes in Computer Science  
The rewriting approach to T -satisfiability is based on establishing termination of a rewrite-based inference system for first-order logic on the T -satisfiability problem.  ...  First, we prove termination of SP for the theories of records with or without extensionality, integer offsets and integer offsets modulo.  ...  We thank Stefano Ferrari, former student of the second author, for running preliminary experiments, and Paolo Fiorini, colleague of the second author, for access to the computers of the robotics laboratory  ... 
doi:10.1007/11559306_4 fatcat:mar73gtjkzhcne5scewq6xi2su

Decision Procedures for SAT, SAT Modulo Theories and Beyond. The BarcelogicTools [chapter]

Robert Nieuwenhuis, Albert Oliveras
2005 Lecture Notes in Computer Science  
An overview is given of a number of recent developments in SAT and SAT Modulo Theories (SMT).  ...  In particular, based on our framework of Abstract DPLL and Abstract DPLL modulo Theories, we explain our DPLL(T) approach to SMT.  ...  Abstract DPLL Modulo Theories In this section we formalize the different enhancements of the lazy approach to Satisfiability Modulo Theories.  ... 
doi:10.1007/11591191_3 fatcat:oarn7yfalzhg5bkg37bjxc5w7i

The synthesis of optimal systems design solutions

Tony Shell
2003 Systems Engineering  
It provides for the direct synthesis of optimal system design solutions of complex system implementations with multiple components, embodying different technologies, and with multiple levels of design  ...  ., nk-STFE for n components and k evaluation criteria) is developed, and its application to optimal design of complex systems architectures is presented.  ...  Current systems engineering standards (process models) and best practice instructions have, in general, little (and sometimes nothing) to say with respect to optimal system design.  ... 
doi:10.1002/sys.10037 fatcat:mkfiheal2vfhdeaaj6ww4zx6ny

SAT modulo discrete event simulation applied to railway design capacity analysis

Bjørnar Luteberget, Koen Claessen, Christian Johansen, Martin Steffen
2021 Formal methods in system design  
This new integration proved useful for designing a solver for capacity analysis in early phase railway construction design.  ...  Design engineers working within the limited scope of construction projects report that only ad-hoc, experience-based methods of capacity analysis are available to them.  ...  Acknowledgements We thank the engineers at Railcomplete AS, especially senior engineer Claus Feyling, for guidance on railway operations and design methodology.  ... 
doi:10.1007/s10703-021-00368-2 fatcat:5a6jxl465nh3nfke6knbbfkvcu

Satisfiability and Synthesis Modulo Oracles [article]

Elizabeth Polgreen, Andrew Reynolds, Sanjit A. Seshia
2021 arXiv   pre-print
As a necessary component of this framework, we also formalize the problem of satisfiability modulo theories and oracles, and present an algorithm for solving this problem.  ...  Many synthesis algorithms use a white-box oracle based on satisfiability modulo theory (SMT) solvers to provide counterexamples.  ...  Definition II.3 (Satisfiability Modulo Theories and Oracles).  ... 
arXiv:2107.13477v1 fatcat:omcqj3brajhhpgd5ye4lfzzffm

Solving SAT and SAT Modulo Theories

Robert Nieuwenhuis, Albert Oliveras, Cesare Tinelli
2006 Journal of the ACM  
We then extend the framework to Satisfiability Modulo background Theories (SMT) and use it to model several variants of the so-called lazy approach for SMT.  ...  Solver T for a given theory T , thus producing a DPLL(T ) system.  ...  We are also grateful to the anonymous referees for their helpful suggestions on improving this article.  ... 
doi:10.1145/1217856.1217859 fatcat:gb26wen23bhylfb246mq4g2btm

Boolector: An Efficient SMT Solver for Bit-Vectors and Arrays [chapter]

Robert Brummayer, Armin Biere
2009 Lecture Notes in Computer Science  
Satisfiability Modulo Theories (SMT) is the problem of deciding satisfiability of a logical formula, expressed in a combination of first-order theories.  ...  We present the architecture and selected features of Boolector, which is an efficient SMT solver for the quantifier-free theories of bit-vectors and arrays.  ...  Conclusion We presented Boolector, which is an efficient SMT solver for the quantifier-free theories of bit-vectors and arrays.  ... 
doi:10.1007/978-3-642-00768-2_16 fatcat:a5gtjyvlufgr3m274ognp23le4

Model-Based Diagnosis of Hybrid Systems Using Satisfiability Modulo Theory

Alexander Diedrich, Alexander Maier, Oliver Niggemann
2019 PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE  
The novelty lies in implementing the observer pattern through the use of a symbolic system description specified in satisfiability theory modulo linear arithmetic.  ...  In this paper we present a novel model-based diagnosis approach for automatically diagnosing hybrid systems.  ...  These variables form the basis for a generic extension of MBD by means of Satisfiability Modulo Theories (SMT).  ... 
doi:10.1609/aaai.v33i01.33011452 fatcat:bdnfau7hpvekjmzub5iquayz3a

Solver technology for system-level to RTL equivalence checking

A. Koelbl, R. Jacoby, H. Jain, C. Pixley
2009 2009 Design, Automation & Test in Europe Conference & Exhibition  
The reason is that usually the system-level model is written by a system architect, whereas the RTL implementation is created by a hardware designer.  ...  Checking the equivalence of a system-level model against an RTL design is a major challenge.  ...  This is usually done by combining multiple theories such as linear arithmetic, theory of arrays, bit-vectors in a single prover framework called Satisfiability Modulo Theories (SMT) framework.  ... 
doi:10.1109/date.2009.5090657 dblp:conf/date/KoelblJJP09 fatcat:27qkxqluljas7isepbx6bbckm4

Games and Decisions for Rigorous Systems Engineering (Dagstuhl Seminar 12461)

Nikolaj Bjorner, Krishnendu Chatterjee, Laura Kovacs, Rupak M. Majumdar, Marc Herbstritt
2013 Dagstuhl Reports  
This report documents the program and the outcomes of the Dagstuhl Seminar 12461 "Games and Decisions for Rigorous Systems Engineering".  ...  This event was the first seminar of this kind and a kickoff of a series of seminars organised on rigorous systems engineering.  ...  The distributed algorithms we consider are parameterized by both the number of processes and the assumed maximum number of Byzantine faulty processes.  ... 
doi:10.4230/dagrep.2.11.45 dblp:journals/dagstuhl-reports/BjornerCKM12 fatcat:gs36midqlvfhzky6v7ebawumtq

Preface

Robert Brijder, Lulu Qian
2018 Natural Computing  
Moreover, satisfiability can be verified using standard satisfaction modulo theory solvers. considers self-assembly systems where simple computational elements with limited memory and communication, called  ...  After a thorough reviewing process, separate from the DNA 23 reviewing process, a selection of five papers has been accepted for this issue: four were presented in a preliminary form at DNA 23 and are  ...  Moreover, satisfiability can be verified using standard satisfaction modulo theory solvers. Two papers of this special issue study molecular selfassembly from a theoretical point of view.  ... 
doi:10.1007/s11047-018-9713-y fatcat:oa3jdgi6w5b5tlgdaippnyo3ne
« Previous Showing results 1 — 15 out of 13,982 results