„satisfiability modulo theories“

Suchergebnisse

1.000+ Treffer

• On solving real-algebraic formulas in a satisfiability-modulo-theories framework
  Loup, Ulrich ; Ábrahám, Erika ; Levandovskyy, Viktor ; Sturm, Thomas 2018 Universitätsbibliothek der RWTH Aachen
• Stochastic satisfiability modulo theories : a symbolic technique for the analysis of probabilistic hybrid systems
  Teige, Tino ; Fränzle, Martin 2012 IBIT - Universitätsbibliothek
• Verification of Stochastic Systems by Stochastic Satisfiability Modulo Theories with Continuous Domain (CSSMT)
  Gao, Yang ; Fränzle, Martin ; Zuliani, Paolo 2017 BIS der Universität Oldenburg
• Bridging Language Models and Symbolic Solvers via the Model Context Protocol
  Szeider, Stefan 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Bit-Precise Reasoning with Parametric Bit-Vectors
  Berger, Zvika ; Zohar, Yoni ; Niemetz, Aina ; Preiner, Mathias ; Reynolds, Andrew ; Barrett, Clark ; Tinelli, Cesare 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Decision Procedures – An Algorithmic Point of View
  Kroening, Daniel ; Strichman, Ofer 2016 Springer Berlin Heidelberg
• Verification of Data-Aware Processes via Satisfiability Modulo Theories
  2023 Springer Nature Switzerland
• Solving quantified verification conditions using satisfiability modulo theories
  Ge, Yeting ; Barrett, Clark ; Tinelli, Cesare
• Scalable Proof Production and Checking in SMT (Invited Talk)
  Tinelli, Cesare 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• IPASIR-UP: User Propagators for CDCL
  Fazekas, Katalin ; Niemetz, Aina ; Preiner, Mathias ; Kirchweger, Markus ; Szeider, Stefan ; Biere, Armin 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• 10161 Abstracts Collection – Decision Procedures in Software, Hardware and Bioware
  Bjorner, Nikolaj ; Nieuwenhuis, Robert ; Veith, Helmut ; Voronkov, Andrei
• Torwards Infinite-State Verification and Planning with Linear Temporal Logic Modulo Theories (Extended Abstract)
  Geatti, Luca ; Gianola, Alessandro ; Gigante, Nicola 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Towards Learning Quantifier Instantiation in SMT
  Janota, Mikoláš ; Piepenbrock, Jelle ; Piotrowski, Bartosz 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• SMT-Based Answer Set Solver CMODELS(DIFF) (System Description)
  Shen, Da ; Lierler, Yuliya 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• SMT-Based Constraint Answer Set Solver EZSMT (System Description)
  Susman, Benjamin ; Lierler, Yuliya 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Parameter Synthesis with IC3 (Informal Presentation)
  Cimatti, Alessandro ; Griggio, Alberto ; Mover, Sergio ; Tonetta, Stefano 2015 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Symbolic Execution as DPLL Modulo Theories
  Phan, Quoc-Sang 2014 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Self-composition by Symbolic Execution
  Phan, Quoc-Sang 2013 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Decision Procedures and Abstract Interpretation (Dagstuhl Seminar 14351)
  Kroening, Daniel ; Reps, Thomas W. ; Seshia, Sanjit A. ; Thakur, Aditya
• Decision Procedures in Soft, Hard and Bio-ware - Follow Up (Dagstuhl Seminar 11272)
  Bjorner, Nikolaj ; Nieuwenhuis, Robert ; Veith, Helmut ; Voronkov, Andrei