simon/sidekick
1
0
Fork 0
mirror of https://github.com/c-cube/sidekick.git synced 2026-01-28 12:24:50 -05:00
Code Issues Projects Releases Packages Wiki Activity Actions

Corrections

Browse source
This commit is contained in:
Guillaume Bury 2017-08-31 16:27:51 +02:00
parent c1d00c21ca
commit 64c170f3a1
2 changed files with 7 additions and 7 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

BIN
poster/poster.pdf
View file

Binary file not shown.

14
poster/poster.tex
View file

@ -43,9 +43,9 @@
{ {
\vspace{0.5cm} % Pour pas se faire manger par le titre \vspace{0.5cm} % Pour pas se faire manger par le titre
\msat{} is a SAT solving library written in OCaml. It allows to solve the satisfiability \msat{}: a SAT solving library in OCaml. Solves the \textbf{satisfibility}
of propositional problems in clausal normal form, and produce either a propositional model, of propositional clauses. It is \textbf{Modular}: the user provides
or a resolution proof of the problem's unsatisfiability. the theory, and produces \textbf{formal proof}.
} }
\tblock{Conflict Driven Clause learning} \tblock{Conflict Driven Clause learning}
@ -83,7 +83,7 @@
\end{itemize} \end{itemize}
\item Features \item Features
\begin{itemize}[label=\checkmark] \begin{itemize}[label=\checkmark]
\item Generative functors \item Functorized design, using generative functors
\item Local assumptions \item Local assumptions
\item Model output and Proof output (Coq, dot) \item Model output and Proof output (Coq, dot)
\end{itemize} \end{itemize}
@ -101,9 +101,9 @@
\begin{center} \begin{center}
\begin{tabular}{c@{\quad}|@{\quad}c@{\quad}|@{\quad}c@{\quad}|@{\quad}c} \begin{tabular}{c@{\quad}|@{\quad}c@{\quad}|@{\quad}c@{\quad}|@{\quad}c}
regstab & SAT & binary only & only pure SAT \\ \hline regstab & SAT & binary only & only pure SAT \\ \hline
\begin{tabular}{c}minisat\\sattools\\ocaml-sat-solvers\end{tabular} & SAT & C bindings & only pure SAT \\ \hline \begin{tabular}{c}\textbf{minisat}\\\textbf{sattools}\\ocaml-sat-solvers\end{tabular} & SAT & C bindings & only pure SAT \\ \hline
Alt-ergo & SMT & binary only & Fixed theory \\ \hline Alt-ergo & SMT & binary only & Fixed theory \\ \hline
Alt-ergo-zero & SMT & OCaml lib & Fixed theory \\ \hline \textbf{Alt-ergo-zero} & SMT & OCaml lib & Fixed theory \\ \hline
\begin{tabular}{c}ocamlyices\\yices2\end{tabular} & SMT & C bindings & Fixed theory \\ \hline \begin{tabular}{c}ocamlyices\\yices2\end{tabular} & SMT & C bindings & Fixed theory \\ \hline
\end{tabular} \end{tabular}
\end{center} \end{center}
@ -132,7 +132,7 @@
\tblock{Proof generation} \tblock{Proof generation}
{ {
\begin{itemize}[label=\checkmark] \begin{itemize}[label=\checkmark]
\item Each clause records it "history", that is the clauses \item Each clause records its "history", that is the clauses
used during analyzing used during analyzing
\item Minimal impact on proof search (already done to compute \item Minimal impact on proof search (already done to compute
unsat-core) unsat-core)