---
_id: '11762'
abstract:
- lang: eng
  text: 'In this paper, we describe six algorithmic problems that arise in web search
    engines and that are not or only partially solved: (1) Uniformly sampling of web
    pages; (2) modeling the web graph; (3) ﬁnding duplicate hosts; (4) ﬁnding top
    gainers and losers in data streams; (5) ﬁnding large dense bipartite graphs; and
    (6) understanding how eigenvectors partition the web.'
article_processing_charge: No
article_type: original
author:
- first_name: Monika H
  full_name: Henzinger, Monika H
  id: 540c9bbd-f2de-11ec-812d-d04a5be85630
  last_name: Henzinger
  orcid: 0000-0002-5008-6530
citation:
  ama: Henzinger M. Algorithmic challenges in web search engines. <i>Internet Mathematics</i>.
    2004;1(1):115-123. doi:<a href="https://doi.org/10.1080/15427951.2004.10129079">10.1080/15427951.2004.10129079</a>
  apa: Henzinger, M. (2004). Algorithmic challenges in web search engines. <i>Internet
    Mathematics</i>. Internet Mathematics. <a href="https://doi.org/10.1080/15427951.2004.10129079">https://doi.org/10.1080/15427951.2004.10129079</a>
  chicago: Henzinger, Monika. “Algorithmic Challenges in Web Search Engines.” <i>Internet
    Mathematics</i>. Internet Mathematics, 2004. <a href="https://doi.org/10.1080/15427951.2004.10129079">https://doi.org/10.1080/15427951.2004.10129079</a>.
  ieee: M. Henzinger, “Algorithmic challenges in web search engines,” <i>Internet
    Mathematics</i>, vol. 1, no. 1. Internet Mathematics, pp. 115–123, 2004.
  ista: Henzinger M. 2004. Algorithmic challenges in web search engines. Internet
    Mathematics. 1(1), 115–123.
  mla: Henzinger, Monika. “Algorithmic Challenges in Web Search Engines.” <i>Internet
    Mathematics</i>, vol. 1, no. 1, Internet Mathematics, 2004, pp. 115–23, doi:<a
    href="https://doi.org/10.1080/15427951.2004.10129079">10.1080/15427951.2004.10129079</a>.
  short: M. Henzinger, Internet Mathematics 1 (2004) 115–123.
date_created: 2022-08-08T11:55:53Z
date_published: 2004-01-01T00:00:00Z
date_updated: 2024-11-06T08:13:59Z
day: '01'
doi: 10.1080/15427951.2004.10129079
extern: '1'
fulldoi: https://doi.org/10.1080/15427951.2004.10129079
intvolume: '         1'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1080/15427951.2004.10129079
month: '01'
oa: 1
oa_version: Published Version
page: 115-123
publication: Internet Mathematics
publication_identifier:
  eissn:
  - 1944-9488
  issn:
  - 1542-7951
publication_status: published
publisher: Internet Mathematics
quality_controlled: '1'
scopus_import: '1'
status: public
title: Algorithmic challenges in web search engines
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 1
year: '2004'
...
---
_id: '11800'
abstract:
- lang: eng
  text: "Web search engines have emerged as one of the central applications on the
    Internet. In fact, search has become one of the most important activities that
    people engage in on the the Internet. Even beyond becoming the number one source
    of information, a growing number of businesses are depending on web search engines
    for customer acquisition.\r\n\r\nThe first generation of web search engines used
    text-only retrieval techniques. Google revolutionized the field by deploying the
    PageRank technology – an eigenvector-based analysis of the hyperlink structure
    – to analyze the web in order to produce relevant results. Moving forward, our
    goal is to achieve a better understanding of a page with a view towards producing
    even more relevant results."
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Monika H
  full_name: Henzinger, Monika H
  id: 540c9bbd-f2de-11ec-812d-d04a5be85630
  last_name: Henzinger
  orcid: 0000-0002-5008-6530
citation:
  ama: 'Henzinger M. The past, present, and future of web search engines. In: <i>31st
    International Colloquium on Automata, Languages and Programming</i>. Vol 3142.
    Springer Nature; 2004:3. doi:<a href="https://doi.org/10.1007/978-3-540-27836-8_2">10.1007/978-3-540-27836-8_2</a>'
  apa: 'Henzinger, M. (2004). The past, present, and future of web search engines.
    In <i>31st International Colloquium on Automata, Languages and Programming</i>
    (Vol. 3142, p. 3). Turku, Finland: Springer Nature. <a href="https://doi.org/10.1007/978-3-540-27836-8_2">https://doi.org/10.1007/978-3-540-27836-8_2</a>'
  chicago: Henzinger, Monika. “The Past, Present, and Future of Web Search Engines.”
    In <i>31st International Colloquium on Automata, Languages and Programming</i>,
    3142:3. Springer Nature, 2004. <a href="https://doi.org/10.1007/978-3-540-27836-8_2">https://doi.org/10.1007/978-3-540-27836-8_2</a>.
  ieee: M. Henzinger, “The past, present, and future of web search engines,” in <i>31st
    International Colloquium on Automata, Languages and Programming</i>, Turku, Finland,
    2004, vol. 3142, p. 3.
  ista: 'Henzinger M. 2004. The past, present, and future of web search engines. 31st
    International Colloquium on Automata, Languages and Programming. ICALP: International
    Colloquium on Automata, Languages, and Programming, LNCS, vol. 3142, 3.'
  mla: Henzinger, Monika. “The Past, Present, and Future of Web Search Engines.” <i>31st
    International Colloquium on Automata, Languages and Programming</i>, vol. 3142,
    Springer Nature, 2004, p. 3, doi:<a href="https://doi.org/10.1007/978-3-540-27836-8_2">10.1007/978-3-540-27836-8_2</a>.
  short: M. Henzinger, in:, 31st International Colloquium on Automata, Languages and
    Programming, Springer Nature, 2004, p. 3.
conference:
  end_date: 2004-07-16
  location: Turku, Finland
  name: 'ICALP: International Colloquium on Automata, Languages, and Programming'
  start_date: 2004-07-12
date_created: 2022-08-11T12:38:58Z
date_published: 2004-07-01T00:00:00Z
date_updated: 2024-11-06T08:14:51Z
day: '01'
doi: 10.1007/978-3-540-27836-8_2
extern: '1'
fulldoi: https://doi.org/10.1007/978-3-540-27836-8_2
intvolume: '      3142'
language:
- iso: eng
month: '07'
oa_version: None
page: '3'
publication: 31st International Colloquium on Automata, Languages and Programming
publication_identifier:
  eissn:
  - 1611-3349
  issn:
  - 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: The past, present, and future of web search engines
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 3142
year: '2004'
...
---
_id: '11801'
abstract:
- lang: eng
  text: "Web search engines have emerged as one of the central applications on the
    internet. In fact, search has become one of the most important activities that
    people engage in on the Internet. Even beyond becoming the number one source of
    information, a growing number of businesses are depending on web search engines
    for customer acquisition. In this talk I will brief review the history of web
    search engines: The first generation of web search engines used text-only retrieval
    techniques. Google revolutionized the field by deploying the PageRank technology
    – an eigenvector-based analysis of the hyperlink structure- to analyze the web
    in order to produce relevant results. Moving forward, our goal is to achieve a
    better understanding of a page with a view towards producing even more relevant
    results.\r\n\r\nGoogle is powered by a large number of PCs. Using this infrastructure
    and striving to be as efficient as possible poses challenging systems problems
    but also various algorithmic challenges. I will discuss some of them in my talk."
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Monika H
  full_name: Henzinger, Monika H
  id: 540c9bbd-f2de-11ec-812d-d04a5be85630
  last_name: Henzinger
  orcid: 0000-0002-5008-6530
citation:
  ama: 'Henzinger M. Algorithmic aspects of web search engines. In: <i>2th Annual
    European Symposium on Algorithms</i>. Vol 3221. Springer Nature; 2004:3. doi:<a
    href="https://doi.org/10.1007/978-3-540-30140-0_2">10.1007/978-3-540-30140-0_2</a>'
  apa: 'Henzinger, M. (2004). Algorithmic aspects of web search engines. In <i>2th
    Annual European Symposium on Algorithms</i> (Vol. 3221, p. 3). Bergen, Norway:
    Springer Nature. <a href="https://doi.org/10.1007/978-3-540-30140-0_2">https://doi.org/10.1007/978-3-540-30140-0_2</a>'
  chicago: Henzinger, Monika. “Algorithmic Aspects of Web Search Engines.” In <i>2th
    Annual European Symposium on Algorithms</i>, 3221:3. Springer Nature, 2004. <a
    href="https://doi.org/10.1007/978-3-540-30140-0_2">https://doi.org/10.1007/978-3-540-30140-0_2</a>.
  ieee: M. Henzinger, “Algorithmic aspects of web search engines,” in <i>2th Annual
    European Symposium on Algorithms</i>, Bergen, Norway, 2004, vol. 3221, p. 3.
  ista: 'Henzinger M. 2004. Algorithmic aspects of web search engines. 2th Annual
    European Symposium on Algorithms. ESA: European Symposium on Algorithms, LNCS,
    vol. 3221, 3.'
  mla: Henzinger, Monika. “Algorithmic Aspects of Web Search Engines.” <i>2th Annual
    European Symposium on Algorithms</i>, vol. 3221, Springer Nature, 2004, p. 3,
    doi:<a href="https://doi.org/10.1007/978-3-540-30140-0_2">10.1007/978-3-540-30140-0_2</a>.
  short: M. Henzinger, in:, 2th Annual European Symposium on Algorithms, Springer
    Nature, 2004, p. 3.
conference:
  end_date: 2004-09-17
  location: Bergen, Norway
  name: 'ESA: European Symposium on Algorithms'
  start_date: 2004-09-14
