---
_id: '3917'
abstract:
- lang: eng
text: Male dimorphism is not genetically determined, but is induced by environmental
conditions particularly decreasing temperature and density.
author:
- first_name: Sylvia
full_name: Cremer, Sylvia
id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87
last_name: Cremer
orcid: 0000-0002-2193-3868
- first_name: Jürgen
full_name: Heinze, Jürgen
last_name: Heinze
citation:
ama: 'Cremer S, Heinze J. Zwischen Hochzeitsflug und Brudermord: reproduktive Taktiken
bei Ameisenmännchen. Blick in die Wissenschaft. 2003;12(15):32-36.'
apa: 'Cremer, S., & Heinze, J. (2003). Zwischen Hochzeitsflug und Brudermord:
reproduktive Taktiken bei Ameisenmännchen. Blick in Die Wissenschaft. Schnell
und Steiner.'
chicago: 'Cremer, Sylvia, and Jürgen Heinze. “Zwischen Hochzeitsflug Und Brudermord:
Reproduktive Taktiken Bei Ameisenmännchen.” Blick in Die Wissenschaft.
Schnell und Steiner, 2003.'
ieee: 'S. Cremer and J. Heinze, “Zwischen Hochzeitsflug und Brudermord: reproduktive
Taktiken bei Ameisenmännchen,” Blick in die Wissenschaft, vol. 12, no.
15. Schnell und Steiner, pp. 32–36, 2003.'
ista: 'Cremer S, Heinze J. 2003. Zwischen Hochzeitsflug und Brudermord: reproduktive
Taktiken bei Ameisenmännchen. Blick in die Wissenschaft. 12(15), 32–36.'
mla: 'Cremer, Sylvia, and Jürgen Heinze. “Zwischen Hochzeitsflug Und Brudermord:
Reproduktive Taktiken Bei Ameisenmännchen.” Blick in Die Wissenschaft,
vol. 12, no. 15, Schnell und Steiner, 2003, pp. 32–36.'
short: S. Cremer, J. Heinze, Blick in Die Wissenschaft 12 (2003) 32–36.
date_created: 2018-12-11T12:05:53Z
date_published: 2003-01-01T00:00:00Z
date_updated: 2021-01-12T07:53:11Z
day: '01'
extern: '1'
intvolume: ' 12'
issue: '15'
language:
- iso: eng
month: '01'
oa_version: None
page: 32 - 36
publication: Blick in die Wissenschaft
publication_status: published
publisher: Schnell und Steiner
publist_id: '2235'
status: public
title: 'Zwischen Hochzeitsflug und Brudermord: reproduktive Taktiken bei Ameisenmännchen'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 12
year: '2003'
...
---
_id: '4416'
abstract:
- lang: eng
text: "Methods for the formal specification and verification of systems are indispensible
for the development of complex yet correct systems. In formal verification, the
designer describes the system in a modeling language with a well-defined semantics,
and this system description is analyzed against a set of correctness requirements.
Model checking is an algorithmic technique to check that a system description
indeed satisfies correctness requirements given as logical specifications. While
successful in hardware verification, the potential for model checking for software
and embedded systems has not yet been realized. This is because traditional model
checking focuses on systems modeled as finite state-transition graphs. While a
natural model for hardware (especially synchronous hardware), state-transition
graphs often do not capture software and embedded systems at an appropriate level
of granularity. This dissertation considers two orthogonal extensions to finite
state-transition graphs making model checking techniques applicable to both a
wider class of systems and a wider class of properties.\r\n\r\nThe first direction
is an extension to infinite-state structures finitely represented using constraints
and operations on constraints. Infinite state arises when we wish to model variables
with unbounded range (e.g., integers), or data structures, or real time. We provide
a uniform framework of symbolic region algebras to study model checking of infinite-state
systems. We also provide sufficient language-independent termination conditions
for symbolic model checking algorithms on infinite state systems.\r\n\r\nThe second
direction supplements verification with game theoretic reasoning. Games are natural
models for interactions between components. We study game theoretic behavior with
winning conditions given by temporal logic objectives both in the deterministic
and in the probabilistic context. For deterministic games, we provide an extremal
model characterization of fixpoint algorithms that link solutions of verification
problems to solutions for games. For probabilistic games we study fixpoint characterization
of winning probabilities for games with omega-regular winning objectives, and
construct (epsilon-)optimal winning strategies."
article_processing_charge: No
author:
- first_name: Ritankar
full_name: Majumdar, Ritankar
last_name: Majumdar
citation:
ama: Majumdar R. Symbolic algorithms for verification and control. 2003:1-201.
apa: Majumdar, R. (2003). Symbolic algorithms for verification and control.
University of California, Berkeley.
chicago: Majumdar, Ritankar. “Symbolic Algorithms for Verification and Control.”
University of California, Berkeley, 2003.
ieee: R. Majumdar, “Symbolic algorithms for verification and control,” University
of California, Berkeley, 2003.
ista: Majumdar R. 2003. Symbolic algorithms for verification and control. University
of California, Berkeley.
mla: Majumdar, Ritankar. Symbolic Algorithms for Verification and Control.
University of California, Berkeley, 2003, pp. 1–201.
short: R. Majumdar, Symbolic Algorithms for Verification and Control, University
of California, Berkeley, 2003.
date_created: 2018-12-11T12:08:44Z
date_published: 2003-12-01T00:00:00Z
date_updated: 2021-01-12T07:56:49Z
day: '01'
extern: '1'
language:
- iso: eng
month: '12'
oa_version: None
page: 1 - 201
publication_status: published
publisher: University of California, Berkeley
publist_id: '313'
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: Symbolic algorithms for verification and control
type: dissertation
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2003'
...
---
_id: '4425'
abstract:
- lang: eng
text: "Giotto provides a time-triggered programmer’s model for the implementation
of embedded control systems with hard real-time constraints. Giotto’s precise
semantics and predictabil- ity make it suitable for safety-critical applications.\r\nGiotto
is based around the idea that time-triggered task invocation together with time-triggered
mode switching can form a useful programming model for real-time systems. To substantiate
this claim, we describe the use of Giotto to refactor the software of a small,
autonomous helicopter. The ease with which Giotto expresses the existing software
provides evidence that Giotto is an appropriate programming language for control
systems.\r\nSince Giotto is a real-time programming language, ensuring that Giotto
programs meet their deadlines is crucial. To study precedence-constrained Giotto
scheduling, we first examine single-mode, single-processor scheduling. We extend
to an infinite, periodic setting the classical problem of meeting deadlines for
a set of tasks with release times, deadlines, precedence constraints, and preemption.
We then develop an algorithm for scheduling Giotto programs on a single processor
by representing Giotto programs as instances of the extended scheduling problem.\r\nNext,
we study multi-mode, single-processor Giotto scheduling. This problem is different
from classical scheduling problems, since in our precedence-constrained approach,
the deadlines of tasks may vary depending on the mode switching behavior of the
program. We present conditional scheduling models which capture this varying-deadline
behavior. We develop polynomial-time algorithms for some conditional scheduling
models, and prove oth- ers to be computationally hard. We show how to represent
multi-mode Giotto programs as instances of the model, resulting in an algorithm
for scheduling multi-mode Giotto programs on a single processor.\r\nFinally, we
show that the problem of scheduling Giotto programs for multiple net- worked processors
is strongly NP-hard."
article_processing_charge: No
author:
- first_name: Benjamin
full_name: Horowitz, Benjamin
last_name: Horowitz
citation:
ama: 'Horowitz B. Giotto: A time-triggered language for embedded programming. 2003:1-237.'
apa: 'Horowitz, B. (2003). Giotto: A time-triggered language for embedded programming.
University of California, Berkeley.'
chicago: 'Horowitz, Benjamin. “Giotto: A Time-Triggered Language for Embedded Programming.”
University of California, Berkeley, 2003.'
ieee: 'B. Horowitz, “Giotto: A time-triggered language for embedded programming,”
University of California, Berkeley, 2003.'
ista: 'Horowitz B. 2003. Giotto: A time-triggered language for embedded programming.
University of California, Berkeley.'
mla: 'Horowitz, Benjamin. Giotto: A Time-Triggered Language for Embedded Programming.
University of California, Berkeley, 2003, pp. 1–237.'
short: 'B. Horowitz, Giotto: A Time-Triggered Language for Embedded Programming,
University of California, Berkeley, 2003.'
date_created: 2018-12-11T12:08:47Z
date_published: 2003-10-01T00:00:00Z
date_updated: 2021-01-12T07:56:53Z
day: '01'
extern: '1'
language:
- iso: eng
month: '10'
oa_version: None
page: 1 - 237
publication_status: published
publisher: University of California, Berkeley
publist_id: '305'
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: 'Giotto: A time-triggered language for embedded programming'
type: dissertation
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2003'
...
---
_id: '576'
abstract:
- lang: eng
text: 'We study the free expansion of a pancake-shaped Bose-condensed gas, which
is initially trapped under harmonic confinement and containing a vortex at its
centre. In the case of a radial expansion holding the axial confinement fixed
we consider various models for the interactions, depending on the thickness of
the condensate relative to the value of the scattering length. We are thus able
to evaluate different scattering regimes ranging from quasi-three-dimensional
(Q3D) to strictly two-dimensional (2D). We find that as the system goes from Q3D
to 2D the expansion rate of the condensate increases whereas that of the vortex
core decreases. In the Q3D scattering regime we also examine a fully free expansion
in 3D and find oscillatory behaviour for the vortex core radius: an initial fast
expansion of the vortex core is followed by a slowing down. Such a nonuniform
expansion rate of the vortex core implies that the timing of its observation should
be chosen appropriately.'
author:
- first_name: Onur
full_name: Onur Hosten
id: 4C02D85E-F248-11E8-B48F-1D18A9856A87
last_name: Hosten
orcid: 0000-0002-2031-204X
- first_name: Patrizia
full_name: Vignolo, Patrizia
last_name: Vignolo
- first_name: Anna
full_name: Minguzzi, Anna
last_name: Minguzzi
- first_name: Bilal
full_name: Tanatar, Bilal
last_name: Tanatar
- first_name: Mario
full_name: Tosi, Mario P
last_name: Tosi
citation:
ama: 'Hosten O, Vignolo P, Minguzzi A, Tanatar B, Tosi M. Free expansion of two-dimensional
condensates with a vortex. Journal of Physics B: Atomic, Molecular and Optical
Physics. 2003;36(12):2455-2463. doi:10.1088/0953-4075/36/12/306'
apa: 'Hosten, O., Vignolo, P., Minguzzi, A., Tanatar, B., & Tosi, M. (2003).
Free expansion of two-dimensional condensates with a vortex. Journal of Physics
B: Atomic, Molecular and Optical Physics. IOP Publishing Ltd. https://doi.org/10.1088/0953-4075/36/12/306'
chicago: 'Hosten, Onur, Patrizia Vignolo, Anna Minguzzi, Bilal Tanatar, and Mario
Tosi. “Free Expansion of Two-Dimensional Condensates with a Vortex.” Journal
of Physics B: Atomic, Molecular and Optical Physics. IOP Publishing Ltd.,
2003. https://doi.org/10.1088/0953-4075/36/12/306.'
ieee: 'O. Hosten, P. Vignolo, A. Minguzzi, B. Tanatar, and M. Tosi, “Free expansion
of two-dimensional condensates with a vortex,” Journal of Physics B: Atomic,
Molecular and Optical Physics, vol. 36, no. 12. IOP Publishing Ltd., pp. 2455–2463,
2003.'
ista: 'Hosten O, Vignolo P, Minguzzi A, Tanatar B, Tosi M. 2003. Free expansion
of two-dimensional condensates with a vortex. Journal of Physics B: Atomic, Molecular
and Optical Physics. 36(12), 2455–2463.'
mla: 'Hosten, Onur, et al. “Free Expansion of Two-Dimensional Condensates with a
Vortex.” Journal of Physics B: Atomic, Molecular and Optical Physics, vol.
36, no. 12, IOP Publishing Ltd., 2003, pp. 2455–63, doi:10.1088/0953-4075/36/12/306.'
short: 'O. Hosten, P. Vignolo, A. Minguzzi, B. Tanatar, M. Tosi, Journal of Physics
B: Atomic, Molecular and Optical Physics 36 (2003) 2455–2463.'
date_created: 2018-12-11T11:47:16Z
date_published: 2003-06-28T00:00:00Z
date_updated: 2021-01-12T08:03:20Z
day: '28'
doi: 10.1088/0953-4075/36/12/306
extern: 1
intvolume: ' 36'
issue: '12'
month: '06'
page: 2455 - 2463
publication: 'Journal of Physics B: Atomic, Molecular and Optical Physics'
publication_status: published
publisher: IOP Publishing Ltd.
publist_id: '7239'
quality_controlled: 0
status: public
title: Free expansion of two-dimensional condensates with a vortex
type: journal_article
volume: 36
year: '2003'
...
---
_id: '6156'
abstract:
- lang: eng
text: 'Social and solitary feeding in natural Caenorhabditis elegans isolates are
associated with two alleles of the orphan G-protein-coupled receptor (GPCR) NPR-1:
social feeders contain NPR-1 215F, whereas solitary feeders contain NPR-1 215V.
Here we identify FMRFamide-related neuropeptides (FaRPs) encoded by the flp-18
and flp-21 genes as NPR-1 ligands and show that these peptides can differentially
activate the NPR-1 215F and NPR-1 215V receptors. Multicopy overexpression of
flp-21 transformed wild social animals into solitary feeders. Conversely, a flp-21
deletion partially phenocopied the npr-1(null) phenotype, which is consistent
with NPR-1 activation by FLP-21 in vivo but also implicates other ligands for
NPR-1. Phylogenetic studies indicate that the dominant npr-1 215V allele likely
arose from an ancestral npr-1 215F gene in C. elegans. Our data suggest a model
in which solitary feeding evolved in an ancestral social strain of C. elegans
by a gain-of-function mutation that modified the response of NPR-1 to FLP-18 and
FLP-21 ligands.'
author:
- first_name: Candida
full_name: Rogers, Candida
last_name: Rogers
- first_name: Vincenzina
full_name: Reale, Vincenzina
last_name: Reale
- first_name: Kyuhyung
full_name: Kim, Kyuhyung
last_name: Kim
- first_name: Heather
full_name: Chatwin, Heather
last_name: Chatwin
- first_name: Chris
full_name: Li, Chris
last_name: Li
- first_name: Peter
full_name: Evans, Peter
last_name: Evans
- first_name: Mario
full_name: de Bono, Mario
id: 4E3FF80E-F248-11E8-B48F-1D18A9856A87
last_name: de Bono
orcid: 0000-0001-8347-0443
citation:
ama: Rogers C, Reale V, Kim K, et al. Inhibition of Caenorhabditis elegans social
feeding by FMRFamide-related peptide activation of NPR-1. Nature Neuroscience.
2003;6(11):1178-1185. doi:10.1038/nn1140
apa: Rogers, C., Reale, V., Kim, K., Chatwin, H., Li, C., Evans, P., & de Bono,
M. (2003). Inhibition of Caenorhabditis elegans social feeding by FMRFamide-related
peptide activation of NPR-1. Nature Neuroscience. Springer Nature. https://doi.org/10.1038/nn1140
chicago: Rogers, Candida, Vincenzina Reale, Kyuhyung Kim, Heather Chatwin, Chris
Li, Peter Evans, and Mario de Bono. “Inhibition of Caenorhabditis Elegans Social
Feeding by FMRFamide-Related Peptide Activation of NPR-1.” Nature Neuroscience.
Springer Nature, 2003. https://doi.org/10.1038/nn1140.
ieee: C. Rogers et al., “Inhibition of Caenorhabditis elegans social feeding
by FMRFamide-related peptide activation of NPR-1,” Nature Neuroscience,
vol. 6, no. 11. Springer Nature, pp. 1178–1185, 2003.
ista: Rogers C, Reale V, Kim K, Chatwin H, Li C, Evans P, de Bono M. 2003. Inhibition
of Caenorhabditis elegans social feeding by FMRFamide-related peptide activation
of NPR-1. Nature Neuroscience. 6(11), 1178–1185.
mla: Rogers, Candida, et al. “Inhibition of Caenorhabditis Elegans Social Feeding
by FMRFamide-Related Peptide Activation of NPR-1.” Nature Neuroscience,
vol. 6, no. 11, Springer Nature, 2003, pp. 1178–85, doi:10.1038/nn1140.
short: C. Rogers, V. Reale, K. Kim, H. Chatwin, C. Li, P. Evans, M. de Bono, Nature
Neuroscience 6 (2003) 1178–1185.
date_created: 2019-03-21T09:47:53Z
date_published: 2003-10-12T00:00:00Z
date_updated: 2021-01-12T08:06:25Z
day: '12'
doi: 10.1038/nn1140
extern: '1'
external_id:
pmid:
- '14555955'
intvolume: ' 6'
issue: '11'
language:
- iso: eng
month: '10'
oa_version: None
page: 1178-1185
pmid: 1
publication: Nature Neuroscience
publication_identifier:
issn:
- 1097-6256
- 1546-1726
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
status: public
title: Inhibition of Caenorhabditis elegans social feeding by FMRFamide-related peptide
activation of NPR-1
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 6
year: '2003'
...
---
_id: '6157'
abstract:
- lang: eng
text: In many animal species individuals aggregate to live in groups. A range of
experimental approaches in different animals, including studies of social feeding
in nematodes, maternal behavior in rats and sheep, and pair-bonding in voles,
are providing insights into the neural bases for these behaviors. These studies
are delineating multiple neural circuits and gene networks in the brain that interact
in ways that are as yet poorly understood to coordinate social behavior.
author:
- first_name: Mario
full_name: de Bono, Mario
id: 4E3FF80E-F248-11E8-B48F-1D18A9856A87
last_name: de Bono
orcid: 0000-0001-8347-0443
citation:
ama: de Bono M. Molecular approaches to aggregation behavior and social attachment.
Journal of Neurobiology. 2003;54(1):78-92. doi:10.1002/neu.10162
apa: de Bono, M. (2003). Molecular approaches to aggregation behavior and social
attachment. Journal of Neurobiology. Wiley. https://doi.org/10.1002/neu.10162
chicago: Bono, Mario de. “Molecular Approaches to Aggregation Behavior and Social
Attachment.” Journal of Neurobiology. Wiley, 2003. https://doi.org/10.1002/neu.10162.
ieee: M. de Bono, “Molecular approaches to aggregation behavior and social attachment,”
Journal of Neurobiology, vol. 54, no. 1. Wiley, pp. 78–92, 2003.
ista: de Bono M. 2003. Molecular approaches to aggregation behavior and social attachment.
Journal of Neurobiology. 54(1), 78–92.
mla: de Bono, Mario. “Molecular Approaches to Aggregation Behavior and Social Attachment.”
Journal of Neurobiology, vol. 54, no. 1, Wiley, 2003, pp. 78–92, doi:10.1002/neu.10162.
short: M. de Bono, Journal of Neurobiology 54 (2003) 78–92.
date_created: 2019-03-21T09:52:31Z
date_published: 2003-01-01T00:00:00Z
date_updated: 2021-01-12T08:06:26Z
day: '01'
doi: 10.1002/neu.10162
extern: '1'
external_id:
pmid:
- '12486699'
intvolume: ' 54'
issue: '1'
language:
- iso: eng
month: '01'
oa_version: None
page: 78-92
pmid: 1
publication: Journal of Neurobiology
publication_identifier:
issn:
- 0022-3034
- 1097-4695
publication_status: published
publisher: Wiley
quality_controlled: '1'
status: public
title: Molecular approaches to aggregation behavior and social attachment
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 54
year: '2003'
...
---
_id: '847'
abstract:
- lang: eng
text: The accumulation of genome-wide information on single nucleotide polymorphisms
in humans provides an unprecedented opportunity to detect the evolutionary forces
responsible for heterogeneity of the level of genetic variability across loci.
Previous studies have shown that history of recombination events has produced
long haplotype blocks in the human genome, which contribute to this heterogeneity.
Other factors, however, such as natural selection or the heterogeneity of mutation
rates across loci, may also lead to heterogeneity of genetic variability. We compared
synonymous and non-synonymous variability within human genes with their divergence
from murine orthologs. We separately analyzed the non-synonymous variants predicted
to damage protein structure or function and the variants predicted to be functionally
benign. The predictions were based on comparative sequence analysis and, in some
cases, on the analysis of protein structure. A strong correlation between non-synonymous,
benign variability and non-synonymous human-mouse divergence suggests that selection
played an important role in shaping the pattern of variability in coding regions
of human genes. However, the lack of correlation between deleterious variability
and evolutionary divergence shows that a substantial proportion of the observed
non-synonymous single-nucleotide polymorphisms reduces fitness and never reaches
fixation. Evolutionary and medical implications of the impact of selection on
human polymorphisms are discussed.
acknowledgement: We are grateful to Alexey Kondrashov and Alison Wellman for the careful
reading of the manuscript and providing us with their valuable comments.
author:
- first_name: Shamil
full_name: Sunyaev, Shamil R
last_name: Sunyaev
- first_name: Fyodor
full_name: Fyodor Kondrashov
id: 44FDEF62-F248-11E8-B48F-1D18A9856A87
last_name: Kondrashov
orcid: 0000-0001-8243-4694
- first_name: Peer
full_name: Bork, Peer
last_name: Bork
- first_name: Vasily
full_name: Ramensky, Vasily
last_name: Ramensky
citation:
ama: Sunyaev S, Kondrashov F, Bork P, Ramensky V. Impact of selection, mutation
rate and genetic drift on human genetic variation. Human Molecular Genetics.
2003;12(24):3325-3330. doi:10.1093/hmg/ddg359
apa: Sunyaev, S., Kondrashov, F., Bork, P., & Ramensky, V. (2003). Impact of
selection, mutation rate and genetic drift on human genetic variation. Human
Molecular Genetics. Oxford University Press. https://doi.org/10.1093/hmg/ddg359
chicago: Sunyaev, Shamil, Fyodor Kondrashov, Peer Bork, and Vasily Ramensky. “Impact
of Selection, Mutation Rate and Genetic Drift on Human Genetic Variation.” Human
Molecular Genetics. Oxford University Press, 2003. https://doi.org/10.1093/hmg/ddg359.
ieee: S. Sunyaev, F. Kondrashov, P. Bork, and V. Ramensky, “Impact of selection,
mutation rate and genetic drift on human genetic variation,” Human Molecular
Genetics, vol. 12, no. 24. Oxford University Press, pp. 3325–3330, 2003.
ista: Sunyaev S, Kondrashov F, Bork P, Ramensky V. 2003. Impact of selection, mutation
rate and genetic drift on human genetic variation. Human Molecular Genetics. 12(24),
3325–3330.
mla: Sunyaev, Shamil, et al. “Impact of Selection, Mutation Rate and Genetic Drift
on Human Genetic Variation.” Human Molecular Genetics, vol. 12, no. 24,
Oxford University Press, 2003, pp. 3325–30, doi:10.1093/hmg/ddg359.
short: S. Sunyaev, F. Kondrashov, P. Bork, V. Ramensky, Human Molecular Genetics
12 (2003) 3325–3330.
date_created: 2018-12-11T11:48:49Z
date_published: 2003-12-15T00:00:00Z
date_updated: 2021-01-12T08:19:29Z
day: '15'
doi: 10.1093/hmg/ddg359
extern: 1
intvolume: ' 12'
issue: '24'
month: '12'
page: 3325 - 3330
publication: Human Molecular Genetics
publication_status: published
publisher: Oxford University Press
publist_id: '6803'
quality_controlled: 0
status: public
title: Impact of selection, mutation rate and genetic drift on human genetic variation
type: journal_article
volume: 12
year: '2003'
...
---
_id: '876'
abstract:
- lang: eng
text: Alternative splicing is thought to be a major source of functional diversity
in animal proteins. We analyzed the evolutionary conservation of proteins encoded
by alternatively spliced genes and predicted the ancestral state for 73 cases
of alternative splicing (25 insertions and 48 deletions). The amino acid sequences
of most of the inserts in proteins produced by alternative splicing are as conserved
as the surrounding sequences. Thus, alternative splicing often creates novel isoforms
by the insertion of new, functional protein sequences that probably originated
from noncoding sequences of introns.
acknowledgement: We thank Peer Bork, Mikhail Gelfand, Alexey Kondrashov, David Lipman
and Shamil Sunyaev for critical reading of the manuscript and useful suggestions
and the Koonin group members for helpful discussions.
author:
- first_name: Fyodor
full_name: Fyodor Kondrashov
id: 44FDEF62-F248-11E8-B48F-1D18A9856A87
last_name: Kondrashov
orcid: 0000-0001-8243-4694
- first_name: Eugene
full_name: Koonin, Eugene V
last_name: Koonin
citation:
ama: 'Kondrashov F, Koonin E. Evolution of alternative splicing: Deletions, insertions
and origin of functional parts of proteins from intron sequences. Trends in
Genetics. 2003;19(3):115-119. doi:10.1016/S0168-9525(02)00029-X'
apa: 'Kondrashov, F., & Koonin, E. (2003). Evolution of alternative splicing:
Deletions, insertions and origin of functional parts of proteins from intron sequences.
Trends in Genetics. Elsevier. https://doi.org/10.1016/S0168-9525(02)00029-X'
chicago: 'Kondrashov, Fyodor, and Eugene Koonin. “Evolution of Alternative Splicing:
Deletions, Insertions and Origin of Functional Parts of Proteins from Intron Sequences.”
Trends in Genetics. Elsevier, 2003. https://doi.org/10.1016/S0168-9525(02)00029-X.'
ieee: 'F. Kondrashov and E. Koonin, “Evolution of alternative splicing: Deletions,
insertions and origin of functional parts of proteins from intron sequences,”
Trends in Genetics, vol. 19, no. 3. Elsevier, pp. 115–119, 2003.'
ista: 'Kondrashov F, Koonin E. 2003. Evolution of alternative splicing: Deletions,
insertions and origin of functional parts of proteins from intron sequences. Trends
in Genetics. 19(3), 115–119.'
mla: 'Kondrashov, Fyodor, and Eugene Koonin. “Evolution of Alternative Splicing:
Deletions, Insertions and Origin of Functional Parts of Proteins from Intron Sequences.”
Trends in Genetics, vol. 19, no. 3, Elsevier, 2003, pp. 115–19, doi:10.1016/S0168-9525(02)00029-X.'
short: F. Kondrashov, E. Koonin, Trends in Genetics 19 (2003) 115–119.
date_created: 2018-12-11T11:48:58Z
date_published: 2003-01-01T00:00:00Z
date_updated: 2021-01-12T08:20:58Z
day: '01'
doi: 10.1016/S0168-9525(02)00029-X
extern: 1
intvolume: ' 19'
issue: '3'
month: '01'
page: 115 - 119
publication: Trends in Genetics
publication_status: published
publisher: Elsevier
publist_id: '6776'
quality_controlled: 0
status: public
title: 'Evolution of alternative splicing: Deletions, insertions and origin of functional
parts of proteins from intron sequences'
type: journal_article
volume: 19
year: '2003'
...
---
_id: '9495'
abstract:
- lang: eng
text: RNA interference is a conserved process in which double-stranded RNA is processed
into 21–25 nucleotide siRNAs that trigger posttranscriptional gene silencing.
In addition, plants display a phenomenon termed RNA-directed DNA methylation (RdDM)
in which DNA with sequence identity to silenced RNA is de novo methylated at its
cytosine residues. This methylation is not only at canonical CpG sites but also
at cytosines in CpNpG and asymmetric sequence contexts. In this report, we study
the role of the DRM and CMT3 DNA methyltransferase genes in the initiation and
maintenance of RdDM. Neither drm nor cmt3 mutants affected the maintenance of
preestablished RNA-directed CpG methylation. However, drm mutants showed a nearly
complete loss of asymmetric methylation and a partial loss of CpNpG methylation.
The remaining asymmetric and CpNpG methylation was dependent on the activity of
CMT3, showing that DRM and CMT3 act redundantly to maintain non-CpG methylation.
These DNA methyltransferases appear to act downstream of siRNAs, since drm1 drm2
cmt3 triple mutants show a lack of non-CpG methylation but elevated levels of
siRNAs. Finally, we demonstrate that DRM activity is required for the initial
establishment of RdDM in all sequence contexts including CpG, CpNpG, and asymmetric
sites.
article_processing_charge: No
article_type: original
author:
- first_name: Xiaofeng
full_name: Cao, Xiaofeng
last_name: Cao
- first_name: Werner
full_name: Aufsatz, Werner
last_name: Aufsatz
- first_name: Daniel
full_name: Zilberman, Daniel
id: 6973db13-dd5f-11ea-814e-b3e5455e9ed1
last_name: Zilberman
orcid: 0000-0002-0123-8649
- first_name: M.Florian
full_name: Mette, M.Florian
last_name: Mette
- first_name: Michael S.
full_name: Huang, Michael S.
last_name: Huang
- first_name: Marjori
full_name: Matzke, Marjori
last_name: Matzke
- first_name: Steven E.
full_name: Jacobsen, Steven E.
last_name: Jacobsen
citation:
ama: Cao X, Aufsatz W, Zilberman D, et al. Role of the DRM and CMT3 methyltransferases
in RNA-directed DNA methylation. Current Biology. 2003;13(24):2212-2217.
doi:10.1016/j.cub.2003.11.052
apa: Cao, X., Aufsatz, W., Zilberman, D., Mette, M. F., Huang, M. S., Matzke, M.,
& Jacobsen, S. E. (2003). Role of the DRM and CMT3 methyltransferases in RNA-directed
DNA methylation. Current Biology. Elsevier. https://doi.org/10.1016/j.cub.2003.11.052
chicago: Cao, Xiaofeng, Werner Aufsatz, Daniel Zilberman, M.Florian Mette, Michael
S. Huang, Marjori Matzke, and Steven E. Jacobsen. “Role of the DRM and CMT3 Methyltransferases
in RNA-Directed DNA Methylation.” Current Biology. Elsevier, 2003. https://doi.org/10.1016/j.cub.2003.11.052.
ieee: X. Cao et al., “Role of the DRM and CMT3 methyltransferases in RNA-directed
DNA methylation,” Current Biology, vol. 13, no. 24. Elsevier, pp. 2212–2217,
2003.
ista: Cao X, Aufsatz W, Zilberman D, Mette MF, Huang MS, Matzke M, Jacobsen SE.
2003. Role of the DRM and CMT3 methyltransferases in RNA-directed DNA methylation.
Current Biology. 13(24), 2212–2217.
mla: Cao, Xiaofeng, et al. “Role of the DRM and CMT3 Methyltransferases in RNA-Directed
DNA Methylation.” Current Biology, vol. 13, no. 24, Elsevier, 2003, pp.
2212–17, doi:10.1016/j.cub.2003.11.052.
short: X. Cao, W. Aufsatz, D. Zilberman, M.F. Mette, M.S. Huang, M. Matzke, S.E.
Jacobsen, Current Biology 13 (2003) 2212–2217.
date_created: 2021-06-07T10:43:02Z
date_published: 2003-12-16T00:00:00Z
date_updated: 2021-12-14T08:41:38Z
day: '16'
department:
- _id: DaZi
doi: 10.1016/j.cub.2003.11.052
extern: '1'
external_id:
pmid:
- '14680640'
intvolume: ' 13'
issue: '24'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1016/j.cub.2003.11.052
month: '12'
oa: 1
oa_version: Published Version
page: 2212-2217
pmid: 1
publication: Current Biology
publication_identifier:
eissn:
- 1879-0445
issn:
- 0960-9822
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Role of the DRM and CMT3 methyltransferases in RNA-directed DNA methylation
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 13
year: '2003'
...
---
_id: '8519'
article_processing_charge: No
article_type: original
author:
- first_name: Vadim
full_name: Kaloshin, Vadim
id: FE553552-CDE8-11E9-B324-C0EBE5697425
last_name: Kaloshin
orcid: 0000-0002-6051-2628
citation:
ama: Kaloshin V. The existential Hilbert 16-th problem and an estimate for cyclicity
of elementary polycycles. Inventiones mathematicae. 2003;151(3):451-512.
doi:10.1007/s00222-002-0244-9
apa: Kaloshin, V. (2003). The existential Hilbert 16-th problem and an estimate
for cyclicity of elementary polycycles. Inventiones Mathematicae. Springer
Nature. https://doi.org/10.1007/s00222-002-0244-9
chicago: Kaloshin, Vadim. “The Existential Hilbert 16-Th Problem and an Estimate
for Cyclicity of Elementary Polycycles.” Inventiones Mathematicae. Springer
Nature, 2003. https://doi.org/10.1007/s00222-002-0244-9.
ieee: V. Kaloshin, “The existential Hilbert 16-th problem and an estimate for cyclicity
of elementary polycycles,” Inventiones mathematicae, vol. 151, no. 3. Springer
Nature, pp. 451–512, 2003.
ista: Kaloshin V. 2003. The existential Hilbert 16-th problem and an estimate for
cyclicity of elementary polycycles. Inventiones mathematicae. 151(3), 451–512.
mla: Kaloshin, Vadim. “The Existential Hilbert 16-Th Problem and an Estimate for
Cyclicity of Elementary Polycycles.” Inventiones Mathematicae, vol. 151,
no. 3, Springer Nature, 2003, pp. 451–512, doi:10.1007/s00222-002-0244-9.
short: V. Kaloshin, Inventiones Mathematicae 151 (2003) 451–512.
date_created: 2020-09-18T10:49:26Z
date_published: 2003-03-01T00:00:00Z
date_updated: 2021-01-12T08:19:50Z
day: '01'
doi: 10.1007/s00222-002-0244-9
extern: '1'
intvolume: ' 151'
issue: '3'
keyword:
- General Mathematics
language:
- iso: eng
month: '03'
oa_version: None
page: 451-512
publication: Inventiones mathematicae
publication_identifier:
issn:
- 0020-9910
- 1432-1297
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
status: public
title: The existential Hilbert 16-th problem and an estimate for cyclicity of elementary
polycycles
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 151
year: '2003'
...
---
_id: '9455'
abstract:
- lang: eng
text: Proteins of the ARGONAUTE family are important in diverse posttranscriptional
RNA-mediated gene-silencing systems as well as in transcriptional gene silencing
in Drosophila and fission yeast and in programmed DNA elimination in Tetrahymena.
We cloned ARGONAUTE4 (AGO4) from a screen for mutants that suppress silencing
of the Arabidopsis SUPERMAN(SUP) gene. The ago4-1 mutant reactivated silentSUP
alleles and decreased CpNpG and asymmetric DNA methylation as well as histone
H3 lysine-9 methylation. In addition,ago4-1 blocked histone and DNA methylation
and the accumulation of 25-nucleotide small interfering RNAs (siRNAs) that correspond
to the retroelement AtSN1. These results suggest that AGO4 and long siRNAs direct
chromatin modifications, including histone methylation and non-CpG DNA methylation.
article_processing_charge: No
article_type: original
author:
- first_name: Daniel
full_name: Zilberman, Daniel
id: 6973db13-dd5f-11ea-814e-b3e5455e9ed1
last_name: Zilberman
orcid: 0000-0002-0123-8649
- first_name: ' Xiaofeng'
full_name: Cao, Xiaofeng
last_name: Cao
- first_name: Steven E.
full_name: Jacobsen, Steven E.
last_name: Jacobsen
citation:
ama: Zilberman D, Cao Xiaofeng, Jacobsen SE. ARGONAUTE4 control of locus-specific
siRNA accumulation and DNA and histone methylation. Science. 2003;299(5607):716-719.
doi:10.1126/science.1079695
apa: Zilberman, D., Cao, Xiaofeng, & Jacobsen, S. E. (2003). ARGONAUTE4 control
of locus-specific siRNA accumulation and DNA and histone methylation. Science.
American Association for the Advancement of Science. https://doi.org/10.1126/science.1079695
chicago: Zilberman, Daniel, Xiaofeng Cao, and Steven E. Jacobsen. “ARGONAUTE4 Control
of Locus-Specific SiRNA Accumulation and DNA and Histone Methylation.” Science.
American Association for the Advancement of Science, 2003. https://doi.org/10.1126/science.1079695.
ieee: D. Zilberman, Xiaofeng Cao, and S. E. Jacobsen, “ARGONAUTE4 control of locus-specific
siRNA accumulation and DNA and histone methylation,” Science, vol. 299,
no. 5607. American Association for the Advancement of Science, pp. 716–719, 2003.
ista: Zilberman D, Cao Xiaofeng, Jacobsen SE. 2003. ARGONAUTE4 control of locus-specific
siRNA accumulation and DNA and histone methylation. Science. 299(5607), 716–719.
mla: Zilberman, Daniel, et al. “ARGONAUTE4 Control of Locus-Specific SiRNA Accumulation
and DNA and Histone Methylation.” Science, vol. 299, no. 5607, American
Association for the Advancement of Science, 2003, pp. 716–19, doi:10.1126/science.1079695.
short: D. Zilberman, Xiaofeng Cao, S.E. Jacobsen, Science 299 (2003) 716–719.
date_created: 2021-06-04T11:26:26Z
date_published: 2003-01-31T00:00:00Z
date_updated: 2021-12-14T08:43:30Z
day: '31'
department:
- _id: DaZi
doi: 10.1126/science.1079695
extern: '1'
external_id:
pmid:
- '12522258'
intvolume: ' 299'
issue: '5607'
keyword:
- Multidisciplinary
language:
- iso: eng
month: '01'
oa_version: None
page: 716-719
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: ARGONAUTE4 control of locus-specific siRNA accumulation and DNA and histone
methylation
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 299
year: '2003'
...
---
_id: '4628'
abstract:
- lang: eng
text: 'Discounting the future means that the value, today, of a unit payoffis 1
if the payoffo ccurs today, a if it occurs tomorrow, a 2 if it occurs the day
after tomorrow, and so on, for some real-valued discount factor 0 < a <
1. Discounting (or inflation) is a key paradigm in economics and has been studied
in Markov decision processes as well as game theory. We submit that discounting
also has a natural place in systems engineering: for nonterminating systems, a
potential bug in the far-away future is less troubling than a potential bug today.
We therefore develop a systems theory with discounting. Our theory includes several
basic elements: discounted versions of system properties that correspond to the
ω-regular properties, fixpoint-based algorithms for checking discounted properties,
and a quantitative notion of bisimilarity for capturing the difference between
two states with respect to discounted properties. We present the theory in a general
form that applies to probabilistic systems as well as multicomponent systems (games),
but it readily specializes to classical transition systems. We show that discounting,
besides its natural practical appeal, has also several mathematical benefits.
First, the resulting theory is robust, in that small perturbations of a system
can cause only small changes in the properties of the system. Second, the theory
is computational, in that the values of discounted properties, as well as the
discounted bisimilarity distance between states, can be computed to any desired
degree of precision.'
acknowledgement: This research was supported in part by the NSF CAREER award CCR-0132780,
the DARPA grant F33615-C-98-3614, the NSF grants CCR-9988172, CCR-0234690 and CCR-0225610,
and the ONR grant N00014-02-1-0671.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Luca
full_name: De Alfaro, Luca
last_name: De Alfaro
- 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: Ritankar
full_name: Majumdar, Ritankar
last_name: Majumdar
citation:
ama: 'De Alfaro L, Henzinger TA, Majumdar R. Discounting the future in systems theory.
In: Proceedings of the 30th International Colloquium on Automata, Languages
and Programming. Vol 2719. Springer; 2003:1022-1037. doi:10.1007/3-540-45061-0_79'
apa: 'De Alfaro, L., Henzinger, T. A., & Majumdar, R. (2003). Discounting the
future in systems theory. In Proceedings of the 30th International Colloquium
on Automata, Languages and Programming (Vol. 2719, pp. 1022–1037). Eindhoven,
The Netherlands: Springer. https://doi.org/10.1007/3-540-45061-0_79'
chicago: De Alfaro, Luca, Thomas A Henzinger, and Ritankar Majumdar. “Discounting
the Future in Systems Theory.” In Proceedings of the 30th International Colloquium
on Automata, Languages and Programming, 2719:1022–37. Springer, 2003. https://doi.org/10.1007/3-540-45061-0_79.
ieee: L. De Alfaro, T. A. Henzinger, and R. Majumdar, “Discounting the future in
systems theory,” in Proceedings of the 30th International Colloquium on Automata,
Languages and Programming, Eindhoven, The Netherlands, 2003, vol. 2719, pp.
1022–1037.
ista: 'De Alfaro L, Henzinger TA, Majumdar R. 2003. Discounting the future in systems
theory. Proceedings of the 30th International Colloquium on Automata, Languages
and Programming. ICALP: Automata, Languages and Programming, LNCS, vol. 2719,
1022–1037.'
mla: De Alfaro, Luca, et al. “Discounting the Future in Systems Theory.” Proceedings
of the 30th International Colloquium on Automata, Languages and Programming,
vol. 2719, Springer, 2003, pp. 1022–37, doi:10.1007/3-540-45061-0_79.
short: L. De Alfaro, T.A. Henzinger, R. Majumdar, in:, Proceedings of the 30th International
Colloquium on Automata, Languages and Programming, Springer, 2003, pp. 1022–1037.
conference:
end_date: 2003-07-04
location: Eindhoven, The Netherlands
name: 'ICALP: Automata, Languages and Programming'
start_date: 2003-06-30
date_created: 2018-12-11T12:09:50Z
date_published: 2003-06-25T00:00:00Z
date_updated: 2023-07-26T13:07:31Z
day: '25'
doi: 10.1007/3-540-45061-0_79
extern: '1'
intvolume: ' 2719'
language:
- iso: eng
month: '06'
oa_version: None
page: 1022 - 1037
publication: Proceedings of the 30th International Colloquium on Automata, Languages
and Programming
publication_identifier:
isbn:
- '9783540404934'
publication_status: published
publisher: Springer
publist_id: '77'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Discounting the future in systems theory
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 2719
year: '2003'
...
---
_id: '13436'
abstract:
- lang: eng
text: Cross-metathesis reactions of α,β-unsaturated sulfones and sulfoxides in the
presence of molybdenum and ruthenium pre-catalysts were tested. A selective metahesis
reaction was achieved between functionalized terminal olefins and vinyl sulfones
by using the ‘second generation’ ruthenium catalysts 1c–h while the highly active
Schrock catalyst 1b was found to be functional group incompatible with vinyl sulfones.
The cross-metathesis products were isolated in good yields with an excellent (E)-selectivity.
Both the molybdenum and ruthenium-based complexes were, however, incompatible
with α,β- and β,γ-unsaturated sulfoxides.
article_processing_charge: No
article_type: original
author:
- first_name: Anna
full_name: Michrowska, Anna
last_name: Michrowska
- first_name: Michał
full_name: Bieniek, Michał
last_name: Bieniek
- first_name: Mikhail
full_name: Kim, Mikhail
last_name: Kim
- first_name: Rafal
full_name: Klajn, Rafal
id: 8e84690e-1e48-11ed-a02b-a1e6fb8bb53b
last_name: Klajn
- first_name: Karol
full_name: Grela, Karol
last_name: Grela
citation:
ama: Michrowska A, Bieniek M, Kim M, Klajn R, Grela K. Cross-metathesis reaction
of vinyl sulfones and sulfoxides. Tetrahedron. 2003;59(25):4525-4531. doi:10.1016/s0040-4020(03)00682-3
apa: Michrowska, A., Bieniek, M., Kim, M., Klajn, R., & Grela, K. (2003). Cross-metathesis
reaction of vinyl sulfones and sulfoxides. Tetrahedron. Elsevier. https://doi.org/10.1016/s0040-4020(03)00682-3
chicago: Michrowska, Anna, Michał Bieniek, Mikhail Kim, Rafal Klajn, and Karol Grela.
“Cross-Metathesis Reaction of Vinyl Sulfones and Sulfoxides.” Tetrahedron.
Elsevier, 2003. https://doi.org/10.1016/s0040-4020(03)00682-3.
ieee: A. Michrowska, M. Bieniek, M. Kim, R. Klajn, and K. Grela, “Cross-metathesis
reaction of vinyl sulfones and sulfoxides,” Tetrahedron, vol. 59, no. 25.
Elsevier, pp. 4525–4531, 2003.
ista: Michrowska A, Bieniek M, Kim M, Klajn R, Grela K. 2003. Cross-metathesis reaction
of vinyl sulfones and sulfoxides. Tetrahedron. 59(25), 4525–4531.
mla: Michrowska, Anna, et al. “Cross-Metathesis Reaction of Vinyl Sulfones and Sulfoxides.”
Tetrahedron, vol. 59, no. 25, Elsevier, 2003, pp. 4525–31, doi:10.1016/s0040-4020(03)00682-3.
short: A. Michrowska, M. Bieniek, M. Kim, R. Klajn, K. Grela, Tetrahedron 59 (2003)
4525–4531.
date_created: 2023-08-01T10:39:34Z
date_published: 2003-06-16T00:00:00Z
date_updated: 2023-08-08T12:44:17Z
day: '16'
doi: 10.1016/s0040-4020(03)00682-3
extern: '1'
intvolume: ' 59'
issue: '25'
keyword:
- Organic Chemistry
- Drug Discovery
- Biochemistry
language:
- iso: eng
month: '06'
oa_version: None
page: 4525-4531
publication: Tetrahedron
publication_identifier:
eissn:
- 1464-5416
issn:
- 0040-4020
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Cross-metathesis reaction of vinyl sulfones and sulfoxides
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 59
year: '2003'
...
---
_id: '4561'
abstract:
- lang: eng
text: 'We present a formalism for specifying component interfaces that expose component
requirements on limited resources. The formalism permits an algorithmic check
if two or more components, when put together, exceed the available resources.
Moreover, the formalism can be used to compute the quantity of resources necessary
for satisfying the requirements of a collection of components. The formalism can
be instantiated in several ways. For example, several components may draw power
from the same source. Then, the formalism supports compatibility checks such as:
can two components, when put together, achieve their tasks without ever exceeding
the available amount of peak power? or, can they achieve their tasks by using
no more than the initially available amount of energy (i.e., power accumulated
over time)? The corresponding quantitative questions that our algorithms answer
are the following: what is the amount of peak power needed for two components
to be put together? what is the corresponding amount of initial energy? To solve
these questions, we model interfaces with resource requirements as games with
quantitative objectives. The games are played on state spaces where each state
is labeled by a number (representing, e.g., power consumption), and a play produces
an infinite path of labels. The objective may be, for example, to minimize the
largest label that occurs during a play. We illustrate our approach by modeling
compatibility questions for the components of robot control software, and of wireless
sensor networks.'
acknowledgement: This research was supported in part by the DARPA grant F33615-00-C-1693,
the MARCO grant 98-DT-660, the ONR grant N00014-02-1-0671, and the NSF grants CCR-0085949,
CCR-0132780, CCR-0234690, and CCR-9988172.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Arindam
full_name: Chakrabarti, Arindam
last_name: Chakrabarti
- first_name: Luca
full_name: De Alfaro, Luca
last_name: De Alfaro
- 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: Mariëlle
full_name: Stoelinga, Mariëlle
last_name: Stoelinga
citation:
ama: 'Chakrabarti A, De Alfaro L, Henzinger TA, Stoelinga M. Resource interfaces.
In: Third International Conference on Embedded Software. Vol 2855. ACM;
2003:117-133. doi:10.1007/978-3-540-45212-6_9'
apa: 'Chakrabarti, A., De Alfaro, L., Henzinger, T. A., & Stoelinga, M. (2003).
Resource interfaces. In Third International Conference on Embedded Software
(Vol. 2855, pp. 117–133). Philadelphia, PA, USA: ACM. https://doi.org/10.1007/978-3-540-45212-6_9'
chicago: Chakrabarti, Arindam, Luca De Alfaro, Thomas A Henzinger, and Mariëlle
Stoelinga. “Resource Interfaces.” In Third International Conference on Embedded
Software, 2855:117–33. ACM, 2003. https://doi.org/10.1007/978-3-540-45212-6_9.
ieee: A. Chakrabarti, L. De Alfaro, T. A. Henzinger, and M. Stoelinga, “Resource
interfaces,” in Third International Conference on Embedded Software, Philadelphia,
PA, USA, 2003, vol. 2855, pp. 117–133.
ista: 'Chakrabarti A, De Alfaro L, Henzinger TA, Stoelinga M. 2003. Resource interfaces.
Third International Conference on Embedded Software. EMSOFT: Embedded Software
, LNCS, vol. 2855, 117–133.'
mla: Chakrabarti, Arindam, et al. “Resource Interfaces.” Third International
Conference on Embedded Software, vol. 2855, ACM, 2003, pp. 117–33, doi:10.1007/978-3-540-45212-6_9.
short: A. Chakrabarti, L. De Alfaro, T.A. Henzinger, M. Stoelinga, in:, Third International
Conference on Embedded Software, ACM, 2003, pp. 117–133.
conference:
end_date: 2003-10-15
location: Philadelphia, PA, USA
name: 'EMSOFT: Embedded Software '
start_date: 2003-10-13
date_created: 2018-12-11T12:09:29Z
date_published: 2003-09-29T00:00:00Z
date_updated: 2024-01-08T10:48:11Z
day: '29'
doi: 10.1007/978-3-540-45212-6_9
extern: '1'
intvolume: ' 2855'
language:
- iso: eng
month: '09'
oa_version: None
page: 117 - 133
publication: Third International Conference on Embedded Software
publication_identifier:
isbn:
- '9783540202233'
publication_status: published
publisher: ACM
publist_id: '148'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Resource interfaces
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 2855
year: '2003'
...
---
_id: '4630'
abstract:
- lang: eng
text: We consider concurrent two-person games played in real time, in which the
players decide both which action to play, and when to play it. Such timed games
differ from untimed games in two essential ways. First, players can take each
other by surprise, because actions are played with delays that cannot be anticipated
by the opponent. Second, a player should not be able to win the game by preventing
time from diverging. We present a model of timed games that preserves the element
of surprise and accounts for time divergence in a way that treats both players
symmetrically and applies to all ω-regular winning conditions. We prove that the
ability to take each other by surprise adds extra power to the players. For the
case that the games are specified in the style of timed automata, we provide symbolic
algorithms for their solution with respect to all ω-regular winning conditions.
We also show that for these timed games, memory strategies are more powerful than
memoryless strategies already in the case of reachability objectives.
acknowledgement: Supported in part by the AFOSR MURI grant F49620-00-1-0327, the DARPA
grant F33615-C-98-3614, the MARCO grant 98-DT-660, -the ONR grant N00014-02-1-0671,
the NSF grants CCR-9988172, CCR-0225610, and CCR-0234690, the NSF CAREER award CCR-0132780,
and the MIUR grant MEFISTO.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Luca
full_name: De Alfaro, Luca
last_name: De Alfaro
- first_name: Marco
full_name: Faella, Marco
last_name: Faella
- 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: Ritankar
full_name: Majumdar, Ritankar
last_name: Majumdar
- first_name: Mariëlle
full_name: Stoelinga, Mariëlle
last_name: Stoelinga
citation:
ama: 'De Alfaro L, Faella M, Henzinger TA, Majumdar R, Stoelinga M. The element
of surprise in timed games. In: Proceedings of the 14th International Conference
on Concurrency Theory. Vol 2761. Schloss Dagstuhl - Leibniz-Zentrum für Informatik;
2003:144-158. doi:10.1007/978-3-540-45187-7_9'
apa: 'De Alfaro, L., Faella, M., Henzinger, T. A., Majumdar, R., & Stoelinga,
M. (2003). The element of surprise in timed games. In Proceedings of the 14th
International Conference on Concurrency Theory (Vol. 2761, pp. 144–158). Marseille,
France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-540-45187-7_9'
chicago: De Alfaro, Luca, Marco Faella, Thomas A Henzinger, Ritankar Majumdar, and
Mariëlle Stoelinga. “The Element of Surprise in Timed Games.” In Proceedings
of the 14th International Conference on Concurrency Theory, 2761:144–58. Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2003. https://doi.org/10.1007/978-3-540-45187-7_9.
ieee: L. De Alfaro, M. Faella, T. A. Henzinger, R. Majumdar, and M. Stoelinga, “The
element of surprise in timed games,” in Proceedings of the 14th International
Conference on Concurrency Theory, Marseille, France, 2003, vol. 2761, pp.
144–158.
ista: 'De Alfaro L, Faella M, Henzinger TA, Majumdar R, Stoelinga M. 2003. The element
of surprise in timed games. Proceedings of the 14th International Conference on
Concurrency Theory. CONCUR: Concurrency Theory, LNCS, vol. 2761, 144–158.'
mla: De Alfaro, Luca, et al. “The Element of Surprise in Timed Games.” Proceedings
of the 14th International Conference on Concurrency Theory, vol. 2761, Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2003, pp. 144–58, doi:10.1007/978-3-540-45187-7_9.
short: L. De Alfaro, M. Faella, T.A. Henzinger, R. Majumdar, M. Stoelinga, in:,
Proceedings of the 14th International Conference on Concurrency Theory, Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2003, pp. 144–158.
conference:
end_date: 2003-09-05
location: Marseille, France
name: 'CONCUR: Concurrency Theory'
start_date: 2003-09-03
date_created: 2018-12-11T12:09:51Z
date_published: 2003-08-21T00:00:00Z
date_updated: 2024-01-08T10:05:30Z
day: '21'
doi: 10.1007/978-3-540-45187-7_9
extern: '1'
intvolume: ' 2761'
language:
- iso: eng
month: '08'
oa_version: None
page: 144 - 158
publication: Proceedings of the 14th International Conference on Concurrency Theory
publication_identifier:
isbn:
- '9783540407539'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '78'
quality_controlled: '1'
scopus_import: '1'
status: public
title: The element of surprise in timed games
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 2761
year: '2003'
...
---
_id: '4468'
abstract:
- lang: eng
text: Giotto is a high-level programming language for time-triggered control applications.
The authors begin with a conceptual overview of its methodology, discuss the Giotto
helicopter project, and summarize available Giotto implementations.
acknowledgement: We thank Niklaus Wirth and Walter Schaufelberger for their advice
and support of the reengineering effort of the ETH Zurich helicopter control system
using Giotto. This research was supported in part by DARPA SEC grant F33615-C-98–3614,
MARCO GSRC grant 98-DT-660, and AFOSR MURI grant F49620–00-1–0327. A preliminary
version of this article appeared as [1].
article_processing_charge: No
article_type: original
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
- first_name: Marco
full_name: Sanvido, Marco
last_name: Sanvido
- first_name: Wolfgang
full_name: Pree, Wolfgang
last_name: Pree
citation:
ama: Henzinger TA, Kirsch C, Sanvido M, Pree W. From control models to real-time
code using Giotto. IEEE Control Systems Magazine. 2003;23(1):50-64. doi:10.1109/MCS.2003.1172829
apa: Henzinger, T. A., Kirsch, C., Sanvido, M., & Pree, W. (2003). From control
models to real-time code using Giotto. IEEE Control Systems Magazine. IEEE.
https://doi.org/10.1109/MCS.2003.1172829
chicago: Henzinger, Thomas A, Christoph Kirsch, Marco Sanvido, and Wolfgang Pree.
“From Control Models to Real-Time Code Using Giotto.” IEEE Control Systems
Magazine. IEEE, 2003. https://doi.org/10.1109/MCS.2003.1172829.
ieee: T. A. Henzinger, C. Kirsch, M. Sanvido, and W. Pree, “From control models
to real-time code using Giotto,” IEEE Control Systems Magazine, vol. 23,
no. 1. IEEE, pp. 50–64, 2003.
ista: Henzinger TA, Kirsch C, Sanvido M, Pree W. 2003. From control models to real-time
code using Giotto. IEEE Control Systems Magazine. 23(1), 50–64.
mla: Henzinger, Thomas A., et al. “From Control Models to Real-Time Code Using Giotto.”
IEEE Control Systems Magazine, vol. 23, no. 1, IEEE, 2003, pp. 50–64, doi:10.1109/MCS.2003.1172829.
short: T.A. Henzinger, C. Kirsch, M. Sanvido, W. Pree, IEEE Control Systems Magazine
23 (2003) 50–64.
date_created: 2018-12-11T12:09:00Z
date_published: 2003-01-29T00:00:00Z
date_updated: 2024-01-08T10:54:53Z
day: '29'
doi: 10.1109/MCS.2003.1172829
extern: '1'
intvolume: ' 23'
issue: '1'
language:
- iso: eng
month: '01'
oa_version: None
page: 50 - 64
publication: IEEE Control Systems Magazine
publication_identifier:
issn:
- '1066-033X '
publication_status: published
publisher: IEEE
publist_id: '260'
quality_controlled: '1'
scopus_import: '1'
status: public
title: From control models to real-time code using Giotto
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 23
year: '2003'
...
---
_id: '4465'
abstract:
- lang: eng
text: Giotto is a principled, tool-supported design methodology for implementing
embedded control systems on platforms of possibly distributed sensors, actuators,
CPUs, and networks. Giotto is based on the principle that time-triggered task
invocations plus time-triggered mode switches can form the abstract essence of
programming real-time control systems. Giotto consists of a programming language
with a formal semantics, and a retargetable compiler and runtime library. Giotto
supports the automation of control system design by strictly separating platform-independent
functionality and timing concerns from platform-dependent scheduling and communication
issues. The time-triggered predictability of Giotto makes it particularly suitable
for safety-critical applications with hard real-time constraints. We illustrate
the platform independence and time-triggered execution of Giotto by coordinating
a heterogeneous flock of Intel x86 robots and Lego Mindstorms robots.
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: Benjamin
full_name: Horowitz, Benjamin
last_name: Horowitz
- first_name: Christoph
full_name: Kirsch, Christoph
last_name: Kirsch
citation:
ama: 'Henzinger TA, Horowitz B, Kirsch C. Embedded control systems development with
Giotto. In: Software-Enabled Control: Information Technology for Dynamical
Systems. Wiley-Blackwell; 2003:123-146. doi:10.1002/047172288X.ch8'
apa: 'Henzinger, T. A., Horowitz, B., & Kirsch, C. (2003). Embedded control
systems development with Giotto. In Software-Enabled Control: Information Technology
for Dynamical Systems (pp. 123–146). Wiley-Blackwell. https://doi.org/10.1002/047172288X.ch8'
chicago: 'Henzinger, Thomas A, Benjamin Horowitz, and Christoph Kirsch. “Embedded
Control Systems Development with Giotto.” In Software-Enabled Control: Information
Technology for Dynamical Systems, 123–46. Wiley-Blackwell, 2003. https://doi.org/10.1002/047172288X.ch8.'
ieee: 'T. A. Henzinger, B. Horowitz, and C. Kirsch, “Embedded control systems development
with Giotto,” in Software-Enabled Control: Information Technology for Dynamical
Systems, Wiley-Blackwell, 2003, pp. 123–146.'
ista: 'Henzinger TA, Horowitz B, Kirsch C. 2003.Embedded control systems development
with Giotto. In: Software-Enabled Control: Information Technology for Dynamical
Systems. , 123–146.'
mla: 'Henzinger, Thomas A., et al. “Embedded Control Systems Development with Giotto.”
Software-Enabled Control: Information Technology for Dynamical Systems,
Wiley-Blackwell, 2003, pp. 123–46, doi:10.1002/047172288X.ch8.'
short: 'T.A. Henzinger, B. Horowitz, C. Kirsch, in:, Software-Enabled Control: Information
Technology for Dynamical Systems, Wiley-Blackwell, 2003, pp. 123–146.'
date_created: 2018-12-11T12:08:59Z
date_published: 2003-05-20T00:00:00Z
date_updated: 2024-01-08T12:24:01Z
day: '20'
doi: 10.1002/047172288X.ch8
extern: '1'
language:
- iso: eng
month: '05'
oa_version: None
page: 123 - 146
publication: 'Software-Enabled Control: Information Technology for Dynamical Systems'
publication_identifier:
isbn:
- '9780471234364 '
publication_status: published
publisher: Wiley-Blackwell
publist_id: '262'
quality_controlled: '1'
status: public
title: Embedded control systems development with Giotto
type: book_chapter
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
year: '2003'
...
---
_id: '4466'
abstract:
- lang: eng
text: One source of complexity in the μ-calculus is its ability to specify an unbounded
number of switches between universal (AX) and existential (EX) branching modes.
We therefore study the problems of satisfiability, validity, model checking, and
implication for the universal and existential fragments of the μ-calculus, in
which only one branching mode is allowed. The universal fragment is rich enough
to express most specifications of interest, and therefore improved algorithms
are of practical importance. We show that while the satisfiability and validity
problems become indeed simpler for the existential and universal fragments, this
is, unfortunately, not the case for model checking and implication. We also show
the corresponding results for the alternationfree fragment of the μ-calculus,
where no alternations between least and greatest fixed points are allowed. Our
results imply that efforts to find a polynomial-time model-checking algorithm
for the μ-calculus can be replaced by efforts to find such an algorithm for the
universal or existential fragment.
acknowledgement: This work was supported in part by NSF grant CCR-9988172, the AFOSR
MURI grant F49620-00-1-0327, and a Microsoft Research Fellowship.
alternative_title:
- LNCS
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: Orna
full_name: Kupferman, Orna
last_name: Kupferman
- first_name: Ritankar
full_name: Majumdar, Ritankar
last_name: Majumdar
citation:
ama: 'Henzinger TA, Kupferman O, Majumdar R. On the universal and existential fragments
of the mu-calculus. In: Proceedings of the 9th International Conference on
Tools and Algorithms for the Construction and Analysis of Systems . Vol 2619.
Springer; 2003:49-64. doi:10.1007/3-540-36577-X_5'
apa: 'Henzinger, T. A., Kupferman, O., & Majumdar, R. (2003). On the universal
and existential fragments of the mu-calculus. In Proceedings of the 9th International
Conference on Tools and Algorithms for the Construction and Analysis of Systems
(Vol. 2619, pp. 49–64). Warsaw, Poland: Springer. https://doi.org/10.1007/3-540-36577-X_5'
chicago: Henzinger, Thomas A, Orna Kupferman, and Ritankar Majumdar. “On the Universal
and Existential Fragments of the Mu-Calculus.” In Proceedings of the 9th International
Conference on Tools and Algorithms for the Construction and Analysis of Systems
, 2619:49–64. Springer, 2003. https://doi.org/10.1007/3-540-36577-X_5.
ieee: T. A. Henzinger, O. Kupferman, and R. Majumdar, “On the universal and existential
fragments of the mu-calculus,” in Proceedings of the 9th International Conference
on Tools and Algorithms for the Construction and Analysis of Systems , Warsaw,
Poland, 2003, vol. 2619, pp. 49–64.
ista: 'Henzinger TA, Kupferman O, Majumdar R. 2003. On the universal and existential
fragments of the mu-calculus. Proceedings of the 9th 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.
2619, 49–64.'
mla: Henzinger, Thomas A., et al. “On the Universal and Existential Fragments of
the Mu-Calculus.” Proceedings of the 9th International Conference on Tools
and Algorithms for the Construction and Analysis of Systems , vol. 2619, Springer,
2003, pp. 49–64, doi:10.1007/3-540-36577-X_5.
short: T.A. Henzinger, O. Kupferman, R. Majumdar, in:, Proceedings of the 9th International
Conference on Tools and Algorithms for the Construction and Analysis of Systems
, Springer, 2003, pp. 49–64.
conference:
end_date: 2003-04-11
location: Warsaw, Poland
name: 'TACAS: Tools and Algorithms for the Construction and Analysis of Systems'
start_date: 2003-04-07
date_created: 2018-12-11T12:08:59Z
date_published: 2003-03-14T00:00:00Z
date_updated: 2024-01-08T13:17:35Z
day: '14'
doi: 10.1007/3-540-36577-X_5
extern: '1'
intvolume: ' 2619'
language:
- iso: eng
month: '03'
oa_version: None
page: 49 - 64
publication: 'Proceedings of the 9th International Conference on Tools and Algorithms
for the Construction and Analysis of Systems '
publication_identifier:
isbn:
- '9783540008989'
publication_status: published
publisher: Springer
publist_id: '263'
quality_controlled: '1'
status: public
title: On the universal and existential fragments of the mu-calculus
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 2619
year: '2003'
...
---
_id: '4467'
abstract:
- lang: eng
text: 'BLAST (the Berkeley Lazy Abstraction Software verification Tool) is a verification
system for checking safety properties of C programs using automatic property-driven
construction and model checking of software abstractions. Blast implements an
abstract-model check-refine loop to check for reachability of a specified label
in the program. The abstract model is built on the fly using predicate abstraction.
This model is then checked for reachability. If there is no (abstract) path to
the specified error label, Blast reports that the system is safe and produces
a succinct proof. Otherwise, it checks if the path is feasible using symbolic
execution of the program. If the path is feasible, Blast outputs the path as an
error trace, otherwise, it uses the infeasibility of the path to refine the abstract
model. Blast short-circuits the loop from abstraction to verification to refinement,
integrating the three steps tightly through “lazy abstraction” [5]. This integration
can offer significant advantages in performance by avoiding the repetition of
work from one iteration of the loop to the next. '
acknowledgement: This work was supported in part by the NSF grants CCR-0085949 and
CCR-9988172, the DARPA PCES grant F33615-00-C-1693, the MARCO GSRC grant 98-DT-660,
and a Microsoft Research Fellowship.
alternative_title:
- LNCS
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: Grégoire
full_name: Sutre, Grégoire
last_name: Sutre
citation:
ama: 'Henzinger TA, Jhala R, Majumdar R, Sutre G. Software verification with BLAST.
In: Proceedings of the 10th International SPIN Workshop . Vol 2648. Springer;
2003:235-239. doi:10.1007/3-540-44829-2_17'
apa: 'Henzinger, T. A., Jhala, R., Majumdar, R., & Sutre, G. (2003). Software
verification with BLAST. In Proceedings of the 10th International SPIN Workshop
(Vol. 2648, pp. 235–239). Portland, OR, USA: Springer. https://doi.org/10.1007/3-540-44829-2_17'
chicago: Henzinger, Thomas A, Ranjit Jhala, Ritankar Majumdar, and Grégoire Sutre.
“Software Verification with BLAST.” In Proceedings of the 10th International
SPIN Workshop , 2648:235–39. Springer, 2003. https://doi.org/10.1007/3-540-44829-2_17.
ieee: T. A. Henzinger, R. Jhala, R. Majumdar, and G. Sutre, “Software verification
with BLAST,” in Proceedings of the 10th International SPIN Workshop , Portland,
OR, USA, 2003, vol. 2648, pp. 235–239.
ista: 'Henzinger TA, Jhala R, Majumdar R, Sutre G. 2003. Software verification with
BLAST. Proceedings of the 10th International SPIN Workshop . SPIN: Model Checking
Software, LNCS, vol. 2648, 235–239.'
mla: Henzinger, Thomas A., et al. “Software Verification with BLAST.” Proceedings
of the 10th International SPIN Workshop , vol. 2648, Springer, 2003, pp. 235–39,
doi:10.1007/3-540-44829-2_17.
short: T.A. Henzinger, R. Jhala, R. Majumdar, G. Sutre, in:, Proceedings of the
10th International SPIN Workshop , Springer, 2003, pp. 235–239.
conference:
end_date: 2003-05-10
location: Portland, OR, USA
name: 'SPIN: Model Checking Software'
start_date: 2003-05-09
date_created: 2018-12-11T12:09:00Z
date_published: 2003-04-28T00:00:00Z
date_updated: 2024-01-08T14:05:29Z
day: '28'
doi: 10.1007/3-540-44829-2_17
extern: '1'
intvolume: ' 2648'
language:
- iso: eng
month: '04'
oa_version: None
page: 235 - 239
publication: 'Proceedings of the 10th International SPIN Workshop '
publication_identifier:
isbn:
- '9783540401179'
publication_status: published
publisher: Springer
publist_id: '264'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Software verification with BLAST
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 2648
year: '2003'
...
---
_id: '4463'
abstract:
- lang: eng
text: We present an algorithm called TAR (“Thread-modular Abstraction Refinement”)
for model checking safety properties of concurrent software. The TAR algorithm
uses thread-modular assume-guarantee reasoning to overcome the exponential complexity
in the control state of multithreaded programs. Thread modularity means that TAR
explores the state space of one thread at a time, making assumptions about how
the environment can interfere. The TAR algorithm uses counterexample-guided predicate-abstraction
refinement to overcome the usually infinite complexity in the data state of C
programs. A successive approximation scheme automatically infers the necessary
precision on data variables as well as suitable environment assumptions. The scheme
is novel in that transition relations are approximated from above, while at the
same time environment assumptions are approximated from below. In our software
verification tool BLAST we have implemented a fully automatic race checker for
multithreaded C programs which is based on the TAR algorithm. This tool has verified
a wide variety of commonly used locking idioms, including locking schemes that
are not amenable to existing dynamic and static race checkers such as ERASER or
WARLOCK.
acknowledgement: This work was supported in part by the NSF grants CCR-0085949 and
CCR-0234690, the DARPA grant F33615-00-C-1693, and the MARCO grant 98-DT-660.
alternative_title:
- LNCS
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: Shaz
full_name: Qadeer, Shaz
last_name: Qadeer
citation:
ama: 'Henzinger TA, Jhala R, Majumdar R, Qadeer S. Thread-modular abstraction refinement.
In: Proceedings of the 15th International Conference on Computer Aided Verification.
Vol 2725. Springer; 2003:262-274. doi:10.1007/978-3-540-45069-6_27'
apa: 'Henzinger, T. A., Jhala, R., Majumdar, R., & Qadeer, S. (2003). Thread-modular
abstraction refinement. In Proceedings of the 15th International Conference
on Computer Aided Verification (Vol. 2725, pp. 262–274). Boulder, CO, USA:
Springer. https://doi.org/10.1007/978-3-540-45069-6_27'
chicago: Henzinger, Thomas A, Ranjit Jhala, Ritankar Majumdar, and Shaz Qadeer.
“Thread-Modular Abstraction Refinement.” In Proceedings of the 15th International
Conference on Computer Aided Verification, 2725:262–74. Springer, 2003. https://doi.org/10.1007/978-3-540-45069-6_27.
ieee: T. A. Henzinger, R. Jhala, R. Majumdar, and S. Qadeer, “Thread-modular abstraction
refinement,” in Proceedings of the 15th International Conference on Computer
Aided Verification, Boulder, CO, USA, 2003, vol. 2725, pp. 262–274.
ista: 'Henzinger TA, Jhala R, Majumdar R, Qadeer S. 2003. Thread-modular abstraction
refinement. Proceedings of the 15th International Conference on Computer Aided
Verification. CAV: Computer Aided Verification, LNCS, vol. 2725, 262–274.'
mla: Henzinger, Thomas A., et al. “Thread-Modular Abstraction Refinement.” Proceedings
of the 15th International Conference on Computer Aided Verification, vol.
2725, Springer, 2003, pp. 262–74, doi:10.1007/978-3-540-45069-6_27.
short: T.A. Henzinger, R. Jhala, R. Majumdar, S. Qadeer, in:, Proceedings of the
15th International Conference on Computer Aided Verification, Springer, 2003,
pp. 262–274.
conference:
end_date: 2003-07-12
location: Boulder, CO, USA
name: 'CAV: Computer Aided Verification'
start_date: 2003-07-08
date_created: 2018-12-11T12:08:59Z
date_published: 2003-06-27T00:00:00Z
date_updated: 2024-01-10T11:05:53Z
day: '27'
doi: 10.1007/978-3-540-45069-6_27
extern: '1'
intvolume: ' 2725'
language:
- iso: eng
month: '06'
oa_version: None
page: 262 - 274
publication: Proceedings of the 15th International Conference on Computer Aided Verification
publication_identifier:
isbn:
- '9783540405245'
publication_status: published
publisher: Springer
publist_id: '266'
quality_controlled: '1'
status: public
title: Thread-modular abstraction refinement
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 2725
year: '2003'
...