Wrap up SAT/SMT
This commit is contained in:
@@ -1,6 +1,6 @@
|
||||
<!DOCTYPE html>
|
||||
<html lang="en-us" dir="ltr">
|
||||
<head><script src="/livereload.js?mindelay=10&v=2&port=1313&path=livereload" data-no-instant defer></script>
|
||||
<head>
|
||||
<meta charset="utf-8">
|
||||
|
||||
<meta name="viewport" content ="width=device-width, initial-scale=1.0, maximum-scale=1.0, user-scalable=no">
|
||||
@@ -14,16 +14,16 @@
|
||||
<meta property="og:type" content="article">
|
||||
<meta property="og:title" content="Actively Maintained">
|
||||
<meta property="og:description" content="">
|
||||
<meta property="og:url" content="http://localhost:1313/maintenance/actively-maintained/">
|
||||
<meta property="og:url" content="https://example.org/maintenance/actively-maintained/">
|
||||
<meta property="og:image" content="images/%!s(<nil>)">
|
||||
<link rel="canonical" href="http://localhost:1313/maintenance/actively-maintained/">
|
||||
<link rel="canonical" href="https://example.org/maintenance/actively-maintained/">
|
||||
|
||||
<link rel="apple-touch-icon" sizes="180x180" href='http://localhost:1313/apple-touch-icon.png'>
|
||||
<link rel="icon" type="image/png" sizes="32x32" href='http://localhost:1313/favicon-32x32.png'>
|
||||
<link rel="icon" type="image/png" sizes='16x16' href='http://localhost:1313/favicon-16x16.png'>
|
||||
<link rel="manifest" href='http://localhost:1313/site.webmanifest'>
|
||||
<link rel="apple-touch-icon" sizes="180x180" href='https://example.org/apple-touch-icon.png'>
|
||||
<link rel="icon" type="image/png" sizes="32x32" href='https://example.org/favicon-32x32.png'>
|
||||
<link rel="icon" type="image/png" sizes='16x16' href='https://example.org/favicon-16x16.png'>
|
||||
<link rel="manifest" href='https://example.org/site.webmanifest'>
|
||||
|
||||
<link rel="stylesheet" href="http://localhost:1313/css/styles.8b49a669b444200848aa2fc88c4dc95a3d61d6c822e7ad08eecab8049173e085d2bfa16bf17fa8ec14eb95bb1f04f9a822b2fc4836b4d329140ddd03444ca0bf.css" integrity="sha512-i0mmabREIAhIqi/IjE3JWj1h1sgi560I7sq4BJFz4IXSv6Fr8X+o7BTrlbsfBPmoIrL8SDa00ykUDd0DREygvw==">
|
||||
<link rel="stylesheet" href="https://example.org/css/styles.e5b470edf89c3e1b9498ce83a3fd0a2e73e9d06958e2c3a1af8d89781f9f2bf612b21d5e45ab8f4aef773661de2529437838673a136797a6a8aaab7759f94ded.css" integrity="sha512-5bRw7ficPhuUmM6Do/0KLnPp0GlY4sOhr42JeB+fK/YSsh1eRauPSu93NmHeJSlDeDhnOhNnl6aoqqt3WflN7Q==">
|
||||
|
||||
<link href="/css/fontawesome.css" rel="stylesheet" />
|
||||
<link href="/css/brands.css" rel="stylesheet" />
|
||||
@@ -81,8 +81,85 @@
|
||||
</thead>
|
||||
<tbody>
|
||||
|
||||
<tr onclick="window.location='\/tools\/smt-rat\/'" style="cursor:pointer;"></tr>
|
||||
<td class="tool"><a href="/tools/smt-rat/">SMT-RAT</a></td>
|
||||
<tr onclick="window.location='\/tools\/sat-smt\/bitwuzla\/'" style="cursor:pointer;">
|
||||
<td class="tool"><a href="/tools/sat-smt/bitwuzla/">Bitwuzla</a></td>
|
||||
<td class="description">Bitwuzla is a Satisfiability Modulo Theories (SMT) solver for the theories of fixed-size …</td>
|
||||
|
||||
|
||||
|
||||
</tr>
|
||||
|
||||
<tr onclick="window.location='\/tools\/sat-smt\/colibri\/'" style="cursor:pointer;">
|
||||
<td class="tool"><a href="/tools/sat-smt/colibri/">Colibri</a></td>
|
||||
<td class="description">Colibri is an SMT solver.
|
||||
</td>
|
||||
|
||||
|
||||
|
||||
</tr>
|
||||
|
||||
<tr onclick="window.location='\/tools\/sat-smt\/cryptominisat\/'" style="cursor:pointer;">
|
||||
<td class="tool"><a href="/tools/sat-smt/cryptominisat/">CryptoMiniSat</a></td>
|
||||
<td class="description">CryptoMiniSat is a SAT solver.
|
||||
APIs and Bindings This tool is available through the following …</td>
|
||||
|
||||
|
||||
|
||||
</tr>
|
||||
|
||||
<tr onclick="window.location='\/tools\/sat-smt\/cvc5\/'" style="cursor:pointer;">
|
||||
<td class="tool"><a href="/tools/sat-smt/cvc5/">cvc5</a></td>
|
||||
<td class="description">cvc5 is an automatic theorem prover for SMT problems.
|
||||
</td>
|
||||
|
||||
|
||||
|
||||
</tr>
|
||||
|
||||
<tr onclick="window.location='\/tools\/sat-smt\/glucose\/'" style="cursor:pointer;">
|
||||
<td class="tool"><a href="/tools/sat-smt/glucose/">Glucose</a></td>
|
||||
<td class="description">Glucose is a SAT solver.
|
||||
</td>
|
||||
|
||||
|
||||
|
||||
</tr>
|
||||
|
||||
<tr onclick="window.location='\/tools\/sat-smt\/lingeling\/'" style="cursor:pointer;">
|
||||
<td class="tool"><a href="/tools/sat-smt/lingeling/">Lingeling</a></td>
|
||||
<td class="description">Lingeling is a SAT solver.
|
||||
</td>
|
||||
|
||||
|
||||
|
||||
</tr>
|
||||
|
||||
<tr onclick="window.location='\/tools\/sat-smt\/mathsat\/'" style="cursor:pointer;">
|
||||
<td class="tool"><a href="/tools/sat-smt/mathsat/">MathSAT</a></td>
|
||||
<td class="description"> [ Closed-Source Tool ] MiniSat is a minimalistic, open-source SAT solver, developed to help …</td>
|
||||
|
||||
|
||||
|
||||
</tr>
|
||||
|
||||
<tr onclick="window.location='\/tools\/sat-smt\/opensmt\/'" style="cursor:pointer;">
|
||||
<td class="tool"><a href="/tools/sat-smt/opensmt/">OpenSMT</a></td>
|
||||
<td class="description">OpenSMT is a compact and open-source SMT-solver written in C++, with the main goal of making …</td>
|
||||
|
||||
|
||||
|
||||
</tr>
|
||||
|
||||
<tr onclick="window.location='\/tools\/sat-smt\/parafrost\/'" style="cursor:pointer;">
|
||||
<td class="tool"><a href="/tools/sat-smt/parafrost/">ParaFROST</a></td>
|
||||
<td class="description">ParaFROST is a parallel SAT solver with GPU-accelerated inprocessing capable of harnessing NVIDIA …</td>
|
||||
|
||||
|
||||
|
||||
</tr>
|
||||
|
||||
<tr onclick="window.location='\/tools\/sat-smt\/smt-rat\/'" style="cursor:pointer;">
|
||||
<td class="tool"><a href="/tools/sat-smt/smt-rat/">SMT-RAT</a></td>
|
||||
<td class="description">SMT-RAT is an SMT Real Algebra Toolbox.
|
||||
APIs and Bindings This tool is available through the …</td>
|
||||
|
||||
@@ -90,8 +167,8 @@ APIs and Bindings This tool is available through the …</td>
|
||||
|
||||
</tr>
|
||||
|
||||
<tr onclick="window.location='\/tools\/smtinterpol\/'" style="cursor:pointer;"></tr>
|
||||
<td class="tool"><a href="/tools/smtinterpol/">SMTInterpol</a></td>
|
||||
<tr onclick="window.location='\/tools\/sat-smt\/smtinterpol\/'" style="cursor:pointer;">
|
||||
<td class="tool"><a href="/tools/sat-smt/smtinterpol/">SMTInterpol</a></td>
|
||||
<td class="description">SMTInterpol is an SMT Solver that can compute Craig interpolants for various theories.
|
||||
APIs and …</td>
|
||||
|
||||
@@ -99,8 +176,8 @@ APIs and …</td>
|
||||
|
||||
</tr>
|
||||
|
||||
<tr onclick="window.location='\/tools\/stp\/'" style="cursor:pointer;"></tr>
|
||||
<td class="tool"><a href="/tools/stp/">STP</a></td>
|
||||
<tr onclick="window.location='\/tools\/sat-smt\/stp\/'" style="cursor:pointer;">
|
||||
<td class="tool"><a href="/tools/sat-smt/stp/">STP</a></td>
|
||||
<td class="description">STP is a constraint solver for quantifier-free bitvectors.
|
||||
APIs and Bindings This tool is available …</td>
|
||||
|
||||
@@ -108,24 +185,24 @@ APIs and Bindings This tool is available …</td>
|
||||
|
||||
</tr>
|
||||
|
||||
<tr onclick="window.location='\/tools\/verit\/'" style="cursor:pointer;"></tr>
|
||||
<td class="tool"><a href="/tools/verit/">veriT</a></td>
|
||||
<tr onclick="window.location='\/tools\/sat-smt\/verit\/'" style="cursor:pointer;">
|
||||
<td class="tool"><a href="/tools/sat-smt/verit/">veriT</a></td>
|
||||
<td class="description">veriT is an SMT solver developed by LORIA and ULiege. It supports a wide range of theories and is …</td>
|
||||
|
||||
|
||||
|
||||
</tr>
|
||||
|
||||
<tr onclick="window.location='\/tools\/yices\/'" style="cursor:pointer;"></tr>
|
||||
<td class="tool"><a href="/tools/yices/">Yices 2</a></td>
|
||||
<tr onclick="window.location='\/tools\/sat-smt\/yices\/'" style="cursor:pointer;">
|
||||
<td class="tool"><a href="/tools/sat-smt/yices/">Yices 2</a></td>
|
||||
<td class="description">Yices is an SMT solver developed by SRI International. It is widely used for checking the …</td>
|
||||
|
||||
|
||||
|
||||
</tr>
|
||||
|
||||
<tr onclick="window.location='\/tools\/z3\/'" style="cursor:pointer;"></tr>
|
||||
<td class="tool"><a href="/tools/z3/">Z3</a></td>
|
||||
<tr onclick="window.location='\/tools\/sat-smt\/z3\/'" style="cursor:pointer;">
|
||||
<td class="tool"><a href="/tools/sat-smt/z3/">Z3</a></td>
|
||||
<td class="description">Z3 is a general-purpose theorem prover widely used for SAT & SMT solving.
|
||||
APIs and Bindings This …</td>
|
||||
|
||||
|
||||
@@ -2,52 +2,115 @@
|
||||
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
|
||||
<channel>
|
||||
<title>Actively Maintained on Formal Methods Tools</title>
|
||||
<link>http://localhost:1313/maintenance/actively-maintained/</link>
|
||||
<link>https://example.org/maintenance/actively-maintained/</link>
|
||||
<description>Recent content in Actively Maintained on Formal Methods Tools</description>
|
||||
<generator>Hugo</generator>
|
||||
<language>en-us</language>
|
||||
<lastBuildDate>Sat, 07 Jun 2025 00:00:00 +0000</lastBuildDate>
|
||||
<atom:link href="http://localhost:1313/maintenance/actively-maintained/index.xml" rel="self" type="application/rss+xml" />
|
||||
<atom:link href="https://example.org/maintenance/actively-maintained/index.xml" rel="self" type="application/rss+xml" />
|
||||
<item>
|
||||
<title>Bitwuzla</title>
|
||||
<link>https://example.org/tools/sat-smt/bitwuzla/</link>
|
||||
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
|
||||
<guid>https://example.org/tools/sat-smt/bitwuzla/</guid>
|
||||
<description><p>Bitwuzla is a Satisfiability Modulo Theories (SMT) solver for the theories of fixed-size bit-vectors, floating-point arithmetic, arrays, uninterpreted functions and their combinations.</p></description>
|
||||
</item>
|
||||
<item>
|
||||
<title>Colibri</title>
|
||||
<link>https://example.org/tools/sat-smt/colibri/</link>
|
||||
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
|
||||
<guid>https://example.org/tools/sat-smt/colibri/</guid>
|
||||
<description><p>Colibri is an SMT solver.</p></description>
|
||||
</item>
|
||||
<item>
|
||||
<title>CryptoMiniSat</title>
|
||||
<link>https://example.org/tools/sat-smt/cryptominisat/</link>
|
||||
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
|
||||
<guid>https://example.org/tools/sat-smt/cryptominisat/</guid>
|
||||
<description><p>CryptoMiniSat is a SAT solver.</p>
<h2 id="apis-and-bindings">APIs and Bindings</h2>
<p>This tool is available through the following interfaces:</p>
<ul>
<li><strong>C++ Namespace:</strong> Documentation on <a href="https://www.msoos.org/cryptominisat5/">homepage</a></li>
<li><strong>Python package:</strong> <a href="https://pypi.org/project/pycryptosat/">PyPI package</a></li>
</ul></description>
|
||||
</item>
|
||||
<item>
|
||||
<title>cvc5</title>
|
||||
<link>https://example.org/tools/sat-smt/cvc5/</link>
|
||||
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
|
||||
<guid>https://example.org/tools/sat-smt/cvc5/</guid>
|
||||
<description><p>cvc5 is an automatic theorem prover for SMT problems.</p></description>
|
||||
</item>
|
||||
<item>
|
||||
<title>Glucose</title>
|
||||
<link>https://example.org/tools/sat-smt/glucose/</link>
|
||||
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
|
||||
<guid>https://example.org/tools/sat-smt/glucose/</guid>
|
||||
<description><p>Glucose is a SAT solver.</p></description>
|
||||
</item>
|
||||
<item>
|
||||
<title>Lingeling</title>
|
||||
<link>https://example.org/tools/sat-smt/lingeling/</link>
|
||||
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
|
||||
<guid>https://example.org/tools/sat-smt/lingeling/</guid>
|
||||
<description><p>Lingeling is a SAT solver.</p></description>
|
||||
</item>
|
||||
<item>
|
||||
<title>MathSAT</title>
|
||||
<link>https://example.org/tools/sat-smt/mathsat/</link>
|
||||
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
|
||||
<guid>https://example.org/tools/sat-smt/mathsat/</guid>
|
||||
<description><p><div style="display: flex; align-items: center; gap: 8px;">
 <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(226, 181, 59);"></span>
 <span style="display:none">[</span>
 <span style="color: rgb(226, 181, 59); font-size: 1rem;">Closed-Source Tool</span>
 <span style="display:none">]&nbsp;</span>