date_created: 2022-08-11T13:18:05Z
date_published: 2004-09-01T00:00:00Z
date_updated: 2024-11-06T11:55:33Z
day: '01'
doi: 10.1007/978-3-540-30140-0_2
extern: '1'
fulldoi: https://doi.org/10.1007/978-3-540-30140-0_2
intvolume: '      3221'
language:
- iso: eng
month: '09'
oa_version: None
page: '3'
publication: 2th Annual European Symposium on Algorithms
publication_identifier:
  eissn:
  - 1611-3349
  isbn:
  - ' 3540230254'
  issn:
  - 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Algorithmic aspects of web search engines
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 3221
year: '2004'
...
---
_id: '11859'
abstract:
- lang: eng
  text: In this article we describe the approach taken by the first web search engines,
    discuss the state of the art, and present some of the challenges for the future.
article_processing_charge: No
author:
- first_name: Monika H
  full_name: Henzinger, Monika H
  id: 540c9bbd-f2de-11ec-812d-d04a5be85630
  last_name: Henzinger
  orcid: 0000-0002-5008-6530
citation:
  ama: 'Henzinger M. The past, present, and future of web information retrieval. In:
    <i>SPIE Proceedings</i>. Vol 5296. Society of Photo-Optical Instrumentation Engineers;
    2004:23-26. doi:<a href="https://doi.org/10.1117/12.537534">10.1117/12.537534</a>'
  apa: 'Henzinger, M. (2004). The past, present, and future of web information retrieval.
    In <i>SPIE Proceedings</i> (Vol. 5296, pp. 23–26). San Jose, CA, United States:
    Society of Photo-Optical Instrumentation Engineers. <a href="https://doi.org/10.1117/12.537534">https://doi.org/10.1117/12.537534</a>'
  chicago: Henzinger, Monika. “The Past, Present, and Future of Web Information Retrieval.”
    In <i>SPIE Proceedings</i>, 5296:23–26. Society of Photo-Optical Instrumentation
    Engineers, 2004. <a href="https://doi.org/10.1117/12.537534">https://doi.org/10.1117/12.537534</a>.
  ieee: M. Henzinger, “The past, present, and future of web information retrieval,”
    in <i>SPIE Proceedings</i>, San Jose, CA, United States, 2004, vol. 5296, pp.
    23–26.
  ista: Henzinger M. 2004. The past, present, and future of web information retrieval.
    SPIE Proceedings. Document Recognition and Retrieval XI vol. 5296, 23–26.
  mla: Henzinger, Monika. “The Past, Present, and Future of Web Information Retrieval.”
    <i>SPIE Proceedings</i>, vol. 5296, Society of Photo-Optical Instrumentation Engineers,
    2004, pp. 23–26, doi:<a href="https://doi.org/10.1117/12.537534">10.1117/12.537534</a>.
  short: M. Henzinger, in:, SPIE Proceedings, Society of Photo-Optical Instrumentation
    Engineers, 2004, pp. 23–26.
conference:
  end_date: 2004-01-22
  location: San Jose, CA, United States
  name: Document Recognition and Retrieval XI
  start_date: 2004-01-21
date_created: 2022-08-16T08:46:41Z
date_published: 2004-01-01T00:00:00Z
date_updated: 2024-11-06T11:59:44Z
day: '01'
doi: 10.1117/12.537534
extern: '1'
fulldoi: https://doi.org/10.1117/12.537534
intvolume: '      5296'
language:
- iso: eng
month: '01'
oa_version: None
page: 23 - 26
publication: SPIE Proceedings
publication_identifier:
  issn:
  - 0277-786X
publication_status: published
publisher: Society of Photo-Optical Instrumentation Engineers
quality_controlled: '1'
scopus_import: '1'
status: public
title: The past, present, and future of web information retrieval
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 5296
year: '2004'
...
---
_id: '11877'
abstract:
- lang: eng
  text: The World Wide Web provides a unprecedented opportunity to automatically analyze
    a large sample of interests and activity in the world. We discuss methods for
    extracting knowledge from the web by randomly sampling and analyzing hosts and
    pages, and by analyzing the link structure of the web and how links accumulate
    over time. A variety of interesting and valuable information can be extracted,
    such as the distribution of web pages over domains, the distribution of interest
    in different areas, communities related to different topics, the nature of competition
    in different categories of sites, and the degree of communication between different
    communities or countries.
article_processing_charge: No
article_type: original
author:
- first_name: Monika H
  full_name: Henzinger, Monika H
  id: 540c9bbd-f2de-11ec-812d-d04a5be85630
  last_name: Henzinger
  orcid: 0000-0002-5008-6530
- first_name: Steve
  full_name: Lawrence, Steve
  last_name: Lawrence
citation:
  ama: Henzinger M, Lawrence S. Extracting knowledge from the World Wide Web. <i>Proceedings
    of the National Academy of Sciences</i>. 2004;101(suppl_1):5186-5191. doi:<a href="https://doi.org/10.1073/pnas.0307528100">10.1073/pnas.0307528100</a>
  apa: Henzinger, M., &#38; Lawrence, S. (2004). Extracting knowledge from the World
    Wide Web. <i>Proceedings of the National Academy of Sciences</i>. Proceedings
    of the National Academy of Sciences. <a href="https://doi.org/10.1073/pnas.0307528100">https://doi.org/10.1073/pnas.0307528100</a>
  chicago: Henzinger, Monika, and Steve Lawrence. “Extracting Knowledge from the World
    Wide Web.” <i>Proceedings of the National Academy of Sciences</i>. Proceedings
    of the National Academy of Sciences, 2004. <a href="https://doi.org/10.1073/pnas.0307528100">https://doi.org/10.1073/pnas.0307528100</a>.
  ieee: M. Henzinger and S. Lawrence, “Extracting knowledge from the World Wide Web,”
    <i>Proceedings of the National Academy of Sciences</i>, vol. 101, no. suppl_1.
    Proceedings of the National Academy of Sciences, pp. 5186–5191, 2004.
  ista: Henzinger M, Lawrence S. 2004. Extracting knowledge from the World Wide Web.
    Proceedings of the National Academy of Sciences. 101(suppl_1), 5186–5191.
  mla: Henzinger, Monika, and Steve Lawrence. “Extracting Knowledge from the World
    Wide Web.” <i>Proceedings of the National Academy of Sciences</i>, vol. 101, no.
    suppl_1, Proceedings of the National Academy of Sciences, 2004, pp. 5186–91, doi:<a
    href="https://doi.org/10.1073/pnas.0307528100">10.1073/pnas.0307528100</a>.
  short: M. Henzinger, S. Lawrence, Proceedings of the National Academy of Sciences
    101 (2004) 5186–5191.
date_created: 2022-08-16T13:06:10Z
date_published: 2004-04-06T00:00:00Z
date_updated: 2024-11-06T12:00:20Z
day: '06'
doi: 10.1073/pnas.0307528100
extern: '1'
external_id:
  pmid:
  - '14745041'
fulldoi: https://doi.org/10.1073/pnas.0307528100
intvolume: '       101'
issue: suppl_1
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC387294/
month: '04'
oa: 1
oa_version: Published Version
page: 5186-5191
pmid: 1
publication: Proceedings of the National Academy of Sciences
publication_identifier:
  eissn:
  - 1091-6490
  issn:
  - 0027-8424
publication_status: published
publisher: Proceedings of the National Academy of Sciences
quality_controlled: '1'
scopus_import: '1'
status: public
title: Extracting knowledge from the World Wide Web
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 101
year: '2004'
...
---
_id: '2461'
author:
- first_name: Michael
  full_name: Sauer, Michael
  last_name: Sauer
- first_name: Jirí
  full_name: Friml, Jirí
  id: 4159519E-F248-11E8-B48F-1D18A9856A87
  last_name: Friml
  orcid: 0000-0002-8302-7596
citation:
  ama: Sauer M, Friml J. The Matryoshka dolls of plant polarity. <i>Development</i>.
    2004;131(23):5774-5775. doi:<a href="https://doi.org/10.1242/dev.01463">10.1242/dev.01463</a>
  apa: Sauer, M., &#38; Friml, J. (2004). The Matryoshka dolls of plant polarity.
    <i>Development</i>. Company of Biologists. <a href="https://doi.org/10.1242/dev.01463">https://doi.org/10.1242/dev.01463</a>
  chicago: Sauer, Michael, and Jiří Friml. “The Matryoshka Dolls of Plant Polarity.”
    <i>Development</i>. Company of Biologists, 2004. <a href="https://doi.org/10.1242/dev.01463">https://doi.org/10.1242/dev.01463</a>.
  ieee: M. Sauer and J. Friml, “The Matryoshka dolls of plant polarity,” <i>Development</i>,
    vol. 131, no. 23. Company of Biologists, pp. 5774–5775, 2004.
  ista: Sauer M, Friml J. 2004. The Matryoshka dolls of plant polarity. Development.
    131(23), 5774–5775.
  mla: Sauer, Michael, and Jiří Friml. “The Matryoshka Dolls of Plant Polarity.” <i>Development</i>,
    vol. 131, no. 23, Company of Biologists, 2004, pp. 5774–75, doi:<a href="https://doi.org/10.1242/dev.01463">10.1242/dev.01463</a>.
  short: M. Sauer, J. Friml, Development 131 (2004) 5774–5775.
date_created: 2018-12-11T11:57:48Z
date_published: 2004-12-01T00:00:00Z
date_updated: 2021-01-12T06:57:37Z
day: '01'
doi: 10.1242/dev.01463
extern: '1'
fulldoi: https://doi.org/10.1242/dev.01463
intvolume: '       131'
issue: '23'
language:
- iso: eng
month: '12'
oa_version: None
page: 5774 - 5775
publication: Development
publication_status: published
publisher: Company of Biologists
publist_id: '4442'
quality_controlled: '1'
status: public
title: The Matryoshka dolls of plant polarity
type: review
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 131
year: '2004'
...
---
_id: '2636'
author:
- first_name: Akiko
  full_name: Momiyama, Akiko
  last_name: Momiyama
- first_name: Ryuichi
  full_name: Ryuichi Shigemoto
  id: 499F3ABC-F248-11E8-B48F-1D18A9856A87
  last_name: Shigemoto
  orcid: 0000-0001-8761-9444
