Modular Code Generation from Synchronous Block Diagrams : Modularity vs. Code Size
- Author
- LUBLINERMAN, Roberto1 ; SZEGEDY, Christian2 ; TRIPAKIS, Stavros3
[1] Computer Science and Engineering Pennsylvania State University, United States
[2] Cadence Research Laboratories Cadence Design Systems
[3] Cadence Research Laboratories and Verimag Laboratory -CNRS, France - Conference title
- Proceedings of the 36th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
- Conference name
- Symposium on Principles of Programming Languages (36 ; Savannah, Georgia 2009-01-23)
- Author (monograph)
- PIERCE, Benjamin C (Editor)1
[1] University of Pennsylvania, United States - Source
ACM SIGPLAN notices. 2009, Vol 44, Num 1, pp 78-89, 12 p ; ref : 1/4 p
- ISSN
- 1523-2867
- Scientific domain
- Computer science
- Publisher
- Association for Computing Machinery, New York, NY
- Publication country
- United States
- Document type
- Conference Paper
- Language
- English
- Author keyword
- Algorithms Block diagrams Clustering Code generation Design Languages; Embedded software NP-complete Synchronous languages
- Keyword (fr)
- Analyse amas Bloc diagramme Calculateur embarqué Classification Extensibilité Génération automatique Génération code Langage programmation Langage synchrone Modélisation Méthode itérative Optimisation Problème NP complet Quantification Réplication Réutilisation Satisfiabilité Schéma fonctionnel Système modulaire Sémantique
- Keyword (en)
- Cluster analysis Block diagram Boarded computer Classification Scalability Automatic generation Code generation Programming language Synchronous language Modeling Iterative method Optimization NP complete problem Quantization Replication Reuse Satisfiability Function block diagram Modular system Semantics
- Keyword (es)
- Analisis cluster Diagrama conjunto Calculador embarque Clasificación Estensibilidad Generación automatica Generación código Lenguaje programación lenguaje sincronico Modelización Método iterativo Optimización Problema NP completo Cuantificación Replicación Reutilización Satisfactibilidad Esquema funcional Sistema modular Semántica
- Classification
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02B Software / 001D02B02 Programming languages
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02B Software / 001D02B04 Computer systems and distributed systems. User interface
- Discipline
- Computer science : theoretical automation and systems
- Origin
- Inist-CNRS
- Database
- PASCAL
- INIST identifier
- 21327072
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Access to the document
Install on your browser
DOI
10.1145/1594834.1480893 
https://dx.doi.org/10.1145/1594834.1480893
"O:13:\"PanistOpenUrl\":36:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000idc\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:23:\"10.1145\/1594834.1480893\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:82:\"Modular Code Generation from Synchronous Block Diagrams : Modularity vs. Code Size\";s:9:\"\u0000*\u0000jtitle\";s:19:\"ACM SIGPLAN notices\";s:9:\"\u0000*\u0000stitle\";s:15:\"ACM SIGPLAN not\";s:7:\"\u0000*\u0000date\";s:4:\"2009\";s:9:\"\u0000*\u0000volume\";s:2:\"44\";s:8:\"\u0000*\u0000issue\";s:1:\"1\";s:8:\"\u0000*\u0000spage\";s:2:\"78\";s:8:\"\u0000*\u0000epage\";s:2:\"89\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"1523-2867\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:11:\"LUBLINERMAN\";s:10:\"\u0000*\u0000aufirst\";s:7:\"Roberto\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:18:\"SZEGEDY, Christian\";i:1;s:17:\"TRIPAKIS, Stavros\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:98:\"Proceedings of the 36th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages\";s:8:\"\u0000*\u0000title\";s:82:\"Modular Code Generation from Synchronous Block Diagrams : Modularity vs. Code Size\";s:8:\"\u0000*\u0000place\";s:12:\"New York, NY\";s:6:\"\u0000*\u0000pub\";s:35:\"Association for Computing Machinery\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"12\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Panist access
"O:12:\"IstexOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:23:\"10.1145\/1594834.1480893\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:82:\"Modular Code Generation from Synchronous Block Diagrams : Modularity vs. Code Size\";s:9:\"\u0000*\u0000jtitle\";s:19:\"ACM SIGPLAN notices\";s:9:\"\u0000*\u0000stitle\";s:15:\"ACM SIGPLAN not\";s:7:\"\u0000*\u0000date\";s:4:\"2009\";s:9:\"\u0000*\u0000volume\";s:2:\"44\";s:8:\"\u0000*\u0000issue\";s:1:\"1\";s:8:\"\u0000*\u0000spage\";s:2:\"78\";s:8:\"\u0000*\u0000epage\";s:2:\"89\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"1523-2867\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:11:\"LUBLINERMAN\";s:10:\"\u0000*\u0000aufirst\";s:7:\"Roberto\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:18:\"SZEGEDY, Christian\";i:1;s:17:\"TRIPAKIS, Stavros\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:98:\"Proceedings of the 36th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages\";s:8:\"\u0000*\u0000title\";s:82:\"Modular Code Generation from Synchronous Block Diagrams : Modularity vs. Code Size\";s:8:\"\u0000*\u0000place\";s:12:\"New York, NY\";s:6:\"\u0000*\u0000pub\";s:35:\"Association for Computing Machinery\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"12\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Istex access
"O:16:\"UnpaywallOpenUrl\":35:{s:8:\"\u0000*\u0000email\";s:27:\"assistance-portail@inist.fr\";s:6:\"\u0000*\u0000fmt\";N;s:6:\"\u0000*\u0000doi\";s:23:\"10.1145\/1594834.1480893\";s:6:\"\u0000*\u0000pii\";N;s:7:\"\u0000*\u0000pmid\";N;s:9:\"\u0000*\u0000atitle\";N;s:9:\"\u0000*\u0000jtitle\";N;s:9:\"\u0000*\u0000stitle\";N;s:7:\"\u0000*\u0000date\";N;s:9:\"\u0000*\u0000volume\";N;s:8:\"\u0000*\u0000issue\";N;s:8:\"\u0000*\u0000spage\";N;s:8:\"\u0000*\u0000epage\";N;s:8:\"\u0000*\u0000pages\";N;s:7:\"\u0000*\u0000issn\";N;s:8:\"\u0000*\u0000eissn\";N;s:9:\"\u0000*\u0000aulast\";N;s:10:\"\u0000*\u0000aufirst\";N;s:9:\"\u0000*\u0000auinit\";N;s:10:\"\u0000*\u0000auinitm\";N;s:5:\"\u0000*\u0000au\";N;s:9:\"\u0000*\u0000aucorp\";N;s:7:\"\u0000*\u0000isbn\";N;s:8:\"\u0000*\u0000coden\";N;s:8:\"\u0000*\u0000genre\";N;s:7:\"\u0000*\u0000part\";N;s:9:\"\u0000*\u0000btitle\";N;s:8:\"\u0000*\u0000title\";N;s:8:\"\u0000*\u0000place\";N;s:6:\"\u0000*\u0000pub\";N;s:10:\"\u0000*\u0000edition\";N;s:9:\"\u0000*\u0000tpages\";N;s:9:\"\u0000*\u0000series\";N;s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";N;}"
Unpaywall access
"O:16:\"EuropePMCOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:23:\"10.1145\/1594834.1480893\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:82:\"Modular Code Generation from Synchronous Block Diagrams : Modularity vs. Code Size\";s:9:\"\u0000*\u0000jtitle\";s:19:\"ACM SIGPLAN notices\";s:9:\"\u0000*\u0000stitle\";s:15:\"ACM SIGPLAN not\";s:7:\"\u0000*\u0000date\";s:4:\"2009\";s:9:\"\u0000*\u0000volume\";s:2:\"44\";s:8:\"\u0000*\u0000issue\";s:1:\"1\";s:8:\"\u0000*\u0000spage\";s:2:\"78\";s:8:\"\u0000*\u0000epage\";s:2:\"89\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"1523-2867\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:11:\"LUBLINERMAN\";s:10:\"\u0000*\u0000aufirst\";s:7:\"Roberto\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:18:\"SZEGEDY, Christian\";i:1;s:17:\"TRIPAKIS, Stavros\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:98:\"Proceedings of the 36th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages\";s:8:\"\u0000*\u0000title\";s:82:\"Modular Code Generation from Synchronous Block Diagrams : Modularity vs. Code Size\";s:8:\"\u0000*\u0000place\";s:12:\"New York, NY\";s:6:\"\u0000*\u0000pub\";s:35:\"Association for Computing Machinery\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"12\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Europe PubMed Central access
"O:11:\"BaseOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:23:\"10.1145\/1594834.1480893\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:82:\"Modular Code Generation from Synchronous Block Diagrams : Modularity vs. Code Size\";s:9:\"\u0000*\u0000jtitle\";s:19:\"ACM SIGPLAN notices\";s:9:\"\u0000*\u0000stitle\";s:15:\"ACM SIGPLAN not\";s:7:\"\u0000*\u0000date\";s:4:\"2009\";s:9:\"\u0000*\u0000volume\";s:2:\"44\";s:8:\"\u0000*\u0000issue\";s:1:\"1\";s:8:\"\u0000*\u0000spage\";s:2:\"78\";s:8:\"\u0000*\u0000epage\";s:2:\"89\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"1523-2867\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:11:\"LUBLINERMAN\";s:10:\"\u0000*\u0000aufirst\";s:7:\"Roberto\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:18:\"SZEGEDY, Christian\";i:1;s:17:\"TRIPAKIS, Stavros\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:98:\"Proceedings of the 36th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages\";s:8:\"\u0000*\u0000title\";s:82:\"Modular Code Generation from Synchronous Block Diagrams : Modularity vs. Code Size\";s:8:\"\u0000*\u0000place\";s:12:\"New York, NY\";s:6:\"\u0000*\u0000pub\";s:35:\"Association for Computing Machinery\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"12\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Base Search access
"O:12:\"ArXivOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:23:\"10.1145\/1594834.1480893\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:82:\"Modular Code Generation from Synchronous Block Diagrams : Modularity vs. Code Size\";s:9:\"\u0000*\u0000jtitle\";s:19:\"ACM SIGPLAN notices\";s:9:\"\u0000*\u0000stitle\";s:15:\"ACM SIGPLAN not\";s:7:\"\u0000*\u0000date\";s:4:\"2009\";s:9:\"\u0000*\u0000volume\";s:2:\"44\";s:8:\"\u0000*\u0000issue\";s:1:\"1\";s:8:\"\u0000*\u0000spage\";s:2:\"78\";s:8:\"\u0000*\u0000epage\";s:2:\"89\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"1523-2867\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:11:\"LUBLINERMAN\";s:10:\"\u0000*\u0000aufirst\";s:7:\"Roberto\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:18:\"SZEGEDY, Christian\";i:1;s:17:\"TRIPAKIS, Stavros\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:98:\"Proceedings of the 36th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages\";s:8:\"\u0000*\u0000title\";s:82:\"Modular Code Generation from Synchronous Block Diagrams : Modularity vs. Code Size\";s:8:\"\u0000*\u0000place\";s:12:\"New York, NY\";s:6:\"\u0000*\u0000pub\";s:35:\"Association for Computing Machinery\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"12\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
arXiv access
