Skip to main content

2015 | OriginalPaper | Buchkapitel

The Inez Mathematical Programming Modulo Theories Framework

verfasst von : Panagiotis Manolios, Jorge Pais, Vasilis Papavasileiou

Erschienen in: Computer Aided Verification

Verlag: Springer International Publishing

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Our Mathematical Programming Modulo Theories (MPMT) constraint solving framework extends Mathematical Programming technology with techniques from the field of Automated Reasoning, e.g., solvers for first-order theories. In previous work, we used MPMT to synthesize system architectures for Boeing’s Dreamliner and we studied the theoretical aspects of MPMT by means of the Branch and Cut Modulo T (\({\text {BC}}(T)\)) transition system. \({\text {BC}}(T)\) can be thought of as a blueprint for MPMT solvers. This paper provides a more practical and algorithmic view of \({\text {BC}}(T)\). We elaborate on the design and features of Inez, our \({\text {BC}}(T)\) constraint solver. Inez is an open-source, freely available superset of the OCaml programming language that uses the SCIP Branch and Cut framework to extend OCaml with MPMT capability. Inez allows users to write programs that arbitrarily interweave general computation with MPMT constraint solving.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
8.
9.
Zurück zum Zitat Besson, F.: On using an inexact floating-point LP solver for deciding linear arithmetic in an SMT solver. In: SMT (2010) Besson, F.: On using an inexact floating-point LP solver for deciding linear arithmetic in an SMT solver. In: SMT (2010)
10.
Zurück zum Zitat Castillo, E., Conejo, A., Pedregal, P., Garca, R., Alguacil, N.: Building and Solving Mathematical Programming Models in Engineering and Science. Wiley, Hoboken (2002) Castillo, E., Conejo, A., Pedregal, P., Garca, R., Alguacil, N.: Building and Solving Mathematical Programming Models in Engineering and Science. Wiley, Hoboken (2002)
11.
Zurück zum Zitat Cimatti, A., Franzén, A., Griggio, A., Sebastiani, R., Stenico, C.: Satisfiability modulo the theory of costs: foundations and applications. In: Esparza, J., Majumdar, R. (eds.) TACAS 2010. LNCS, vol. 6015, pp. 99–113. Springer, Heidelberg (2010) CrossRef Cimatti, A., Franzén, A., Griggio, A., Sebastiani, R., Stenico, C.: Satisfiability modulo the theory of costs: foundations and applications. In: Esparza, J., Majumdar, R. (eds.) TACAS 2010. LNCS, vol. 6015, pp. 99–113. Springer, Heidelberg (2010) CrossRef
12.
13.
Zurück zum Zitat Dutertre, B., de Moura, L.: A fast linear-arithmetic solver for DPLL(T). In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 81–94. Springer, Heidelberg (2006) CrossRef Dutertre, B., de Moura, L.: A fast linear-arithmetic solver for DPLL(T). In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 81–94. Springer, Heidelberg (2006) CrossRef
14.
Zurück zum Zitat Faure, G., Nieuwenhuis, R., Oliveras, A., Rodríguez-Carbonell, E.: SAT modulo the theory of linear arithmetic: exact, inexact and commercial solvers. In: Kleine Büning, H., Zhao, X. (eds.) SAT 2008. LNCS, vol. 4996, pp. 77–90. Springer, Heidelberg (2008) CrossRef Faure, G., Nieuwenhuis, R., Oliveras, A., Rodríguez-Carbonell, E.: SAT modulo the theory of linear arithmetic: exact, inexact and commercial solvers. In: Kleine Büning, H., Zhao, X. (eds.) SAT 2008. LNCS, vol. 4996, pp. 77–90. Springer, Heidelberg (2008) CrossRef
15.
Zurück zum Zitat Gomory, R.E.: Outline of an algorithm for integer solutions to linear programs. Bull. AMS 64, 275–278 (1958)MathSciNetCrossRef Gomory, R.E.: Outline of an algorithm for integer solutions to linear programs. Bull. AMS 64, 275–278 (1958)MathSciNetCrossRef
16.
Zurück zum Zitat Griggio, A.: A practical approach to satisfiability modulo linear integer arithmetic. JSAT 8, 1–27 (2012)MathSciNet Griggio, A.: A practical approach to satisfiability modulo linear integer arithmetic. JSAT 8, 1–27 (2012)MathSciNet
17.
Zurück zum Zitat Hang, C., Manolios, P., Papavasileiou, V.: Synthesizing cyber-physical architectural models with real-time constraints. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 441–456. Springer, Heidelberg (2011) CrossRef Hang, C., Manolios, P., Papavasileiou, V.: Synthesizing cyber-physical architectural models with real-time constraints. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 441–456. Springer, Heidelberg (2011) CrossRef
18.
Zurück zum Zitat Jones, S.P., Vytiniotis, D., Weirich, S., Washburn, G.: Simple unification-based type inference for GADTs. In: ICFP (2006) Jones, S.P., Vytiniotis, D., Weirich, S., Washburn, G.: Simple unification-based type inference for GADTs. In: ICFP (2006)
19.
Zurück zum Zitat Koksal, A.S., Kuncak, V., Suter, P.: Constraints as Control. In: POPL (2012) Koksal, A.S., Kuncak, V., Suter, P.: Constraints as Control. In: POPL (2012)
20.
Zurück zum Zitat Manna, Z., Zarba, C.: Combining Decision Procedures. In: 10th Anniversary Colloquium of UNU/IIST (2002) Manna, Z., Zarba, C.: Combining Decision Procedures. In: 10th Anniversary Colloquium of UNU/IIST (2002)
21.
Zurück zum Zitat Manolios, P., Papavasileiou, V.: ILP modulo theories. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 662–677. Springer, Heidelberg (2013) CrossRef Manolios, P., Papavasileiou, V.: ILP modulo theories. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 662–677. Springer, Heidelberg (2013) CrossRef
22.
Zurück zum Zitat Manolios, P., Papavasileiou, V., Riedewald, M.: ILP Modulo Data. In: FMCAD (2014) Manolios, P., Papavasileiou, V., Riedewald, M.: ILP Modulo Data. In: FMCAD (2014)
23.
Zurück zum Zitat Monniaux, D.: On using floating-point computations to help an exact linear arithmetic decision procedure. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 570–583. Springer, Heidelberg (2009) CrossRef Monniaux, D.: On using floating-point computations to help an exact linear arithmetic decision procedure. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 570–583. Springer, Heidelberg (2009) CrossRef
24.
Zurück zum Zitat Nelson, G., Oppen, D.: Fast Decision Algorithms Based on Union and Find (1977) Nelson, G., Oppen, D.: Fast Decision Algorithms Based on Union and Find (1977)
25.
Zurück zum Zitat Nelson, G., Oppen, D.C.: Simplification by cooperating decision procedures. TOPLAS 1, 245–257 (1979)CrossRef Nelson, G., Oppen, D.C.: Simplification by cooperating decision procedures. TOPLAS 1, 245–257 (1979)CrossRef
26.
Zurück zum Zitat Nieuwenhuis, R., Oliveras, A.: On SAT modulo theories and optimization problems. In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol. 4121, pp. 156–169. Springer, Heidelberg (2006) CrossRef Nieuwenhuis, R., Oliveras, A.: On SAT modulo theories and optimization problems. In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol. 4121, pp. 156–169. Springer, Heidelberg (2006) CrossRef
27.
28.
Zurück zum Zitat Nieuwenhuis, R., Oliveras, A., Tinelli, C.: Solving SAT and SAT modulo theories: from an abstract davis-putnam-logemann-loveland procedure to DPLL(T). JACM 53(6), 937–977 (2006)MathSciNetCrossRef Nieuwenhuis, R., Oliveras, A., Tinelli, C.: Solving SAT and SAT modulo theories: from an abstract davis-putnam-logemann-loveland procedure to DPLL(T). JACM 53(6), 937–977 (2006)MathSciNetCrossRef
29.
Zurück zum Zitat Shostak, R.: A practical decision procedure for arithmetic with function symbols. JACM 26(2), 351–360 (1979)MathSciNetCrossRef Shostak, R.: A practical decision procedure for arithmetic with function symbols. JACM 26(2), 351–360 (1979)MathSciNetCrossRef
30.
Zurück zum Zitat Sofronie-Stokkermans, V.: Hierarchic reasoning in local theory extensions. In: Nieuwenhuis, R. (ed.) CADE 2005. LNCS (LNAI), vol. 3632, pp. 219–234. Springer, Heidelberg (2005) CrossRef Sofronie-Stokkermans, V.: Hierarchic reasoning in local theory extensions. In: Nieuwenhuis, R. (ed.) CADE 2005. LNCS (LNAI), vol. 3632, pp. 219–234. Springer, Heidelberg (2005) CrossRef
31.
Zurück zum Zitat Torlak, E., Bodik, R.: A lightweight symbolic virtual machine for solver-aided host languages. In: PLDI (2014) Torlak, E., Bodik, R.: A lightweight symbolic virtual machine for solver-aided host languages. In: PLDI (2014)
Metadaten
Titel
The Inez Mathematical Programming Modulo Theories Framework
verfasst von
Panagiotis Manolios
Jorge Pais
Vasilis Papavasileiou
Copyright-Jahr
2015
DOI
https://doi.org/10.1007/978-3-319-21668-3_4