Lista referatów

• 2022-01-28, godz. 12:15, 5820

  Konrad Zdanowski (Cardinal Stefan Wyszynski University)

  Intuitionistic SAT solver

  I will present an article by F. Besson, Itauto: An Extensible Intuitionistic SAT Solver, which was presented at the conference Interactive Theorem Proving, ITP 2021 (url: https://drops.dagstuhl.de/opus/frontdoor.php?source_opus=13904 ). The author presents an implementation of an intuitionistic ...

• 2022-01-21, godz. 12:15, 5820

  Aleksy Schubert (MIMUW)

  Prenex fragment of first-order intuitionistic logic and word unification

  I will recall an old result by Gurevich and Voronkov connecting the monadic case in the prenex intuitionistic predicate logic with equality with word unification. ...

• 2021-12-03, godz. 12:15, 5820

  Marcin Benke (MIMUW)

  (E)TiML: A Functional Language for Practical Complexity Analysis (for Ethereum)

  TiML is a variant of ML whose types contain resource bounds, designed by Peng Wang as his PhD thesis on MIT. When a TiML program passes the typechecking, upper bounds on its resource usage can be guaranteed. One interesting application (or rather extension) of this language is using it for Ethereum...

• 2021-11-26, godz. 12:15, 5820

  Aleksy Schubert (MIMUW)

  Verification of Ethereum programs

  The general overview of blockchain and smart contract technologies is given. Based upon that a state-of-the art verification technique VerX is discussed.   You can join the meeting under the Zoom link: https://us02web.zoom.us/j/83143002443?pwd=dnlSQ05pVjB3L3cwSUkzOEVOTnJVUT09 ...

• 2021-11-19, godz. 12:15, 5820

  Maciej Zielenkiewicz (MIMUW)

  Small model property reflects in games and automata

  Let's choose a logic theory having the small model property. I will show that the size of the small model used in the definition of the property can be directly used to show a limit on the number of maximal variables 1n an Aphrodite strategy in games for finding a proof. On the other hand I'll show ...

• 2021-11-05, godz. 12:15, 5820

  Jacek Chrząszcz (MIMUW)

  Cameleer: a Deductive Verification Tool for OCaml

  Despite all the advances in deductive verification and proof automation over the past few decades, little attention has been given to the family of functional languages. We present Cameleer, a tool for the deductive verification of programs written in OCaml, with a clear focus on proof automa...

• 2021-10-29, godz. 12:15, 5820

  Aleksy Schubert (MIMUW)

  NP-completeness of BCI - another view

  Another proof of NP-hardness of provability in BCI is presented. As a more natural source of the reduction, the one-in-three 3SAT problem is assumed. ...

• 2021-10-22, godz. 12:15, 5820

  Paweł Urzyczyn (MIMUW)

  NP-completeness of BCI

  We will see a proof of NP-completness of propositional implicational logic BCI, in which each assumption is used exactly once. ...

• 2021-10-08, godz. 12:15, 5820

  Aleksy Schubert (MIMUW)

  Nierozstrzygalność semiunifikacji na chuseczce do nosa

  Problem semiunifikacji pojawia się naturalnie w zagadnieniach związanych z typowalnością programów funkcyjnych, w których systemy typów opartych na systemie F. Intuicyjnie chodzi tutaj o typowanie, w którym funkcji w programie staramy się przypisać jak najbardziej o...

• 2013-09-09, godz. 10:15, 4070

  Kokichi Futatsugi (JAIST-RCSV)

  Generate and check method for invariant verification in CafeOBJ

  Effective coordination of inference (a la theorem proving) and search (a la model checking) is one of the most important and interesting research topics in formal methods.  We have developed several kinds of techniques for coordinating inference and search.The generate and check method is a recent ...

Strony