Zobrazeno 1 - 10
of 186
pro vyhledávání: '"Rubio, Rubén"'
Autor:
Esparza, Javier, Rubio, Rubén
Publikováno v:
Extends LIPIcs 311 (2024) 11:1-11:17
Many well-known logical identities are naturally written as equivalences between contextual formulas. A simple example is the Boole-Shannon expansion $c[p] \equiv (p \wedge c[\mathrm{true}] ) \vee (\neg\, p \wedge c[\mathrm{false}] )$, where $c$ deno
Externí odkaz:
http://arxiv.org/abs/2407.07759
Publikováno v:
J. Logic. Algebr. Program 134 (2023) article 100887
Rewriting logic is a natural and expressive framework for the specification of concurrent systems and logics. The Maude specification language provides an implementation of this formalism that allows executing, verifying, and analyzing the represente
Externí odkaz:
http://arxiv.org/abs/2402.00275
Autor:
Esparza, Javier1 esparza@in.tum.de, Rubio, Rubén2 rubenrub@ucm.es, Sickert, Salomon3 salomon.sickert@mail.huji.ac.il
Publikováno v:
Journal of the ACM. Apr2024, Vol. 71 Issue 2, p1-42. 42p.
Publikováno v:
J. ACM 71(2) (2024) 16:1-16:42
In the mid 80s, Lichtenstein, Pnueli, and Zuck proved a classical theorem stating that every formula of Past LTL (the extension of LTL with past operators) is equivalent to a formula of the form $\bigwedge_{i=1}^n \mathbf{G}\mathbf{F}\, \varphi_i \ve
Externí odkaz:
http://arxiv.org/abs/2310.12613
In the mid 80s, Lichtenstein, Pnueli, and Zuck showed that every formula of Past LTL (the extension of Linear Temporal Logic with past operators) is equivalent to a conjunction of formulas of the form $\mathbf{G}\mathbf{F} \varphi \vee \mathbf{F}\mat
Externí odkaz:
http://arxiv.org/abs/2304.08872
Autor:
Camargo Rubio, Rubén Dario
Publikováno v:
In Acta Colombiana de Cuidado Intensivo April-June 2024 24(2):131-139
Autor:
Camargo Rubio, Rubén Dario
Publikováno v:
In Acta Colombiana de Cuidado Intensivo January-March 2024 24(1):36-44
Autor:
Durán, Francisco, Eker, Steven, Escobar, Santiago, Martí-Oliet, Narciso, Meseguer, José, Rubio, Rubén, Talcott, Carolyn
Rewriting logic is both a flexible semantic framework within which widely different concurrent systems can be naturally specified and a logical framework in which widely different logics can be specified. Maude programs are exactly rewrite theories.
Externí odkaz:
http://arxiv.org/abs/1910.08416
Autor:
Camargo Rubio, Rubén Darío
Publikováno v:
In Acta Colombiana de Cuidado Intensivo October-December 2023 23(4):363-369