Výsledky vyhledávání - "Michael Leuschel"

Akademický článek

Constraint Logic Programming over Infinite Domains with an Application to Proof

Autor: Sebastian Krings, Michael Leuschel

Publikováno v: Electronic Proceedings in Theoretical Computer Science, Vol 234, Iss Proc. WLP 2015/'16/WFLP'16, Pp 73-87 (2017)

We present a CLP(FD)-based constraint solver able to deal with unbounded domains. It is based on constraint propagation, resorting to enumeration if all other methods fail. An important aspect is detecting when enumeration was complete and if this ha

Externí odkaz: https://doaj.org/article/5e7a53358dbe4f0baef6f14bf64a834b

Zobrazit plný text záznamu

Akademický článek

Who watches the watchers: Validating the ProB Validation Tool

Autor: Jens Bendisposto, Sebastian Krings, Michael Leuschel

Publikováno v: Electronic Proceedings in Theoretical Computer Science, Vol 149, Iss Proc. F-IDE 2014, Pp 16-29 (2014)

Over the years, ProB has moved from a tool that complemented proving, to a development environment that is now sometimes used instead of proving for applications, such as exhaustive model checking or data validation. This has led to much more stringe

Externí odkaz: https://doaj.org/article/32854be3dc204aeda83ada9301151278

Zobrazit plný text záznamu

Akademický článek

Checking Computations of Formal Method Tools - A Secondary Toolchain for ProB

Autor: John Witulski, Michael Leuschel

Publikováno v: Electronic Proceedings in Theoretical Computer Science, Vol 149, Iss Proc. F-IDE 2014, Pp 93-105 (2014)

We present the implementation of pyB, a predicate - and expression - checker for the B language. The tool is to be used for a secondary tool chain for data validation and data generation, with ProB being used in the primary tool chain. Indeed, pyB is

Externí odkaz: https://doaj.org/article/2bfbc39c8a5748669fd03eadb1c61ff9

Zobrazit plný text záznamu

SMT solving for the validation of B and Event-B models

Autor: Joshua Schmidt, Michael Leuschel

Publikováno v: International Journal on Software Tools for Technology Transfer. 24:1043-1077

ProB provides a constraint solver for the B-method written in Prolog and can make use of different backends based on SAT and SMT solving. One such backend translates B and Event-B operators to SMT-LIB using the Z3 solver. This translation uses quanti

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::048ab4e39c2ad116a76fcae84d6c1f17
https://doi.org/10.1007/s10009-022-00682-y

Zobrazit plný text záznamu

Making ProB Compatible with SWI-Prolog

Autor: DAVID GELEßUS, MICHAEL LEUSCHEL

Publikováno v: Theory and Practice of Logic Programming. 22:755-769

Even though the core of the Prolog programming language has been standardized by ISO since 1995, it remains difficult to write complex Prolog programs that can run unmodified on multiple Prolog implementations. Indeed, implementations sometimes devia

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::8380e2d6c86636e5019da6c53fe1d16f
https://doi.org/10.1017/s1471068422000230

Zobrazit plný text záznamu

Fifty Years of Prolog and Beyond

Autor: PHILIPP KÖRNER, MICHAEL LEUSCHEL, JOÃO BARBOSA, VÍTOR SANTOS COSTA, VERÓNICA DAHL, MANUEL V. HERMENEGILDO, JOSE F. MORALES, JAN WIELEMAKER, DANIEL DIAZ, SALVADOR ABREU, GIOVANNI CIATTO

Publikováno v: Theory and Practice of Logic Programming, ISSN 1475-3081, 2022, Vol. 22, No. 6

Both logic programming in general, and Prolog in particular, have a long and fascinating history, intermingled with that of many disciplines they inherited from or catalyzed. A large body of research has been gathered over the last 50 years, supporte

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5f1b9f45279284e3240228fefeba166e
https://doi.org/10.1017/s1471068422000102

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání