Zobrazeno 1 - 10
of 70
pro vyhledávání: '"Hardin, Thérèse"'
Publikováno v:
9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning - LPAR'2002, Oct 2002, Tbilisi, Georgia. pp.130-144
We define an extension of predicate logic, called Binding Logic, where variables can be bound in terms and in propositions. We introduce a notion of model for this logic and prove a soundness and completeness theorem for it. This theorem is obtained
Externí odkaz:
http://arxiv.org/abs/2305.15782
Publikováno v:
EPTCS 149, 2014, pp. 58-63
In this paper we present our experience in developing a security application using a typed functional language. We describe how the formal grounding of its semantic and compiler have allowed for a trustworthy development and have facilitated the fulf
Externí odkaz:
http://arxiv.org/abs/1404.6606
Autor:
Jaeger, Eric, Hardin, Thérèse
We present Bicoq3, a deep embedding of the B system in Coq, focusing on the technical aspects of the development. The main subjects discussed are related to the representation of sets and maps, the use of induction principles, and the introduction of
Externí odkaz:
http://arxiv.org/abs/0902.3865
Autor:
Jaeger, Eric, Hardin, Thérèse
Publikováno v:
High Assurance Systems Engineering Symposium, Nanjing : Chine (2008)
Formal methods provide remarkable tools allowing for high levels of confidence in the correctness of developments. Their use is therefore encouraged, when not required, for the development of systems in which safety or security is mandatory. But effe
Externí odkaz:
http://arxiv.org/abs/0902.3861
Publikováno v:
Dans 16th European Symposium on Programming (2006)
Many algorithms use concrete data types with some additional invariants. The set of values satisfying the invariants is often a set of representatives for the equivalence classes of some equational theory. For instance, a sorted list is a particular
Externí odkaz:
http://arxiv.org/abs/cs/0701031
Publikováno v:
ISTE Wiley, 2021, Print ISBN:9781786306029 |Online ISBN:9781119851196. ⟨10.1002/9781119851196⟩
International audience; This book – composed of two volumes – explores the syntactical constructs of the most common programming languages, and sheds a mathematical light on their semantics, providing also an accurate presentation of the material
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::771495d742b29cf8c8f9040c2c76ead1
https://hal.archives-ouvertes.fr/hal-03337213
https://hal.archives-ouvertes.fr/hal-03337213
Publikováno v:
ISTE Wiley, 2021, Print ISBN:9781786305305 |Online ISBN:9781119824121. ⟨10.1002/9781119824121⟩
International audience; This book – the first of two volumes – explores the syntactical constructs of the most common programming languages, and sheds a mathematical light on their semantics, while also providing an accurate presentation of the m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::df893c58d210b9f86a56e01d1a54fbde
https://doi.org/10.1002/9781119824121
https://doi.org/10.1002/9781119824121
Publikováno v:
ISTE Editions, 2021, 9781784057022
National audience; Cet ouvrage explore les constructions syntaxiques des langages de programmation les plus courants, avec un éclairage mathématique sur leurs sémantiques et une présentation précise des aspects matériels qui interfèrent avec l
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::bcf85d06980937517ad6abc1e64cb9d8
https://hal.science/hal-03030511
https://hal.science/hal-03030511