default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFranco Gasperoni
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2007
[c14]Peggy Aycinena, Eric Bantegnie, Gerard Ladier, Ralph Mueller, Franco Gasperoni, Alex Wilson:
Towards total open source in aeronautics and space? DATE 2007: 1556- 2006
- [j4]Franco Gasperoni:
Safety, security, and object-oriented programming. SIGBED Rev. 3(4): 15-26 (2006) - 2004
- [c13]Franco Gasperoni:
Vector Processing in Ada. Ada-Europe 2004: 321-331 - [c12]Cyrille Comar, Franco Gasperoni:
Open source in dependable systems: Current and future business models. IFIP Congress Topical Sessions 2004: 699-710 - 2003
- [c11]Emmanuel Briot, Franco Gasperoni, Robert Dewar, Dirk Craeynest, Philippe Waroquiers:
Exposing Memory Corruption and Finding Leaks: Advanced Mechanisms in Ada. Ada-Europe 2003: 129-141 - 2002
- [c10]Paul Parkinson, Franco Gasperoni:
High-Integrity Systems Development for Integrated Modular Avionics Using VxWorks and GNAT. Ada-Europe 2002: 163-178
1990 – 1999
- 1999
- [e1]Hal Hart, S. Tucker Taft, Franco Gasperoni:
Proceedings ACM SIGAda Annual International Conference, SIGAda 1999, The Engineering of Industrial Strength Real-Time Software & Distributed Systems: Using Ada and Related Technologie, Redondo Beach, CA, USA, October 17-21, 1999. ACM 1999, ISBN 1-58113-127-5 [contents] - 1998
- [j3]Franco Gasperoni, Uwe Schwiegelshohn
:
List Scheduling in the Presence of Branches: A Theoretical Evaluation. Theor. Comput. Sci. 196(1-2): 347-363 (1998) - [c9]Franco Gasperoni:
Embedded Opportunities. Ada-Europe 1998: 1-13 - 1997
- [c8]Cyrille Comar, Gary Dismukes, Franco Gasperoni:
Targeting GNAT to the Java Virtual Machine. TRI-Ada 1997: 149-161 - 1996
- [c7]Franco Gasperoni, Uwe Schwiegelshohn:
List Scheduling in the Presence of Branches: A Theoretical Evaluation. Euro-Par, Vol. II 1996: 515-526 - 1995
- [c6]Christine Eisenbeis, Franco Gasperoni, Uwe Schwiegelshohn:
Allocating registers in multiple instruction-issuing processors. PACT 1995: 290-293 - [c5]Franco Gasperoni, Uwe Schwiegelshohn, John Turek:
Optimal Loop Scheduling on Multiprocessors: A Pumping Lemma for p-Processor Schedules. PaCT 1995: 51-56 - [c4]Cyrille Comar, Gary Dismukes, Franco Gasperoni:
The GNAT implementation of controlled types. TRI-Ada 1995: 467-473 - 1994
- [j2]Franco Gasperoni, Uwe Schwiegelshohn:
Generating Close to Optimum Loop Schedules on Parallel Processors. Parallel Process. Lett. 4: 391-403 (1994) - [c3]Franco Gasperoni, Patrick Bazire:
Smart Recompilation and the GNAT Compiler. TRI-Ada 1994: 104-111 - 1992
- [c2]Franco Gasperoni, Uwe Schwiegelshohn:
Scheduling Loops on Parallel Processors: A Simple Algorithm with Close to Optimum Performance. CONPAR 1992: 625-636 - 1991
- [b1]Franco Gasperoni:
Scheduling for Horizontal Systems: The VLIW Paradigm in Persepctive. New York University, USA, 1991 - [j1]Uwe Schwiegelshohn, Franco Gasperoni, Kemal Ebcioglu:
On Optimal Parallelization of Arbitrary Loops. J. Parallel Distributed Comput. 11(2): 130-134 (1991)
1980 – 1989
- 1989
- [c1]Franco Gasperoni, Uwe Schwiegelshohn, Kemal Ebcioglu:
On optimal loop parallelization. MICRO 1989: 141-147
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
