Seffrin, André ; Biedermann, Alexander ; Huss, Sorin (2010)
Tiny-Pi: A Novel Formal Method for Specification, Analysis, and Verification of Dynamic Partial Reconfiguration Processes.
Konferenzveröffentlichung, Bibliographie
Kurzbeschreibung (Abstract)
On FPGA-platforms, the feature of dynamic partial recon?guration offers a wide range of applications. We propose a new formal method for design, analysis, and veri?cation of the recon?guration process on such devices. The ?-calculus, also known as the calculus of mobile processes, is a type of process algebra typically used to describe dynamic communicating processes. We propose the ?-calculus as a foundation to model dynamic partial recon?guration of hardware modules. A subset of this calculus that we call tiny-? can be executed in resource-restricted, embedded environments which feature recon?guration properties. As a proof-of-concept, we present a small virtual machine implementation for tiny-?. We have also implemented a compilation ?ow from a textual description of tiny-? speci?cations into executable bytecode.
| Typ des Eintrags: | Konferenzveröffentlichung |
|---|---|
| Erschienen: | 2010 |
| Autor(en): | Seffrin, André ; Biedermann, Alexander ; Huss, Sorin |
| Art des Eintrags: | Bibliographie |
| Titel: | Tiny-Pi: A Novel Formal Method for Specification, Analysis, and Verification of Dynamic Partial Reconfiguration Processes |
| Sprache: | Englisch |
| Publikationsjahr: | September 2010 |
| Buchtitel: | 13th IEEE Forum on Specification and Design Languages (FDL 2010) |
| Kurzbeschreibung (Abstract): | On FPGA-platforms, the feature of dynamic partial recon?guration offers a wide range of applications. We propose a new formal method for design, analysis, and veri?cation of the recon?guration process on such devices. The ?-calculus, also known as the calculus of mobile processes, is a type of process algebra typically used to describe dynamic communicating processes. We propose the ?-calculus as a foundation to model dynamic partial recon?guration of hardware modules. A subset of this calculus that we call tiny-? can be executed in resource-restricted, embedded environments which feature recon?guration properties. As a proof-of-concept, we present a small virtual machine implementation for tiny-?. We have also implemented a compilation ?ow from a textual description of tiny-? speci?cations into executable bytecode. |
| Freie Schlagworte: | Secure Things |
| Fachbereich(e)/-gebiet(e): | LOEWE > LOEWE-Zentren > CASED – Center for Advanced Security Research Darmstadt LOEWE > LOEWE-Zentren LOEWE |
| Hinterlegungsdatum: | 31 Dez 2016 00:15 |
| Letzte Änderung: | 17 Mai 2018 13:02 |
| PPN: | |
| Export: | |
| Suche nach Titel in: | TUfind oder in Google |
 |
Frage zum Eintrag |
Optionen (nur für Redakteure)
 |
Redaktionelle Details anzeigen |
Drucken
Impressum