citation:
  ama: Momiyama A, Shigemoto R. Function and distribution of glutamate receptors in
    the central synapses. <i>Tanpakushitsu kakusan koso Protein nucleic acid enzyme</i>.
    2004;49(3 Suppl):287-294.
  apa: Momiyama, A., &#38; Shigemoto, R. (2004). Function and distribution of glutamate
    receptors in the central synapses. <i>Tanpakushitsu Kakusan Koso Protein Nucleic
    Acid Enzyme</i>. Kyoritsu Shuppan.
  chicago: Momiyama, Akiko, and Ryuichi Shigemoto. “Function and Distribution of Glutamate
    Receptors in the Central Synapses.” <i>Tanpakushitsu Kakusan Koso Protein Nucleic
    Acid Enzyme</i>. Kyoritsu Shuppan, 2004.
  ieee: A. Momiyama and R. Shigemoto, “Function and distribution of glutamate receptors
    in the central synapses,” <i>Tanpakushitsu kakusan koso Protein nucleic acid enzyme</i>,
    vol. 49, no. 3 Suppl. Kyoritsu Shuppan, pp. 287–294, 2004.
  ista: Momiyama A, Shigemoto R. 2004. Function and distribution of glutamate receptors
    in the central synapses. Tanpakushitsu kakusan koso Protein nucleic acid enzyme.
    49(3 Suppl), 287–294.
  mla: Momiyama, Akiko, and Ryuichi Shigemoto. “Function and Distribution of Glutamate
    Receptors in the Central Synapses.” <i>Tanpakushitsu Kakusan Koso Protein Nucleic
    Acid Enzyme</i>, vol. 49, no. 3 Suppl, Kyoritsu Shuppan, 2004, pp. 287–94.
  short: A. Momiyama, R. Shigemoto, Tanpakushitsu Kakusan Koso Protein Nucleic Acid
    Enzyme 49 (2004) 287–294.
date_created: 2018-12-11T11:58:48Z
date_published: 2004-02-01T00:00:00Z
date_updated: 2020-07-14T12:45:44Z
day: '01'
extern: 1
intvolume: '        49'
issue: 3 Suppl
month: '02'
page: 287 - 294
publication: Tanpakushitsu kakusan koso Protein nucleic acid enzyme
publication_status: published
publisher: Kyoritsu Shuppan
publist_id: '4261'
quality_controlled: 0
status: public
title: Function and distribution of glutamate receptors in the central synapses
type: review
volume: 49
year: '2004'
...
---
_id: '12203'
abstract:
- lang: eng
  text: 'Geranylgeranyl diphosphate synthase (GGPPS, EC: 2.5.1.29) catalyzes the biosynthesis
    of geranylgeranyl diphosphate (GGPP), which is a key precursor for ginkgolide
    biosynthesis. Here we reported for the first time the cloning of a new full-length
    cDNA encoding GGPPS from the living fossil plant Ginkgo biloba. The full-length
    cDNA encoding G. biloba GGPPS (designated as GbGGPPS) was 1657bp long and contained
    a 1176bp open reading frame encoding a 391 amino acid protein. Comparative analysis
    showed that GbGGPPS possessed a 79 amino acid transit peptide at its N-terminal,
    which directed GbGGPPS to target to the plastids. Bioinformatic analysis revealed
    that GbGGPPS was a member of polyprenyltransferases with two highly conserved
    aspartate-rich motifs like other plant GGPPSs. Phylogenetic tree analysis indicated
    that plant GGPPSs could be classified into two groups, angiosperm and gymnosperm
    GGPPSs, while GbGGPPS had closer relationship with gymnosperm plant GGPPSs.'
acknowledgement: This study was financially supported by China National High-Tech
  “863” Program. The authors are very thankful to Dr Li Wang (School of Life Sciences,
  Fudan University, Shanghai, China) for her kind help with constructing the phylogenetic
  tree.
article_processing_charge: No
article_type: original
author:
- first_name: Zhihua
  full_name: Liao, Zhihua
  last_name: Liao
- first_name: Min
  full_name: Chen, Min
  last_name: Chen
- first_name: Yifu
  full_name: Gong, Yifu
  last_name: Gong
- first_name: Liang
  full_name: Guo, Liang
  last_name: Guo
- first_name: Qiumin
  full_name: Tan, Qiumin
  last_name: Tan
- first_name: Xiaoqi
  full_name: Feng, Xiaoqi
  id: e0164712-22ee-11ed-b12a-d80fcdf35958
  last_name: Feng
  orcid: 0000-0002-4008-1234
- first_name: Xiaofen
  full_name: Sun, Xiaofen
  last_name: Sun
- first_name: Feng
  full_name: Tan, Feng
  last_name: Tan
- first_name: Kexuan
  full_name: Tang, Kexuan
  last_name: Tang
citation:
  ama: Liao Z, Chen M, Gong Y, et al. A new geranylgeranyl Diphosphate synthase gene
    from Ginkgo biloba, which intermediates the biosynthesis of the key precursor
    for ginkgolides. <i>DNA Sequence</i>. 2004;15(2):153-158. doi:<a href="https://doi.org/10.1080/10425170410001667348">10.1080/10425170410001667348</a>
  apa: Liao, Z., Chen, M., Gong, Y., Guo, L., Tan, Q., Feng, X., … Tang, K. (2004).
    A new geranylgeranyl Diphosphate synthase gene from Ginkgo biloba, which intermediates
    the biosynthesis of the key precursor for ginkgolides. <i>DNA Sequence</i>. Informa
    UK Limited. <a href="https://doi.org/10.1080/10425170410001667348">https://doi.org/10.1080/10425170410001667348</a>
  chicago: Liao, Zhihua, Min Chen, Yifu Gong, Liang Guo, Qiumin Tan, Xiaoqi Feng,
    Xiaofen Sun, Feng Tan, and Kexuan Tang. “A New Geranylgeranyl Diphosphate Synthase
    Gene from Ginkgo Biloba, Which Intermediates the Biosynthesis of the Key Precursor
    for Ginkgolides.” <i>DNA Sequence</i>. Informa UK Limited, 2004. <a href="https://doi.org/10.1080/10425170410001667348">https://doi.org/10.1080/10425170410001667348</a>.
  ieee: Z. Liao <i>et al.</i>, “A new geranylgeranyl Diphosphate synthase gene from
    Ginkgo biloba, which intermediates the biosynthesis of the key precursor for ginkgolides,”
    <i>DNA Sequence</i>, vol. 15, no. 2. Informa UK Limited, pp. 153–158, 2004.
  ista: Liao Z, Chen M, Gong Y, Guo L, Tan Q, Feng X, Sun X, Tan F, Tang K. 2004.
    A new geranylgeranyl Diphosphate synthase gene from Ginkgo biloba, which intermediates
    the biosynthesis of the key precursor for ginkgolides. DNA Sequence. 15(2), 153–158.
  mla: Liao, Zhihua, et al. “A New Geranylgeranyl Diphosphate Synthase Gene from Ginkgo
    Biloba, Which Intermediates the Biosynthesis of the Key Precursor for Ginkgolides.”
    <i>DNA Sequence</i>, vol. 15, no. 2, Informa UK Limited, 2004, pp. 153–58, doi:<a
    href="https://doi.org/10.1080/10425170410001667348">10.1080/10425170410001667348</a>.
  short: Z. Liao, M. Chen, Y. Gong, L. Guo, Q. Tan, X. Feng, X. Sun, F. Tan, K. Tang,
    DNA Sequence 15 (2004) 153–158.
date_created: 2023-01-16T09:24:50Z
date_published: 2004-01-01T00:00:00Z
date_updated: 2023-05-08T10:58:29Z
department:
- _id: XiFe
doi: 10.1080/10425170410001667348
extern: '1'
external_id:
  pmid:
  - '15352294'
fulldoi: https://doi.org/10.1080/10425170410001667348
intvolume: '        15'
issue: '2'
keyword:
- Endocrinology
- Genetics
- Molecular Biology
- Biochemistry
language:
- iso: eng
oa_version: None
page: 153-158
pmid: 1
publication: DNA Sequence
publication_identifier:
  issn:
  - 1042-5179
publication_status: published
publisher: Informa UK Limited
quality_controlled: '1'
scopus_import: '1'
status: public
title: A new geranylgeranyl Diphosphate synthase gene from Ginkgo biloba, which intermediates
  the biosynthesis of the key precursor for ginkgolides
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 15
year: '2004'
...
---
_id: '12658'
abstract:
- lang: eng
  text: '[1] During the ablation period 2001 a glaciometeorological experiment was
    carried out on Haut Glacier d''Arolla, Switzerland. Five meteorological stations
    were installed on the glacier, and one permanent automatic weather station in
    the glacier foreland. The altitudes of the stations ranged between 2500 and 3000
    m a.s.l., and they were in operation from end of May to beginning of September
    2001. The spatial arrangement of the stations and temporal duration of the measurements
    generated a unique data set enabling the analysis of the spatial and temporal
    variability of the meteorological variables across an alpine glacier. All measurements
    were taken at a nominal height of 2 m, and hourly averages were derived for the
    analysis. The wind regime was dominated by the glacier wind (mean value 2.8 m
    s−1) but due to erosion by the synoptic gradient wind, occasionally the wind would
    blow up the valley. A slight decrease in mean 2 m air temperatures with altitude
    was found, however the 2 m air temperature gradient varied greatly and frequently
    changed its sign. Mean relative humidity was 71% and exhibited limited spatial
    variation. Mean incoming shortwave radiation and albedo both generally increased
    with elevation. The different components of shortwave radiation are quantified
    with a parameterization scheme. Resulting spatial variations are mainly due to
    horizon obstruction and reflections from surrounding slopes, i.e., topography.
    The effect of clouds accounts for a loss of 30% of the extraterrestrial flux.
    Albedos derived from a Landsat TM image of 30 July show remarkably constant values,
    in the range 0.49 to 0.50, across snow covered parts of the glacier, while albedo
    is highly spatially variable below the zone of continuous snow cover. These results
    are verified with ground measurements and compared with parameterized albedo.
    Mean longwave radiative fluxes decreased with elevation due to lower air temperatures
    and the effect of upper hemisphere slopes. It is shown through parameterization
    that this effect would even be more pronounced without the effect of clouds. Results
    are discussed with respect to a similar study which has been carried out on Pasterze
    Glacier (Austria). The presented algorithms for interpolating, parameterizing
    and simulating variables and parameters in alpine regions are integrated in the
    software package AMUNDSEN which is freely available to be adapted and further
    developed by the community.'
