---
_id: '13425'
abstract:
- lang: eng
text: Nanoparticles (NPs) decorated with ligands combining photoswitchable dipoles
and covalent cross-linkers can be assembled by light into organized, three-dimensional
suprastructures of various types and sizes. NPs covered with only few photoactive
ligands form metastable crystals that can be assembled and disassembled “on demand”
by using light of different wavelengths. For higher surface concentrations, self-assembly
is irreversible, and the NPs organize into permanently cross-linked structures
including robust supracrystals and plastic spherical aggregates.
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: Kyle J. M.
full_name: Bishop, Kyle J. M.
last_name: Bishop
- first_name: Bartosz A.
full_name: Grzybowski, Bartosz A.
last_name: Grzybowski
citation:
ama: Klajn R, Bishop KJM, Grzybowski BA. Light-controlled self-assembly of reversible
and irreversible nanoparticle suprastructures. Proceedings of the National
Academy of Sciences. 2007;104(25):10305-10309. doi:10.1073/pnas.0611371104
apa: Klajn, R., Bishop, K. J. M., & Grzybowski, B. A. (2007). Light-controlled
self-assembly of reversible and irreversible nanoparticle suprastructures. Proceedings
of the National Academy of Sciences. Proceedings of the National Academy of
Sciences. https://doi.org/10.1073/pnas.0611371104
chicago: Klajn, Rafal, Kyle J. M. Bishop, and Bartosz A. Grzybowski. “Light-Controlled
Self-Assembly of Reversible and Irreversible Nanoparticle Suprastructures.” Proceedings
of the National Academy of Sciences. Proceedings of the National Academy of
Sciences, 2007. https://doi.org/10.1073/pnas.0611371104.
ieee: R. Klajn, K. J. M. Bishop, and B. A. Grzybowski, “Light-controlled self-assembly
of reversible and irreversible nanoparticle suprastructures,” Proceedings of
the National Academy of Sciences, vol. 104, no. 25. Proceedings of the National
Academy of Sciences, pp. 10305–10309, 2007.
ista: Klajn R, Bishop KJM, Grzybowski BA. 2007. Light-controlled self-assembly of
reversible and irreversible nanoparticle suprastructures. Proceedings of the National
Academy of Sciences. 104(25), 10305–10309.
mla: Klajn, Rafal, et al. “Light-Controlled Self-Assembly of Reversible and Irreversible
Nanoparticle Suprastructures.” Proceedings of the National Academy of Sciences,
vol. 104, no. 25, Proceedings of the National Academy of Sciences, 2007, pp. 10305–09,
doi:10.1073/pnas.0611371104.
short: R. Klajn, K.J.M. Bishop, B.A. Grzybowski, Proceedings of the National Academy
of Sciences 104 (2007) 10305–10309.
date_created: 2023-08-01T10:31:19Z
date_published: 2007-06-19T00:00:00Z
date_updated: 2023-08-08T11:24:51Z
day: '19'
doi: 10.1073/pnas.0611371104
extern: '1'
external_id:
pmid:
- '17563381'
intvolume: ' 104'
issue: '25'
keyword:
- Multidisciplinary
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1073/pnas.0611371104
month: '06'
oa: 1
oa_version: Published Version
page: 10305-10309
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: Light-controlled self-assembly of reversible and irreversible nanoparticle
suprastructures
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 104
year: '2007'
...
---
_id: '13426'
abstract:
- lang: eng
text: Photoswelling of thin films of dichromated gelatin provides a basis for fabrication
of multilevel surface reliefs via sequential UV illumination through different
photomasks. The remarkable feature of this simple, benchtop technique is that
by adjusting irradiation times, film thickness, or its hydration state the heights
of the developed features can be varied from few nanometers to tens of microns.
After UV exposure, the surface structures can be replicated faithfully into either
soft or hard PDMS stamps.
article_processing_charge: No
article_type: original
author:
- first_name: Maciej
full_name: Paszewski, Maciej
last_name: Paszewski
- first_name: Stoyan K.
full_name: Smoukov, Stoyan K.
last_name: Smoukov
- first_name: Rafal
full_name: Klajn, Rafal
id: 8e84690e-1e48-11ed-a02b-a1e6fb8bb53b
last_name: Klajn
- first_name: Bartosz A.
full_name: Grzybowski, Bartosz A.
last_name: Grzybowski
citation:
ama: Paszewski M, Smoukov SK, Klajn R, Grzybowski BA. Multilevel surface nano- and
microstructuring via sequential photoswelling of dichromated gelatin. Langmuir.
2007;23(10):5419-5422. doi:10.1021/la062982c
apa: Paszewski, M., Smoukov, S. K., Klajn, R., & Grzybowski, B. A. (2007). Multilevel
surface nano- and microstructuring via sequential photoswelling of dichromated
gelatin. Langmuir. American Chemical Society. https://doi.org/10.1021/la062982c
chicago: Paszewski, Maciej, Stoyan K. Smoukov, Rafal Klajn, and Bartosz A. Grzybowski.
“Multilevel Surface Nano- and Microstructuring via Sequential Photoswelling of
Dichromated Gelatin.” Langmuir. American Chemical Society, 2007. https://doi.org/10.1021/la062982c.
ieee: M. Paszewski, S. K. Smoukov, R. Klajn, and B. A. Grzybowski, “Multilevel surface
nano- and microstructuring via sequential photoswelling of dichromated gelatin,”
Langmuir, vol. 23, no. 10. American Chemical Society, pp. 5419–5422, 2007.
ista: Paszewski M, Smoukov SK, Klajn R, Grzybowski BA. 2007. Multilevel surface
nano- and microstructuring via sequential photoswelling of dichromated gelatin.
Langmuir. 23(10), 5419–5422.
mla: Paszewski, Maciej, et al. “Multilevel Surface Nano- and Microstructuring via
Sequential Photoswelling of Dichromated Gelatin.” Langmuir, vol. 23, no.
10, American Chemical Society, 2007, pp. 5419–22, doi:10.1021/la062982c.
short: M. Paszewski, S.K. Smoukov, R. Klajn, B.A. Grzybowski, Langmuir 23 (2007)
5419–5422.
date_created: 2023-08-01T10:31:33Z
date_published: 2007-04-11T00:00:00Z
date_updated: 2023-08-08T11:26:24Z
day: '11'
doi: 10.1021/la062982c
extern: '1'
external_id:
pmid:
- '17425340'
intvolume: ' 23'
issue: '10'
keyword:
- Electrochemistry
- Spectroscopy
- Surfaces and Interfaces
- Condensed Matter Physics
- General Materials Science
language:
- iso: eng
month: '04'
oa_version: None
page: 5419-5422
pmid: 1
publication: Langmuir
publication_identifier:
eissn:
- 1520-5827
issn:
- 0743-7463
publication_status: published
publisher: American Chemical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Multilevel surface nano- and microstructuring via sequential photoswelling
of dichromated gelatin
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 23
year: '2007'
...
---
_id: '13427'
abstract:
- lang: eng
text: Deformable, spherical aggregates of metal nanoparticles connected by long-chain
dithiol ligands self-assemble into nanostructured materials of macroscopic dimensions.
These materials are plastic and moldable against arbitrarily shaped masters and
can be thermally hardened into polycrystalline metal structures of controllable
porosity. In addition, in both plastic and hardened states, the assemblies are
electrically conductive and exhibit Ohmic characteristics down to ∼20 volts per
meter. The self-assembly method leading to such materials is applicable both to
pure metals and to bimetallic structures of various elemental compositions.
article_processing_charge: No
article_type: letter_note
author:
- first_name: Rafal
full_name: Klajn, Rafal
id: 8e84690e-1e48-11ed-a02b-a1e6fb8bb53b
last_name: Klajn
- first_name: Kyle J. M.
full_name: Bishop, Kyle J. M.
last_name: Bishop
- first_name: Marcin
full_name: Fialkowski, Marcin
last_name: Fialkowski
- first_name: Maciej
full_name: Paszewski, Maciej
last_name: Paszewski
- first_name: Christopher J.
full_name: Campbell, Christopher J.
last_name: Campbell
- first_name: Timothy P.
full_name: Gray, Timothy P.
last_name: Gray
- first_name: Bartosz A.
full_name: Grzybowski, Bartosz A.
last_name: Grzybowski
citation:
ama: Klajn R, Bishop KJM, Fialkowski M, et al. Plastic and moldable metals by self-assembly
of sticky nanoparticle aggregates. Science. 2007;316(5822):261-264. doi:10.1126/science.1139131
apa: Klajn, R., Bishop, K. J. M., Fialkowski, M., Paszewski, M., Campbell, C. J.,
Gray, T. P., & Grzybowski, B. A. (2007). Plastic and moldable metals by self-assembly
of sticky nanoparticle aggregates. Science. American Association for the
Advancement of Science. https://doi.org/10.1126/science.1139131
chicago: Klajn, Rafal, Kyle J. M. Bishop, Marcin Fialkowski, Maciej Paszewski, Christopher
J. Campbell, Timothy P. Gray, and Bartosz A. Grzybowski. “Plastic and Moldable
Metals by Self-Assembly of Sticky Nanoparticle Aggregates.” Science. American
Association for the Advancement of Science, 2007. https://doi.org/10.1126/science.1139131.
ieee: R. Klajn et al., “Plastic and moldable metals by self-assembly of sticky
nanoparticle aggregates,” Science, vol. 316, no. 5822. American Association
for the Advancement of Science, pp. 261–264, 2007.
ista: Klajn R, Bishop KJM, Fialkowski M, Paszewski M, Campbell CJ, Gray TP, Grzybowski
BA. 2007. Plastic and moldable metals by self-assembly of sticky nanoparticle
aggregates. Science. 316(5822), 261–264.
mla: Klajn, Rafal, et al. “Plastic and Moldable Metals by Self-Assembly of Sticky
Nanoparticle Aggregates.” Science, vol. 316, no. 5822, American Association
for the Advancement of Science, 2007, pp. 261–64, doi:10.1126/science.1139131.
short: R. Klajn, K.J.M. Bishop, M. Fialkowski, M. Paszewski, C.J. Campbell, T.P.
Gray, B.A. Grzybowski, Science 316 (2007) 261–264.
date_created: 2023-08-01T10:36:08Z
date_published: 2007-04-13T00:00:00Z
date_updated: 2023-08-08T11:28:29Z
day: '13'
doi: 10.1126/science.1139131
extern: '1'
external_id:
pmid:
- '17431176'
intvolume: ' 316'
issue: '5822'
keyword:
- Multidisciplinary
language:
- iso: eng
month: '04'
oa_version: None
page: 261-264
pmid: 1
publication: Science
publication_identifier:
eissn:
- 1095-9203
issn:
- 0036-8075
publication_status: published
publisher: American Association for the Advancement of Science
quality_controlled: '1'
scopus_import: '1'
status: public
title: Plastic and moldable metals by self-assembly of sticky nanoparticle aggregates
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 316
year: '2007'
...
---
_id: '167'
abstract:
- lang: eng
text: This book contains research articles on Diophantine Geometry, written by participants
of a research program held at the Ennio De Giorgi Mathematical Research Center
in Pisa, Italy, during the period April – July 2005. The authors are eminent experts
in the field. Several subfields of the main topic are presented; the volume thus
is particularly useful to get a broad overview of recent research developments.
alternative_title:
- CRM Series
article_processing_charge: No
arxiv: 1
author:
- first_name: Timothy D
full_name: Browning, Timothy D
id: 35827D50-F248-11E8-B48F-1D18A9856A87
last_name: Browning
orcid: 0000-0002-8314-0177
- first_name: Roger
full_name: Heath Brown, Roger
last_name: Heath Brown
citation:
ama: 'Browning TD, Heath Brown R. Simultaneous equal sums of three powers. In: Zannier
U, ed. Diophantine Geometry. Vol 4. Edizioni della Normale; 2007:93-100.'
apa: Browning, T. D., & Heath Brown, R. (2007). Simultaneous equal sums of three
powers. In U. Zannier (Ed.), Diophantine Geometry (Vol. 4, pp. 93–100).
Edizioni della Normale.
chicago: Browning, Timothy D, and Roger Heath Brown. “Simultaneous Equal Sums of
Three Powers.” In Diophantine Geometry, edited by Umberto Zannier, 4:93–100.
Edizioni della Normale, 2007.
ieee: T. D. Browning and R. Heath Brown, “Simultaneous equal sums of three powers,”
in Diophantine Geometry, vol. 4, U. Zannier, Ed. Edizioni della Normale,
2007, pp. 93–100.
ista: 'Browning TD, Heath Brown R. 2007.Simultaneous equal sums of three powers.
In: Diophantine Geometry. CRM Series, vol. 4, 93–100.'
mla: Browning, Timothy D., and Roger Heath Brown. “Simultaneous Equal Sums of Three
Powers.” Diophantine Geometry, edited by Umberto Zannier, vol. 4, Edizioni
della Normale, 2007, pp. 93–100.
short: T.D. Browning, R. Heath Brown, in:, U. Zannier (Ed.), Diophantine Geometry,
Edizioni della Normale, 2007, pp. 93–100.
date_created: 2018-12-11T11:44:59Z
date_published: 2007-01-01T00:00:00Z
date_updated: 2021-01-12T06:52:24Z
day: '01'
editor:
- first_name: Umberto
full_name: Zannier, Umberto
last_name: Zannier
extern: '1'
external_id:
arxiv:
- '0509152'
intvolume: ' 4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/math/0509152
month: '01'
oa: 1
oa_version: Preprint
page: 93 - 100
publication: Diophantine Geometry
publication_status: published
publisher: Edizioni della Normale
publist_id: '7754'
quality_controlled: '1'
status: public
title: Simultaneous equal sums of three powers
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 4
year: '2007'
...
---
_id: '1964'
abstract:
- lang: eng
text: Complex I of respiratory chains plays a central role in cellular energy production.
Mutations in its subunits lead to many human neurodegenerative diseases. Recently,
a first atomic structure of the hydrophilic domain of complex I from Thermus thermophilus
was determined. This domain represents a catalytic core of the enzyme. It consists
of eight different subunits, contains all the redox centers, and comprises more
than half of the entire complex. In this review, novel mechanistic implications
of the structure are discussed, and the effects of many known mutations of complex
I subunits are interpreted in a structural context.
author:
- first_name: Leonid A
full_name: Leonid Sazanov
id: 338D39FE-F248-11E8-B48F-1D18A9856A87
last_name: Sazanov
orcid: 0000-0002-0977-7989
citation:
ama: 'Sazanov LA. Respiratory complex I: Mechanistic and structural insights provided
by the crystal structure of the hydrophilic domain. Biochemistry. 2007;46(9):2275-2288.
doi:10.1021/bi602508x'
apa: 'Sazanov, L. A. (2007). Respiratory complex I: Mechanistic and structural insights
provided by the crystal structure of the hydrophilic domain. Biochemistry.
ACS. https://doi.org/10.1021/bi602508x'
chicago: 'Sazanov, Leonid A. “Respiratory Complex I: Mechanistic and Structural
Insights Provided by the Crystal Structure of the Hydrophilic Domain.” Biochemistry.
ACS, 2007. https://doi.org/10.1021/bi602508x.'
ieee: 'L. A. Sazanov, “Respiratory complex I: Mechanistic and structural insights
provided by the crystal structure of the hydrophilic domain,” Biochemistry,
vol. 46, no. 9. ACS, pp. 2275–2288, 2007.'
ista: 'Sazanov LA. 2007. Respiratory complex I: Mechanistic and structural insights
provided by the crystal structure of the hydrophilic domain. Biochemistry. 46(9),
2275–2288.'
mla: 'Sazanov, Leonid A. “Respiratory Complex I: Mechanistic and Structural Insights
Provided by the Crystal Structure of the Hydrophilic Domain.” Biochemistry,
vol. 46, no. 9, ACS, 2007, pp. 2275–88, doi:10.1021/bi602508x.'
short: L.A. Sazanov, Biochemistry 46 (2007) 2275–2288.
date_created: 2018-12-11T11:54:57Z
date_published: 2007-03-06T00:00:00Z
date_updated: 2021-01-12T06:54:23Z
day: '06'
doi: 10.1021/bi602508x
extern: 1
intvolume: ' 46'
issue: '9'
month: '03'
page: 2275 - 2288
publication: Biochemistry
publication_status: published
publisher: ACS
publist_id: '5118'
quality_controlled: 0
status: public
title: 'Respiratory complex I: Mechanistic and structural insights provided by the
crystal structure of the hydrophilic domain'
type: journal_article
volume: 46
year: '2007'
...
---
_id: '1965'
abstract:
- lang: eng
text: Respiratory complex I (NADH:ubiquinone oxidoreductase) is an L-shaped multisubunit
protein assembly consisting of a hydrophobic membrane arm and a hydrophilic peripheral
arm. It catalyses the transfer of two electrons from NADH to quinone coupled to
the translocation of four protons across the membrane. Although we have solved
recently the crystal structure of the peripheral arm, the structure of the complete
enzyme and the coupling mechanism are not yet known. The membrane domain of Escherichia
coli complex I consists of seven different subunits with total molecular mass
of 258 kDa. It is significantly more stable than the whole enzyme, which allowed
us to obtain well-ordered two-dimensional crystals of the domain, belonging to
the space group p22121. Comparison of the projection map of negatively stained
crystals with previously published low-resolution structures indicated that the
characteristic curved shape of the membrane domain is remarkably well conserved
between bacterial and mitochondrial enzymes, helping us to interpret projection
maps in the context of the intact complex. Two pronounced stain-excluding densities
at the distal end of the membrane domain are likely to represent the two large
antiporter-like subunits NuoL and NuoM. Cryo-electron microscopy on frozen-hydrated
crystals allowed us to calculate a projection map at 8 Å resolution. About 60
transmembrane α-helices, both perpendicular to the membrane plane and tilted,
are present within one membrane domain, which is consistent with secondary structure
predictions. A possible binding site and access channel for quinone are found
at the interface with the peripheral arm. Tentative assignment of individual subunits
to the features of the map has been made. The location of subunits NuoL and NuoM
at substantial distance from the peripheral arm, which contains all the redox
centres of the complex, indicates that conformational changes are likely to play
a role in the mechanism of coupling between electron transfer and proton pumping.
author:
- first_name: Ekaterina
full_name: Baranova, Ekaterina A
last_name: Baranova
- first_name: Peter
full_name: Holt, Peter J
last_name: Holt
- first_name: Leonid A
full_name: Leonid Sazanov
id: 338D39FE-F248-11E8-B48F-1D18A9856A87
last_name: Sazanov
orcid: 0000-0002-0977-7989
citation:
ama: Baranova E, Holt P, Sazanov LA. Projection structure of the membrane domain
of Escherichia coli respiratory Complex I at 8 Å resolution. Journal of Molecular
Biology. 2007;366(1):140-154. doi:10.1016/j.jmb.2006.11.026
apa: Baranova, E., Holt, P., & Sazanov, L. A. (2007). Projection structure of
the membrane domain of Escherichia coli respiratory Complex I at 8 Å resolution.
Journal of Molecular Biology. Elsevier. https://doi.org/10.1016/j.jmb.2006.11.026
chicago: Baranova, Ekaterina, Peter Holt, and Leonid A Sazanov. “Projection Structure
of the Membrane Domain of Escherichia Coli Respiratory Complex I at 8 Å Resolution.”
Journal of Molecular Biology. Elsevier, 2007. https://doi.org/10.1016/j.jmb.2006.11.026.
ieee: E. Baranova, P. Holt, and L. A. Sazanov, “Projection structure of the membrane
domain of Escherichia coli respiratory Complex I at 8 Å resolution,” Journal
of Molecular Biology, vol. 366, no. 1. Elsevier, pp. 140–154, 2007.
ista: Baranova E, Holt P, Sazanov LA. 2007. Projection structure of the membrane
domain of Escherichia coli respiratory Complex I at 8 Å resolution. Journal of
Molecular Biology. 366(1), 140–154.
mla: Baranova, Ekaterina, et al. “Projection Structure of the Membrane Domain of
Escherichia Coli Respiratory Complex I at 8 Å Resolution.” Journal of Molecular
Biology, vol. 366, no. 1, Elsevier, 2007, pp. 140–54, doi:10.1016/j.jmb.2006.11.026.
short: E. Baranova, P. Holt, L.A. Sazanov, Journal of Molecular Biology 366 (2007)
140–154.
date_created: 2018-12-11T11:54:57Z
date_published: 2007-02-09T00:00:00Z
date_updated: 2021-01-12T06:54:23Z
day: '09'
doi: 10.1016/j.jmb.2006.11.026
extern: 1
intvolume: ' 366'
issue: '1'
month: '02'
page: 140 - 154
publication: Journal of Molecular Biology
publication_status: published
publisher: Elsevier
publist_id: '5119'
quality_controlled: 0
status: public
title: Projection structure of the membrane domain of Escherichia coli respiratory
Complex I at 8 Å resolution
type: journal_article
volume: 366
year: '2007'
...
---
_id: '1969'
abstract:
- lang: eng
text: Respiratory complex I catalyses the transfer of electrons from NADH to quinone
coupled to the translocation of protons across the membrane. The mechanism of
coupling and the structure of the complete enzyme are not known. The membrane
domain of the complex contains three similar antiporter-like subunits NuoL/M/N,
probably involved in proton pumping. We have previously shown that subunits NuoL/M
can be removed from the rest of the complex, suggesting their location at the
distal end of the membrane domain. Here, using electron microscopy and single
particle analysis, we show that subunits NuoL and M jointly occupy a distal half
of the membrane domain, separated by about 10 nm from the interface with the peripheral
arm. This indicates that coupling mechanism of complex I is likely to involve
long range conformational changes.
author:
- first_name: Ekaterina
full_name: Baranova, Ekaterina A
last_name: Baranova
- first_name: David
full_name: Morgan, David J
last_name: Morgan
- first_name: Leonid A
full_name: Leonid Sazanov
id: 338D39FE-F248-11E8-B48F-1D18A9856A87
last_name: Sazanov
orcid: 0000-0002-0977-7989
citation:
ama: Baranova E, Morgan D, Sazanov LA. Single particle analysis confirms distal
location of subunits NuoL and NuoM in Escherichia coli complex I. Journal of
Structural Biology. 2007;159(2 SPEC. ISS.):238-242. doi:10.1016/j.jsb.2007.01.009
apa: Baranova, E., Morgan, D., & Sazanov, L. A. (2007). Single particle analysis
confirms distal location of subunits NuoL and NuoM in Escherichia coli complex
I. Journal of Structural Biology. Academic Press. https://doi.org/10.1016/j.jsb.2007.01.009
chicago: Baranova, Ekaterina, David Morgan, and Leonid A Sazanov. “Single Particle
Analysis Confirms Distal Location of Subunits NuoL and NuoM in Escherichia Coli
Complex I.” Journal of Structural Biology. Academic Press, 2007. https://doi.org/10.1016/j.jsb.2007.01.009.
ieee: E. Baranova, D. Morgan, and L. A. Sazanov, “Single particle analysis confirms
distal location of subunits NuoL and NuoM in Escherichia coli complex I,” Journal
of Structural Biology, vol. 159, no. 2 SPEC. ISS. Academic Press, pp. 238–242,
2007.
ista: Baranova E, Morgan D, Sazanov LA. 2007. Single particle analysis confirms
distal location of subunits NuoL and NuoM in Escherichia coli complex I. Journal
of Structural Biology. 159(2 SPEC. ISS.), 238–242.
mla: Baranova, Ekaterina, et al. “Single Particle Analysis Confirms Distal Location
of Subunits NuoL and NuoM in Escherichia Coli Complex I.” Journal of Structural
Biology, vol. 159, no. 2 SPEC. ISS., Academic Press, 2007, pp. 238–42, doi:10.1016/j.jsb.2007.01.009.
short: E. Baranova, D. Morgan, L.A. Sazanov, Journal of Structural Biology 159 (2007)
238–242.
date_created: 2018-12-11T11:54:58Z
date_published: 2007-08-01T00:00:00Z
date_updated: 2021-01-12T06:54:24Z
day: '01'
doi: 10.1016/j.jsb.2007.01.009
extern: 1
intvolume: ' 159'
issue: 2 SPEC. ISS.
month: '08'
page: 238 - 242
publication: Journal of Structural Biology
publication_status: published
publisher: Academic Press
publist_id: '5117'
quality_controlled: 0
status: public
title: Single particle analysis confirms distal location of subunits NuoL and NuoM
in Escherichia coli complex I
type: journal_article
volume: 159
year: '2007'
...
---
_id: '4344'
abstract:
- lang: ger
text: Anknüpfend an ihren Aufsatz „Bibliothek 2.0 – Die Zukunft der Bibliothek?“
(2006) geben Patrick Danowski und Lambert Heller, verantwortlich für das Schwerpunktthema
der vorliegenden Ausgabe, einen Überblick über den erreichten Diskussionsstand
über verschiedene Teilaspekte der Bibliothek 2.0 unter besonderer Berücksichtigung
der deutschen Fachöffentlichkeit. Einige charakteristische Fragen und Probleme
der Weiterentwicklung, Öffnung und Vernetzung bibliothekarischer Dienste und Informationen
werden angesprochen.
- lang: eng
text: Following up their article „Bibliothek 2.0 – Die Zukunft der Bibliothek?“
(„Library 2.0 – The future of the library?“) (2006), Patrick Danowski and Lambert
Heller, responsible for the main focus of this issue, give an outline of some
recently discussed library 2.0 topics, especially in respect to the professional
community in germany. Some characteristic questions and problems of the development,
opening and networking of library Services and information are mentioned.
article_processing_charge: No
author:
- first_name: Patrick
full_name: Danowski, Patrick
id: 2EBD1598-F248-11E8-B48F-1D18A9856A87
last_name: Danowski
orcid: 0000-0002-6026-4409
- first_name: Lambert
full_name: Heller, Lambert
last_name: Heller
citation:
ama: Danowski P, Heller L. Bibliothek 2.0? Wird alles anders? Bibliothek - Forschung
und Praxis. 2007;31(2):130-136. doi:10.1515/BFUP.2007.130
apa: Danowski, P., & Heller, L. (2007). Bibliothek 2.0? Wird alles anders? Bibliothek
- Forschung Und Praxis. De Gruyter. https://doi.org/10.1515/BFUP.2007.130
chicago: Danowski, Patrick, and Lambert Heller. “Bibliothek 2.0? Wird Alles Anders?”
Bibliothek - Forschung Und Praxis. De Gruyter, 2007. https://doi.org/10.1515/BFUP.2007.130.
ieee: P. Danowski and L. Heller, “Bibliothek 2.0? Wird alles anders?,” Bibliothek
- Forschung und Praxis, vol. 31, no. 2. De Gruyter, pp. 130–136, 2007.
ista: Danowski P, Heller L. 2007. Bibliothek 2.0? Wird alles anders? Bibliothek
- Forschung und Praxis. 31(2), 130–136.
mla: Danowski, Patrick, and Lambert Heller. “Bibliothek 2.0? Wird Alles Anders?”
Bibliothek - Forschung Und Praxis, vol. 31, no. 2, De Gruyter, 2007, pp.
130–36, doi:10.1515/BFUP.2007.130.
short: P. Danowski, L. Heller, Bibliothek - Forschung Und Praxis 31 (2007) 130–136.
date_created: 2018-12-11T12:08:22Z
date_published: 2007-08-01T00:00:00Z
date_updated: 2025-07-01T13:06:48Z
day: '01'
doi: 10.1515/BFUP.2007.130
extern: '1'
intvolume: ' 31'
issue: '2'
language:
- iso: eng
month: '08'
oa_version: None
page: 130 - 136
publication: Bibliothek - Forschung und Praxis
publication_status: published
publisher: De Gruyter
publist_id: '1230'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Bibliothek 2.0? Wird alles anders?
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 31
year: '2007'
...
---
_id: '4353'
abstract:
- lang: eng
text: 'BACKGROUND: The invention of the Genome Sequence 20 DNA Sequencing System
(454 parallel sequencing platform) has enabled the rapid and high-volume production
of sequence data. Until now, however, individual emulsion PCR (emPCR) reactions
and subsequent sequencing runs have been unable to combine template DNA from multiple
individuals, as homologous sequences cannot be subsequently assigned to their
original sources. METHODOLOGY: We use conventional PCR with 5''-nucleotide tagged
primers to generate homologous DNA amplification products from multiple specimens,
followed by sequencing through the high-throughput Genome Sequence 20 DNA Sequencing
System (GS20, Roche/454 Life Sciences). Each DNA sequence is subsequently traced
back to its individual source through 5''tag-analysis. CONCLUSIONS: We demonstrate
that this new approach enables the assignment of virtually all the generated DNA
sequences to the correct source once sequencing anomalies are accounted for (miss-assignment
rate<0.4%). Therefore, the method enables accurate sequencing and assignment
of homologous DNA sequences from multiple sources in single high-throughput GS20
run. We observe a bias in the distribution of the differently tagged primers that
is dependent on the 5'' nucleotide of the tag. In particular, primers 5'' labelled
with a cytosine are heavily overrepresented among the final sequences, while those
5'' labelled with a thymine are strongly underrepresented. A weaker bias also
exists with regards to the distribution of the sequences as sorted by the second
nucleotide of the dinucleotide tags. As the results are based on a single GS20
run, the general applicability of the approach requires confirmation. However,
our experiments demonstrate that 5''primer tagging is a useful method in which
the sequencing power of the GS20 can be applied to PCR-based assays of multiple
homologous PCR products. The new approach will be of value to a broad range of
research areas, such as those of comparative genomics, complete mitochondrial
analyses, population genetics, and phylogenetics.'
acknowledgement: JB and EW were supported by the Wellcome Trust, UK, the Carlsberg
Foundation, DK, and the National Science Foundation, DK. MTPG acknowledges the Marie
Curie Actions FP6-MEIF-CT-2005-025002 ‘FORMAPLEX’ grant for funding his research.
JPB and RN were funded by the Danish FSS and the National Science Foundation, DK.
None of the sponsors or funders have had any influence on the data or manuscript
presented here.
author:
- first_name: Jonas
full_name: Binladen, Jonas
last_name: Binladen
- first_name: M Thomas
full_name: Gilbert, M Thomas
last_name: Gilbert
- first_name: Jonathan P
full_name: Jonathan Bollback
id: 2C6FA9CC-F248-11E8-B48F-1D18A9856A87
last_name: Bollback
orcid: 0000-0002-4624-4612
- first_name: Frank
full_name: Panitz, Frank
last_name: Panitz
- first_name: Christian
full_name: Bendixen, Christian
last_name: Bendixen
- first_name: Rasmus
full_name: Nielsen, Rasmus
last_name: Nielsen
- first_name: Eske
full_name: Willerslev, Eske
last_name: Willerslev
citation:
ama: Binladen J, Gilbert MT, Bollback JP, et al. The use of coded PCR primers enables
high-throughput sequencing of multiple homolog amplification products by 454 parallel
sequencing. PLoS One. 2007;2(2). doi:10.1371/journal.pone.0000197
apa: Binladen, J., Gilbert, M. T., Bollback, J. P., Panitz, F., Bendixen, C., Nielsen,
R., & Willerslev, E. (2007). The use of coded PCR primers enables high-throughput
sequencing of multiple homolog amplification products by 454 parallel sequencing.
PLoS One. Public Library of Science. https://doi.org/10.1371/journal.pone.0000197
chicago: Binladen, Jonas, M Thomas Gilbert, Jonathan P Bollback, Frank Panitz, Christian
Bendixen, Rasmus Nielsen, and Eske Willerslev. “The Use of Coded PCR Primers Enables
High-Throughput Sequencing of Multiple Homolog Amplification Products by 454 Parallel
Sequencing.” PLoS One. Public Library of Science, 2007. https://doi.org/10.1371/journal.pone.0000197.
ieee: J. Binladen et al., “The use of coded PCR primers enables high-throughput
sequencing of multiple homolog amplification products by 454 parallel sequencing,”
PLoS One, vol. 2, no. 2. Public Library of Science, 2007.
ista: Binladen J, Gilbert MT, Bollback JP, Panitz F, Bendixen C, Nielsen R, Willerslev
E. 2007. The use of coded PCR primers enables high-throughput sequencing of multiple
homolog amplification products by 454 parallel sequencing. PLoS One. 2(2).
mla: Binladen, Jonas, et al. “The Use of Coded PCR Primers Enables High-Throughput
Sequencing of Multiple Homolog Amplification Products by 454 Parallel Sequencing.”
PLoS One, vol. 2, no. 2, Public Library of Science, 2007, doi:10.1371/journal.pone.0000197.
short: J. Binladen, M.T. Gilbert, J.P. Bollback, F. Panitz, C. Bendixen, R. Nielsen,
E. Willerslev, PLoS One 2 (2007).
date_created: 2018-12-11T12:08:25Z
date_published: 2007-02-14T00:00:00Z
date_updated: 2021-01-12T07:56:21Z
day: '14'
doi: 10.1371/journal.pone.0000197
extern: 1
intvolume: ' 2'
issue: '2'
month: '02'
publication: PLoS One
publication_status: published
publisher: Public Library of Science
publist_id: '1105'
quality_controlled: 0
status: public
title: The use of coded PCR primers enables high-throughput sequencing of multiple
homolog amplification products by 454 parallel sequencing
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
volume: 2
year: '2007'
...
---
_id: '4354'
abstract:
- lang: eng
text: Homology search is one of the most ubiquitous bioinformatic tasks, yet it
is unknown how effective the currently available tools are for identifying noncoding
RNAs (ncRNAs). In this work, we use reliable ncRNA data sets to assess the effectiveness
of methods such as BLAST, FASTA, HMMer, and Infernal. Surprisingly, the most popular
homology search methods are often the least accurate. As a result, many studies
have used inappropriate tools for their analyses. On the basis of our results,
we suggest homology search strategies using the currently available tools and
some directions for future development.
author:
- first_name: Eva
full_name: Freyhult, Eva K
last_name: Freyhult
- first_name: Jonathan P
full_name: Jonathan Bollback
id: 2C6FA9CC-F248-11E8-B48F-1D18A9856A87
last_name: Bollback
orcid: 0000-0002-4624-4612
- first_name: Paul
full_name: Gardner, Paul P
last_name: Gardner
citation:
ama: 'Freyhult E, Bollback JP, Gardner P. Exploring genomic dark matter: a critical
assessment of the performance of homology search methods on noncoding RNA. Genome
Research. 2007;17(1):117-125. doi:10.1101/gr.5890907'
apa: 'Freyhult, E., Bollback, J. P., & Gardner, P. (2007). Exploring genomic
dark matter: a critical assessment of the performance of homology search methods
on noncoding RNA. Genome Research. Cold Spring Harbor Laboratory Press.
https://doi.org/10.1101/gr.5890907'
chicago: 'Freyhult, Eva, Jonathan P Bollback, and Paul Gardner. “Exploring Genomic
Dark Matter: A Critical Assessment of the Performance of Homology Search Methods
on Noncoding RNA.” Genome Research. Cold Spring Harbor Laboratory Press,
2007. https://doi.org/10.1101/gr.5890907.'
ieee: 'E. Freyhult, J. P. Bollback, and P. Gardner, “Exploring genomic dark matter:
a critical assessment of the performance of homology search methods on noncoding
RNA,” Genome Research, vol. 17, no. 1. Cold Spring Harbor Laboratory Press,
pp. 117–25, 2007.'
ista: 'Freyhult E, Bollback JP, Gardner P. 2007. Exploring genomic dark matter:
a critical assessment of the performance of homology search methods on noncoding
RNA. Genome Research. 17(1), 117–25.'
mla: 'Freyhult, Eva, et al. “Exploring Genomic Dark Matter: A Critical Assessment
of the Performance of Homology Search Methods on Noncoding RNA.” Genome Research,
vol. 17, no. 1, Cold Spring Harbor Laboratory Press, 2007, pp. 117–25, doi:10.1101/gr.5890907.'
short: E. Freyhult, J.P. Bollback, P. Gardner, Genome Research 17 (2007) 117–25.
date_created: 2018-12-11T12:08:25Z
date_published: 2007-01-01T00:00:00Z
date_updated: 2021-01-12T07:56:21Z
day: '01'
doi: 10.1101/gr.5890907
extern: 1
intvolume: ' 17'
issue: '1'
main_file_link:
- open_access: '0'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC1716261
month: '01'
page: 117 - 25
publication: Genome Research
publication_status: published
publisher: Cold Spring Harbor Laboratory Press
publist_id: '1106'
quality_controlled: 0
status: public
title: 'Exploring genomic dark matter: a critical assessment of the performance of
homology search methods on noncoding RNA'
type: journal_article
volume: 17
year: '2007'
...
---
_id: '4355'
abstract:
- lang: eng
text: When a beneficial mutation is fixed in a population that lacks recombination,
the genetic background linked to that mutation is fixed. As a result, beneficial
mutations on different backgrounds experience competition, or "clonal interference,"
that can cause asexual populations to evolve more slowly than their sexual counterparts.
Factors such as a large population size (N) and high mutation rates (mu) increase
the number of competing beneficial mutations, and hence are expected to increase
the intensity of clonal interference. However, recent theory suggests that, with
very large values of Nmu, the severity of clonal interference may instead decline.
The reason is that, with large Nmu, genomes including both beneficial mutations
are rapidly created by recurrent mutation, obviating the need for recombination.
Here, we analyze data from experimentally evolved asexual populations of a bacteriophage
and find that, in these nonrecombining populations with very large Nmu, recurrent
mutation does appear to ameliorate this cost of asexuality.
acknowledgement: R01 GM069801-08/GM/NIGMS NIH HHS/United States
author:
- first_name: Jonathan P
full_name: Jonathan Bollback
id: 2C6FA9CC-F248-11E8-B48F-1D18A9856A87
last_name: Bollback
orcid: 0000-0002-4624-4612
- first_name: John
full_name: Huelsenbeck, John P
last_name: Huelsenbeck
citation:
ama: Bollback JP, Huelsenbeck J. Clonal interference is alleviated by high mutation
rates in large populations. Molecular Biology and Evolution. 2007;24(6):1397-1406.
doi:10.1093/molbev/msm056
apa: Bollback, J. P., & Huelsenbeck, J. (2007). Clonal interference is alleviated
by high mutation rates in large populations. Molecular Biology and Evolution.
Oxford University Press. https://doi.org/10.1093/molbev/msm056
chicago: Bollback, Jonathan P, and John Huelsenbeck. “Clonal Interference Is Alleviated
by High Mutation Rates in Large Populations.” Molecular Biology and Evolution.
Oxford University Press, 2007. https://doi.org/10.1093/molbev/msm056.
ieee: J. P. Bollback and J. Huelsenbeck, “Clonal interference is alleviated by high
mutation rates in large populations,” Molecular Biology and Evolution,
vol. 24, no. 6. Oxford University Press, pp. 1397–1406, 2007.
ista: Bollback JP, Huelsenbeck J. 2007. Clonal interference is alleviated by high
mutation rates in large populations. Molecular Biology and Evolution. 24(6), 1397–1406.
mla: Bollback, Jonathan P., and John Huelsenbeck. “Clonal Interference Is Alleviated
by High Mutation Rates in Large Populations.” Molecular Biology and Evolution,
vol. 24, no. 6, Oxford University Press, 2007, pp. 1397–406, doi:10.1093/molbev/msm056.
short: J.P. Bollback, J. Huelsenbeck, Molecular Biology and Evolution 24 (2007)
1397–1406.
date_created: 2018-12-11T12:08:26Z
date_published: 2007-03-22T00:00:00Z
date_updated: 2021-01-12T07:56:22Z
day: '22'
doi: 10.1093/molbev/msm056
extern: 1
intvolume: ' 24'
issue: '6'
month: '03'
page: 1397 - 1406
publication: Molecular Biology and Evolution
publication_status: published
publisher: Oxford University Press
publist_id: '1104'
quality_controlled: 0
status: public
title: Clonal interference is alleviated by high mutation rates in large populations
type: journal_article
volume: 24
year: '2007'
...
---
_id: '4356'
abstract:
- lang: eng
text: We used a comparative genomics approach to identify genes that are under positive
selection in six strains of Escherichia coli and Shigella flexneri, including
five strains that are human pathogens. We find that positive selection targets
a wide range of different functions in the E. coli genome, including cell surface
proteins such as beta barrel porins, presumably because of the involvement of
these genes in evolutionary arms races with other bacteria, phages, and/or the
host immune system. Structural mapping of positively selected sites on trans-membrane
beta barrel porins reveals that the residues under positive selection occur almost
exclusively in the extracellular region of the proteins that are enriched with
sites known to be targets of phages, colicins, or the host immune system. More
surprisingly, we also find a number of other categories of genes that show very
strong evidence for positive selection, such as the enigmatic rhs elements and
transposases. Based on structural evidence, we hypothesize that the selection
acting on transposases is related to the genomic conflict between transposable
elements and the host genome.
author:
- first_name: Lise
full_name: Petersen, Lise
last_name: Petersen
- first_name: Jonathan P
full_name: Jonathan Bollback
id: 2C6FA9CC-F248-11E8-B48F-1D18A9856A87
last_name: Bollback
orcid: 0000-0002-4624-4612
- first_name: Matt
full_name: Dimmic, Matt
last_name: Dimmic
- first_name: Melissa
full_name: Hubisz, Melissa
last_name: Hubisz
- first_name: Rasmus
full_name: Nielsen, Rasmus
last_name: Nielsen
citation:
ama: Petersen L, Bollback JP, Dimmic M, Hubisz M, Nielsen R. Genes under positive
selection in Escherichia coli. Genome Research. 2007;17(9):1336-1343. doi:10.1101/gr.6254707
apa: Petersen, L., Bollback, J. P., Dimmic, M., Hubisz, M., & Nielsen, R. (2007).
Genes under positive selection in Escherichia coli. Genome Research. Cold
Spring Harbor Laboratory Press. https://doi.org/10.1101/gr.6254707
chicago: Petersen, Lise, Jonathan P Bollback, Matt Dimmic, Melissa Hubisz, and Rasmus
Nielsen. “Genes under Positive Selection in Escherichia Coli.” Genome Research.
Cold Spring Harbor Laboratory Press, 2007. https://doi.org/10.1101/gr.6254707.
ieee: L. Petersen, J. P. Bollback, M. Dimmic, M. Hubisz, and R. Nielsen, “Genes
under positive selection in Escherichia coli,” Genome Research, vol. 17,
no. 9. Cold Spring Harbor Laboratory Press, pp. 1336–1343, 2007.
ista: Petersen L, Bollback JP, Dimmic M, Hubisz M, Nielsen R. 2007. Genes under
positive selection in Escherichia coli. Genome Research. 17(9), 1336–1343.
mla: Petersen, Lise, et al. “Genes under Positive Selection in Escherichia Coli.”
Genome Research, vol. 17, no. 9, Cold Spring Harbor Laboratory Press, 2007,
pp. 1336–43, doi:10.1101/gr.6254707.
short: L. Petersen, J.P. Bollback, M. Dimmic, M. Hubisz, R. Nielsen, Genome Research
17 (2007) 1336–1343.
date_created: 2018-12-11T12:08:26Z
date_published: 2007-08-03T00:00:00Z
date_updated: 2021-01-12T07:56:22Z
day: '03'
doi: 10.1101/gr.6254707
extern: 1
intvolume: ' 17'
issue: '9'
month: '08'
page: 1336 - 1343
publication: Genome Research
publication_status: published
publisher: Cold Spring Harbor Laboratory Press
publist_id: '1103'
quality_controlled: 0
status: public
title: Genes under positive selection in Escherichia coli
type: journal_article
volume: 17
year: '2007'
...
---
_id: '4368'
abstract:
- lang: eng
text: In this paper we describe AMT, a tool for monitoring temporal properties of
continuous signals. We first introduce Stl/Psl, a specification formalism based
on the industrial standard language Psl and the real-time temporal logic Mitl,
extended with constructs that allow describing behaviors of real-valued variables.
The tool automatically builds property observers from an Stl/Psl specification
and checks, in an offline or incremental fashion, whether simulation traces satisfy
the property. The AMT tool is validated through a Flash memory case-study.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Dejan
full_name: Nickovic, Dejan
id: 41BCEE5C-F248-11E8-B48F-1D18A9856A87
last_name: Nickovic
- first_name: Oded
full_name: Maler, Oded
last_name: Maler
citation:
ama: 'Nickovic D, Maler O. AMT: A property-based monitoring tool for analog systems.
In: 5th International Conference on Formal Modeling and Analysis of Timed Systems.
Vol 4763. Springer; 2007:304-319. doi:10.1007/978-3-540-75454-1_22'
apa: 'Nickovic, D., & Maler, O. (2007). AMT: A property-based monitoring tool
for analog systems. In 5th International Conference on Formal Modeling and
Analysis of Timed Systems (Vol. 4763, pp. 304–319). Salzburg, Austria: Springer.
https://doi.org/10.1007/978-3-540-75454-1_22'
chicago: 'Nickovic, Dejan, and Oded Maler. “AMT: A Property-Based Monitoring Tool
for Analog Systems.” In 5th International Conference on Formal Modeling and
Analysis of Timed Systems, 4763:304–19. Springer, 2007. https://doi.org/10.1007/978-3-540-75454-1_22.'
ieee: 'D. Nickovic and O. Maler, “AMT: A property-based monitoring tool for analog
systems,” in 5th International Conference on Formal Modeling and Analysis of
Timed Systems, Salzburg, Austria, 2007, vol. 4763, pp. 304–319.'
ista: 'Nickovic D, Maler O. 2007. AMT: A property-based monitoring tool for analog
systems. 5th International Conference on Formal Modeling and Analysis of Timed
Systems. FORMATS: Formal Modeling and Analysis of Timed Systems, LNCS, vol. 4763,
304–319.'
mla: 'Nickovic, Dejan, and Oded Maler. “AMT: A Property-Based Monitoring Tool for
Analog Systems.” 5th International Conference on Formal Modeling and Analysis
of Timed Systems, vol. 4763, Springer, 2007, pp. 304–19, doi:10.1007/978-3-540-75454-1_22.'
short: D. Nickovic, O. Maler, in:, 5th International Conference on Formal Modeling
and Analysis of Timed Systems, Springer, 2007, pp. 304–319.
conference:
end_date: 2007-10-05
location: Salzburg, Austria
name: 'FORMATS: Formal Modeling and Analysis of Timed Systems'
start_date: 2007-10-03
date_created: 2018-12-11T12:08:30Z
date_published: 2007-09-20T00:00:00Z
date_updated: 2025-07-01T13:02:22Z
day: '20'
doi: 10.1007/978-3-540-75454-1_22
extern: '1'
intvolume: ' 4763'
language:
- iso: eng
month: '09'
oa_version: None
page: 304 - 319
publication: 5th International Conference on Formal Modeling and Analysis of Timed
Systems
publication_status: published
publisher: Springer
publist_id: '1089'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'AMT: A property-based monitoring tool for analog systems'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 4763
year: '2007'
...
---
_id: '4370'
abstract:
- lang: eng
text: In this paper we propose a complete chain for synthesizing controllers from
high-level specifications. From real-time properties expressed in the logic mtl
we generate, under bounded-variability assumptions, deterministic timed automata
to which we apply safety synthesis algorithms to derive a controller that satisfies
the properties by construction. Some preliminary experimental results are reported.
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
- first_name: Amir
full_name: Pnueli, Amir
last_name: Pnueli
citation:
ama: 'Maler O, Nickovic D, Pnueli A. On synthesizing controllers from bounded-response
properties. In: 19th International Conference on Computer Aided Verification.
Vol 4590. Springer; 2007:95-107. doi:10.1007/978-3-540-73368-3_12'
apa: 'Maler, O., Nickovic, D., & Pnueli, A. (2007). On synthesizing controllers
from bounded-response properties. In 19th International Conference on Computer
Aided Verification (Vol. 4590, pp. 95–107). Berlin, Germany: Springer. https://doi.org/10.1007/978-3-540-73368-3_12'
chicago: Maler, Oded, Dejan Nickovic, and Amir Pnueli. “On Synthesizing Controllers
from Bounded-Response Properties.” In 19th International Conference on Computer
Aided Verification, 4590:95–107. Springer, 2007. https://doi.org/10.1007/978-3-540-73368-3_12.
ieee: O. Maler, D. Nickovic, and A. Pnueli, “On synthesizing controllers from bounded-response
properties,” in 19th International Conference on Computer Aided Verification,
Berlin, Germany, 2007, vol. 4590, pp. 95–107.
ista: 'Maler O, Nickovic D, Pnueli A. 2007. On synthesizing controllers from bounded-response
properties. 19th International Conference on Computer Aided Verification. CAV:
Computer Aided Verification, LNCS, vol. 4590, 95–107.'
mla: Maler, Oded, et al. “On Synthesizing Controllers from Bounded-Response Properties.”
19th International Conference on Computer Aided Verification, vol. 4590,
Springer, 2007, pp. 95–107, doi:10.1007/978-3-540-73368-3_12.
short: O. Maler, D. Nickovic, A. Pnueli, in:, 19th International Conference on Computer
Aided Verification, Springer, 2007, pp. 95–107.
conference:
end_date: 2007-07-07
location: Berlin, Germany
name: 'CAV: Computer Aided Verification'
start_date: 2007-07-03
date_created: 2018-12-11T12:08:30Z
date_published: 2007-01-01T00:00:00Z
date_updated: 2025-07-01T12:59:28Z
day: '01'
doi: 10.1007/978-3-540-73368-3_12
extern: '1'
intvolume: ' 4590'
language:
- iso: eng
month: '01'
oa_version: None
page: 95 - 107
publication: 19th International Conference on Computer Aided Verification
publication_status: published
publisher: Springer
publist_id: '1086'
quality_controlled: '1'
scopus_import: '1'
status: public
title: On synthesizing controllers from bounded-response properties
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 4590
year: '2007'
...
---
_id: '4394'
abstract:
- lang: eng
text: "This paper presents our integration of efficient resolution-based theorem
provers into the Jahob data structure verification system. Our experimental results
show that this approach enables Jahob to automatically verify the correctness
of a range of complex dynamically instantiable data structures, such as hash tables
and search trees, without the need for interactive theorem proving or techniques
tailored to individual data structures.\r\n\r\nOur primary technical results include:
(1) a translation from higher-order logic to first-order logic that enables the
application of resolution-based theorem provers and (2) a proof that eliminating
type (sort) information in formulas is both sound and complete, even in the presence
of a generic equality operator. Our experimental results show that the elimination
of type information often dramatically decreases the time required to prove the
resulting formulas.\r\n\r\nThese techniques enabled us to verify complex correctness
properties of Java programs such as a mutable set implemented as an imperative
linked list, a finite map implemented as a functional ordered tree, a hash table
with a mutable array, and a simple library system example that uses these container
data structures. Our system verifies (in a matter of minutes) that data structure
operations correctly update the finite map, that they preserve data structure
invariants (such as ordering of elements, membership in appropriate hash table
buckets, or relationships between sets and relations), and that there are no run-time
errors such as null dereferences or array out of bounds accesses."
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Charles
full_name: Bouillaguet, Charles
last_name: Bouillaguet
- first_name: Viktor
full_name: Kuncak, Viktor
last_name: Kuncak
- first_name: Thomas
full_name: Wies, Thomas
id: 447BFB88-F248-11E8-B48F-1D18A9856A87
last_name: Wies
- first_name: Karen
full_name: Zee, Karen
last_name: Zee
- first_name: Martin
full_name: Rinard, Martin
last_name: Rinard
citation:
ama: 'Bouillaguet C, Kuncak V, Wies T, Zee K, Rinard M. Using first-order theorem
provers in the Jahob data structure verification system. In: 8th International
Conference on Verification, Model Checking, and Abstract Interpretation. Vol
4349. Springer; 2007:74-88. doi:10.1007/978-3-540-69738-1_5'
apa: 'Bouillaguet, C., Kuncak, V., Wies, T., Zee, K., & Rinard, M. (2007). Using
first-order theorem provers in the Jahob data structure verification system. In
8th International Conference on Verification, Model Checking, and Abstract
Interpretation (Vol. 4349, pp. 74–88). Nice, France: Springer. https://doi.org/10.1007/978-3-540-69738-1_5'
chicago: Bouillaguet, Charles, Viktor Kuncak, Thomas Wies, Karen Zee, and Martin
Rinard. “Using First-Order Theorem Provers in the Jahob Data Structure Verification
System.” In 8th International Conference on Verification, Model Checking, and
Abstract Interpretation, 4349:74–88. Springer, 2007. https://doi.org/10.1007/978-3-540-69738-1_5.
ieee: C. Bouillaguet, V. Kuncak, T. Wies, K. Zee, and M. Rinard, “Using first-order
theorem provers in the Jahob data structure verification system,” in 8th International
Conference on Verification, Model Checking, and Abstract Interpretation, Nice,
France, 2007, vol. 4349, pp. 74–88.
ista: 'Bouillaguet C, Kuncak V, Wies T, Zee K, Rinard M. 2007. Using first-order
theorem provers in the Jahob data structure verification system. 8th International
Conference on Verification, Model Checking, and Abstract Interpretation. VMCAI:
Verification, Model Checking and Abstract Interpretation, LNCS, vol. 4349, 74–88.'
mla: Bouillaguet, Charles, et al. “Using First-Order Theorem Provers in the Jahob
Data Structure Verification System.” 8th International Conference on Verification,
Model Checking, and Abstract Interpretation, vol. 4349, Springer, 2007, pp.
74–88, doi:10.1007/978-3-540-69738-1_5.
short: C. Bouillaguet, V. Kuncak, T. Wies, K. Zee, M. Rinard, in:, 8th International
Conference on Verification, Model Checking, and Abstract Interpretation, Springer,
2007, pp. 74–88.
conference:
end_date: 2007-01-16
location: Nice, France
name: 'VMCAI: Verification, Model Checking and Abstract Interpretation'
start_date: 2007-01-14
date_created: 2018-12-11T12:08:37Z
date_published: 2007-01-01T00:00:00Z
date_updated: 2025-07-01T12:57:14Z
day: '01'
doi: 10.1007/978-3-540-69738-1_5
extern: '1'
intvolume: ' 4349'
language:
- iso: eng
month: '01'
oa_version: None
page: 74 - 88
publication: 8th International Conference on Verification, Model Checking, and Abstract
Interpretation
publication_status: published
publisher: Springer
publist_id: '1062'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Using first-order theorem provers in the Jahob data structure verification
system
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 4349
year: '2007'
...
---
_id: '4398'
abstract:
- lang: eng
text: 'We propose a shape analysis that adapts to some of the complex composite
data structures found in industrial systems-level programs. Examples of such data
structures include “cyclic doubly-linked lists of acyclic singly-linked lists”,
“singly-linked lists of cyclic doubly-linked lists with back-pointers to head
nodes”, etc. The analysis introduces the use of generic higher-order inductive
predicates describing spatial relationships together with a method of synthesizing
new parameterized spatial predicates which can be used in combination with the
higher-order predicates. In order to evaluate the proposed approach for realistic
programs we have performed experiments on examples drawn from device drivers:
the analysis proved safety of the data structure manipulation of several routines
belonging to an IEEE 1394 (firewire) driver, and also found several previously
unknown memory safety bugs.'
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Josh
full_name: Berdine, Josh
last_name: Berdine
- first_name: Cristiano
full_name: Calcagno, Cristiano
last_name: Calcagno
- first_name: Byron
full_name: Cook, Byron
last_name: Cook
- first_name: Dino
full_name: Distefano, Dino
last_name: Distefano
- first_name: Peter
full_name: O'Hearn, Peter
last_name: O'Hearn
- first_name: Thomas
full_name: Wies, Thomas
id: 447BFB88-F248-11E8-B48F-1D18A9856A87
last_name: Wies
- first_name: Hongseok
full_name: Yang, Hongseok
last_name: Yang
citation:
ama: 'Berdine J, Calcagno C, Cook B, et al. Shape analysis for composite data structures.
In: 19th International Conference on Computer Aided Verification. Vol 4590.
Springer; 2007:178-192. doi:10.1007/978-3-540-73368-3_22'
apa: 'Berdine, J., Calcagno, C., Cook, B., Distefano, D., O’Hearn, P., Wies, T.,
& Yang, H. (2007). Shape analysis for composite data structures. In 19th
International Conference on Computer Aided Verification (Vol. 4590, pp. 178–192).
Berlin, Germany: Springer. https://doi.org/10.1007/978-3-540-73368-3_22'
chicago: Berdine, Josh, Cristiano Calcagno, Byron Cook, Dino Distefano, Peter O’Hearn,
Thomas Wies, and Hongseok Yang. “Shape Analysis for Composite Data Structures.”
In 19th International Conference on Computer Aided Verification, 4590:178–92.
Springer, 2007. https://doi.org/10.1007/978-3-540-73368-3_22.
ieee: J. Berdine et al., “Shape analysis for composite data structures,”
in 19th International Conference on Computer Aided Verification, Berlin,
Germany, 2007, vol. 4590, pp. 178–192.
ista: 'Berdine J, Calcagno C, Cook B, Distefano D, O’Hearn P, Wies T, Yang H. 2007.
Shape analysis for composite data structures. 19th International Conference on
Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 4590,
178–192.'
mla: Berdine, Josh, et al. “Shape Analysis for Composite Data Structures.” 19th
International Conference on Computer Aided Verification, vol. 4590, Springer,
2007, pp. 178–92, doi:10.1007/978-3-540-73368-3_22.
short: J. Berdine, C. Calcagno, B. Cook, D. Distefano, P. O’Hearn, T. Wies, H. Yang,
in:, 19th International Conference on Computer Aided Verification, Springer, 2007,
pp. 178–192.
conference:
end_date: 2007-07-07
location: Berlin, Germany
name: 'CAV: Computer Aided Verification'
start_date: 2007-07-03
date_created: 2018-12-11T12:08:39Z
date_published: 2007-01-01T00:00:00Z
date_updated: 2025-07-01T12:54:23Z
day: '01'
doi: 10.1007/978-3-540-73368-3_22
extern: '1'
intvolume: ' 4590'
language:
- iso: eng
month: '01'
oa_version: None
page: 178 - 192
publication: 19th International Conference on Computer Aided Verification
publication_status: published
publisher: Springer
publist_id: '1058'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Shape analysis for composite data structures
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 4590
year: '2007'
...
---
_id: '4399'
abstract:
- lang: eng
text: 'A temporal interface for a software component is a finite automaton that
specifies the legal sequences of calls to functions that are provided by the component.
We compare and evaluate three different algorithms for automatically extracting
temporal interfaces from program code: (1) a game algorithm that computes the
interface as a representation of the most general environment strategy to avoid
a safety violation; (2) a learning algorithm that repeatedly queries the program
to construct the minimal interface automaton; and (3) a CEGAR algorithm that iteratively
refines an abstract interface hypothesis by adding relevant program variables.
For comparison purposes, we present and implement the three algorithms in a unifying
formal setting. While the three algorithms compute the same output and have similar
worst-case complexities, their actual running times may differ considerably for
a given input program. On the theoretical side, we provide for each of the three
algorithms a family of input programs on which that algorithm outperforms the
two alternatives. On the practical side, we evaluate the three algorithms experimentally
on a variety of Java libraries. '
acknowledgement: This research was supported in part by the grant SFU/PRG 06-3, and
by the Swiss National Science Foundation.
alternative_title:
- LNCS
author:
- first_name: Dirk
full_name: Beyer, Dirk
last_name: Beyer
- first_name: Thomas A
full_name: Thomas Henzinger
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Vasu
full_name: Vasu Singh
id: 4DAE2708-F248-11E8-B48F-1D18A9856A87
last_name: Singh
citation:
ama: 'Beyer D, Henzinger TA, Singh V. Algorithms for interface synthesis. In: Vol
4590. Springer; 2007:4-19. doi:10.1007/978-3-540-73368-3_4'
apa: 'Beyer, D., Henzinger, T. A., & Singh, V. (2007). Algorithms for interface
synthesis (Vol. 4590, pp. 4–19). Presented at the CAV: Computer Aided Verification,
Springer. https://doi.org/10.1007/978-3-540-73368-3_4'
chicago: Beyer, Dirk, Thomas A Henzinger, and Vasu Singh. “Algorithms for Interface
Synthesis,” 4590:4–19. Springer, 2007. https://doi.org/10.1007/978-3-540-73368-3_4.
ieee: 'D. Beyer, T. A. Henzinger, and V. Singh, “Algorithms for interface synthesis,”
presented at the CAV: Computer Aided Verification, 2007, vol. 4590, pp. 4–19.'
ista: 'Beyer D, Henzinger TA, Singh V. 2007. Algorithms for interface synthesis.
CAV: Computer Aided Verification, LNCS, vol. 4590, 4–19.'
mla: Beyer, Dirk, et al. Algorithms for Interface Synthesis. Vol. 4590, Springer,
2007, pp. 4–19, doi:10.1007/978-3-540-73368-3_4.
short: D. Beyer, T.A. Henzinger, V. Singh, in:, Springer, 2007, pp. 4–19.
conference:
name: 'CAV: Computer Aided Verification'
date_created: 2018-12-11T12:08:39Z
date_published: 2007-07-02T00:00:00Z
date_updated: 2021-01-12T07:56:41Z
day: '02'
doi: 10.1007/978-3-540-73368-3_4
extern: 1
intvolume: ' 4590'
month: '07'
page: 4 - 19
publication_status: published
publisher: Springer
publist_id: '1059'
quality_controlled: 0
status: public
title: Algorithms for interface synthesis
type: conference
volume: 4590
year: '2007'
...
---
_id: '4402'
abstract:
- lang: eng
text: 'For specifying and verifying branching-time requirements, a reactive system
is traditionally modeled as a labeled tree, where a path in the tree encodes a
possible execution of the system. We propose to enrich such tree models with “jump-edges”
that capture observational indistinguishability: for an agent a, an a-labeled
edge is added between two nodes if the observable behaviors of the agent a along
the paths to these nodes are identical. We show that it is possible to specify
information flow properties and partial information games in temporal logics interpreted
on this enriched structure. We study complexity and decidability of the model
checking problem for these logics. We show that it is PSPACE-complete and EXPTIME-complete
respectively for fragments of CTL and μ-calculus-like logics. These fragments
are expressive enough to allow specifications of information flow properties such
as “agent A does not reveal x (a secret) until agent B reveals y (a password)”
and of partial information games.'
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Rajeev
full_name: Alur, Rajeev
last_name: Alur
- first_name: Pavol
full_name: Cerny, Pavol
id: 4DCBEFFE-F248-11E8-B48F-1D18A9856A87
last_name: Cerny
- first_name: Swarat
full_name: Chaudhuri, Swarat
last_name: Chaudhuri
citation:
ama: 'Alur R, Cerny P, Chaudhuri S. Model checking on trees with path equivalences.
In: 13th International Conference on Tools and Algorithms for the Construction
and Analysis of Systems. Vol 4424. Springer; 2007:664-678. doi:10.1007/978-3-540-71209-1_51'
apa: 'Alur, R., Cerny, P., & Chaudhuri, S. (2007). Model checking on trees with
path equivalences. In 13th International Conference on Tools and Algorithms
for the Construction and Analysis of Systems (Vol. 4424, pp. 664–678). Braga,
Portugal: Springer. https://doi.org/10.1007/978-3-540-71209-1_51'
chicago: Alur, Rajeev, Pavol Cerny, and Swarat Chaudhuri. “Model Checking on Trees
with Path Equivalences.” In 13th International Conference on Tools and Algorithms
for the Construction and Analysis of Systems, 4424:664–78. Springer, 2007.
https://doi.org/10.1007/978-3-540-71209-1_51.
ieee: R. Alur, P. Cerny, and S. Chaudhuri, “Model checking on trees with path equivalences,”
in 13th International Conference on Tools and Algorithms for the Construction
and Analysis of Systems, Braga, Portugal, 2007, vol. 4424, pp. 664–678.
ista: 'Alur R, Cerny P, Chaudhuri S. 2007. Model checking on trees with path equivalences.
13th International Conference on Tools and Algorithms for the Construction and
Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis
of Systems, LNCS, vol. 4424, 664–678.'
mla: Alur, Rajeev, et al. “Model Checking on Trees with Path Equivalences.” 13th
International Conference on Tools and Algorithms for the Construction and Analysis
of Systems, vol. 4424, Springer, 2007, pp. 664–78, doi:10.1007/978-3-540-71209-1_51.
short: R. Alur, P. Cerny, S. Chaudhuri, in:, 13th International Conference on Tools
and Algorithms for the Construction and Analysis of Systems, Springer, 2007, pp.
664–678.
conference:
end_date: 2007-04-01
location: Braga, Portugal
name: 'TACAS: Tools and Algorithms for the Construction and Analysis of Systems'
start_date: 2007-03-24
date_created: 2018-12-11T12:08:40Z
date_published: 2007-01-01T00:00:00Z
date_updated: 2025-07-01T12:51:33Z
day: '01'
doi: 10.1007/978-3-540-71209-1_51
extern: '1'
intvolume: ' 4424'
language:
- iso: eng
month: '01'
oa_version: None
page: 664 - 678
publication: 13th International Conference on Tools and Algorithms for the Construction
and Analysis of Systems
publication_status: published
publisher: Springer
publist_id: '1055'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Model checking on trees with path equivalences
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 4424
year: '2007'
...
---
_id: '4405'
abstract:
- lang: eng
text: |-
Background
A central goal of Systems Biology is to model and analyze biological signaling pathways that interact with one another to form complex networks. Here we introduce Qualitative networks, an extension of Boolean networks. With this framework, we use formal verification methods to check whether a model is consistent with the laboratory experimental observations on which it is based. If the model does not conform to the data, we suggest a revised model and the new hypotheses are tested in-silico.
Results
We consider networks in which elements range over a small finite domain allowing more flexibility than Boolean values, and add target functions that allow to model a rich set of behaviors. We propose a symbolic algorithm for analyzing the steady state of these networks, allowing us to scale up to a system consisting of 144 elements and state spaces of approximately 1086 states. We illustrate the usefulness of this approach through a model of the interaction between the Notch and the Wnt signaling pathways in mammalian skin, and its extensive analysis.
Conclusion
We introduce an approach for constructing computational models of biological systems that extends the framework of Boolean networks and uses formal verification methods for the analysis of the model. This approach can scale to multicellular models of complex pathways, and is therefore a useful tool for the analysis of complex biological systems. The hypotheses formulated during in-silico testing suggest new avenues to explore experimentally. Hence, this approach has the potential to efficiently complement experimental studies in biology.
author:
- first_name: Marc
full_name: Schaub, Marc A
last_name: Schaub
- first_name: Thomas A
full_name: Thomas Henzinger
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Jasmin
full_name: Fisher, Jasmin
last_name: Fisher
citation:
ama: 'Schaub M, Henzinger TA, Fisher J. Qualitative networks: A symbolic approach
to analyze biological signaling networks. BMC Systems Biology. 2007;1(4).
doi:10.1186/1752-0509-1-4'
apa: 'Schaub, M., Henzinger, T. A., & Fisher, J. (2007). Qualitative networks:
A symbolic approach to analyze biological signaling networks. BMC Systems Biology.
BioMed Central. https://doi.org/10.1186/1752-0509-1-4'
chicago: 'Schaub, Marc, Thomas A Henzinger, and Jasmin Fisher. “Qualitative Networks:
A Symbolic Approach to Analyze Biological Signaling Networks.” BMC Systems
Biology. BioMed Central, 2007. https://doi.org/10.1186/1752-0509-1-4.'
ieee: 'M. Schaub, T. A. Henzinger, and J. Fisher, “Qualitative networks: A symbolic
approach to analyze biological signaling networks,” BMC Systems Biology,
vol. 1, no. 4. BioMed Central, 2007.'
ista: 'Schaub M, Henzinger TA, Fisher J. 2007. Qualitative networks: A symbolic
approach to analyze biological signaling networks. BMC Systems Biology. 1(4).'
mla: 'Schaub, Marc, et al. “Qualitative Networks: A Symbolic Approach to Analyze
Biological Signaling Networks.” BMC Systems Biology, vol. 1, no. 4, BioMed
Central, 2007, doi:10.1186/1752-0509-1-4.'
short: M. Schaub, T.A. Henzinger, J. Fisher, BMC Systems Biology 1 (2007).
date_created: 2018-12-11T12:08:41Z
date_published: 2007-01-08T00:00:00Z
date_updated: 2021-01-12T07:56:44Z
day: '08'
doi: 10.1186/1752-0509-1-4
extern: 1
intvolume: ' 1'
issue: '4'
main_file_link:
- open_access: '0'
url: http://www.biomedcentral.com/1752-0509/1/4
month: '01'
publication: BMC Systems Biology
publication_status: published
publisher: BioMed Central
publist_id: '325'
quality_controlled: 0
status: public
title: 'Qualitative networks: A symbolic approach to analyze biological signaling
networks'
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
volume: 1
year: '2007'
...
---
_id: '4417'
abstract:
- lang: eng
text: Counterexample-guided abstraction refinement (CEGAR) is a powerful technique
to scale automatic program analysis techniques to large programs. However, so
far it has been used primarily for model checking in the context of predicate
abstraction. We formalize CEGAR for general powerset domains. If a spurious abstract
counterexample needs to be removed through abstraction refinement, there are often
several choices, such as which program location(s) to refine, which abstract domain(s)
to use at different locations, and which abstract values to compute. We define
several plausible preference orderings on abstraction refinements, such as refining
as “late” as possible and as “coarse” as possible. We present generic algorithms
for finding refinements that are optimal with respect to the different preference
orderings. We also compare the different orderings with respect to desirable properties,
including the property if locally optimal refinements compose to a global optimum.
Finally, we point out some difficulties with CEGAR for non-powerset domains.
acknowledgement: This research is partially supported by the Clore Fellowship Programme.
Supported in part by the Swiss National Science Foundation.
alternative_title:
- LNCS
author:
- first_name: Roman
full_name: Manevich, Roman
last_name: Manevich
- first_name: John
full_name: Field, John
last_name: Field
- first_name: Thomas A
full_name: Thomas Henzinger
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Ganesan
full_name: Ramalingam, Ganesan
last_name: Ramalingam
- first_name: Mooly
full_name: Sagiv, Mooly
last_name: Sagiv
citation:
ama: 'Manevich R, Field J, Henzinger TA, Ramalingam G, Sagiv M. Abstract counterexample-based
refinement for powerset domains. In: Program Analysis and Compilation, Theory
and Practice: Essays Dedicated to Reinhard Wilhelm on the Occasion of His 60th
Birthday. Vol 4444. Springer; 2007:273-292. doi:10.1007/978-3-540-71322-7_13'
apa: 'Manevich, R., Field, J., Henzinger, T. A., Ramalingam, G., & Sagiv, M.
(2007). Abstract counterexample-based refinement for powerset domains. In Program
Analysis and Compilation, Theory and Practice: Essays Dedicated to Reinhard Wilhelm
on the Occasion of His 60th Birthday (Vol. 4444, pp. 273–292). Springer. https://doi.org/10.1007/978-3-540-71322-7_13'
chicago: 'Manevich, Roman, John Field, Thomas A Henzinger, Ganesan Ramalingam, and
Mooly Sagiv. “Abstract Counterexample-Based Refinement for Powerset Domains.”
In Program Analysis and Compilation, Theory and Practice: Essays Dedicated
to Reinhard Wilhelm on the Occasion of His 60th Birthday, 4444:273–92. Springer,
2007. https://doi.org/10.1007/978-3-540-71322-7_13.'
ieee: 'R. Manevich, J. Field, T. A. Henzinger, G. Ramalingam, and M. Sagiv, “Abstract
counterexample-based refinement for powerset domains,” in Program Analysis
and Compilation, Theory and Practice: Essays Dedicated to Reinhard Wilhelm on
the Occasion of His 60th Birthday, vol. 4444, Springer, 2007, pp. 273–292.'
ista: 'Manevich R, Field J, Henzinger TA, Ramalingam G, Sagiv M. 2007.Abstract counterexample-based
refinement for powerset domains. In: Program Analysis and Compilation, Theory
and Practice: Essays Dedicated to Reinhard Wilhelm on the Occasion of His 60th
Birthday. LNCS, vol. 4444, 273–292.'
mla: 'Manevich, Roman, et al. “Abstract Counterexample-Based Refinement for Powerset
Domains.” Program Analysis and Compilation, Theory and Practice: Essays Dedicated
to Reinhard Wilhelm on the Occasion of His 60th Birthday, vol. 4444, Springer,
2007, pp. 273–92, doi:10.1007/978-3-540-71322-7_13.'
short: 'R. Manevich, J. Field, T.A. Henzinger, G. Ramalingam, M. Sagiv, in:, Program
Analysis and Compilation, Theory and Practice: Essays Dedicated to Reinhard Wilhelm
on the Occasion of His 60th Birthday, Springer, 2007, pp. 273–292.'
date_created: 2018-12-11T12:08:45Z
date_published: 2007-03-30T00:00:00Z
date_updated: 2021-01-12T07:56:49Z
day: '30'
doi: 10.1007/978-3-540-71322-7_13
extern: 1
intvolume: ' 4444'
month: '03'
page: 273 - 292
publication: 'Program Analysis and Compilation, Theory and Practice: Essays Dedicated
to Reinhard Wilhelm on the Occasion of His 60th Birthday'
publication_status: published
publisher: Springer
publist_id: '314'
quality_controlled: 0
status: public
title: Abstract counterexample-based refinement for powerset domains
type: book_chapter
volume: 4444
year: '2007'
...