Proceedings of the Institute for System Programming of the RAS
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Proceedings of ISP RAS:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Proceedings of the Institute for System Programming of the RAS, 2023, Volume 35, Issue 1, Pages 113–122
DOI: https://doi.org/10.15514/ISPRAS-2023-35(1)-8
(Mi tisp758)
 

Blockchain and satisfiability modulo theories for tender systems

R. Dávila, R. Aldeco-Pérez, E. Barcenas

Universidad Nacional Autónoma de México
Abstract: A tender process consists in competing offers from different candidate suppliers or contractors. The tender winner is supposed to supply or provide a service in better conditions than competitors. Tenders are developed using centralized unverified systems, which reduce transparency, fairness and trust on the process, it also reduces the ability to detect malicious attempts to manipulate the process. Systems that provide formal verification, decentralization, authentication, trust and transparency can mitigate these risks. Satisfiability Modulo Theories provides a formal analysis to prove correctness of tender offers properties, verified properties ensures system reliability. In addition, one technology that claims to provide decentralization is Blockchain, a chain of distributed and decentralized records linked in a way such that integrity is ensured. This paper presents a formal verified and decentralized proposal system, based on Satisfiability Modulo Theories and Blockchain technology, to make electronic procurement tenders more reliable, transparent and fair.
Keywords: Satisfiability Modulo Theories, Tender verification, Blockchain, e-Procurement
Funding agency
This research was supported by the Mexican Council CONACYT (1006953) in collaboration with Instituto de Investigaciones en Matemáticas Aplicadas y en Sistemas: Posgrado de Ciencia e Ingeniería de la Computación of the Universidad Nacional Autónoma de México. The work was also supported by UNAM-PAPIIT(IA104122) and UNAM-PAPIIT(TA101021).
Document Type: Article
Language: English
Citation: R. Dávila, R. Aldeco-Pérez, E. Barcenas, “Blockchain and satisfiability modulo theories for tender systems”, Proceedings of ISP RAS, 35:1 (2023), 113–122
Citation in format AMSBIB
\Bibitem{DavAldBar23}
\by R.~D{\' a}vila, R.~Aldeco-P{\'e}rez, E.~Barcenas
\paper Blockchain and satisfiability modulo theories for tender systems
\jour Proceedings of ISP RAS
\yr 2023
\vol 35
\issue 1
\pages 113--122
\mathnet{http://mi.mathnet.ru/tisp758}
\crossref{https://doi.org/10.15514/ISPRAS-2023-35(1)-8}
Linking options:
  • https://www.mathnet.ru/eng/tisp758
  • https://www.mathnet.ru/eng/tisp/v35/i1/p113
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Proceedings of the Institute for System Programming of the RAS
    Statistics & downloads:
    Abstract page:17
    Full-text PDF :4
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024