article_number: D03103
article_processing_charge: No
article_type: original
author:
- first_name: Ulrich
  full_name: Strasser, Ulrich
  last_name: Strasser
- first_name: Javier
  full_name: Corripio, Javier
  last_name: Corripio
- first_name: Francesca
  full_name: Pellicciotti, Francesca
  id: b28f055a-81ea-11ed-b70c-a9fe7f7b0e70
  last_name: Pellicciotti
- first_name: Paolo
  full_name: Burlando, Paolo
  last_name: Burlando
- first_name: Ben
  full_name: Brock, Ben
  last_name: Brock
- first_name: Martin
  full_name: Funk, Martin
  last_name: Funk
citation:
  ama: 'Strasser U, Corripio J, Pellicciotti F, Burlando P, Brock B, Funk M. Spatial
    and temporal variability of meteorological variables at Haut Glacier d’Arolla
    (Switzerland) during the ablation season 2001: Measurements and simulations. <i>Journal
    of Geophysical Research: Atmospheres</i>. 2004;109(D3). doi:<a href="https://doi.org/10.1029/2003jd003973">10.1029/2003jd003973</a>'
  apa: 'Strasser, U., Corripio, J., Pellicciotti, F., Burlando, P., Brock, B., &#38;
    Funk, M. (2004). Spatial and temporal variability of meteorological variables
    at Haut Glacier d’Arolla (Switzerland) during the ablation season 2001: Measurements
    and simulations. <i>Journal of Geophysical Research: Atmospheres</i>. American
    Geophysical Union. <a href="https://doi.org/10.1029/2003jd003973">https://doi.org/10.1029/2003jd003973</a>'
  chicago: 'Strasser, Ulrich, Javier Corripio, Francesca Pellicciotti, Paolo Burlando,
    Ben Brock, and Martin Funk. “Spatial and Temporal Variability of Meteorological
    Variables at Haut Glacier d’Arolla (Switzerland) during the Ablation Season 2001:
    Measurements and Simulations.” <i>Journal of Geophysical Research: Atmospheres</i>.
    American Geophysical Union, 2004. <a href="https://doi.org/10.1029/2003jd003973">https://doi.org/10.1029/2003jd003973</a>.'
  ieee: 'U. Strasser, J. Corripio, F. Pellicciotti, P. Burlando, B. Brock, and M.
    Funk, “Spatial and temporal variability of meteorological variables at Haut Glacier
    d’Arolla (Switzerland) during the ablation season 2001: Measurements and simulations,”
    <i>Journal of Geophysical Research: Atmospheres</i>, vol. 109, no. D3. American
    Geophysical Union, 2004.'
  ista: 'Strasser U, Corripio J, Pellicciotti F, Burlando P, Brock B, Funk M. 2004.
    Spatial and temporal variability of meteorological variables at Haut Glacier d’Arolla
    (Switzerland) during the ablation season 2001: Measurements and simulations. Journal
    of Geophysical Research: Atmospheres. 109(D3), D03103.'
  mla: 'Strasser, Ulrich, et al. “Spatial and Temporal Variability of Meteorological
    Variables at Haut Glacier d’Arolla (Switzerland) during the Ablation Season 2001:
    Measurements and Simulations.” <i>Journal of Geophysical Research: Atmospheres</i>,
    vol. 109, no. D3, D03103, American Geophysical Union, 2004, doi:<a href="https://doi.org/10.1029/2003jd003973">10.1029/2003jd003973</a>.'
  short: 'U. Strasser, J. Corripio, F. Pellicciotti, P. Burlando, B. Brock, M. Funk,
    Journal of Geophysical Research: Atmospheres 109 (2004).'
date_created: 2023-02-20T08:18:57Z
date_published: 2004-02-16T00:00:00Z
date_updated: 2023-02-20T08:40:21Z
day: '16'
doi: 10.1029/2003jd003973
extern: '1'
fulldoi: https://doi.org/10.1029/2003jd003973
intvolume: '       109'
issue: D3
keyword:
- Paleontology
- Space and Planetary Science
- Earth and Planetary Sciences (miscellaneous)
- Atmospheric Science
- Earth-Surface Processes
- Geochemistry and Petrology
- Soil Science
- Water Science and Technology
- Ecology
- Aquatic Science
- Forestry
- Oceanography
- Geophysics
language:
- iso: eng
month: '02'
oa_version: None
publication: 'Journal of Geophysical Research: Atmospheres'
publication_identifier:
  issn:
  - 0148-0227
publication_status: published
publisher: American Geophysical Union
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Spatial and temporal variability of meteorological variables at Haut Glacier
  d''Arolla (Switzerland) during the ablation season 2001: Measurements and simulations'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 109
year: '2004'
...
---
_id: '13434'
abstract:
- lang: eng
  text: Thin films of ionically doped gelatin have been color-patterned with submicrometer
    precision using the wet-stamping technique. Inorganic salts are delivered onto
    the gelatin surface from an agarose stamp, and diffuse into the gelatine layer,
    producting deeply colored precipitates. Reaction fronts originating from different
    features of the stamp cease within < 1 μm of each other, leaving sharp, transparent
    regions in between.
article_processing_charge: No
article_type: original
author:
- first_name: C. J.
  full_name: Campbell, C. J.
  last_name: Campbell
- first_name: M.
  full_name: Fialkowski, M.
  last_name: Fialkowski
- first_name: Rafal
  full_name: Klajn, Rafal
  id: 8e84690e-1e48-11ed-a02b-a1e6fb8bb53b
  last_name: Klajn
- first_name: I. T.
  full_name: Bensemann, I. T.
  last_name: Bensemann
- first_name: B. A.
  full_name: Grzybowski, B. A.
  last_name: Grzybowski
citation:
  ama: Campbell CJ, Fialkowski M, Klajn R, Bensemann IT, Grzybowski BA. Color micro-
    and nanopatterning with counter-propagating reaction-diffusion fronts. <i>Advanced
    Materials</i>. 2004;16(21):1912-1917. doi:<a href="https://doi.org/10.1002/adma.200400383">10.1002/adma.200400383</a>
  apa: Campbell, C. J., Fialkowski, M., Klajn, R., Bensemann, I. T., &#38; Grzybowski,
    B. A. (2004). Color micro- and nanopatterning with counter-propagating reaction-diffusion
    fronts. <i>Advanced Materials</i>. Wiley. <a href="https://doi.org/10.1002/adma.200400383">https://doi.org/10.1002/adma.200400383</a>
  chicago: Campbell, C. J., M. Fialkowski, Rafal Klajn, I. T. Bensemann, and B. A.
    Grzybowski. “Color Micro- and Nanopatterning with Counter-Propagating Reaction-Diffusion
    Fronts.” <i>Advanced Materials</i>. Wiley, 2004. <a href="https://doi.org/10.1002/adma.200400383">https://doi.org/10.1002/adma.200400383</a>.
  ieee: C. J. Campbell, M. Fialkowski, R. Klajn, I. T. Bensemann, and B. A. Grzybowski,
    “Color micro- and nanopatterning with counter-propagating reaction-diffusion fronts,”
    <i>Advanced Materials</i>, vol. 16, no. 21. Wiley, pp. 1912–1917, 2004.
  ista: Campbell CJ, Fialkowski M, Klajn R, Bensemann IT, Grzybowski BA. 2004. Color
    micro- and nanopatterning with counter-propagating reaction-diffusion fronts.
    Advanced Materials. 16(21), 1912–1917.
  mla: Campbell, C. J., et al. “Color Micro- and Nanopatterning with Counter-Propagating
    Reaction-Diffusion Fronts.” <i>Advanced Materials</i>, vol. 16, no. 21, Wiley,
    2004, pp. 1912–17, doi:<a href="https://doi.org/10.1002/adma.200400383">10.1002/adma.200400383</a>.
  short: C.J. Campbell, M. Fialkowski, R. Klajn, I.T. Bensemann, B.A. Grzybowski,
    Advanced Materials 16 (2004) 1912–1917.
date_created: 2023-08-01T10:39:09Z
date_published: 2004-11-14T00:00:00Z
date_updated: 2023-08-08T12:41:23Z
day: '14'
doi: 10.1002/adma.200400383
extern: '1'
fulldoi: https://doi.org/10.1002/adma.200400383
intvolume: '        16'
issue: '21'
keyword:
- Mechanical Engineering
- Mechanics of Materials
- General Materials Science
language:
- iso: eng
month: '11'
oa_version: None
page: 1912-1917
publication: Advanced Materials
publication_identifier:
  eissn:
  - 1521-4095
  issn:
  - 0935-9648
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Color micro- and nanopatterning with counter-propagating reaction-diffusion
  fronts
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 16
year: '2004'
...
---
_id: '13435'
abstract:
- lang: eng
  text: Micropatterning of surfaces with several chemicals at different spatial locations
    usually requires multiple stamping and registration steps. Here, we describe an
    experimental method based on reaction–diffusion phenomena that allows for simultaneous
    micropatterning of a substrate with several coloured chemicals. In this method,
    called wet stamping (WETS), aqueous solutions of two or more inorganic salts are
    delivered onto a film of dry, ionically doped gelatin from an agarose stamp patterned
    in bas relief. Once in conformal contact, these salts diffuse into the gelatin,
    where they react to give deeply coloured precipitates. Separation of colours in
    the plane of the surface is the consequence of the differences in the diffusion
    coefficients, the solubility products, and the amounts of different salts delivered
    from the stamp, and is faithfully reproduced by a theoretical model based on a
    system of reaction–diffusion partial differential equations. The multicolour micropatterns
    are useful as non-binary optical elements, and could potentially form the basis
    of new applications in microseparations and in controlled delivery.
article_processing_charge: No
article_type: original
author:
- first_name: Rafal
  full_name: Klajn, Rafal
  id: 8e84690e-1e48-11ed-a02b-a1e6fb8bb53b
  last_name: Klajn
- first_name: Marcin
  full_name: Fialkowski, Marcin
  last_name: Fialkowski
