Výsledky vyhledávání - "Bourke, Timothy"

Report

Sundials/ML: Connecting OCaml to the Sundials Numeric Solvers

Autor: Bourke, Timothy, Inoue, Jun, Pouzet, Marc

Publikováno v: EPTCS 285, 2018, pp. 101-130

This paper describes the design and implementation of a comprehensive OCaml interface to the Sundials library of numeric solvers for ordinary differential equations, differential algebraic equations, and non-linear equations. The interface provides a

Externí odkaz: http://arxiv.org/abs/1812.11668

Zobrazit plný text záznamu

Report

Mechanizing a Process Algebra for Network Protocols

Autor: Bourke, Timothy, van Glabbeek, Robert J., Höfner, Peter

This paper presents the mechanization of a process algebra for Mobile Ad hoc Networks and Wireless Mesh Networks, and the development of a compositional framework for proving invariant properties. Mechanizing the core process algebra in Isabelle/HOL

Externí odkaz: http://arxiv.org/abs/1512.07304

Zobrazit plný text záznamu

Report

A mechanized proof of loop freedom of the (untimed) AODV routing protocol

Autor: Bourke, Timothy, van Glabbeek, Robert J., Höfner, Peter

Publikováno v: Proc. Automated Technology for Verification and Analysis, ATVA 2014 (F. Cassez and J.-F. Raskin, eds.), LNCS 8837, Springer, 2014, pp. 47-63

The Ad hoc On-demand Distance Vector (AODV) routing protocol allows the nodes in a Mobile Ad hoc Network (MANET) or a Wireless Mesh Network (WMN) to know where to forward data packets. Such a protocol is 'loop free' if it never leads to routing decis

Externí odkaz: http://arxiv.org/abs/1505.05646

Zobrazit plný text záznamu

Report

Showing invariance compositionally for a process algebra for network protocols

Autor: Bourke, Timothy, van Glabbeek, Robert J., Höfner, Peter

Publikováno v: Proc. Interactive Theorem Proving, ITP '14 (G. Klein & R. Gamboa, eds.), LNCS 8558, Springer, 2014, pp. 144-159

Externí odkaz: http://arxiv.org/abs/1407.3519

Zobrazit plný text záznamu

Akademický článek

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

33èmes Journées Francophones des Langages Applicatifs

Autor: Keller, Chantal, Bourke, Timothy, Blazy, Sandrine, Bour, Frédéric, Bury, Guillaume, Dumbrava, Stefania, Gallois-Wong, Diane, Guatto, Adrien, Janin, David, Kerjean, Marie, Pellissier, Luc, Pereira, Mário, Trieu, Alix, Zakowski, Yannick

Publikováno v: Chantal Keller; Timothy Bourke., pp.1-292, 2022

International audience; Les 33èmes Journées Francophones des Langages Applicatifs (JFLA) se sont tenues à Saint-Médard-d'Excideuil, plus précisément Domaine d'Essendiéras (Périgord), du mardi 28 juin 2022 au vendredi 1er juillet 2022.Les JFLA

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::8576c5c241ab3e94a3ac0c7e870b372e
https://inria.hal.science/hal-03689075

Zobrazit plný text záznamu

JFLA 2023 - 34èmes Journées Francophones des Langages Applicatifs

Autor: Bourke, Timothy, Demange, Delphine

Publikováno v: pp.1-308, 2023, Journées Francophones des Langages Applicatifs
2023, Journées Francophones des Langages Applicatifs

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::777da45e327eef9c0ec0f1e23fa3c09b
https://inria.hal.science/hal-03962188

Zobrazit plný text záznamu

Analyse de dépendance vérifiée pour un langage synchrone à flot de données

Autor: Bourke, Timothy, Pesin, Basile, Pouzet, Marc

Publikováno v: Journées Francophones des Langages Applicatifs
JFLA 2023-34èmes Journées Francophones des Langages Applicatifs
JFLA 2023-34èmes Journées Francophones des Langages Applicatifs, Jan 2023, Praz-sur-Arly, France. pp.101-120

National audience; Vélus est une formalisation d'un langage synchrone à flots de données et de sa compilation dans l'assistant de preuve Coq. Il inclut une définition de la sémantique dynamique du langage, un compilateur produisant du code impé

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=od_______165::b40678e08dde4f34f37719380fb24d2a
https://inria.hal.science/hal-03936656/document

Zobrazit plný text záznamu

Scheduling and Compiling Rate-Synchronous Programs with End-To-End Latency Constraints

Autor: Bourke, Timothy, Bregeon, Vincent, Pouzet, Marc

Publikováno v: Leibniz International Proceedings in Informatics
35th Euromicro Conference on Real-Time Systems (ECRTS 2023)
35th Euromicro Conference on Real-Time Systems (ECRTS 2023), Jul 2023, Vienna, Austria. pp.1:1--1:22, ⟨10.4230/LIPIcs.ECRTS.2023.1⟩

We present an extension of the synchronous-reactive model for specifying multi-rate systems. A set of periodically executed components and their communication dependencies are expressed in a Lustre-like programming language with features for load bal

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ea2fb3e026d17912350da65d774fccc2

Zobrazit plný text záznamu

Normalisation vérifiée du langage Lustre

Autor: Bourke, Timothy, Jeanmaire, Paul, Pesin, Basile, Pouzet, Marc

Publikováno v: JFLA 2021-32ème Journées Francophones des Langages Applicatifs
JFLA 2021-32ème Journées Francophones des Langages Applicatifs, Yann Régis-Gianas et Chantal Keller, Apr 2021, En ligne, France. pp.117-133

Lustre is a synchronous dataflow language designed for programming embedded systems. In the Vélus project, we use Coq to develop and formalize a compiler that accepts a normalized form of the language and produces imperative code. While this restric

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::c257e39ae08ea61fb6a51fdc986e5eac
https://hal.inria.fr/hal-03287572/document

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání