Skip to content

Commit

Permalink
Merge pull request #5787 from openjournals/joss.06757
Browse files Browse the repository at this point in the history 
Merging automatically
  • Loading branch information
@editorialbot
editorialbot authored Aug 20, 2024
2 parents 9816617 + 87c4c8f commit 549c3d2
Show file tree
Hide file tree
Showing 3 changed files with 908 additions and 0 deletions.
312 changes: 312 additions & 0 deletions joss.06757/10.21105.joss.06757.crossref.xml
View file
Original file line number Diff line number Diff line change
@@ -0,0 +1,312 @@
<?xml version="1.0" encoding="UTF-8"?>
<doi_batch xmlns="http://www.crossref.org/schema/5.3.1"
xmlns:ai="http://www.crossref.org/AccessIndicators.xsd"
xmlns:rel="http://www.crossref.org/relations.xsd"
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
version="5.3.1"
xsi:schemaLocation="http://www.crossref.org/schema/5.3.1 http://www.crossref.org/schemas/crossref5.3.1.xsd">
<head>
<doi_batch_id>20240820144541-96ebf5358ad6b9fb8b46e8a82c2c5d3bc3837413</doi_batch_id>
<timestamp>20240820144541</timestamp>
<depositor>
<depositor_name>JOSS Admin</depositor_name>
<email_address>[email protected]</email_address>
</depositor>
<registrant>The Open Journal</registrant>
</head>
<body>
<journal>
<journal_metadata>
<full_title>Journal of Open Source Software</full_title>
<abbrev_title>JOSS</abbrev_title>
<issn media_type="electronic">2475-9066</issn>
<doi_data>
<doi>10.21105/joss</doi>
<resource>https://joss.theoj.org</resource>
</doi_data>
</journal_metadata>
<journal_issue>
<publication_date media_type="online">
<month>08</month>
<year>2024</year>
</publication_date>
<journal_volume>
<volume>9</volume>
</journal_volume>
<issue>100</issue>
</journal_issue>
<journal_article publication_type="full_text">
<titles>
<title>Satisfiability.jl: Satisfiability Modulo Theories in
Julia</title>
</titles>
<contributors>
<person_name sequence="first" contributor_role="author">
<given_name>Emiko</given_name>
<surname>Soroka</surname>
<ORCID>https://orcid.org/0009-0001-2710-469X</ORCID>
</person_name>
<person_name sequence="additional"
contributor_role="author">
<given_name>Mykel J.</given_name>
<surname>Kochenderfer</surname>
<ORCID>https://orcid.org/0000-0002-7238-9663</ORCID>
</person_name>
<person_name sequence="additional"
contributor_role="author">
<given_name>Sanjay</given_name>
<surname>Lall</surname>
<ORCID>https://orcid.org/0000-0002-1783-5309</ORCID>
</person_name>
</contributors>
<publication_date>
<month>08</month>
<day>20</day>
<year>2024</year>
</publication_date>
<pages>
<first_page>6757</first_page>
</pages>
<publisher_item>
<identifier id_type="doi">10.21105/joss.06757</identifier>
</publisher_item>
<ai:program name="AccessIndicators">
<ai:license_ref applies_to="vor">http://creativecommons.org/licenses/by/4.0/</ai:license_ref>
<ai:license_ref applies_to="am">http://creativecommons.org/licenses/by/4.0/</ai:license_ref>
<ai:license_ref applies_to="tdm">http://creativecommons.org/licenses/by/4.0/</ai:license_ref>
</ai:program>
<rel:program>
<rel:related_item>
<rel:description>Software archive</rel:description>
<rel:inter_work_relation relationship-type="references" identifier-type="doi">10.6084/m9.figshare.26768461</rel:inter_work_relation>
</rel:related_item>
<rel:related_item>
<rel:description>GitHub review issue</rel:description>
<rel:inter_work_relation relationship-type="hasReview" identifier-type="uri">https://github.com/openjournals/joss-reviews/issues/6757</rel:inter_work_relation>
</rel:related_item>
</rel:program>
<doi_data>
<doi>10.21105/joss.06757</doi>
<resource>https://joss.theoj.org/papers/10.21105/joss.06757</resource>
<collection property="text-mining">
<item>
<resource mime_type="application/pdf">https://joss.theoj.org/papers/10.21105/joss.06757.pdf</resource>
</item>
</collection>
</doi_data>
<citation_list>
<citation key="convexjl">
<article_title>Convex optimization in Julia</article_title>
<author>Udell</author>
<journal_title>SC14 Workshop on High Performance Technical
Computing in Dynamic Languages</journal_title>
<doi>10.48550/arXiv.1410.4821</doi>
<cYear>2014</cYear>
<unstructured_citation>Udell, M., Mohan, K., Zeng, D., Hong,
J., Diamond, S., &amp; Boyd, S. (2014). Convex optimization in Julia.
SC14 Workshop on High Performance Technical Computing in Dynamic
Languages.
https://doi.org/10.48550/arXiv.1410.4821</unstructured_citation>
</citation>
<citation key="Lubin2023">
<article_title>JuMP 1.0: Recent improvements to a modeling
language for mathematical optimization</article_title>
<author>Lubin</author>
<journal_title>Mathematical Programming
Computation</journal_title>
<doi>10.1007/s12532-023-00239-3</doi>
<cYear>2023</cYear>
<unstructured_citation>Lubin, M., Dowson, O., Garcia, J. D.,
Huchette, J., Legat, B., &amp; Vielma, J. P. (2023). JuMP 1.0: Recent
improvements to a modeling language for mathematical optimization.
Mathematical Programming Computation.
https://doi.org/10.1007/s12532-023-00239-3</unstructured_citation>
</citation>
<citation key="bradley2007calculus">
<volume_title>The calculus of computation: Decision
procedures with applications to verification</volume_title>
<author>Bradley</author>
<cYear>2007</cYear>
<unstructured_citation>Bradley, A. R., &amp; Manna, Z.
(2007). The calculus of computation: Decision procedures with
applications to verification. Springer Science &amp; Business
Media.</unstructured_citation>
</citation>
<citation key="kroening2016decision">
<volume_title>Decision procedures</volume_title>
<author>Kroening</author>
<cYear>2016</cYear>
<unstructured_citation>Kroening, D., &amp; Strichman, O.
(2016). Decision procedures. Springer.</unstructured_citation>
</citation>
<citation key="de2011satisfiabilityintro">
<article_title>Satisfiability modulo theories: Introduction
and applications</article_title>
<author>De Moura</author>
<journal_title>Communications of the ACM</journal_title>
<issue>9</issue>
<volume>54</volume>
<doi>10.1145/1995376.1995394</doi>
<cYear>2011</cYear>
<unstructured_citation>De Moura, L., &amp; Bjørner, N.
(2011). Satisfiability modulo theories: Introduction and applications.
Communications of the ACM, 54(9), 69–77.
https://doi.org/10.1145/1995376.1995394</unstructured_citation>
</citation>
<citation key="pysmt2015">
<article_title>PySMT: A solver-agnostic library for fast
prototyping of SMT-based algorithms</article_title>
<author>Gario</author>
<journal_title>SMT workshop 2015</journal_title>
<cYear>2015</cYear>
<unstructured_citation>Gario, M., &amp; Micheli, A. (2015).
PySMT: A solver-agnostic library for fast prototyping of SMT-based
algorithms. SMT Workshop 2015.</unstructured_citation>
</citation>
<citation key="baier2021javasmt">
<article_title>JavaSMT 3: Interacting with SMT solvers in
java</article_title>
<author>Baier</author>
<journal_title>International conference on computer aided
verification</journal_title>
<doi>10.1007/978-3-030-81688-9_9</doi>
<cYear>2021</cYear>
<unstructured_citation>Baier, D., Beyer, D., &amp;
Friedberger, K. (2021). JavaSMT 3: Interacting with SMT solvers in java.
International Conference on Computer Aided Verification, 195–208.
https://doi.org/10.1007/978-3-030-81688-9_9</unstructured_citation>
</citation>
<citation key="z3">
<article_title>Z3: An efficient SMT solver</article_title>
<author>Moura</author>
<journal_title>International conference on tools and
algorithms for construction and analysis of systems</journal_title>
<doi>10.1007/978-3-540-78800-3_24</doi>
<cYear>2008</cYear>
<unstructured_citation>Moura, L. M. de, &amp; Bjørner, N. S.
(2008). Z3: An efficient SMT solver. International Conference on Tools
and Algorithms for Construction and Analysis of Systems.
https://doi.org/10.1007/978-3-540-78800-3_24</unstructured_citation>
</citation>
<citation key="cvc5">
<article_title>cvc5: A versatile and industrial-strength SMT
solver</article_title>
<author>Barbosa</author>
<journal_title>Tools and algorithms for the construction and
analysis of systems TACAS 2022</journal_title>
<volume>13243</volume>
<doi>10.1007/978-3-030-99524-9_24</doi>
<cYear>2022</cYear>
<unstructured_citation>Barbosa, H., Barrett, C. W., Brain,
M., Kremer, G., Lachnitt, H., Mann, M., Mohamed, A., Mohamed, M.,
Niemetz, A., Nötzli, A., Ozdemir, A., Preiner, M., Reynolds, A., Sheng,
Y., Tinelli, C., &amp; Zohar, Y. (2022). cvc5: A versatile and
industrial-strength SMT solver. Tools and Algorithms for the
Construction and Analysis of Systems TACAS 2022, 13243, 415–442.
https://doi.org/10.1007/978-3-030-99524-9_24</unstructured_citation>
</citation>
<citation key="biere2008picosat">
<article_title>PicoSAT essentials</article_title>
<author>Biere</author>
<journal_title>Journal on Satisfiability, Boolean Modeling
and Computation</journal_title>
<issue>2-4</issue>
<volume>4</volume>
<doi>10.3233/SAT190039</doi>
<cYear>2008</cYear>
<unstructured_citation>Biere, A. (2008). PicoSAT essentials.
Journal on Satisfiability, Boolean Modeling and Computation, 4(2-4),
75–97. https://doi.org/10.3233/SAT190039</unstructured_citation>
</citation>
<citation key="cassez2017scalasmt">
<article_title>ScalaSMT: Satisfiability modulo theory in
scala (tool paper)</article_title>
<author>Cassez</author>
<journal_title>Proceedings of the 8th ACM SIGPLAN
international symposium on scala</journal_title>
<doi>10.1145/3136000.3136004</doi>
<cYear>2017</cYear>
<unstructured_citation>Cassez, F., &amp; Sloane, A. M.
(2017). ScalaSMT: Satisfiability modulo theory in scala (tool paper).
Proceedings of the 8th ACM SIGPLAN International Symposium on Scala,
51–55. https://doi.org/10.1145/3136000.3136004</unstructured_citation>
</citation>
<citation key="picosat_jl">
<article_title>PicoSAT.jl</article_title>
<author>Bolewski</author>
<cYear>2020</cYear>
<unstructured_citation>Bolewski, J., Lucibello, C., &amp;
Bouton, M. (2020). PicoSAT.jl. Stanford Intelligent Systems Laboratory.
https://github.com/sisl/PicoSAT.jl</unstructured_citation>
</citation>
<citation key="smtlib2">
<article_title>The SMT-LIB standard: Version
2.6</article_title>
<author>Barrett</author>
<cYear>2017</cYear>
<unstructured_citation>Barrett, C., Fontaine, P., &amp;
Tinelli, C. (2017). The SMT-LIB standard: Version 2.6. Department of
Computer Science, The University of Iowa.</unstructured_citation>
</citation>
<citation key="bjorner2023satisfiability">
<article_title>Satisfiability modulo custom theories in
Z3</article_title>
<author>Bjørner</author>
<journal_title>International conference on verification,
model checking, and abstract interpretation</journal_title>
<doi>10.1007/978-3-031-24950-1_5</doi>
<cYear>2023</cYear>
<unstructured_citation>Bjørner, N., Eisenhofer, C., &amp;
Kovács, L. (2023). Satisfiability modulo custom theories in Z3.
International Conference on Verification, Model Checking, and Abstract
Interpretation, 91–105.
https://doi.org/10.1007/978-3-031-24950-1_5</unstructured_citation>
</citation>
<citation key="saouli2023cosysel">
<article_title>CosySEL: Improving SAT solving using local
symmetries</article_title>
<author>Saouli</author>
<journal_title>International conference on verification,
model checking, and abstract interpretation</journal_title>
<doi>10.1007/978-3-031-24950-1_12</doi>
<cYear>2023</cYear>
<unstructured_citation>Saouli, S., Baarir, S., Dutheillet,
C., &amp; Devriendt, J. (2023). CosySEL: Improving SAT solving using
local symmetries. International Conference on Verification, Model
Checking, and Abstract Interpretation, 252–266.
https://doi.org/10.1007/978-3-031-24950-1_12</unstructured_citation>
</citation>
<citation key="bezanson2017julia">
<article_title>Julia: A fresh approach to numerical
computing</article_title>
<author>Bezanson</author>
<journal_title>SIAM review</journal_title>
<issue>1</issue>
<volume>59</volume>
<doi>10.1137/141000671</doi>
<cYear>2017</cYear>
<unstructured_citation>Bezanson, J., Edelman, A., Karpinski,
S., &amp; Shah, V. B. (2017). Julia: A fresh approach to numerical
computing. SIAM Review, 59(1), 65–98.
https://doi.org/10.1137/141000671</unstructured_citation>
</citation>
<citation key="mann2021smt">
<article_title>SMT-switch: A solver-agnostic C++ API for SMT
solving</article_title>
<author>Mann</author>
<journal_title>International conference on theory and
applications of satisfiability testing</journal_title>
<doi>10.1007/978-3-030-80223-3_26</doi>
<cYear>2021</cYear>
<unstructured_citation>Mann, M., Wilson, A., Zohar, Y.,
Stuntz, L., Irfan, A., Brown, K., Donovick, C., Guman, A., Tinelli, C.,
&amp; Barrett, C. (2021). SMT-switch: A solver-agnostic C++ API for SMT
solving. International Conference on Theory and Applications of
Satisfiability Testing, 377–386.
https://doi.org/10.1007/978-3-030-80223-3_26</unstructured_citation>
</citation>
</citation_list>
</journal_article>
</journal>
</body>
</doi_batch>
Binary file added joss.06757/10.21105.joss.06757.pdf
View file
Binary file not shown.
Loading

0 comments on commit 549c3d2

Please sign in to comment.