- first_name: Igor T.
  full_name: Bensemann, Igor T.
  last_name: Bensemann
- first_name: Agnieszka
  full_name: Bitner, Agnieszka
  last_name: Bitner
- first_name: C. J.
  full_name: Campbell, C. J.
  last_name: Campbell
- first_name: Kyle
  full_name: Bishop, Kyle
  last_name: Bishop
- first_name: Stoyan
  full_name: Smoukov, Stoyan
  last_name: Smoukov
- first_name: Bartosz A.
  full_name: Grzybowski, Bartosz A.
  last_name: Grzybowski
citation:
  ama: Klajn R, Fialkowski M, Bensemann IT, et al. Multicolour micropatterning of
    thin films of dry gels. <i>Nature Materials</i>. 2004;3:729-735. doi:<a href="https://doi.org/10.1038/nmat1231">10.1038/nmat1231</a>
  apa: Klajn, R., Fialkowski, M., Bensemann, I. T., Bitner, A., Campbell, C. J., Bishop,
    K., … Grzybowski, B. A. (2004). Multicolour micropatterning of thin films of dry
    gels. <i>Nature Materials</i>. Springer Nature. <a href="https://doi.org/10.1038/nmat1231">https://doi.org/10.1038/nmat1231</a>
  chicago: Klajn, Rafal, Marcin Fialkowski, Igor T. Bensemann, Agnieszka Bitner, C.
    J. Campbell, Kyle Bishop, Stoyan Smoukov, and Bartosz A. Grzybowski. “Multicolour
    Micropatterning of Thin Films of Dry Gels.” <i>Nature Materials</i>. Springer
    Nature, 2004. <a href="https://doi.org/10.1038/nmat1231">https://doi.org/10.1038/nmat1231</a>.
  ieee: R. Klajn <i>et al.</i>, “Multicolour micropatterning of thin films of dry
    gels,” <i>Nature Materials</i>, vol. 3. Springer Nature, pp. 729–735, 2004.
  ista: Klajn R, Fialkowski M, Bensemann IT, Bitner A, Campbell CJ, Bishop K, Smoukov
    S, Grzybowski BA. 2004. Multicolour micropatterning of thin films of dry gels.
    Nature Materials. 3, 729–735.
  mla: Klajn, Rafal, et al. “Multicolour Micropatterning of Thin Films of Dry Gels.”
    <i>Nature Materials</i>, vol. 3, Springer Nature, 2004, pp. 729–35, doi:<a href="https://doi.org/10.1038/nmat1231">10.1038/nmat1231</a>.
  short: R. Klajn, M. Fialkowski, I.T. Bensemann, A. Bitner, C.J. Campbell, K. Bishop,
    S. Smoukov, B.A. Grzybowski, Nature Materials 3 (2004) 729–735.
date_created: 2023-08-01T10:39:23Z
date_published: 2004-09-19T00:00:00Z
date_updated: 2023-08-08T12:42:51Z
day: '19'
doi: 10.1038/nmat1231
extern: '1'
external_id:
  pmid:
  - '15378052'
fulldoi: https://doi.org/10.1038/nmat1231
intvolume: '         3'
keyword:
- Mechanical Engineering
- Mechanics of Materials
- Condensed Matter Physics
- General Materials Science
- General Chemistry
language:
- iso: eng
month: '09'
oa_version: None
page: 729-735
pmid: 1
publication: Nature Materials
publication_identifier:
  eissn:
  - 1476-4660
  issn:
  - 1476-1122
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Multicolour micropatterning of thin films of dry gels
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 3
year: '2004'
...
---
OA_place: repository
OA_type: green
_id: '18739'
abstract:
- lang: eng
  text: 'The first massive astrophysical black holes likely formed at high redshifts
    (z≳ 10) at the centers of low mass (~ 106 M⊙) dark matter concentrations. These
    black holes grow by mergers and gas accretion, evolve into the population of bright
    quasars observed at lower redshifts, and eventually leave the supermassive black
    hole remnants that are ubiquitous at the centers of galaxies in the nearby universe.
    The astrophysical processes responsible for the formation of the earliest seed
    black holes are poorly understood. The purpose of this review is threefold: (1)
    to describe theoretical expectations for the formation and growth of the earliest
    black holes within the general paradigm of hierarchical cold dark matter cosmologies,
    (2) to summarize several relevant recent observations that have implications for
    the formation of the earliest black holes, and (3) to look into the future and
    assess the power of forthcoming observations to probe the physics of the first
    active galactic nuclei.'
alternative_title:
- Astrophysics and Space Science Library
article_processing_charge: No
arxiv: 1
author:
- first_name: Zoltán
  full_name: Haiman, Zoltán
  id: 7c006e8c-cc0d-11ee-8322-cb904ef76f36
  last_name: Haiman
  orcid: 0000-0003-3633-5403
- first_name: Eliot
  full_name: Quataert, Eliot
  last_name: Quataert
citation:
  ama: 'Haiman Z, Quataert E. The Formation and Evolution of the First Massive Black
    Holes. In: <i>Supermassive Black Holes in the Distant Universe</i>. Vol 308. ASSL.
    Springer Nature; 2004:147-185. doi:<a href="https://doi.org/10.1007/978-1-4020-2471-9_5">10.1007/978-1-4020-2471-9_5</a>'
  apa: Haiman, Z., &#38; Quataert, E. (2004). The Formation and Evolution of the First
    Massive Black Holes. In <i>Supermassive Black Holes in the Distant Universe</i>
    (Vol. 308, pp. 147–185). Springer Nature. <a href="https://doi.org/10.1007/978-1-4020-2471-9_5">https://doi.org/10.1007/978-1-4020-2471-9_5</a>
  chicago: Haiman, Zoltán, and Eliot Quataert. “The Formation and Evolution of the
    First Massive Black Holes.” In <i>Supermassive Black Holes in the Distant Universe</i>,
    308:147–85. ASSL. Springer Nature, 2004. <a href="https://doi.org/10.1007/978-1-4020-2471-9_5">https://doi.org/10.1007/978-1-4020-2471-9_5</a>.
  ieee: Z. Haiman and E. Quataert, “The Formation and Evolution of the First Massive
    Black Holes,” in <i>Supermassive Black Holes in the Distant Universe</i>, vol.
    308, Springer Nature, 2004, pp. 147–185.
  ista: 'Haiman Z, Quataert E. 2004.The Formation and Evolution of the First Massive
    Black Holes. In: Supermassive Black Holes in the Distant Universe. Astrophysics
    and Space Science Library, vol. 308, 147–185.'
  mla: Haiman, Zoltán, and Eliot Quataert. “The Formation and Evolution of the First
    Massive Black Holes.” <i>Supermassive Black Holes in the Distant Universe</i>,
    vol. 308, Springer Nature, 2004, pp. 147–85, doi:<a href="https://doi.org/10.1007/978-1-4020-2471-9_5">10.1007/978-1-4020-2471-9_5</a>.
  short: Z. Haiman, E. Quataert, in:, Supermassive Black Holes in the Distant Universe,
    Springer Nature, 2004, pp. 147–185.
date_created: 2025-01-03T12:33:47Z
date_published: 2004-08-03T00:00:00Z
date_updated: 2025-01-07T13:46:38Z
day: '03'
doi: 10.1007/978-1-4020-2471-9_5
extern: '1'
external_id:
  arxiv:
  - astro-ph/0403225
fulldoi: https://doi.org/10.1007/978-1-4020-2471-9_5
intvolume: '       308'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/astro-ph/0403225
month: '08'
oa: 1
oa_version: Preprint
page: 147-185
publication: Supermassive Black Holes in the Distant Universe
publication_identifier:
  eisbn:
  - '9781402024719'
  isbn:
  - '9789048166626'
  issn:
  - 0067-0057
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
series_title: ASSL
status: public
title: The Formation and Evolution of the First Massive Black Holes
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 308
year: '2004'
...
---
OA_place: repository
OA_type: green
_id: '18742'
abstract:
- lang: eng
  text: Recent improved determinations of the mass density ρBH of supermassive black
    holes (SMBHs) in the local universe have allowed accurate comparisons of ρBH with
    the amount of light received from past quasar activity. These comparisons support
    the notion that local SMBHs are "dead quasars" and yield a value epsilon ≳ 0.1
    for the average radiative efficiency of cosmic SMBH accretion. BH coalescences
    may represent an important component of the quasar mass assembly and yet not produce
    any observable electromagnetic signature. Therefore, ignoring gravitational wave
    (GW) emission during such coalescences, which reduces the amount of mass locked
    into remnant BHs, results in an overestimate of epsilon. Here we put constraints
    on the magnitude of this bias. We calculate the cumulative mass loss to GWs experienced
    by a representative population of BHs during repeated cosmological mergers, using
    loss prescriptions based on detailed general relativistic calculations. Despite
    the possibly large number of mergers in the assembly history of each individual
    SMBH, we find that near-equal mass mergers are rare; therefore, the cumulative
    loss is likely to be modest, amounting at most to a 20% increase in the inferred
    epsilon value. Thus, recent estimates of epsilon ≳ 0.1 appear robust. The space
    interferometer LISA should provide empirical constraints on the dark side of quasar
    evolution by measuring the masses and rates of coalescence of massive BHs to cosmological
    distances.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Kristen
  full_name: Menou, Kristen
  last_name: Menou
- first_name: Zoltán
  full_name: Haiman, Zoltán
  id: 7c006e8c-cc0d-11ee-8322-cb904ef76f36
  last_name: Haiman
  orcid: 0000-0003-3633-5403
citation:
  ama: Menou K, Haiman Z. On the dark side of quasar evolution. <i>The Astrophysical
    Journal</i>. 2004;615(1):130-134. doi:<a href="https://doi.org/10.1086/423951">10.1086/423951</a>
  apa: Menou, K., &#38; Haiman, Z. (2004). On the dark side of quasar evolution. <i>The
    Astrophysical Journal</i>. American Astronomical Society. <a href="https://doi.org/10.1086/423951">https://doi.org/10.1086/423951</a>
  chicago: Menou, Kristen, and Zoltán Haiman. “On the Dark Side of Quasar Evolution.”
    <i>The Astrophysical Journal</i>. American Astronomical Society, 2004. <a href="https://doi.org/10.1086/423951">https://doi.org/10.1086/423951</a>.
  ieee: K. Menou and Z. Haiman, “On the dark side of quasar evolution,” <i>The Astrophysical
    Journal</i>, vol. 615, no. 1. American Astronomical Society, pp. 130–134, 2004.
  ista: Menou K, Haiman Z. 2004. On the dark side of quasar evolution. The Astrophysical
    Journal. 615(1), 130–134.
  mla: Menou, Kristen, and Zoltán Haiman. “On the Dark Side of Quasar Evolution.”
    <i>The Astrophysical Journal</i>, vol. 615, no. 1, American Astronomical Society,
    2004, pp. 130–34, doi:<a href="https://doi.org/10.1086/423951">10.1086/423951</a>.
  short: K. Menou, Z. Haiman, The Astrophysical Journal 615 (2004) 130–134.
date_created: 2025-01-03T12:34:57Z
date_published: 2004-11-01T00:00:00Z
date_updated: 2025-01-07T14:02:29Z
day: '01'
doi: 10.1086/423951
extern: '1'
external_id:
  arxiv:
  - astro-ph/0405335
fulldoi: https://doi.org/10.1086/423951
intvolume: '       615'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/astro-ph/0405335
month: '11'
oa: 1
oa_version: Preprint
page: 130-134
publication: The Astrophysical Journal
publication_identifier:
  eissn:
  - 1538-4357
  issn:
  - 0004-637X
publication_status: published
publisher: American Astronomical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: On the dark side of quasar evolution
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 615
year: '2004'
...
---
_id: '4372'
acknowledgement: This work was partially supported by the EC projects IST-2001-33520
  CC (Control and Computation), IST-2001-35302 AMETIST (Advanced Methods for Timed
  Systems) and IST-2003-507219 PROSYD (Property-Based System Design).
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Oded
  full_name: Maler, Oded
  last_name: Maler
- first_name: Dejan
  full_name: Nickovic, Dejan
  id: 41BCEE5C-F248-11E8-B48F-1D18A9856A87
  last_name: Nickovic
citation:
  ama: 'Maler O, Nickovic D. Monitoring Temporal Properties of Continuous Signals.
    In: Springer; 2004:152-166. doi:<a href="https://doi.org/10.1007/978-3-540-30206-3_12">10.1007/978-3-540-30206-3_12</a>'
  apa: 'Maler, O., &#38; Nickovic, D. (2004). Monitoring Temporal Properties of Continuous
    Signals (pp. 152–166). Presented at the FORMATS: Formal Modeling and Analysis
    of Timed Systems, Springer. <a href="https://doi.org/10.1007/978-3-540-30206-3_12">https://doi.org/10.1007/978-3-540-30206-3_12</a>'
  chicago: Maler, Oded, and Dejan Nickovic. “Monitoring Temporal Properties of Continuous
    Signals,” 152–66. Springer, 2004. <a href="https://doi.org/10.1007/978-3-540-30206-3_12">https://doi.org/10.1007/978-3-540-30206-3_12</a>.
  ieee: 'O. Maler and D. Nickovic, “Monitoring Temporal Properties of Continuous Signals,”
    presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, 2004,
    pp. 152–166.'
  ista: 'Maler O, Nickovic D. 2004. Monitoring Temporal Properties of Continuous Signals.
    FORMATS: Formal Modeling and Analysis of Timed Systems, LNCS, , 152–166.'
  mla: Maler, Oded, and Dejan Nickovic. <i>Monitoring Temporal Properties of Continuous
    Signals</i>. Springer, 2004, pp. 152–66, doi:<a href="https://doi.org/10.1007/978-3-540-30206-3_12">10.1007/978-3-540-30206-3_12</a>.
  short: O. Maler, D. Nickovic, in:, Springer, 2004, pp. 152–166.
conference:
  name: 'FORMATS: Formal Modeling and Analysis of Timed Systems'
date_created: 2018-12-11T12:08:31Z
date_published: 2004-12-14T00:00:00Z
date_updated: 2025-06-26T09:05:17Z
day: '14'
doi: 10.1007/978-3-540-30206-3_12
extern: '1'
fulldoi: https://doi.org/10.1007/978-3-540-30206-3_12
language:
- iso: eng
month: '12'
oa_version: None
page: 152 - 166
publication_status: published
publisher: Springer
publist_id: '1088'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Monitoring Temporal Properties of Continuous Signals
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2004'
...
---
_id: '4424'
abstract:
- lang: eng
  text: "The enormous cost and ubiquity of software errors necessitates the need for
    techniques and tools that can precisely analyze large systems and prove that they
    meet given specifications, or if they don't, return counterexample behaviors showing
    how the system fails. Recent advances in model checking, decision procedures,
    program analysis and type systems, and a shift of focus to partial specifications
    common to several systems (e.g., memory safety and race freedom) have resulted
    in several practical verification methods. However, these methods are either precise
    or they are scalable, depending on whether they track the values of variables
    or only a fixed small set of dataflow facts (e.g., types), and are usually insufficient
    for precisely verifying large programs.\r\n\r\nWe describe a new technique called
    Lazy Abstraction (LA) which achieves both precision and scalability by localizing
    the use of precise information. LA automatically builds, explores and refines
    a single abstract model of the program in a way that different parts of the model
    exhibit different degrees of precision, namely just enough to verify the desired
    property. The algorithm automatically mines the information required by partitioning
    mechanical proofs of unsatisfiability of spurious counterexamples into Craig Interpolants.
    For multithreaded systems, we give a new technique based on analyzing the behavior
    of a single thread executing in a context which is an abstraction of the other
    (arbitrarily many) threads. We define novel context models and show how to automatically
    infer them and analyze the full system (thread + context) using LA.\r\n\r\nLA
    is implemented in BLAST. We have run BLAST on Windows and Linux Device Drivers
    to verify API conformance properties, and have used it to find (or guarantee the
    absence of) data races in multithreaded Networked Embedded Systems (NESC) applications.
    BLAST is able to prove the absence of races in several cases where earlier methods,
    which depend on lock-based synchronization, fail."
article_processing_charge: No
author:
- first_name: Ranjit
  full_name: Jhala, Ranjit
  last_name: Jhala
citation:
  ama: Jhala R. Program verification by lazy abstraction. 2004:1-165.
  apa: Jhala, R. (2004). <i>Program verification by lazy abstraction</i>. University
    of California, Berkeley.
  chicago: Jhala, Ranjit. “Program Verification by Lazy Abstraction.” University of
    California, Berkeley, 2004.
  ieee: R. Jhala, “Program verification by lazy abstraction,” University of California,
    Berkeley, 2004.
  ista: Jhala R. 2004. Program verification by lazy abstraction. University of California,
    Berkeley.
  mla: Jhala, Ranjit. <i>Program Verification by Lazy Abstraction</i>. University
    of California, Berkeley, 2004, pp. 1–165.
  short: R. Jhala, Program Verification by Lazy Abstraction, University of California,
    Berkeley, 2004.
date_created: 2018-12-11T12:08:47Z
date_published: 2004-12-01T00:00:00Z
date_updated: 2021-01-12T07:56:52Z
day: '01'
extern: '1'
language:
- iso: eng
month: '12'
oa_version: None
page: 1 - 165
publication_status: published
publisher: University of California, Berkeley
publist_id: '307'
status: public
supervisor:
- first_name: Thomas A
  full_name: Henzinger, Thomas A
  id: 40876CD8-F248-11E8-B48F-1D18A9856A87
  last_name: Henzinger
  orcid: 0000-0002-2985-7724
title: Program verification by lazy abstraction
type: dissertation
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2004'
...
---
OA_type: closed access
_id: '4445'
abstract:
- lang: eng
  text: We present a type system for E code, which is an assembly language that manages
    the release, interaction, and termination of real-time tasks. E code specifies
    a deadline for each task, and the type system ensures that the deadlines are path-insensitive.
    We show that typed E programs allow, for given worst-case execution times of tasks,
    a simple schedulability analysis. Moreover, the real-time programming language
    Giotto can be compiled into typed E~code. This shows that typed E~code identifies
    an easily schedulable yet expressive class of real-time programs. We have extended
    the Giotto compiler to generate typed E code, and enabled the run-time system
    for E code to perform a type and schedulability check before executing the code.
acknowledgement: This research was supported in part by the AFOSR MURI grant F49620-00-1-0327
  and by the NSF grants CCR- 0208875 and CCR-0225610.
article_processing_charge: No
author:
- first_name: Thomas A
  full_name: Henzinger, Thomas A
  id: 40876CD8-F248-11E8-B48F-1D18A9856A87
  last_name: Henzinger
  orcid: 0000−0002−2985−7724
- first_name: Christoph
  full_name: Kirsch, Christoph
  last_name: Kirsch
citation:
  ama: 'Henzinger TA, Kirsch C. A typed assembly language for real-time programs.
    In: <i>Proceedings of the 4th ACM International Conference on Embedded Software</i>.
    Association for Computing Machinery; 2004:104-113. doi:<a href="https://doi.org/10.1145/1017753.1017774">10.1145/1017753.1017774</a>'
  apa: 'Henzinger, T. A., &#38; Kirsch, C. (2004). A typed assembly language for real-time
    programs. In <i>Proceedings of the 4th ACM international conference on Embedded
    software</i> (pp. 104–113). Pisa, Italy: Association for Computing Machinery.
    <a href="https://doi.org/10.1145/1017753.1017774">https://doi.org/10.1145/1017753.1017774</a>'
  chicago: Henzinger, Thomas A, and Christoph Kirsch. “A Typed Assembly Language for
    Real-Time Programs.” In <i>Proceedings of the 4th ACM International Conference
    on Embedded Software</i>, 104–13. Association for Computing Machinery, 2004. <a
    href="https://doi.org/10.1145/1017753.1017774">https://doi.org/10.1145/1017753.1017774</a>.
  ieee: T. A. Henzinger and C. Kirsch, “A typed assembly language for real-time programs,”
    in <i>Proceedings of the 4th ACM international conference on Embedded software</i>,
    Pisa, Italy, 2004, pp. 104–113.
  ista: 'Henzinger TA, Kirsch C. 2004. A typed assembly language for real-time programs.
    Proceedings of the 4th ACM international conference on Embedded software. EMSOFT:
    Embedded Software , 104–113.'
  mla: Henzinger, Thomas A., and Christoph Kirsch. “A Typed Assembly Language for
    Real-Time Programs.” <i>Proceedings of the 4th ACM International Conference on
    Embedded Software</i>, Association for Computing Machinery, 2004, pp. 104–13,
    doi:<a href="https://doi.org/10.1145/1017753.1017774">10.1145/1017753.1017774</a>.
  short: T.A. Henzinger, C. Kirsch, in:, Proceedings of the 4th ACM International
    Conference on Embedded Software, Association for Computing Machinery, 2004, pp.
    104–113.
conference:
  end_date: 2004-09-29
  location: Pisa, Italy
  name: 'EMSOFT: Embedded Software '
  start_date: 2004-09-27
date_created: 2018-12-11T12:08:53Z
date_published: 2004-09-27T00:00:00Z
date_updated: 2026-05-29T09:45:12Z
day: '27'
doi: 10.1145/1017753.1017774
extern: '1'
fulldoi: https://doi.org/10.1145/1017753.1017774
language:
- iso: eng
month: '09'
oa_version: None
page: 104 - 113
publication: Proceedings of the 4th ACM international conference on Embedded software
publication_identifier:
  isbn:
  - '9781581138603'
publication_status: published
publisher: Association for Computing Machinery
publist_id: '285'
quality_controlled: '1'
scopus_import: '1'
status: public
title: A typed assembly language for real-time programs
type: conference
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2004'
...
---
OA_type: closed access
_id: '4458'
abstract:
- lang: eng
  text: 'The success of model checking for large programs depends crucially on the
    ability to efficiently construct parsimonious abstractions. A predicate abstraction
    is parsimonious if at each control location, it specifies only relationships between
    current values of variables, and only those which are required for proving correctness.
    Previous methods for automatically refining predicate abstractions until sufficient
    precision is obtained do not systematically construct parsimonious abstractions:
    predicates usually contain symbolic variables, and are added heuristically and
    often uniformly to many or all control locations at once. We use Craig interpolation
    to efficiently construct, from a given abstract error trace which cannot be concretized,
    a parsominous abstraction that removes the trace. At each location of the trace,
    we infer the relevant predicates as an interpolant between the two formulas that
    define the past and the future segment of the trace. Each interpolant is a relationship
    between current values of program variables, and is relevant only at that particular
    program location. It can be found by a linear scan of the proof of infeasibility
    of the trace.We develop our method for programs with arithmetic and pointer expressions,
    and call-by-value function calls. For function calls, Craig interpolation offers
    a systematic way of generating relevant predicates that contain only the local
    variables of the function and the values of the formal parameters when the function
    was called. We have extended our model checker Blast with predicate discovery
    by Craig interpolation, and applied it successfully to C programs with more than
    130,000 lines of code, which was not possible with approaches that build less
    parsimonious abstractions.'
article_processing_charge: No
author:
- first_name: Thomas A
  full_name: Henzinger, Thomas A
  id: 40876CD8-F248-11E8-B48F-1D18A9856A87
  last_name: Henzinger
  orcid: 0000−0002−2985−7724
- first_name: Ranjit
  full_name: Jhala, Ranjit
  last_name: Jhala
- first_name: Ritankar
  full_name: Majumdar, Ritankar
  last_name: Majumdar
- first_name: Kenneth
  full_name: Mcmillan, Kenneth
  last_name: Mcmillan
citation:
  ama: 'Henzinger TA, Jhala R, Majumdar R, Mcmillan K. Abstractions from proofs. In:
    <i>Proceedings of the 31st ACM SIGPLAN-SIGACT Symposium on Principles of Programming
    Languages</i>. Association for Computing Machinery; 2004:232-244. doi:<a href="https://doi.org/10.1145/964001.964021">10.1145/964001.964021</a>'
  apa: 'Henzinger, T. A., Jhala, R., Majumdar, R., &#38; Mcmillan, K. (2004). Abstractions
    from proofs. In <i>Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles
    of programming languages</i> (pp. 232–244). Venice, Italy: Association for Computing
    Machinery. <a href="https://doi.org/10.1145/964001.964021">https://doi.org/10.1145/964001.964021</a>'
  chicago: Henzinger, Thomas A, Ranjit Jhala, Ritankar Majumdar, and Kenneth Mcmillan.
    “Abstractions from Proofs.” In <i>Proceedings of the 31st ACM SIGPLAN-SIGACT Symposium
    on Principles of Programming Languages</i>, 232–44. Association for Computing
    Machinery, 2004. <a href="https://doi.org/10.1145/964001.964021">https://doi.org/10.1145/964001.964021</a>.
  ieee: T. A. Henzinger, R. Jhala, R. Majumdar, and K. Mcmillan, “Abstractions from
    proofs,” in <i>Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles
    of programming languages</i>, Venice, Italy, 2004, pp. 232–244.
  ista: 'Henzinger TA, Jhala R, Majumdar R, Mcmillan K. 2004. Abstractions from proofs.
    Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming
    languages. POPL: Principles of Programming Languages, 232–244.'
  mla: Henzinger, Thomas A., et al. “Abstractions from Proofs.” <i>Proceedings of
    the 31st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages</i>,
    Association for Computing Machinery, 2004, pp. 232–44, doi:<a href="https://doi.org/10.1145/964001.964021">10.1145/964001.964021</a>.
  short: T.A. Henzinger, R. Jhala, R. Majumdar, K. Mcmillan, in:, Proceedings of the
    31st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Association
    for Computing Machinery, 2004, pp. 232–244.
conference:
  end_date: 2004-01-16
  location: Venice, Italy
  name: 'POPL: Principles of Programming Languages'
  start_date: 2004-01-14
date_created: 2018-12-11T12:08:57Z
date_published: 2004-04-01T00:00:00Z
date_updated: 2026-05-29T09:32:36Z
day: '01'
doi: 10.1145/964001.964021
extern: '1'
fulldoi: https://doi.org/10.1145/964001.964021
language:
- iso: eng
month: '04'
oa_version: None
page: 232 - 244
publication: Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of
  programming languages
publication_identifier:
  isbn:
  - '9781581137293'
publication_status: published
publisher: Association for Computing Machinery
publist_id: '270'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Abstractions from proofs
type: conference
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2004'
...
---
OA_type: closed access
_id: '4459'
abstract:
- lang: eng
  text: Software model checking has been successful for sequential programs, where
    predicate abstraction offers suitable models, and counterexample-guided abstraction
    refinement permits the automatic inference of models. When checking concurrent
    programs, we need to abstract threads as well as the contexts in which they execute.
    Stateless context models, such as predicates on global variables, prove insufficient
    for showing the absence of race conditions in many examples. We therefore use
    richer context models, which combine (1) predicates for abstracting data state,
    (2) control flow quotients for abstracting control state, and (3) counters for
    abstracting an unbounded number of threads. We infer suitable context models automatically
    by a combination of counterexample-guided abstraction refinement, bisimulation
    minimization, circular assume-guarantee reasoning, and parametric reasoning about
    an unbounded number of threads. This algorithm, called CIRC, has been implemented
    in BLAST and succeeds in checking many examples of NESC code for data races. In
    particular, BLAST proves the absence of races in several cases where previous
    race checkers give false positives.
article_processing_charge: No
author:
- first_name: Thomas A
  full_name: Henzinger, Thomas A
  id: 40876CD8-F248-11E8-B48F-1D18A9856A87
  last_name: Henzinger
  orcid: 0000−0002−2985−7724
- first_name: Ranjit
  full_name: Jhala, Ranjit
  last_name: Jhala
- first_name: Ritankar
  full_name: Majumdar, Ritankar
  last_name: Majumdar
citation:
  ama: 'Henzinger TA, Jhala R, Majumdar R. Race checking by context inference. In:
    <i>Proceedings of the ACM SIGPLAN 2004 Conference on Programming Language Design
    and Implementation</i>. Association for Computing Machinery; 2004:1-13. doi:<a
    href="https://doi.org/10.1145/996841.996844">10.1145/996841.996844</a>'
  apa: 'Henzinger, T. A., Jhala, R., &#38; Majumdar, R. (2004). Race checking by context
    inference. In <i>Proceedings of the ACM SIGPLAN 2004 conference on Programming
    language design and implementation</i> (pp. 1–13). Washington, DC, United States:
    Association for Computing Machinery. <a href="https://doi.org/10.1145/996841.996844">https://doi.org/10.1145/996841.996844</a>'
  chicago: Henzinger, Thomas A, Ranjit Jhala, and Ritankar Majumdar. “Race Checking
    by Context Inference.” In <i>Proceedings of the ACM SIGPLAN 2004 Conference on
    Programming Language Design and Implementation</i>, 1–13. Association for Computing
    Machinery, 2004. <a href="https://doi.org/10.1145/996841.996844">https://doi.org/10.1145/996841.996844</a>.
  ieee: T. A. Henzinger, R. Jhala, and R. Majumdar, “Race checking by context inference,”
    in <i>Proceedings of the ACM SIGPLAN 2004 conference on Programming language design
    and implementation</i>, Washington, DC, United States, 2004, pp. 1–13.
  ista: 'Henzinger TA, Jhala R, Majumdar R. 2004. Race checking by context inference.
    Proceedings of the ACM SIGPLAN 2004 conference on Programming language design
    and implementation. PLDI: Programming Languages Design and Implementation, 1–13.'
  mla: Henzinger, Thomas A., et al. “Race Checking by Context Inference.” <i>Proceedings
    of the ACM SIGPLAN 2004 Conference on Programming Language Design and Implementation</i>,
    Association for Computing Machinery, 2004, pp. 1–13, doi:<a href="https://doi.org/10.1145/996841.996844">10.1145/996841.996844</a>.
  short: T.A. Henzinger, R. Jhala, R. Majumdar, in:, Proceedings of the ACM SIGPLAN
    2004 Conference on Programming Language Design and Implementation, Association
    for Computing Machinery, 2004, pp. 1–13.
