Zobrazeno 1 - 10
of 43
pro vyhledávání: '"Horatiu Cirstea"'
Publikováno v:
Logical Methods in Computer Science, Vol Volume 13, Issue 4 (2017)
Rewriting is a formalism widely used in computer science and mathematical logic. When using rewriting as a programming or modeling paradigm, the rewrite rules describe the transformations one wants to operate and rewriting strategies are used to con-
Externí odkaz:
https://doaj.org/article/f03c227f453c4d30909726ba88d4107a
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 15, Iss Proc. WRS 2009, Pp 1-19 (2010)
This paper is a contribution to the theoretical foundations of strategies. We first present a general definition of abstract strategies which is extensional in the sense that a strategy is defined explicitly as a set of derivations of an abstract red
Externí odkaz:
https://doaj.org/article/e929508765c0496282f9cbe32e3d7809
Publikováno v:
PPDP
PPDP 2021-23rd International Symposium on Principles and Practice of Declarative Programming
PPDP 2021-23rd International Symposium on Principles and Practice of Declarative Programming, Sep 2021, Tallinn, Estonia. pp.1-13, ⟨10.1145/3479394.3479404⟩
PPDP 2021-23rd International Symposium on Principles and Practice of Declarative Programming
PPDP 2021-23rd International Symposium on Principles and Practice of Declarative Programming, Sep 2021, Tallinn, Estonia. pp.1-13, ⟨10.1145/3479394.3479404⟩
International audience; Rewriting is a widely established formalism with major applications in computer science. It is indeed a staple of many formal verification applications as it is especially well suited to describe program semantics and transfor
Publikováno v:
International Workshop on Verification and Program Transformation
International Workshop on Verification and Program Transformation, Apr 2020, Dublin, Ireland. pp.110-124, ⟨10.4204/EPTCS.320.8⟩
[Research Report] LORIA UMR 7503 CNRS, INRIA, Université de LORRAINE. 2020, pp.36
VPT/HCVS@ETAPS
International Workshop on Verification and Program Transformation, Apr 2020, Dublin, Ireland. pp.110-124, ⟨10.4204/EPTCS.320.8⟩
[Research Report] LORIA UMR 7503 CNRS, INRIA, Université de LORRAINE. 2020, pp.36
VPT/HCVS@ETAPS
Distributed algorithms offer challenges in checking that they meet their specifications. Verification techniques can be extended to deal with the verification of safety properties of distributed algorithms. In this paper, we present an approach for c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c72933bca1689ce7d9a4fbd4d4d1e91a
https://hal.inria.fr/hal-02997277
https://hal.inria.fr/hal-02997277
Autor:
Pierre-Etienne Moreau, Horatiu Cirstea
Publikováno v:
PPDP
PPDP '19: Principles and Practice of Programming Languages 2019
PPDP '19: Principles and Practice of Programming Languages 2019, Oct 2019, Porto, Portugal. pp.19, ⟨10.1145/3354166.3354173⟩
PPDP '19: Principles and Practice of Programming Languages 2019
PPDP '19: Principles and Practice of Programming Languages 2019, Oct 2019, Porto, Portugal. pp.19, ⟨10.1145/3354166.3354173⟩
Rewriting is a formalism widely used in computer science and mathematical logic. The classical formalism has been extended, in the context of functional languages, with an order over the rules and, in the context of rewrite based languages, with the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9444a936bf67a448dd3ca6eaaefab7ba
http://arxiv.org/abs/1905.06233
http://arxiv.org/abs/1905.06233
Publikováno v:
LOPSTR 2020-30th International Symposium on Logic-Based Program Synthesis and Transformation
LOPSTR 2020-30th International Symposium on Logic-Based Program Synthesis and Transformation, Sep 2020, Bologna, Italy
CIEL 2019-8ème Conférence en IngénieriE du Logiciel
CIEL 2019-8ème Conférence en IngénieriE du Logiciel, Jun 2019, Toulouse, France
Logic-Based Program Synthesis and Transformation ISBN: 9783030684457
LOPSTR
LOPSTR 2020-30th International Symposium on Logic-Based Program Synthesis and Transformation, Sep 2020, Bologna, Italy
CIEL 2019-8ème Conférence en IngénieriE du Logiciel
CIEL 2019-8ème Conférence en IngénieriE du Logiciel, Jun 2019, Toulouse, France
Logic-Based Program Synthesis and Transformation ISBN: 9783030684457
LOPSTR
National audience; Program transformation is a common practice in computer science, and its many applications can have a range of dierent objectives. For example, a program written in an original high level language could be either translated into ma
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::909d085a7f7af237938ecff74e2510c3
https://hal.inria.fr/hal-02186325
https://hal.inria.fr/hal-02186325
Autor:
David Sabel, Horatiu Cirstea
Publikováno v:
Electronic Proceedings in Theoretical Computer Science. 265
Autor:
Horatiu Cirstea, Santiago Escobar
Publikováno v:
Electronic Proceedings in Theoretical Computer Science. 235
Publikováno v:
Electronic Proceedings in Theoretical Computer Science
Electronic Proceedings in Theoretical Computer Science, 2010, Reduction Strategies in Rewriting and Programming, 15, pp.1-19. ⟨10.4204/EPTCS.15.1⟩
Electronic Proceedings in Theoretical Computer Science, EPTCS, 2010, Reduction Strategies in Rewriting and Programming, 15, pp.1-19. ⟨10.4204/EPTCS.15.1⟩
Electronic Proceedings in Theoretical Computer Science, Vol 15, Iss Proc. WRS 2009, Pp 1-19 (2010)
Electronic Proceedings in Theoretical Computer Science, 2010, Reduction Strategies in Rewriting and Programming, 15, pp.1-19. ⟨10.4204/EPTCS.15.1⟩
Electronic Proceedings in Theoretical Computer Science, EPTCS, 2010, Reduction Strategies in Rewriting and Programming, 15, pp.1-19. ⟨10.4204/EPTCS.15.1⟩
Electronic Proceedings in Theoretical Computer Science, Vol 15, Iss Proc. WRS 2009, Pp 1-19 (2010)
Proceedings Ninth International Workshop on Reduction Strategies in Rewriting and Programming / Brasilia, Brazil, 28th June 2009 / Edited by: Maribel Fernández; International audience; This paper is a contribution to the theoretical foundations of s
Publikováno v:
7th International Workshop on Reduction Strategies in Rewriting and Programming-WRS 2007
7th International Workshop on Reduction Strategies in Rewriting and Programming-WRS 2007, Jun 2007, Paris, France
7th International Workshop on Reduction Strategies in Rewriting and Programming-WRS 2007, Jun 2007, Paris, France
International audience; The graph rewriting calculus is an extension of the $\rho$-calculus, handling graph like structures rather than simple terms. The calculus over terms is naturally generalized by using unification constraints in addition to the