Zobrazeno 1 - 10
of 173
pro vyhledávání: '"Frédéric Lang"'
Autor:
Luca Di Stefano, Frédéric Lang
Publikováno v:
Formal Methods in System Design
Formal Methods in System Design, In press, ⟨10.1007/s10703-023-00422-1⟩
Formal Methods in System Design, In press, ⟨10.1007/s10703-023-00422-1⟩
International audience; Sharp bisimulation is a refinement of branching bisimulation, parameterized by a subset of the system's actions, called strong actions. This parameterization allows the sharp bisimulation to be tailored by the property under v
Autor:
Frédéric Lang, Luca Di Stefano
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783031249495
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::31127125868dab22682c9a19b569ff44
https://doi.org/10.1007/978-3-031-24950-1_8
https://doi.org/10.1007/978-3-031-24950-1_8
Publikováno v:
AppFM 2021-1st International Workshop on Applicable Formal Methods
AppFM 2021-1st International Workshop on Applicable Formal Methods, Nov 2021, Bejing, China. ⟨10.48550/arXiv.2111.08203⟩
AppFM 2021-1st International Workshop on Applicable Formal Methods, Nov 2021, Bejing, China
AppFM 2021-1st International Workshop on Applicable Formal Methods, Nov 2021, Bejing, China. ⟨10.48550/arXiv.2111.08203⟩
AppFM 2021-1st International Workshop on Applicable Formal Methods, Nov 2021, Bejing, China
CADP is a comprehensive toolbox implementing results of concurrency theory. This paper addresses the question, whether CADP qualifies as an applicable formal method, based on the experience of the authors and feedback reported by users.
Comment:
Comment:
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1cff8fc8e9a173d2b3af635480726261
Autor:
Frédéric Lang, Radu Mateescu
Publikováno v:
Logical Methods in Computer Science, Vol Volume 9, Issue 4 (2013)
Partial model checking was proposed by Andersen in 1995 to verify a temporal logic formula compositionally on a composition of processes. It consists in incrementally incorporating into the formula the behavioural information taken from one process -
Externí odkaz:
https://doaj.org/article/828ff972b82a49bd879b412ebb9f8a46
Publikováno v:
Science of Computer Programming
Science of Computer Programming, Elsevier, 2020, 196, pp.102493. ⟨10.1016/j.scico.2020.102493⟩
Science of Computer Programming, 2020, 196, pp.102493. ⟨10.1016/j.scico.2020.102493⟩
Science of Computer Programming, 196:102493. Elsevier
Science of Computer Programming, Elsevier, 2020, 196, pp.102493. ⟨10.1016/j.scico.2020.102493⟩
Science of Computer Programming, 2020, 196, pp.102493. ⟨10.1016/j.scico.2020.102493⟩
Science of Computer Programming, 196:102493. Elsevier
Compositional model checking approaches attempt to limit state space explosion by iteratively combining the behaviour of the components in a concurrent system and reducing the result modulo an appropriate equivalence relation. In this article, we con
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4dfa09089be79a8135533696913de012
https://hal.inria.fr/hal-02890800/document
https://hal.inria.fr/hal-02890800/document
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030500283
COORDINATION
Lecture Notes in Computer Science
COORDINATION 2020-22nd IFIP WG 6.1 International Conference on Coordination Models and Languages
COORDINATION 2020-22nd IFIP WG 6.1 International Conference on Coordination Models and Languages, Jun 2020, La Valetta, Malta. pp.370-385, ⟨10.1007/978-3-030-50029-0_23⟩
Coordination Models and Languages
COORDINATION
Lecture Notes in Computer Science
COORDINATION 2020-22nd IFIP WG 6.1 International Conference on Coordination Models and Languages
COORDINATION 2020-22nd IFIP WG 6.1 International Conference on Coordination Models and Languages, Jun 2020, La Valetta, Malta. pp.370-385, ⟨10.1007/978-3-030-50029-0_23⟩
Coordination Models and Languages
International audience; We present an automated workflow for the analysis of multi-agent systems described in a simple specification language. The procedure is based on a structural encoding of the input system and the property of interest into an LN
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::58ddbe0eb067c38db1e1ae7b5187a95f
https://doi.org/10.1007/978-3-030-50029-0_23
https://doi.org/10.1007/978-3-030-50029-0_23
Publikováno v:
Tools and Algorithms for the Construction and Analysis of Systems ISBN: 9783030452360
TACAS (2)
TACAS 2020-Tools and Algorithms for the Construction and Analysis of Systems
TACAS 2020-Tools and Algorithms for the Construction and Analysis of Systems, Apr 2020, Dublin, Ireland. pp.57-76, ⟨10.1007/978-3-030-45237-7_4⟩
Tools and Algorithms for the Construction and Analysis of Systems
26th International Conference, TACAS 2020, pp. 57–73, Dublin, Ireland, April 25-30, 2020
info:cnr-pdr/source/autori:Lang F.; Mateescu R.; Mazzanti F./congresso_nome:26th International Conference, TACAS 2020/congresso_luogo:Dublin, Ireland/congresso_data:April 25-30, 2020/anno:2020/pagina_da:57/pagina_a:73/intervallo_pagine:57–73
TACAS (2)
TACAS 2020-Tools and Algorithms for the Construction and Analysis of Systems
TACAS 2020-Tools and Algorithms for the Construction and Analysis of Systems, Apr 2020, Dublin, Ireland. pp.57-76, ⟨10.1007/978-3-030-45237-7_4⟩
Tools and Algorithms for the Construction and Analysis of Systems
26th International Conference, TACAS 2020, pp. 57–73, Dublin, Ireland, April 25-30, 2020
info:cnr-pdr/source/autori:Lang F.; Mateescu R.; Mazzanti F./congresso_nome:26th International Conference, TACAS 2020/congresso_luogo:Dublin, Ireland/congresso_data:April 25-30, 2020/anno:2020/pagina_da:57/pagina_a:73/intervallo_pagine:57–73
We showed in a recent paper that, when verifying a modal \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\odd
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d426b86a86124e429cb3f20c230325e9
https://doi.org/10.1007/978-3-030-45237-7_4
https://doi.org/10.1007/978-3-030-45237-7_4
Publikováno v:
FM 2019-23rd International Conference on Formal Methods
FM 2019-23rd International Conference on Formal Methods, Oct 2019, Porto, Portugal. pp.196-213, ⟨10.1007/978-3-030-30942-8_13⟩
Formal Methods in System Design
Formal Methods in System Design, 2021, ⟨10.1007/s10703-021-00360-w⟩
Formal methods in system design (Dordr., Online) (2021). doi:10.1007/s10703-021-00360-w
info:cnr-pdr/source/autori:Frédéric Lang F., Mateescu R.; Mazzanti F./titolo:Compositional Verification of Concurrent Systems by Combining Bisimulations/doi:10.1007%2Fs10703-021-00360-w/rivista:Formal methods in system design (Dordr., Online)/anno:2021/pagina_da:/pagina_a:/intervallo_pagine:/volume
Formal Methods in System Design, Springer Verlag, 2021
Formal Methods in System Design, Springer Verlag, 2021, ⟨10.1007/s10703-021-00360-w⟩
FM 2019-International Symposium on Formal Methods. Third World Congress, pp. 196–213, Porto, Portugal, 7-11 October 2019
info:cnr-pdr/source/autori:Lang F.; Mateescu R.; Mazzanti F./congresso_nome:FM 2019-International Symposium on Formal Methods. Third World Congress/congresso_luogo:Porto, Portugal/congresso_data:7-11 October 2019/anno:2019/pagina_da:196/pagina_a:213/intervallo_pagine:196–213
Lecture Notes in Computer Science ISBN: 9783030309411
FM
FM 2019-23rd International Conference on Formal Methods, Oct 2019, Porto, Portugal. pp.196-213, ⟨10.1007/978-3-030-30942-8_13⟩
Formal Methods in System Design
Formal Methods in System Design, 2021, ⟨10.1007/s10703-021-00360-w⟩
Formal methods in system design (Dordr., Online) (2021). doi:10.1007/s10703-021-00360-w
info:cnr-pdr/source/autori:Frédéric Lang F., Mateescu R.; Mazzanti F./titolo:Compositional Verification of Concurrent Systems by Combining Bisimulations/doi:10.1007%2Fs10703-021-00360-w/rivista:Formal methods in system design (Dordr., Online)/anno:2021/pagina_da:/pagina_a:/intervallo_pagine:/volume
Formal Methods in System Design, Springer Verlag, 2021
Formal Methods in System Design, Springer Verlag, 2021, ⟨10.1007/s10703-021-00360-w⟩
FM 2019-International Symposium on Formal Methods. Third World Congress, pp. 196–213, Porto, Portugal, 7-11 October 2019
info:cnr-pdr/source/autori:Lang F.; Mateescu R.; Mazzanti F./congresso_nome:FM 2019-International Symposium on Formal Methods. Third World Congress/congresso_luogo:Porto, Portugal/congresso_data:7-11 October 2019/anno:2019/pagina_da:196/pagina_a:213/intervallo_pagine:196–213
Lecture Notes in Computer Science ISBN: 9783030309411
FM
International audience; One approach to verify a property expressed as a modal μ-calculus formula on a system with several concurrent processes is to build the underlying state space compositionally (i.e., by minimizing and recomposing the state spa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::264f876d70ea19bbd4f08434642b9003
https://hal.inria.fr/hal-02295459/document
https://hal.inria.fr/hal-02295459/document
Publikováno v:
Formal Methods for Industrial Critical Systems ISBN: 9783030002435
FMICS
FMICS 2018-23rd International Conference on Formal Methods for Industrial Critical Systems
FMICS 2018-23rd International Conference on Formal Methods for Industrial Critical Systems, Sep 2018, Maynooth, Ireland. pp.189-210, ⟨10.1007/978-3-030-00244-2_13⟩
FMICS
FMICS 2018-23rd International Conference on Formal Methods for Industrial Critical Systems
FMICS 2018-23rd International Conference on Formal Methods for Industrial Critical Systems, Sep 2018, Maynooth, Ireland. pp.189-210, ⟨10.1007/978-3-030-00244-2_13⟩
International audience; Concurrent systems are intrinsically complex and their verification is hampered by the well-known "state-space explosion" issue. Compositional verification is a powerful approach, based on the divide-and-conquer paradigm, to a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a50de9a10aef84c313b12ab2018bca79
https://doi.org/10.1007/978-3-030-00244-2_13
https://doi.org/10.1007/978-3-030-00244-2_13
Publikováno v:
ModelEd, TestEd, TrustEd-Essays Dedicated to Ed Brinksma on the Occasion of His 60th Birthday
Joost-Pieter Katoen; Rom Langerak; Arend Rensink. ModelEd, TestEd, TrustEd-Essays Dedicated to Ed Brinksma on the Occasion of His 60th Birthday, 10500, Springer, pp.3-26, 2017, Lecture Notes in Computer Science, 978-3-319-68270-9. ⟨10.1007/978-3-319-68270-9_1⟩
ModelEd, TestEd, TrustEd ISBN: 9783319682693
ModelEd, TestEd, TrustEd
Joost-Pieter Katoen; Rom Langerak; Arend Rensink. ModelEd, TestEd, TrustEd-Essays Dedicated to Ed Brinksma on the Occasion of His 60th Birthday, 10500, Springer, pp.3-26, 2017, Lecture Notes in Computer Science, 978-3-319-68270-9. ⟨10.1007/978-3-319-68270-9_1⟩
ModelEd, TestEd, TrustEd ISBN: 9783319682693
ModelEd, TestEd, TrustEd
International audience; We revisit the early publications of Ed Brinksma devoted, on the one hand, to the definition of the formal description technique LOTOS (ISO International Standard 8807:1989) for specifying communication protocols and distribut
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e81271c6f11451511b5c9f67b5f9bcbd
https://inria.hal.science/hal-01621670/document
https://inria.hal.science/hal-01621670/document