Zobrazeno 1 - 10
of 28
pro vyhledávání: '"Yann Régis Gianas"'
Publikováno v:
Formal Aspects of Computing
Formal Aspects of Computing, Springer Verlag, 2020, ⟨10.1007/s00165-020-00523-2⟩
Formal Aspects of Computing, 2020, ⟨10.1007/s00165-020-00523-2⟩
Formal Aspects of Computing, Springer Verlag, 2020, ⟨10.1007/s00165-020-00523-2⟩
Formal Aspects of Computing, 2020, ⟨10.1007/s00165-020-00523-2⟩
Modern computing systems have grown in complexity, and even though system components are generally carefully designed and even verified by different groups of people, thecompositionof these components is often regarded with less attention. Inconsiste
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b264ca4e934c763c499602cdbbc52edd
https://hal.archives-ouvertes.fr/hal-03107526
https://hal.archives-ouvertes.fr/hal-03107526
Autor:
Thomas Letan, Yann Régis-Gianas
Publikováno v:
CPP 2020-9th ACM SIGPLAN International Conference on Certified Programs and Proofs
CPP 2020-9th ACM SIGPLAN International Conference on Certified Programs and Proofs, Jan 2020, Nouvelle-Orléans, United States. pp.1-15, ⟨10.1145/3372885.3373812⟩
CPP
CPP 2020-9th ACM SIGPLAN International Conference on Certified Programs and Proofs, Jan 2020, Nouvelle-Orléans, United States. pp.1-15, ⟨10.1145/3372885.3373812⟩
CPP
International audience; FreeSpec is a framework for the Coq theorem prover whichallows for specifying and verifying complex systems as hierarchies of components verified both in isolation and incomposition. While FreeSpec was originally introduced fo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::071e66a4ebc13644a4242eb295ccd6e2
https://hal.inria.fr/hal-02422273/file/article.pdf
https://hal.inria.fr/hal-02422273/file/article.pdf
Autor:
Mihaela Sighireanu, Nicolas Jeannerod, Claude Marché, Ralf Treinen, Yann Régis-Gianas, Benedikt Becker
Publikováno v:
Tools and Algorithms for the Construction and Analysis of Systems ISBN: 9783030452360
TACAS (2)
Tools and Algorithms for the Construction and Analysis of Systems
TACAS 2020-26th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
TACAS 2020-26th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Apr 2020, The conference took place on-line, because it couldn't be held in Dublin, Ireland. pp.235-253, ⟨10.1007/978-3-030-45237-7_14⟩
TACAS (2)
Tools and Algorithms for the Construction and Analysis of Systems
TACAS 2020-26th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
TACAS 2020-26th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Apr 2020, The conference took place on-line, because it couldn't be held in Dublin, Ireland. pp.235-253, ⟨10.1007/978-3-030-45237-7_14⟩
The Debian distribution includes more than 28 thousand maintainer scripts, almost all of them are written in Posix shell. These scripts are executed with root privileges at installation, update, and removal of a package, which make them critical for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::83781a0aa95ff8ec80f03f0f0b2d4b88
https://doi.org/10.1007/978-3-030-45237-7_14
https://doi.org/10.1007/978-3-030-45237-7_14
Publikováno v:
Programming Languages and Systems ISBN: 9783030171834
ESOP
ESOP
Incremental computation requires propagating changes and reusing intermediate results of base computations. Derivatives, as produced by static differentiation [7], propagate changes but do not reuse intermediate results, leading to wasteful recomputa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::094a96c055b82fb091ed6734b5c7a3a5
https://doi.org/10.1007/978-3-030-17184-1_20
https://doi.org/10.1007/978-3-030-17184-1_20
Publikováno v:
Journal of Computer Languages. 57:100944
The POSIX shell language defies conventional wisdom of compiler construction on several levels: The shell language was not designed for static parsing, but with an intertwining of syntactic analysis and execution by expansion in mind. Token recogniti
Publikováno v:
SLE 2018-ACM SIGPLAN International Conference on Software Language Engineering
SLE 2018-ACM SIGPLAN International Conference on Software Language Engineering, Nov 2018, Boston, United States. ⟨10.1145/3276604.3276615⟩
SLE
SLE 2018-ACM SIGPLAN International Conference on Software Language Engineering, Nov 2018, Boston, United States. ⟨10.1145/3276604.3276615⟩
SLE
The POSIX shell language defies conventional wisdom of compiler construction on several levels: The shell language was not designed for static parsing, but with an intertwining of syntactic analysis and execution by expansion in mind. Token recogniti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e5ac6b56f05d097adfea38a4cec1792c
https://hal.archives-ouvertes.fr/hal-01890044
https://hal.archives-ouvertes.fr/hal-01890044
Publikováno v:
FM 2018-22nd International Symposium on Formal Methods
FM 2018-22nd International Symposium on Formal Methods, Jul 2018, Oxford, United Kingdom. pp.338-354, ⟨10.1007/978-3-319-95582-7_20⟩
Formal Methods ISBN: 9783319955810
FM
FM 2018-22nd International Symposium on Formal Methods, Jul 2018, Oxford, United Kingdom. pp.338-354, ⟨10.1007/978-3-319-95582-7_20⟩
Formal Methods ISBN: 9783319955810
FM
International audience; Modern computing systems have grown in complexity, and the attack surface has increased accordingly. Even though system components are generally carefully designed and even verified by different groups of people, the compositi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7df59d78375118733e8b73e32abe6961
https://hal.inria.fr/hal-01799712
https://hal.inria.fr/hal-01799712
Coq supports a range of built-in tactics, which are engineered primarily to support \emph{backward reasoning}. Starting from a desired goal, the Coq programmer can use these tactics to manipulate the proof state interactively, applying axioms or lemm
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1475cdec8c6885c6aef3b30aa53f9a1f
Publikováno v:
Proceedings of the ACM on Programming Languages, 2(ICFP)
Proceedings of the ACM on Programming Languages
Proceedings of the ACM on Programming Languages, ACM, 2018, 2 (ICFP), pp.1-31. ⟨10.1145/3236773⟩
Proceedings of the ACM on Programming Languages, 2018, 2 (ICFP), pp.1-31. ⟨10.1145/3236773⟩
Proceedings of the ACM on Programming Languages
Proceedings of the ACM on Programming Languages, ACM, 2018, 2 (ICFP), pp.1-31. ⟨10.1145/3236773⟩
Proceedings of the ACM on Programming Languages, 2018, 2 (ICFP), pp.1-31. ⟨10.1145/3236773⟩
Coq supports a range of built-in tactics, which are engineered primarily to support backward reasoning . Starting from a desired goal, the Coq programmer can use these tactics to manipulate the proof state interactively, applying axioms or lemmas to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f04fcf8e3d307d4d94952473d2a99a8d
http://resolver.tudelft.nl/uuid:76e4c827-24ae-45c5-a57f-f902a6011fd8
http://resolver.tudelft.nl/uuid:76e4c827-24ae-45c5-a57f-f902a6011fd8
Autor:
Yann Régis-Gianas, Paul Laforgue
Publikováno v:
International Symposium on Principles and Practice of Declarative Programming
International Symposium on Principles and Practice of Declarative Programming, Oct 2017, Namur, Belgium. ⟨10.1145/3131851.3131869⟩
PPDP
International Symposium on Principles and Practice of Declarative Programming, Oct 2017, Namur, Belgium. ⟨10.1145/3131851.3131869⟩
PPDP
International audience; Infinite data structures are elegantly defined by means of copatternmatching, a dual construction to pattern matching that expressesthe outcomes of the observations of an infinite structure. We extendthe OCaml programming lang
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::463b30b90d3a0d00eaaa5657b8bc12f5
https://hal.inria.fr/hal-01653261/file/laforgue-17.pdf
https://hal.inria.fr/hal-01653261/file/laforgue-17.pdf