</div>
MiniSat is a minimalistic, open-source SAT solver, developed to help researchers and developers alike to get started on SAT.</p></description>
|
||||
</item>
|
||||
<item>
|
||||
<title>OpenSMT</title>
|
||||
<link>https://example.org/tools/sat-smt/opensmt/</link>
|
||||
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
|
||||
<guid>https://example.org/tools/sat-smt/opensmt/</guid>
|
||||
<description><p>OpenSMT is a compact and open-source SMT-solver written in C++, with the main goal of making SMT-Solvers easy to understand and use as a computational engine for formal verification. OpenSMT is built on top of <a href="https://example.org/tools/minisat">MiniSAT</a>.</p></description>
|
||||
</item>
|
||||
<item>
|
||||
<title>ParaFROST</title>
|
||||
<link>https://example.org/tools/sat-smt/parafrost/</link>
|
||||
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
|
||||
<guid>https://example.org/tools/sat-smt/parafrost/</guid>
|
||||
<description><p>ParaFROST is a parallel SAT solver with GPU-accelerated inprocessing capable of harnessing NVIDIA CUDA-enabled GPUs in applying modern inprocessing tecnhiques in parallel.</p>
<h2 id="apis-and-bindings">APIs and Bindings</h2>
<p>This tool is available through the following interfaces:</p>
<ul>
<li><strong>C API:</strong> <a href="https://z3prover.github.io/api/html/group__capi.html">Z3 C API Reference</a></li>
<li><strong>C++ API:</strong> <a href="https://z3prover.github.io/api/html/namespacez3.html">Z3 C++ Namespace Reference</a></li>
<li><strong>.NET API:</strong> <a href="https://z3prover.github.io/api/html/namespace_microsoft_1_1_z3.html">Z3 .NET Namespace Reference</a></li>
<li><strong>Java API:</strong> <a href="https://z3prover.github.io/api/html/namespacecom_1_1microsoft_1_1z3.html">Z3 Java API Reference</a></li>
<li><strong>Python bindings:</strong> <a href="https://pypi.org/project/z3-solver/">z3-solver PyPI package</a> (<a href="https://z3prover.github.io/api/html/z3.html">Documentation</a>)</li>
<li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/z3">z3 crate on crates.io</a></li>
</ul></description>
|
||||
</item>
|
||||
<item>
|
||||
<title>SMT-RAT</title>
|
||||
<link>http://localhost:1313/tools/smt-rat/</link>
|
||||
<link>https://example.org/tools/sat-smt/smt-rat/</link>
|
||||
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
|
||||
<guid>http://localhost:1313/tools/smt-rat/</guid>
|
||||
<guid>https://example.org/tools/sat-smt/smt-rat/</guid>
|
||||
<description><p>SMT-RAT is an SMT Real Algebra Toolbox.</p>
<h2 id="apis-and-bindings">APIs and Bindings</h2>
<p>This tool is available through the following interfaces:</p>
<ul>
<li><strong>C++ API:</strong> <a href="https://ths-rwth.github.io/smtrat/dc/dad/md__builds_ths_smt_smtrat_doc_markdown_07_using_smtrat.html#autotoc_md25">C++ API Reference</a></li>
</ul></description>
|
||||
</item>
|
||||
<item>
|
||||
<title>SMTInterpol</title>
|
||||
<link>http://localhost:1313/tools/smtinterpol/</link>
|
||||
<link>https://example.org/tools/sat-smt/smtinterpol/</link>
|
||||
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
|
||||
<guid>http://localhost:1313/tools/smtinterpol/</guid>
|
||||
<guid>https://example.org/tools/sat-smt/smtinterpol/</guid>
|
||||
<description><p>SMTInterpol is an SMT Solver that can compute Craig interpolants for various theories.</p>
<h2 id="apis-and-bindings">APIs and Bindings</h2>
<p>This tool is available through the following interfaces:</p>
<ul>
<li><strong>Java API:</strong> <a href="https://ultimate.informatik.uni-freiburg.de/smtinterpol/doc/index.html">Java API Reference</a></li>
</ul></description>
|
||||
</item>
|
||||
<item>
|
||||
<title>STP</title>
|
||||
<link>http://localhost:1313/tools/stp/</link>
|
||||
<link>https://example.org/tools/sat-smt/stp/</link>
|
||||
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
|
||||
<guid>http://localhost:1313/tools/stp/</guid>
|
||||
<guid>https://example.org/tools/sat-smt/stp/</guid>
|
||||
<description><p>STP is a constraint solver for quantifier-free bitvectors.</p>
<h2 id="apis-and-bindings">APIs and Bindings</h2>
<p>This tool is available through the following interfaces:</p>
<ul>
<li><strong>C API:</strong> <a href="https://stp.readthedocs.io/en/latest/#c-library-usage">stp C API Reference</a></li>
<li><strong>Python bindings:</strong> <a href="https://stp.readthedocs.io/en/latest/#python-usage">stp PyPI package</a></li>
</ul></description>
|
||||
</item>
|
||||
<item>
|
||||
<title>veriT</title>
|
||||
<link>http://localhost:1313/tools/verit/</link>
|
||||
<link>https://example.org/tools/sat-smt/verit/</link>
|
||||
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
|
||||
<guid>http://localhost:1313/tools/verit/</guid>
|
||||
<guid>https://example.org/tools/sat-smt/verit/</guid>
|
||||
<description><p>veriT is an SMT solver developed by LORIA and ULiege. It supports a wide range of theories and is designed for use in formal verification, automated reasoning, and related research areas. veriT accepts input in SMT-LIB2 and DIMACS formats and provides a command-line interface for ease of integration into verification workflows. The solver is actively maintained and distributed under the BSD license, making it suitable for both academic and industrial applications.</p></description>
|
||||
</item>
|
||||
<item>
|
||||
<title>Yices 2</title>
|
||||
<link>http://localhost:1313/tools/yices/</link>
|
||||
<link>https://example.org/tools/sat-smt/yices/</link>
|
||||
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
|
||||
<guid>http://localhost:1313/tools/yices/</guid>
|
||||
<guid>https://example.org/tools/sat-smt/yices/</guid>
|
||||
<description><p>Yices is an SMT solver developed by SRI International. It is widely used for checking the satisfiability of logical formulas over various theories. It supports the SMT-LIB standard and its own input language, and provides APIs for several programming languages, making it suitable for research and industrial applications in software and hardware verification.</p>
<h2 id="apis-and-bindings">APIs and Bindings</h2>
<p>This tool is available through the following interfaces:</p>
<ul>
<li><strong>General API:</strong> <a href="https://yices.csl.sri.com/doc/index.html">Yices API Reference</a></li>
<li><strong>Python bindings:</strong> <a href="https://pypi.org/project/yices/">yices2 PyPI package</a></li>
<li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/yices2">yices2 crate on crates.io</a></li>
</ul></description>
|
||||
</item>
|
||||
<item>
|
||||
<title>Z3</title>
|
||||
<link>http://localhost:1313/tools/z3/</link>
|
||||
<link>https://example.org/tools/sat-smt/z3/</link>
|
||||
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
|
||||
<guid>http://localhost:1313/tools/z3/</guid>
|
||||
<guid>https://example.org/tools/sat-smt/z3/</guid>
|
||||
<description><p>Z3 is a general-purpose theorem prover widely used for SAT &amp; SMT solving.</p>
<h2 id="apis-and-bindings">APIs and Bindings</h2>
<p>This tool is available through the following interfaces:</p>
<ul>
<li><strong>C API:</strong> <a href="https://z3prover.github.io/api/html/group__capi.html">Z3 C API Reference</a></li>
<li><strong>C++ API:</strong> <a href="https://z3prover.github.io/api/html/namespacez3.html">Z3 C++ Namespace Reference</a></li>
<li><strong>.NET API:</strong> <a href="https://z3prover.github.io/api/html/namespace_microsoft_1_1_z3.html">Z3 .NET Namespace Reference</a></li>
<li><strong>Java API:</strong> <a href="https://z3prover.github.io/api/html/namespacecom_1_1microsoft_1_1z3.html">Z3 Java API Reference</a></li>
<li><strong>Python bindings:</strong> <a href="https://pypi.org/project/z3-solver/">z3-solver PyPI package</a> (<a href="https://z3prover.github.io/api/html/z3.html">Documentation</a>)</li>
<li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/z3">z3 crate on crates.io</a></li>
</ul></description>
|
||||
</item>
|
||||
</channel>
|
||||
|
||||
Reference in New Issue
Block a user