conference:
  end_date: 2004-06-11
  location: Washington, DC, United States
  name: 'PLDI: Programming Languages Design and Implementation'
  start_date: 2004-06-09
date_created: 2018-12-11T12:08:57Z
date_published: 2004-06-09T00:00:00Z
date_updated: 2026-05-29T09:37:45Z
day: '09'
doi: 10.1145/996841.996844
extern: '1'
fulldoi: https://doi.org/10.1145/996841.996844
language:
- iso: eng
month: '06'
oa_version: None
page: 1 - 13
publication: Proceedings of the ACM SIGPLAN 2004 conference on Programming language
  design and implementation
publication_identifier:
  isbn:
  - '1581138075'
publication_status: published
publisher: Association for Computing Machinery
publist_id: '271'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Race checking by context inference
type: conference
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2004'
...
---
OA_place: repository
OA_type: green
_id: '4461'
abstract:
- lang: eng
  text: One of the central axioms of extreme programming is the disciplined use of
    regression testing during stepwise software development. Due to recent progress
    in software model checking, it has become possible to supplement this process
    with automatic checks for behavioral safety properties of programs, such as conformance
    with locking idioms and other programming protocols and patterns. For efficiency
    reasons, all checks must be incremental, i.e., they must reuse partial results
    from previous checks in order to avoid all unnecessary repetition of expensive
    verification tasks. We show that the lazy-abstraction algorithm, and its implementation
    in Blast, can be extended to support the fully automatic and incremental checking
    of temporal safety properties during software development.
acknowledgement: 'This work was supported in part by the NSF grants CCR-9988172, CCR-0085949,
  and CCR-0234690, the ONR grant N00014-02-1-0671, the DARPA grant F33615-00-C-1693,
  and the MARCO grant 98-DT-660. '
alternative_title:
- Lecture Notes in Computer Science
article_processing_charge: No
author:
- first_name: Thomas A
  full_name: Henzinger, Thomas A
  id: 40876CD8-F248-11E8-B48F-1D18A9856A87
  last_name: Henzinger
  orcid: 0000−0002−2985−7724
- first_name: Ranjit
  full_name: Jhala, Ranjit
  last_name: Jhala
- first_name: Ritankar
  full_name: Majumdar, Ritankar
  last_name: Majumdar
- first_name: Marco
  full_name: Sanvido, Marco
  last_name: Sanvido
citation:
  ama: 'Henzinger TA, Jhala R, Majumdar R, Sanvido M. Extreme Model Checking. In:
    <i>Verification: Theory and Practice</i>. Vol 2772. Lecture Notes in Computer
    Science. Berlin: Springer Nature; 2004:332-358. doi:<a href="https://doi.org/10.1007/978-3-540-39910-0_16">10.1007/978-3-540-39910-0_16</a>'
  apa: 'Henzinger, T. A., Jhala, R., Majumdar, R., &#38; Sanvido, M. (2004). Extreme
    Model Checking. In <i>Verification: Theory and Practice</i> (Vol. 2772, pp. 332–358).
    Berlin: Springer Nature. <a href="https://doi.org/10.1007/978-3-540-39910-0_16">https://doi.org/10.1007/978-3-540-39910-0_16</a>'
  chicago: 'Henzinger, Thomas A, Ranjit Jhala, Ritankar Majumdar, and Marco Sanvido.
    “Extreme Model Checking.” In <i>Verification: Theory and Practice</i>, 2772:332–58.
    Lecture Notes in Computer Science. Berlin: Springer Nature, 2004. <a href="https://doi.org/10.1007/978-3-540-39910-0_16">https://doi.org/10.1007/978-3-540-39910-0_16</a>.'
  ieee: 'T. A. Henzinger, R. Jhala, R. Majumdar, and M. Sanvido, “Extreme Model Checking,”
    in <i>Verification: Theory and Practice</i>, vol. 2772, Berlin: Springer Nature,
    2004, pp. 332–358.'
  ista: 'Henzinger TA, Jhala R, Majumdar R, Sanvido M. 2004.Extreme Model Checking.
    In: Verification: Theory and Practice. Lecture Notes in Computer Science, vol.
    2772, 332–358.'
  mla: 'Henzinger, Thomas A., et al. “Extreme Model Checking.” <i>Verification: Theory
    and Practice</i>, vol. 2772, Springer Nature, 2004, pp. 332–58, doi:<a href="https://doi.org/10.1007/978-3-540-39910-0_16">10.1007/978-3-540-39910-0_16</a>.'
  short: 'T.A. Henzinger, R. Jhala, R. Majumdar, M. Sanvido, in:, Verification: Theory
    and Practice, Springer Nature, Berlin, 2004, pp. 332–358.'
date_created: 2018-12-11T12:08:58Z
date_published: 2004-02-24T00:00:00Z
date_updated: 2026-05-29T09:24:17Z
day: '24'
doi: 10.1007/978-3-540-39910-0_16
extern: '1'
fulldoi: https://doi.org/10.1007/978-3-540-39910-0_16
intvolume: '      2772'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: http://progsys.ucsd.edu/~rjhala/papers/extreme_model_checking.pdf
month: '02'
oa: 1
oa_version: Preprint
page: 332 - 358
place: Berlin
publication: 'Verification: Theory and Practice'
publication_identifier:
  eisbn:
  - '9783540399100'
  isbn:
  - '9783540210023'
publication_status: published
publisher: Springer Nature
publist_id: '269'
quality_controlled: '1'
series_title: Lecture Notes in Computer Science
status: public
title: Extreme Model Checking
type: book_chapter
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 2772
year: '2004'
...
---
OA_place: repository
OA_type: green
_id: '4525'
abstract:
- lang: eng
  text: 'We present a new high-level programming language, called xGiotto, for programming
    applications with hard real-time constraints. Like its predecessor, xGiotto is
    based on the LET (logical execution time) assumption: the programmer specifies
    when the outputs of a task become available, and the compiler checks if the specification
    can be implemented on a given platform. However, while the predecessor language
    xGiotto was purely time-triggered, xGiotto accommodates also asynchronous events.
    Indeed, through a mechanism called event scoping, events are the main structuring
    principle of the new language. The xGiotto compiler and run-time system implement
    event scoping through a tree-based event filter. The compiler also checks programs
    for determinism (absence of race conditions).'
acknowledgement: This research is supported by the AFOSR MURI grant F49620-00-1-0327,
  the DARPA SEC grant F33615-C-98-3614, the MARCO GSRC grant 98-DT-660, and the NSF
  grants CCR-0208875 and CCR-0225610.
alternative_title:
- Lecture Notes in Computer Science
article_processing_charge: No
author:
- first_name: Arkadeb
  full_name: Ghosal, Arkadeb
  last_name: Ghosal
- first_name: Thomas A
  full_name: Henzinger, Thomas A
  id: 40876CD8-F248-11E8-B48F-1D18A9856A87
  last_name: Henzinger
  orcid: 0000−0002−2985−7724
- first_name: Christoph
  full_name: Kirsch, Christoph
  last_name: Kirsch
- first_name: Marco
  full_name: Sanvido, Marco
  last_name: Sanvido
citation:
  ama: 'Ghosal A, Henzinger TA, Kirsch C, Sanvido M. Event-driven programming with
    logical execution times. In: Springer Nature; 2004:357-371. doi:<a href="https://doi.org/10.1007/978-3-540-24743-2_24">10.1007/978-3-540-24743-2_24</a>'
  apa: 'Ghosal, A., Henzinger, T. A., Kirsch, C., &#38; Sanvido, M. (2004). Event-driven
    programming with logical execution times (pp. 357–371). Presented at the HSCC:
    Hybrid Systems - Computation and Control, Philadelphia, PA, United States: Springer
    Nature. <a href="https://doi.org/10.1007/978-3-540-24743-2_24">https://doi.org/10.1007/978-3-540-24743-2_24</a>'
  chicago: Ghosal, Arkadeb, Thomas A Henzinger, Christoph Kirsch, and Marco Sanvido.
    “Event-Driven Programming with Logical Execution Times,” 357–71. Springer Nature,
    2004. <a href="https://doi.org/10.1007/978-3-540-24743-2_24">https://doi.org/10.1007/978-3-540-24743-2_24</a>.
  ieee: 'A. Ghosal, T. A. Henzinger, C. Kirsch, and M. Sanvido, “Event-driven programming
    with logical execution times,” presented at the HSCC: Hybrid Systems - Computation
    and Control, Philadelphia, PA, United States, 2004, pp. 357–371.'
  ista: 'Ghosal A, Henzinger TA, Kirsch C, Sanvido M. 2004. Event-driven programming
    with logical execution times. HSCC: Hybrid Systems - Computation and Control,
    Lecture Notes in Computer Science, , 357–371.'
  mla: Ghosal, Arkadeb, et al. <i>Event-Driven Programming with Logical Execution
    Times</i>. Springer Nature, 2004, pp. 357–71, doi:<a href="https://doi.org/10.1007/978-3-540-24743-2_24">10.1007/978-3-540-24743-2_24</a>.
  short: A. Ghosal, T.A. Henzinger, C. Kirsch, M. Sanvido, in:, Springer Nature, 2004,
    pp. 357–371.
conference:
  end_date: 2004-03-27
  location: Philadelphia, PA, United States
  name: 'HSCC: Hybrid Systems - Computation and Control'
  start_date: 2004-03-25
date_created: 2018-12-11T12:09:18Z
date_published: 2004-03-12T00:00:00Z
date_updated: 2026-05-29T09:15:20Z
day: '12'
doi: 10.1007/978-3-540-24743-2_24
extern: '1'
fulldoi: https://doi.org/10.1007/978-3-540-24743-2_24
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://www.cs.uni-salzburg.at/~ck/content/publications/conferences/HSCC04-EventDrivenProgramming.pdf
month: '03'
oa: 1
oa_version: Preprint
page: 357-371
publication_identifier:
  eisbn:
  - '9783540247432'
  isbn:
  - '9783540212591'
publication_status: published
publisher: Springer Nature
publist_id: '200'
quality_controlled: '1'
status: public
title: Event-driven programming with logical execution times
type: conference
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2004'
...
