---
_id: '2290'
abstract:
- lang: eng
text: The plant hormone indole-acetic acid (auxin) is essential for many aspects
of plant development. Auxin-mediated growth regulation typically involves the
establishment of an auxin concentration gradient mediated by polarly localized
auxin transporters. The localization of auxin carriers and their amount at the
plasma membrane are controlled by membrane trafficking processes such as secretion,
endocytosis, and recycling. In contrast to endocytosis or recycling, how the secretory
pathway mediates the localization of auxin carriers is not well understood. In
this study we have used the differential cell elongation process during apical
hook development to elucidate the mechanisms underlying the post-Golgi trafficking
of auxin carriers in Arabidopsis. We show that differential cell elongation during
apical hook development is defective in Arabidopsis mutant echidna (ech). ECH
protein is required for the trans-Golgi network (TGN)-mediated trafficking of
the auxin influx carrier AUX1 to the plasma membrane. In contrast, ech mutation
only marginally perturbs the trafficking of the highly related auxin influx carrier
LIKE-AUX1-3 or the auxin efflux carrier PIN-FORMED-3, both also involved in hook
development. Electron tomography reveals that the trafficking defects in ech mutant
are associated with the perturbation of secretory vesicle genesis from the TGN.
Our results identify differential mechanisms for the post-Golgi trafficking of
de novo-synthesized auxin carriers to plasma membrane from the TGN and reveal
how trafficking of auxin influx carriers mediates the control of differential
cell elongation in apical hook development.
article_processing_charge: No
author:
- first_name: Yohann
full_name: Boutté, Yohann
last_name: Boutté
- first_name: Kristoffer
full_name: Jonsson, Kristoffer
last_name: Jonsson
- first_name: Heather
full_name: Mcfarlane, Heather
last_name: Mcfarlane
- first_name: Errin
full_name: Johnson, Errin
last_name: Johnson
- first_name: Delphine
full_name: Gendre, Delphine
last_name: Gendre
- first_name: Ranjan
full_name: Swarup, Ranjan
last_name: Swarup
- first_name: Jirí
full_name: Friml, Jirí
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
- first_name: Lacey
full_name: Samuels, Lacey
last_name: Samuels
- first_name: Stéphanie
full_name: Robert, Stéphanie
last_name: Robert
- first_name: Rishikesh
full_name: Bhalerao, Rishikesh
last_name: Bhalerao
citation:
ama: Boutté Y, Jonsson K, Mcfarlane H, et al. ECHIDNA mediated post Golgi trafficking
of auxin carriers for differential cell elongation. PNAS. 2013;110(40):16259-16264.
doi:10.1073/pnas.1309057110
apa: Boutté, Y., Jonsson, K., Mcfarlane, H., Johnson, E., Gendre, D., Swarup, R.,
… Bhalerao, R. (2013). ECHIDNA mediated post Golgi trafficking of auxin carriers
for differential cell elongation. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.1309057110
chicago: Boutté, Yohann, Kristoffer Jonsson, Heather Mcfarlane, Errin Johnson, Delphine
Gendre, Ranjan Swarup, Jiří Friml, Lacey Samuels, Stéphanie Robert, and Rishikesh
Bhalerao. “ECHIDNA Mediated Post Golgi Trafficking of Auxin Carriers for Differential
Cell Elongation.” PNAS. National Academy of Sciences, 2013. https://doi.org/10.1073/pnas.1309057110.
ieee: Y. Boutté et al., “ECHIDNA mediated post Golgi trafficking of auxin
carriers for differential cell elongation,” PNAS, vol. 110, no. 40. National
Academy of Sciences, pp. 16259–16264, 2013.
ista: Boutté Y, Jonsson K, Mcfarlane H, Johnson E, Gendre D, Swarup R, Friml J,
Samuels L, Robert S, Bhalerao R. 2013. ECHIDNA mediated post Golgi trafficking
of auxin carriers for differential cell elongation. PNAS. 110(40), 16259–16264.
mla: Boutté, Yohann, et al. “ECHIDNA Mediated Post Golgi Trafficking of Auxin Carriers
for Differential Cell Elongation.” PNAS, vol. 110, no. 40, National Academy
of Sciences, 2013, pp. 16259–64, doi:10.1073/pnas.1309057110.
short: Y. Boutté, K. Jonsson, H. Mcfarlane, E. Johnson, D. Gendre, R. Swarup, J.
Friml, L. Samuels, S. Robert, R. Bhalerao, PNAS 110 (2013) 16259–16264.
date_created: 2018-12-11T11:56:48Z
date_published: 2013-10-01T00:00:00Z
date_updated: 2025-09-29T14:22:33Z
day: '01'
department:
- _id: JiFr
doi: 10.1073/pnas.1309057110
external_id:
isi:
- '000325105500090'
pmid:
- '24043780'
intvolume: ' 110'
isi: 1
issue: '40'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3791722/
month: '10'
oa: 1
oa_version: Submitted Version
page: 16259 - 16264
pmid: 1
publication: PNAS
publication_status: published
publisher: National Academy of Sciences
publist_id: '4639'
quality_controlled: '1'
scopus_import: '1'
status: public
title: ECHIDNA mediated post Golgi trafficking of auxin carriers for differential
cell elongation
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 110
year: '2013'
...
---
_id: '2291'
abstract:
- lang: eng
text: "Cryptographic access control promises to offer easily distributed trust and
broader applicability, while reducing reliance on low-level online monitors. Traditional
implementations of cryptographic access control rely on simple cryptographic primitives
whereas recent endeavors employ primitives with richer functionality and security
guarantees. Worryingly, few of the existing cryptographic access-control schemes
come with precise guarantees, the gap between the policy specification and the
implementation being analyzed only informally, if at all. In this paper we begin
addressing this shortcoming. Unlike prior work that targeted ad-hoc policy specification,
we look at the well-established Role-Based Access Control (RBAC) model, as used
in a typical file system. In short, we provide a precise syntax for a computational
version of RBAC, offer rigorous definitions for cryptographic policy enforcement
of a large class of RBAC security policies, and demonstrate that an implementation
based on attribute-based encryption meets our security notions. We view our main
contribution as being at the conceptual level. Although we work with RBAC for
concreteness, our general methodology could guide future research for uses of
cryptography in other access-control models. \r\n"
article_processing_charge: No
author:
- first_name: Anna
full_name: Ferrara, Anna
last_name: Ferrara
- first_name: Georg
full_name: Fuchsbauer, Georg
id: 46B4C3EE-F248-11E8-B48F-1D18A9856A87
last_name: Fuchsbauer
- first_name: Bogdan
full_name: Warinschi, Bogdan
last_name: Warinschi
citation:
ama: 'Ferrara A, Fuchsbauer G, Warinschi B. Cryptographically enforced RBAC. In:
IEEE; 2013:115-129. doi:10.1109/CSF.2013.15'
apa: 'Ferrara, A., Fuchsbauer, G., & Warinschi, B. (2013). Cryptographically
enforced RBAC (pp. 115–129). Presented at the CSF: Computer Security Foundations,
New Orleans, LA, United States: IEEE. https://doi.org/10.1109/CSF.2013.15'
chicago: Ferrara, Anna, Georg Fuchsbauer, and Bogdan Warinschi. “Cryptographically
Enforced RBAC,” 115–29. IEEE, 2013. https://doi.org/10.1109/CSF.2013.15.
ieee: 'A. Ferrara, G. Fuchsbauer, and B. Warinschi, “Cryptographically enforced
RBAC,” presented at the CSF: Computer Security Foundations, New Orleans, LA, United
States, 2013, pp. 115–129.'
ista: 'Ferrara A, Fuchsbauer G, Warinschi B. 2013. Cryptographically enforced RBAC.
CSF: Computer Security Foundations, 115–129.'
mla: Ferrara, Anna, et al. Cryptographically Enforced RBAC. IEEE, 2013, pp.
115–29, doi:10.1109/CSF.2013.15.
short: A. Ferrara, G. Fuchsbauer, B. Warinschi, in:, IEEE, 2013, pp. 115–129.
conference:
end_date: 2013-09-28
location: New Orleans, LA, United States
name: 'CSF: Computer Security Foundations'
start_date: 2013-09-26
date_created: 2018-12-11T11:56:48Z
date_published: 2013-09-01T00:00:00Z
date_updated: 2025-09-29T14:22:06Z
day: '01'
department:
- _id: KrPi
doi: 10.1109/CSF.2013.15
external_id:
isi:
- '000335225600008'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://eprint.iacr.org/2013/492
month: '09'
oa: 1
oa_version: Submitted Version
page: 115 - 129
publication_status: published
publisher: IEEE
publist_id: '4637'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Cryptographically enforced RBAC
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
year: '2013'
...
---
_id: '2292'
abstract:
- lang: eng
text: This book constitutes the thoroughly refereed conference proceedings of the
38th International Symposium on Mathematical Foundations of Computer Science,
MFCS 2013, held in Klosterneuburg, Austria, in August 2013. The 67 revised full
papers presented together with six invited talks were carefully selected from
191 submissions. Topics covered include algorithmic game theory, algorithmic learning
theory, algorithms and data structures, automata, formal languages, bioinformatics,
complexity, computational geometry, computer-assisted reasoning, concurrency theory,
databases and knowledge-based systems, foundations of computing, logic in computer
science, models of computation, semantics and verification of programs, and theoretical
issues in artificial intelligence.
alternative_title:
- LNCS
citation:
ama: Chatterjee K, Sgall J, eds. Mathematical Foundations of Computer Science
2013. Vol 8087. Springer; 2013:VI-854. doi:10.1007/978-3-642-40313-2
apa: 'Chatterjee, K., & Sgall, J. (Eds.). (2013). Mathematical Foundations
of Computer Science 2013 (Vol. 8087, p. VI-854). Presented at the MFCS: Mathematical
Foundations of Computer Science, Klosterneuburg, Austria: Springer. https://doi.org/10.1007/978-3-642-40313-2'
chicago: Chatterjee, Krishnendu, and Jiri Sgall, eds. Mathematical Foundations
of Computer Science 2013. Vol. 8087. Lecture Notes in Computer Science. Springer,
2013. https://doi.org/10.1007/978-3-642-40313-2.
ieee: K. Chatterjee and J. Sgall, Eds., Mathematical Foundations of Computer
Science 2013, vol. 8087. Springer, 2013, p. VI-854.
ista: Chatterjee K, Sgall J eds. 2013. Mathematical Foundations of Computer Science
2013, Springer,p.
mla: Chatterjee, Krishnendu, and Jiri Sgall, editors. Mathematical Foundations
of Computer Science 2013. Vol. 8087, Springer, 2013, p. VI-854, doi:10.1007/978-3-642-40313-2.
short: K. Chatterjee, J. Sgall, eds., Mathematical Foundations of Computer Science
2013, Springer, 2013.
conference:
end_date: 2013-08-30
location: Klosterneuburg, Austria
name: 'MFCS: Mathematical Foundations of Computer Science'
start_date: 2013-08-26
date_created: 2018-12-11T11:56:48Z
date_published: 2013-08-08T00:00:00Z
date_updated: 2020-08-11T10:09:45Z
day: '08'
department:
- _id: KrCh
doi: 10.1007/978-3-642-40313-2
editor:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Jiri
full_name: Sgall, Jiri
last_name: Sgall
intvolume: ' 8087'
language:
- iso: eng
month: '08'
oa_version: None
page: VI - 854
publication_identifier:
isbn:
- 978-3-642-40312-5
publication_status: published
publisher: Springer
publist_id: '4636'
quality_controlled: '1'
scopus_import: 1
series_title: Lecture Notes in Computer Science
status: public
title: Mathematical Foundations of Computer Science 2013
type: conference_editor
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8087
year: '2013'
...
---
_id: '2293'
abstract:
- lang: eng
text: Many computer vision problems have an asymmetric distribution of information
between training and test time. In this work, we study the case where we are given
additional information about the training data, which however will not be available
at test time. This situation is called learning using privileged information (LUPI).
We introduce two maximum-margin techniques that are able to make use of this additional
source of information, and we show that the framework is applicable to several
scenarios that have been studied in computer vision before. Experiments with attributes,
bounding boxes, image tags and rationales as additional information in object
classification show promising results.
article_processing_charge: No
author:
- first_name: Viktoriia
full_name: Sharmanska, Viktoriia
id: 2EA6D09E-F248-11E8-B48F-1D18A9856A87
last_name: Sharmanska
orcid: 0000-0003-0192-9308
- first_name: Novi
full_name: Quadrianto, Novi
last_name: Quadrianto
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: 'Sharmanska V, Quadrianto N, Lampert C. Learning to rank using privileged information.
In: IEEE; 2013:825-832. doi:10.1109/ICCV.2013.107'
apa: 'Sharmanska, V., Quadrianto, N., & Lampert, C. (2013). Learning to rank
using privileged information (pp. 825–832). Presented at the ICCV: International
Conference on Computer Vision, Sydney, Australia: IEEE. https://doi.org/10.1109/ICCV.2013.107'
chicago: Sharmanska, Viktoriia, Novi Quadrianto, and Christoph Lampert. “Learning
to Rank Using Privileged Information,” 825–32. IEEE, 2013. https://doi.org/10.1109/ICCV.2013.107.
ieee: 'V. Sharmanska, N. Quadrianto, and C. Lampert, “Learning to rank using privileged
information,” presented at the ICCV: International Conference on Computer Vision,
Sydney, Australia, 2013, pp. 825–832.'
ista: 'Sharmanska V, Quadrianto N, Lampert C. 2013. Learning to rank using privileged
information. ICCV: International Conference on Computer Vision, 825–832.'
mla: Sharmanska, Viktoriia, et al. Learning to Rank Using Privileged Information.
IEEE, 2013, pp. 825–32, doi:10.1109/ICCV.2013.107.
short: V. Sharmanska, N. Quadrianto, C. Lampert, in:, IEEE, 2013, pp. 825–832.
conference:
end_date: 2013-12-08
location: Sydney, Australia
name: 'ICCV: International Conference on Computer Vision'
start_date: 2013-12-01
date_created: 2018-12-11T11:56:49Z
date_published: 2013-12-01T00:00:00Z
date_updated: 2025-09-29T14:20:45Z
day: '01'
department:
- _id: ChLa
doi: 10.1109/ICCV.2013.107
ec_funded: 1
external_id:
isi:
- '000351830500103'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: www.cv-foundation.org/openaccess/content_iccv_2013/papers/Sharmanska_Learning_to_Rank_2013_ICCV_paper.pdf
month: '12'
oa: 1
oa_version: Submitted Version
page: 825 - 832
project:
- _id: 2532554C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '308036'
name: Lifelong Learning of Visual Scene Understanding
publication_status: published
publisher: IEEE
publist_id: '4635'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Learning to rank using privileged information
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
year: '2013'
...
---
_id: '2294'
abstract:
- lang: eng
text: "In this work we propose a system for automatic classification of Drosophila
embryos into developmental stages.\r\nWhile the system is designed to solve an
actual problem in biological research, we believe that the principle underly-\r\ning
it is interesting not only for biologists, but also for researchers in computer
vision. The main idea is to combine two orthogonal sources of information: one
is a classifier trained on strongly invariant features, which makes it applicable
to images of very different conditions, but also leads to rather noisy predictions.
The other is a label propagation step based on a more powerful similarity measure
that however is only consistent within specific subsets of the data at a time.\r\nIn
our biological setup, the information sources are the shape and the staining patterns
of embryo images. We show\r\nexperimentally that while neither of the methods
\ can be used by itself to achieve satisfactory results, their combina-\r\ntion
achieves prediction quality comparable to human performance."
article_processing_charge: No
author:
- first_name: Tomas
full_name: Kazmar, Tomas
last_name: Kazmar
- first_name: Evgeny
full_name: Kvon, Evgeny
last_name: Kvon
- first_name: Alexander
full_name: Stark, Alexander
last_name: Stark
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: 'Kazmar T, Kvon E, Stark A, Lampert C. Drosophila Embryo Stage Annotation using
Label Propagation. In: IEEE; 2013. doi:10.1109/ICCV.2013.139'
apa: 'Kazmar, T., Kvon, E., Stark, A., & Lampert, C. (2013). Drosophila Embryo
Stage Annotation using Label Propagation. Presented at the ICCV: International
Conference on Computer Vision, Sydney, Australia: IEEE. https://doi.org/10.1109/ICCV.2013.139'
chicago: Kazmar, Tomas, Evgeny Kvon, Alexander Stark, and Christoph Lampert. “Drosophila
Embryo Stage Annotation Using Label Propagation.” IEEE, 2013. https://doi.org/10.1109/ICCV.2013.139.
ieee: 'T. Kazmar, E. Kvon, A. Stark, and C. Lampert, “Drosophila Embryo Stage Annotation
using Label Propagation,” presented at the ICCV: International Conference on Computer
Vision, Sydney, Australia, 2013.'
ista: 'Kazmar T, Kvon E, Stark A, Lampert C. 2013. Drosophila Embryo Stage Annotation
using Label Propagation. ICCV: International Conference on Computer Vision.'
mla: Kazmar, Tomas, et al. Drosophila Embryo Stage Annotation Using Label Propagation.
IEEE, 2013, doi:10.1109/ICCV.2013.139.
short: T. Kazmar, E. Kvon, A. Stark, C. Lampert, in:, IEEE, 2013.
conference:
end_date: 2013-12-08
location: Sydney, Australia
name: 'ICCV: International Conference on Computer Vision'
start_date: 2013-12-01
date_created: 2018-12-11T11:56:49Z
date_published: 2013-12-01T00:00:00Z
date_updated: 2025-09-29T14:20:15Z
day: '01'
department:
- _id: ChLa
doi: 10.1109/ICCV.2013.139
ec_funded: 1
external_id:
isi:
- '000351830500136'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.cv-foundation.org/openaccess/ICCV2013.py
month: '12'
oa: 1
oa_version: Submitted Version
project:
- _id: 2532554C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '308036'
name: Lifelong Learning of Visual Scene Understanding
publication_status: published
publisher: IEEE
publist_id: '4634'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Drosophila Embryo Stage Annotation using Label Propagation
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
year: '2013'
...
---
_id: '2295'
abstract:
- lang: eng
text: We consider partially observable Markov decision processes (POMDPs) with ω-regular
conditions specified as parity objectives. The qualitative analysis problem given
a POMDP and a parity objective asks whether there is a strategy to ensure that
the objective is satisfied with probability 1 (resp. positive probability). While
the qualitative analysis problems are known to be undecidable even for very special
cases of parity objectives, we establish decidability (with optimal EXPTIME-complete
complexity) of the qualitative analysis problems for POMDPs with all parity objectives
under finite-memory strategies. We also establish asymptotically optimal (exponential)
memory bounds.
alternative_title:
- LIPIcs
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Martin
full_name: Chmelik, Martin
id: 3624234E-F248-11E8-B48F-1D18A9856A87
last_name: Chmelik
- first_name: Mathieu
full_name: Tracol, Mathieu
id: 3F54FA38-F248-11E8-B48F-1D18A9856A87
last_name: Tracol
citation:
ama: Chatterjee K, Chmelik M, Tracol M. What is decidable about partially observable
Markov decision processes with omega-regular objectives. 2013;23:165-180. doi:10.4230/LIPIcs.CSL.2013.165
apa: 'Chatterjee, K., Chmelik, M., & Tracol, M. (2013). What is decidable about
partially observable Markov decision processes with omega-regular objectives.
Presented at the CSL: Computer Science Logic, Torino, Italy: Schloss Dagstuhl
- Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CSL.2013.165'
chicago: Chatterjee, Krishnendu, Martin Chmelik, and Mathieu Tracol. “What Is Decidable
about Partially Observable Markov Decision Processes with Omega-Regular Objectives.”
Leibniz International Proceedings in Informatics. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2013. https://doi.org/10.4230/LIPIcs.CSL.2013.165.
ieee: K. Chatterjee, M. Chmelik, and M. Tracol, “What is decidable about partially
observable Markov decision processes with omega-regular objectives,” vol. 23.
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 165–180, 2013.
ista: Chatterjee K, Chmelik M, Tracol M. 2013. What is decidable about partially
observable Markov decision processes with omega-regular objectives. 23, 165–180.
mla: Chatterjee, Krishnendu, et al. What Is Decidable about Partially Observable
Markov Decision Processes with Omega-Regular Objectives. Vol. 23, Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2013, pp. 165–80, doi:10.4230/LIPIcs.CSL.2013.165.
short: K. Chatterjee, M. Chmelik, M. Tracol, 23 (2013) 165–180.
conference:
end_date: 2013-09-05
location: Torino, Italy
name: 'CSL: Computer Science Logic'
start_date: 2013-09-02
date_created: 2018-12-11T11:56:50Z
date_published: 2013-08-27T00:00:00Z
date_updated: 2025-09-18T11:38:38Z
day: '27'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.4230/LIPIcs.CSL.2013.165
ec_funded: 1
file:
- access_level: open_access
checksum: ba2828322955574d9283bea0e17a37a6
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:09:42Z
date_updated: 2020-07-14T12:45:37Z
file_id: '4766'
file_name: IST-2017-756-v1+1_2.pdf
file_size: 345171
relation: main_file
file_date_updated: 2020-07-14T12:45:37Z
has_accepted_license: '1'
intvolume: ' 23'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
page: 165 - 180
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '4633'
pubrep_id: '756'
quality_controlled: '1'
related_material:
record:
- id: '5400'
relation: earlier_version
status: public
- id: '1477'
relation: later_version
status: public
scopus_import: 1
series_title: Leibniz International Proceedings in Informatics
status: public
title: What is decidable about partially observable Markov decision processes with
omega-regular objectives
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: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 23
year: '2013'
...
---
_id: '2297'
abstract:
- lang: eng
text: We present an overview of mathematical results on the low temperature properties
of dilute quantum gases, which have been obtained in the past few years. The presentation
includes a discussion of Bose-Einstein condensation, the excitation spectrum for
trapped gases and its relation to superfluidity, as well as the appearance of
quantized vortices in rotating systems. All these properties are intensely being
studied in current experiments on cold atomic gases. We will give a description
of the mathematics involved in understanding these phenomena, starting from the
underlying many-body Schrödinger equation.
article_processing_charge: No
arxiv: 1
author:
- first_name: Robert
full_name: Seiringer, Robert
id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
last_name: Seiringer
orcid: 0000-0002-6781-0521
citation:
ama: 'Seiringer R. Hot topics in cold gases: A mathematical physics perspective.
Japanese Journal of Mathematics. 2013;8(2):185-232. doi:10.1007/s11537-013-1264-5'
apa: 'Seiringer, R. (2013). Hot topics in cold gases: A mathematical physics perspective.
Japanese Journal of Mathematics. Springer. https://doi.org/10.1007/s11537-013-1264-5'
chicago: 'Seiringer, Robert. “Hot Topics in Cold Gases: A Mathematical Physics Perspective.”
Japanese Journal of Mathematics. Springer, 2013. https://doi.org/10.1007/s11537-013-1264-5.'
ieee: 'R. Seiringer, “Hot topics in cold gases: A mathematical physics perspective,”
Japanese Journal of Mathematics, vol. 8, no. 2. Springer, pp. 185–232,
2013.'
ista: 'Seiringer R. 2013. Hot topics in cold gases: A mathematical physics perspective.
Japanese Journal of Mathematics. 8(2), 185–232.'
mla: 'Seiringer, Robert. “Hot Topics in Cold Gases: A Mathematical Physics Perspective.”
Japanese Journal of Mathematics, vol. 8, no. 2, Springer, 2013, pp. 185–232,
doi:10.1007/s11537-013-1264-5.'
short: R. Seiringer, Japanese Journal of Mathematics 8 (2013) 185–232.
corr_author: '1'
date_created: 2018-12-11T11:56:50Z
date_published: 2013-09-24T00:00:00Z
date_updated: 2025-09-29T14:19:17Z
day: '24'
department:
- _id: RoSe
doi: 10.1007/s11537-013-1264-5
external_id:
arxiv:
- '0908.3686'
isi:
- '000324648700001'
intvolume: ' 8'
isi: 1
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/0908.3686
month: '09'
oa: 1
oa_version: Preprint
page: 185 - 232
publication: Japanese Journal of Mathematics
publication_status: published
publisher: Springer
publist_id: '4631'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Hot topics in cold gases: A mathematical physics perspective'
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 8
year: '2013'
...
---
_id: '2298'
abstract:
- lang: eng
text: "We present a shape analysis for programs that manipulate overlaid data structures
which share sets of objects. The abstract domain contains Separation Logic formulas
that (1) combine a per-object separating conjunction with a per-field separating
conjunction and (2) constrain a set of variables interpreted as sets of objects.
The definition of the abstract domain operators is based on a notion of homomorphism
between formulas, viewed as graphs, used recently to define optimal decision procedures
for fragments of the Separation Logic. Based on a Frame Rule that supports the
two versions of the separating conjunction, the analysis is able to reason in
a modular manner about non-overlaid data structures and then, compose information
only at a few program points, e.g., procedure returns. We have implemented this
analysis in a prototype tool and applied it on several interesting case studies
that manipulate overlaid and nested linked lists.\r\n"
alternative_title:
- LNCS
author:
- first_name: Cezara
full_name: Dragoi, Cezara
id: 2B2B5ED0-F248-11E8-B48F-1D18A9856A87
last_name: Dragoi
- first_name: Constantin
full_name: Enea, Constantin
last_name: Enea
- first_name: Mihaela
full_name: Sighireanu, Mihaela
last_name: Sighireanu
citation:
ama: 'Dragoi C, Enea C, Sighireanu M. Local shape analysis for overlaid data structures.
In: Vol 7935. Springer; 2013:150-171. doi:10.1007/978-3-642-38856-9_10'
apa: 'Dragoi, C., Enea, C., & Sighireanu, M. (2013). Local shape analysis for
overlaid data structures (Vol. 7935, pp. 150–171). Presented at the SAS: Static
Analysis Symposium, Seattle, WA, United States: Springer. https://doi.org/10.1007/978-3-642-38856-9_10'
chicago: Dragoi, Cezara, Constantin Enea, and Mihaela Sighireanu. “Local Shape Analysis
for Overlaid Data Structures,” 7935:150–71. Springer, 2013. https://doi.org/10.1007/978-3-642-38856-9_10.
ieee: 'C. Dragoi, C. Enea, and M. Sighireanu, “Local shape analysis for overlaid
data structures,” presented at the SAS: Static Analysis Symposium, Seattle, WA,
United States, 2013, vol. 7935, pp. 150–171.'
ista: 'Dragoi C, Enea C, Sighireanu M. 2013. Local shape analysis for overlaid data
structures. SAS: Static Analysis Symposium, LNCS, vol. 7935, 150–171.'
mla: Dragoi, Cezara, et al. Local Shape Analysis for Overlaid Data Structures.
Vol. 7935, Springer, 2013, pp. 150–71, doi:10.1007/978-3-642-38856-9_10.
short: C. Dragoi, C. Enea, M. Sighireanu, in:, Springer, 2013, pp. 150–171.
conference:
end_date: 2013-06-22
location: Seattle, WA, United States
name: 'SAS: Static Analysis Symposium'
start_date: 2013-06-20
date_created: 2018-12-11T11:56:50Z
date_published: 2013-01-01T00:00:00Z
date_updated: 2021-01-12T06:56:36Z
day: '01'
ddc:
- '000'
- '004'
department:
- _id: ToHe
doi: 10.1007/978-3-642-38856-9_10
ec_funded: 1
file:
- access_level: open_access
checksum: 907edd33a5892e3af093365f1fd57ed7
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:10:36Z
date_updated: 2020-07-14T12:45:37Z
file_id: '4824'
file_name: IST-2014-196-v1+1_sas13.pdf
file_size: 299004
relation: main_file
file_date_updated: 2020-07-14T12:45:37Z
has_accepted_license: '1'
intvolume: ' 7935'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Submitted Version
page: 150 - 171
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
publication_status: published
publisher: Springer
publist_id: '4630'
pubrep_id: '196'
quality_controlled: '1'
scopus_import: 1
status: public
title: Local shape analysis for overlaid data structures
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 7935
year: '2013'
...
---
_id: '2299'
abstract:
- lang: eng
text: 'The standard hardware design flow involves: (a) design of an integrated circuit
using a hardware description language, (b) extensive functional and formal verification,
and (c) logical synthesis. However, the above-mentioned processes consume significant
effort and time. An alternative approach is to use a formal specification language
as a high-level hardware description language and synthesize hardware from formal
specifications. Our work is a case study of the synthesis of the widely and industrially
used AMBA AHB protocol from formal specifications. Bloem et al. presented the
first formal specifications for the AMBA AHB Arbiter and synthesized the AHB Arbiter
circuit. However, in the first formal specification some important assumptions
were missing. Our contributions are as follows: (a) We present detailed formal
specifications for the AHB Arbiter incorporating the missing details, and obtain
significant improvements in the synthesis results (both with respect to the number
of gates in the synthesized circuit and with respect to the time taken to synthesize
the circuit), and (b) we present formal specifications to generate compact circuits
for the remaining two main components of AMBA AHB, namely, AHB Master and AHB
Slave. Thus with systematic description we are able to automatically and completely
synthesize an important and widely used industrial protocol.'
author:
- first_name: Yashdeep
full_name: Godhal, Yashdeep
id: 5B547124-EB61-11E9-8887-89D9C04DBDF5
last_name: Godhal
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
citation:
ama: 'Godhal Y, Chatterjee K, Henzinger TA. Synthesis of AMBA AHB from formal specification:
A case study. International Journal on Software Tools for Technology Transfer.
2013;15(5-6):585-601. doi:10.1007/s10009-011-0207-9'
apa: 'Godhal, Y., Chatterjee, K., & Henzinger, T. A. (2013). Synthesis of AMBA
AHB from formal specification: A case study. International Journal on Software
Tools for Technology Transfer. Springer. https://doi.org/10.1007/s10009-011-0207-9'
chicago: 'Godhal, Yashdeep, Krishnendu Chatterjee, and Thomas A Henzinger. “Synthesis
of AMBA AHB from Formal Specification: A Case Study.” International Journal
on Software Tools for Technology Transfer. Springer, 2013. https://doi.org/10.1007/s10009-011-0207-9.'
ieee: 'Y. Godhal, K. Chatterjee, and T. A. Henzinger, “Synthesis of AMBA AHB from
formal specification: A case study,” International Journal on Software Tools
for Technology Transfer, vol. 15, no. 5–6. Springer, pp. 585–601, 2013.'
ista: 'Godhal Y, Chatterjee K, Henzinger TA. 2013. Synthesis of AMBA AHB from formal
specification: A case study. International Journal on Software Tools for Technology
Transfer. 15(5–6), 585–601.'
mla: 'Godhal, Yashdeep, et al. “Synthesis of AMBA AHB from Formal Specification:
A Case Study.” International Journal on Software Tools for Technology Transfer,
vol. 15, no. 5–6, Springer, 2013, pp. 585–601, doi:10.1007/s10009-011-0207-9.'
short: Y. Godhal, K. Chatterjee, T.A. Henzinger, International Journal on Software
Tools for Technology Transfer 15 (2013) 585–601.
corr_author: '1'
date_created: 2018-12-11T11:56:51Z
date_published: 2013-10-01T00:00:00Z
date_updated: 2024-10-09T20:55:16Z
day: '01'
ddc:
- '000'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1007/s10009-011-0207-9
file:
- access_level: open_access
checksum: 57b06a732dd8d6349190dba6b5b0d33b
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:11:53Z
date_updated: 2020-07-14T12:45:37Z
file_id: '4910'
file_name: IST-2012-87-v1+1_Synthesis_of_AMBA_AHB_from_formal_specifications-_A_case_study.pdf
file_size: 277372
relation: main_file
file_date_updated: 2020-07-14T12:45:37Z
has_accepted_license: '1'
intvolume: ' 15'
issue: 5-6
language:
- iso: eng
month: '10'
oa: 1
oa_version: Submitted Version
page: 585 - 601
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: International Journal on Software Tools for Technology Transfer
publication_status: published
publisher: Springer
publist_id: '4629'
pubrep_id: '87'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'Synthesis of AMBA AHB from formal specification: A case study'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 15
year: '2013'
...
---
_id: '2300'
abstract:
- lang: eng
text: We consider Ising models in two and three dimensions with nearest neighbor
ferromagnetic interactions and long-range, power law decaying, antiferromagnetic
interactions. If the strength of the ferromagnetic coupling J is larger than a
critical value Jc, then the ground state is homogeneous and ferromagnetic. As
the critical value is approached from smaller values of J, it is believed that
the ground state consists of a periodic array of stripes (d=2) or slabs (d=3),
all of the same size and alternating magnetization. Here we prove rigorously that
the ground state energy per site converges to that of the optimal periodic striped
or slabbed state, in the limit that J tends to the ferromagnetic transition point.
While this theorem does not prove rigorously that the ground state is precisely
striped or slabbed, it does prove that in any suitably large box the ground state
is striped or slabbed with high probability.
article_number: '064401'
article_processing_charge: No
arxiv: 1
author:
- first_name: Alessandro
full_name: Giuliani, Alessandro
last_name: Giuliani
- first_name: Élliott
full_name: Lieb, Élliott
last_name: Lieb
- first_name: Robert
full_name: Seiringer, Robert
id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
last_name: Seiringer
orcid: 0000-0002-6781-0521
citation:
ama: Giuliani A, Lieb É, Seiringer R. Realization of stripes and slabs in two and
three dimensions. Physical Review B. 2013;88(6). doi:10.1103/PhysRevB.88.064401
apa: Giuliani, A., Lieb, É., & Seiringer, R. (2013). Realization of stripes
and slabs in two and three dimensions. Physical Review B. American Physical
Society. https://doi.org/10.1103/PhysRevB.88.064401
chicago: Giuliani, Alessandro, Élliott Lieb, and Robert Seiringer. “Realization
of Stripes and Slabs in Two and Three Dimensions.” Physical Review B. American
Physical Society, 2013. https://doi.org/10.1103/PhysRevB.88.064401.
ieee: A. Giuliani, É. Lieb, and R. Seiringer, “Realization of stripes and slabs
in two and three dimensions,” Physical Review B, vol. 88, no. 6. American
Physical Society, 2013.
ista: Giuliani A, Lieb É, Seiringer R. 2013. Realization of stripes and slabs in
two and three dimensions. Physical Review B. 88(6), 064401.
mla: Giuliani, Alessandro, et al. “Realization of Stripes and Slabs in Two and Three
Dimensions.” Physical Review B, vol. 88, no. 6, 064401, American Physical
Society, 2013, doi:10.1103/PhysRevB.88.064401.
short: A. Giuliani, É. Lieb, R. Seiringer, Physical Review B 88 (2013).
date_created: 2018-12-11T11:56:51Z
date_published: 2013-08-01T00:00:00Z
date_updated: 2025-09-29T14:18:13Z
day: '01'
department:
- _id: RoSe
doi: 10.1103/PhysRevB.88.064401
external_id:
arxiv:
- '1305.5323'
isi:
- '000322721000002'
intvolume: ' 88'
isi: 1
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1305.5323
month: '08'
oa: 1
oa_version: Preprint
publication: Physical Review B
publication_status: published
publisher: American Physical Society
publist_id: '4627'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Realization of stripes and slabs in two and three dimensions
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 88
year: '2013'
...
---
_id: '2301'
abstract:
- lang: eng
text: We describe the design and implementation of P, a domain-specific language
to write asynchronous event driven code. P allows the programmer to specify the
system as a collection of interacting state machines, which communicate with each
other using events. P unifies modeling and programming into one activity for the
programmer. Not only can a P program be compiled into executable code, but it
can also be tested using model checking techniques. P allows the programmer to
specify the environment, used to "close" the system during testing,
as nondeterministic ghost machines. Ghost machines are erased during compilation
to executable code; a type system ensures that the erasure is semantics preserving.
The P language is designed so that a P program can be checked for responsiveness-the
ability to handle every event in a timely manner. By default, a machine needs
to handle every event that arrives in every state. But handling every event in
every state is impractical. The language provides a notion of deferred events
where the programmer can annotate when she wants to delay processing an event.
The default safety checker looks for presence of unhan-dled events. The language
also provides default liveness checks that an event cannot be potentially deferred
forever. P was used to implement and verify the core of the USB device driver
stack that ships with Microsoft Windows 8. The resulting driver is more reliable
and performs better than its prior incarnation (which did not use P); we have
more confidence in the robustness of its design due to the language abstractions
and verification provided by P.
author:
- first_name: Ankush
full_name: Desai, Ankush
last_name: Desai
- first_name: Vivek
full_name: Gupta, Vivek
last_name: Gupta
- first_name: Ethan
full_name: Jackson, Ethan
last_name: Jackson
- first_name: Shaz
full_name: Qadeer, Shaz
last_name: Qadeer
- first_name: Sriram
full_name: Rajamani, Sriram
last_name: Rajamani
- first_name: Damien
full_name: Zufferey, Damien
id: 4397AC76-F248-11E8-B48F-1D18A9856A87
last_name: Zufferey
orcid: 0000-0002-3197-8736
citation:
ama: 'Desai A, Gupta V, Jackson E, Qadeer S, Rajamani S, Zufferey D. P: Safe asynchronous
event-driven programming. In: Proceedings of the 34th ACM SIGPLAN Conference
on Programming Language Design and Implementation. ACM; 2013:321-331. doi:10.1145/2491956.2462184'
apa: 'Desai, A., Gupta, V., Jackson, E., Qadeer, S., Rajamani, S., & Zufferey,
D. (2013). P: Safe asynchronous event-driven programming. In Proceedings of
the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation
(pp. 321–331). Seattle, WA, United States: ACM. https://doi.org/10.1145/2491956.2462184'
chicago: 'Desai, Ankush, Vivek Gupta, Ethan Jackson, Shaz Qadeer, Sriram Rajamani,
and Damien Zufferey. “P: Safe Asynchronous Event-Driven Programming.” In Proceedings
of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation,
321–31. ACM, 2013. https://doi.org/10.1145/2491956.2462184.'
ieee: 'A. Desai, V. Gupta, E. Jackson, S. Qadeer, S. Rajamani, and D. Zufferey,
“P: Safe asynchronous event-driven programming,” in Proceedings of the 34th
ACM SIGPLAN Conference on Programming Language Design and Implementation,
Seattle, WA, United States, 2013, pp. 321–331.'
ista: 'Desai A, Gupta V, Jackson E, Qadeer S, Rajamani S, Zufferey D. 2013. P: Safe
asynchronous event-driven programming. Proceedings of the 34th ACM SIGPLAN Conference
on Programming Language Design and Implementation. PLDI: Programming Languages
Design and Implementation, 321–331.'
mla: 'Desai, Ankush, et al. “P: Safe Asynchronous Event-Driven Programming.” Proceedings
of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation,
ACM, 2013, pp. 321–31, doi:10.1145/2491956.2462184.'
short: A. Desai, V. Gupta, E. Jackson, S. Qadeer, S. Rajamani, D. Zufferey, in:,
Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design
and Implementation, ACM, 2013, pp. 321–331.
conference:
end_date: 2013-06-19
location: Seattle, WA, United States
name: 'PLDI: Programming Languages Design and Implementation'
start_date: 2013-06-16
date_created: 2018-12-11T11:56:52Z
date_published: 2013-06-01T00:00:00Z
date_updated: 2021-01-12T06:56:38Z
day: '01'
department:
- _id: ToHe
doi: 10.1145/2491956.2462184
ec_funded: 1
language:
- iso: eng
main_file_link:
- url: http://research.microsoft.com/pubs/191069/pldi212_desai.pdf
month: '06'
oa_version: None
page: 321 - 331
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
publication: Proceedings of the 34th ACM SIGPLAN Conference on Programming Language
Design and Implementation
publication_status: published
publisher: ACM
publist_id: '4626'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'P: Safe asynchronous event-driven programming'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2013'
...
---
_id: '2303'
abstract:
- lang: eng
text: MADM (Mosaic Analysis with Double Markers) technology offers a genetic approach
in mice to visualize and concomitantly manipulate genetically defined cells at
clonal level and single cell resolution. MADM employs Cre recombinase/loxP-dependent
interchromosomal mitotic recombination to reconstitute two split marker genes—green
GFP and red tdTomato—and can label sparse clones of homozygous mutant cells in
one color and wild-type cells in the other color in an otherwise unlabeled background.
At present, major MADM applications include lineage tracing, single cell labeling,
conditional knockouts in small populations of cells and induction of uniparental
chromosome disomy to assess effects of genomic imprinting. MADM can be applied
universally in the mouse with the sole limitation being the specificity of the
promoter controlling Cre recombinase expression. Here I review recent developments
and extensions of the MADM technique and give an overview of the major discoveries
and progresses enabled by the implementation of the novel genetic MADM tools.
acknowledgement: This work was supported by IST Austria institutional funds.
article_type: review
author:
- first_name: Simon
full_name: Hippenmeyer, Simon
id: 37B36620-F248-11E8-B48F-1D18A9856A87
last_name: Hippenmeyer
orcid: 0000-0003-2279-1061
citation:
ama: Hippenmeyer S. Dissection of gene function at clonal level using mosaic analysis
with double markers. Frontiers in Biology. 2013;8(6):557-568. doi:10.1007/s11515-013-1279-6
apa: Hippenmeyer, S. (2013). Dissection of gene function at clonal level using mosaic
analysis with double markers. Frontiers in Biology. Springer. https://doi.org/10.1007/s11515-013-1279-6
chicago: Hippenmeyer, Simon. “Dissection of Gene Function at Clonal Level Using
Mosaic Analysis with Double Markers.” Frontiers in Biology. Springer, 2013.
https://doi.org/10.1007/s11515-013-1279-6.
ieee: S. Hippenmeyer, “Dissection of gene function at clonal level using mosaic
analysis with double markers,” Frontiers in Biology, vol. 8, no. 6. Springer,
pp. 557–568, 2013.
ista: Hippenmeyer S. 2013. Dissection of gene function at clonal level using mosaic
analysis with double markers. Frontiers in Biology. 8(6), 557–568.
mla: Hippenmeyer, Simon. “Dissection of Gene Function at Clonal Level Using Mosaic
Analysis with Double Markers.” Frontiers in Biology, vol. 8, no. 6, Springer,
2013, pp. 557–68, doi:10.1007/s11515-013-1279-6.
short: S. Hippenmeyer, Frontiers in Biology 8 (2013) 557–568.
corr_author: '1'
date_created: 2018-12-11T11:56:52Z
date_published: 2013-09-03T00:00:00Z
date_updated: 2024-10-09T20:55:16Z
day: '03'
department:
- _id: SiHi
doi: 10.1007/s11515-013-1279-6
intvolume: ' 8'
issue: '6'
language:
- iso: eng
month: '09'
oa_version: None
page: 557 - 568
publication: Frontiers in Biology
publication_status: published
publisher: Springer
publist_id: '4624'
quality_controlled: '1'
scopus_import: 1
status: public
title: Dissection of gene function at clonal level using mosaic analysis with double
markers
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 8
year: '2013'
...
---
_id: '2304'
abstract:
- lang: eng
text: This extended abstract is concerned with the irregularities of distribution
of one-dimensional permuted van der Corput sequences that are generated from linear
permutations. We show how to obtain upper bounds for the discrepancy and diaphony
of these sequences, by relating them to Kronecker sequences and applying earlier
results of Faure and Niederreiter.
acknowledgement: This research is supported by the Graduate school of IST Austria
(Institute of Science and Technology Austria).
author:
- first_name: Florian
full_name: Pausinger, Florian
id: 2A77D7A2-F248-11E8-B48F-1D18A9856A87
last_name: Pausinger
orcid: 0000-0002-8379-3768
citation:
ama: Pausinger F. Van der Corput sequences and linear permutations. Electronic
Notes in Discrete Mathematics. 2013;43:43-50. doi:10.1016/j.endm.2013.07.008
apa: Pausinger, F. (2013). Van der Corput sequences and linear permutations. Electronic
Notes in Discrete Mathematics. Elsevier. https://doi.org/10.1016/j.endm.2013.07.008
chicago: Pausinger, Florian. “Van Der Corput Sequences and Linear Permutations.”
Electronic Notes in Discrete Mathematics. Elsevier, 2013. https://doi.org/10.1016/j.endm.2013.07.008.
ieee: F. Pausinger, “Van der Corput sequences and linear permutations,” Electronic
Notes in Discrete Mathematics, vol. 43. Elsevier, pp. 43–50, 2013.
ista: Pausinger F. 2013. Van der Corput sequences and linear permutations. Electronic
Notes in Discrete Mathematics. 43, 43–50.
mla: Pausinger, Florian. “Van Der Corput Sequences and Linear Permutations.” Electronic
Notes in Discrete Mathematics, vol. 43, Elsevier, 2013, pp. 43–50, doi:10.1016/j.endm.2013.07.008.
short: F. Pausinger, Electronic Notes in Discrete Mathematics 43 (2013) 43–50.
corr_author: '1'
date_created: 2018-12-11T11:56:53Z
date_published: 2013-09-05T00:00:00Z
date_updated: 2024-10-09T20:55:15Z
day: '05'
department:
- _id: HeEd
doi: 10.1016/j.endm.2013.07.008
intvolume: ' 43'
language:
- iso: eng
month: '09'
oa_version: None
page: 43 - 50
publication: Electronic Notes in Discrete Mathematics
publication_status: published
publisher: Elsevier
publist_id: '4623'
quality_controlled: '1'
scopus_import: 1
status: public
title: Van der Corput sequences and linear permutations
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 43
year: '2013'
...
---
_id: '2305'
abstract:
- lang: eng
text: We study the complexity of central controller synthesis problems for finite-state
Markov decision processes, where the objective is to optimize both the expected
mean-payoff performance of the system and its stability. e argue that the basic
theoretical notion of expressing the stability in terms of the variance of the
mean-payoff (called global variance in our paper) is not always sufficient, since
it ignores possible instabilities on respective runs. For this reason we propose
alernative definitions of stability, which we call local and hybrid variance,
and which express how rewards on each run deviate from the run's own mean-payoff
and from the expected mean-payoff, respectively. We show that a strategy ensuring
both the expected mean-payoff and the variance below given bounds requires randomization
and memory, under all the above semantics of variance. We then look at the problem
of determining whether there is a such a strategy. For the global variance, we
show that the problem is in PSPACE, and that the answer can be approximated in
pseudo-polynomial time. For the hybrid variance, the analogous decision problem
is in NP, and a polynomial-time approximating algorithm also exists. For local
variance, we show that the decision problem is in NP. Since the overall performance
can be traded for stability (and vice versa), we also present algorithms for approximating
the associated Pareto curve in all the three cases. Finally, we study a special
case of the decision problems, where we require a given expected mean-payoff together
with zero variance. Here we show that the problems can be all solved in polynomial
time.
article_processing_charge: No
arxiv: 1
author:
- first_name: Tomáš
full_name: Brázdil, Tomáš
last_name: Brázdil
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Vojtěch
full_name: Forejt, Vojtěch
last_name: Forejt
- first_name: Antonín
full_name: Kučera, Antonín
last_name: Kučera
citation:
ama: 'Brázdil T, Chatterjee K, Forejt V, Kučera A. Trading performance for stability
in Markov decision processes. In: 28th Annual ACM/IEEE Symposium. IEEE;
2013:331-340. doi:10.1109/LICS.2013.39'
apa: 'Brázdil, T., Chatterjee, K., Forejt, V., & Kučera, A. (2013). Trading
performance for stability in Markov decision processes. In 28th Annual ACM/IEEE
Symposium (pp. 331–340). New Orleans, LA, United States: IEEE. https://doi.org/10.1109/LICS.2013.39'
chicago: Brázdil, Tomáš, Krishnendu Chatterjee, Vojtěch Forejt, and Antonín Kučera.
“Trading Performance for Stability in Markov Decision Processes.” In 28th Annual
ACM/IEEE Symposium, 331–40. IEEE, 2013. https://doi.org/10.1109/LICS.2013.39.
ieee: T. Brázdil, K. Chatterjee, V. Forejt, and A. Kučera, “Trading performance
for stability in Markov decision processes,” in 28th Annual ACM/IEEE Symposium,
New Orleans, LA, United States, 2013, pp. 331–340.
ista: 'Brázdil T, Chatterjee K, Forejt V, Kučera A. 2013. Trading performance for
stability in Markov decision processes. 28th Annual ACM/IEEE Symposium. LICS:
Logic in Computer Science, 331–340.'
mla: Brázdil, Tomáš, et al. “Trading Performance for Stability in Markov Decision
Processes.” 28th Annual ACM/IEEE Symposium, IEEE, 2013, pp. 331–40, doi:10.1109/LICS.2013.39.
short: T. Brázdil, K. Chatterjee, V. Forejt, A. Kučera, in:, 28th Annual ACM/IEEE
Symposium, IEEE, 2013, pp. 331–340.
conference:
end_date: 2013-06-28
location: New Orleans, LA, United States
name: 'LICS: Logic in Computer Science'
start_date: 2013-06-25
date_created: 2018-12-11T11:56:53Z
date_published: 2013-08-01T00:00:00Z
date_updated: 2025-09-29T14:16:57Z
day: '01'
department:
- _id: KrCh
doi: 10.1109/LICS.2013.39
ec_funded: 1
external_id:
arxiv:
- '1305.4103'
isi:
- '000326815000038'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1305.4103
month: '08'
oa: 1
oa_version: Preprint
page: 331 - 340
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: 28th Annual ACM/IEEE Symposium
publication_status: published
publisher: IEEE
publist_id: '4622'
quality_controlled: '1'
related_material:
record:
- id: '1294'
relation: later_version
status: public
scopus_import: '1'
status: public
title: Trading performance for stability in Markov decision processes
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
year: '2013'
...
---
_id: '2306'
abstract:
- lang: ger
text: Das Buch ist sowohl eine Einführung in die Themen Linked Data, Open Data und
Open Linked Data als es auch den konkreten Bezug auf Bibliotheken behandelt. Hierzu
werden konkrete Anwendungsprojekte beschrieben. Der Band wendet sich dabei sowohl
an Personen aus der Bibliothekspraxis als auch an Personen aus dem Bibliotheksmanagement,
die noch nicht mit dem Thema vertraut sind.
alternative_title:
- Bibliotheks- und Informationspraxis
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: Adrian
full_name: Pohl, Adrian
last_name: Pohl
citation:
ama: Danowski P, Pohl A. (Open) Linked Data in Bibliotheken. Vol 50. De Gruyter;
2013. doi:10.1515/9783110278736
apa: Danowski, P., & Pohl, A. (2013). (Open) Linked Data in Bibliotheken
(Vol. 50). De Gruyter. https://doi.org/10.1515/9783110278736
chicago: Danowski, Patrick, and Adrian Pohl. (Open) Linked Data in Bibliotheken.
Vol. 50. De Gruyter, 2013. https://doi.org/10.1515/9783110278736.
ieee: P. Danowski and A. Pohl, (Open) Linked Data in Bibliotheken, vol. 50.
De Gruyter, 2013.
ista: Danowski P, Pohl A. 2013. (Open) Linked Data in Bibliotheken, De Gruyter,p.
mla: Danowski, Patrick, and Adrian Pohl. (Open) Linked Data in Bibliotheken.
Vol. 50, De Gruyter, 2013, doi:10.1515/9783110278736.
short: P. Danowski, A. Pohl, (Open) Linked Data in Bibliotheken, De Gruyter, 2013.
date_created: 2018-12-11T11:56:53Z
date_published: 2013-09-13T00:00:00Z
date_updated: 2021-12-21T12:17:19Z
day: '13'
ddc:
- '020'
department:
- _id: E-Lib
doi: 10.1515/9783110278736
file:
- access_level: open_access
checksum: 807a408bbee519d792702828a32c6e85
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:09:49Z
date_updated: 2020-07-14T12:45:38Z
file_id: '4774'
file_name: IST-2017-725-v1+1_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Frontmatter.pdf
file_size: 67731
relation: main_file
- access_level: open_access
checksum: 587e95c2ba24307a5a5d5bd1579429d9
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:09:50Z
date_updated: 2020-07-14T12:45:38Z
file_id: '4775'
file_name: IST-2017-725-v1+2_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Inhalt.pdf
file_size: 43563
relation: main_file
- access_level: open_access
checksum: dbcada36bb32d725d9838615706e700f
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:09:51Z
date_updated: 2020-07-14T12:45:38Z
file_id: '4776'
file_name: IST-2017-725-v1+3_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Linked_Open_Data_in_der_Bibliothekswelt__Grundlagen_und_Überblick.pdf
file_size: 11318599
relation: main_file
- access_level: open_access
checksum: 5235712bf0a49ccc8c2cb4f6c2560d43
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:09:52Z
date_updated: 2020-07-14T12:45:38Z
file_id: '4777'
file_name: IST-2017-725-v1+4_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Vokabulare_für_bibliographische_Daten.pdf
file_size: 330210
relation: main_file
- access_level: open_access
checksum: d851cc91f705da80617ac7df33c1c0e1
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:09:53Z
date_updated: 2020-07-14T12:45:38Z
file_id: '4778'
file_name: IST-2017-725-v1+5_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_FRBR,_Serials_und_CIDOC_CRM_-_Modellierung_von_fortlaufenden_Sammelwerken_unter_Verwendung_von_FRBRoo.pdf
file_size: 10652088
relation: main_file
- access_level: open_access
checksum: 4e77b182692c58e50fc5251bf23cc584
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:09:54Z
date_updated: 2020-07-14T12:45:38Z
file_id: '4779'
file_name: IST-2017-725-v1+6_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Die_Provenienz_von_Linked_Data.pdf
file_size: 6125273
relation: main_file
- access_level: open_access
checksum: 3debae38064d5099d22f855c353a57ec
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:09:55Z
date_updated: 2020-07-14T12:45:38Z
file_id: '4780'
file_name: IST-2017-725-v1+7_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Forschungsdaten.pdf
file_size: 1893872
relation: main_file
- access_level: open_access
checksum: e630b330dc0b7522d2cf204587030252
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:09:56Z
date_updated: 2020-07-14T12:45:38Z
file_id: '4781'
file_name: IST-2017-725-v1+8_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Datenanreicherung_auf_LOD-Basis.pdf
file_size: 1095929
relation: main_file
- access_level: open_access
checksum: 17edda91271bfcce8e1b6e77ca1c9d11
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:09:57Z
date_updated: 2020-07-14T12:45:38Z
file_id: '4782'
file_name: IST-2017-725-v1+9_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Herausforderung_Wissensvernetzung.pdf
file_size: 149699
relation: main_file
- access_level: open_access
checksum: aacef6734b1de58aeb58024fc47c2373
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:09:58Z
date_updated: 2020-07-14T12:45:38Z
file_id: '4783'
file_name: IST-2017-725-v1+10_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Linked_Open_Data_geht_in_die_Fläche__Der_B3Kat_stellt_seine_Daten_frei.pdf
file_size: 8828405
relation: main_file
- access_level: open_access
checksum: 0619451f7ff3ea641ce0b10c97831f47
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:09:59Z
date_updated: 2020-07-14T12:45:38Z
file_id: '4784'
file_name: IST-2017-725-v1+11_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Open_Data_und_Linked_Data_in_einem_Informationssystem_für_die_Archäologie.pdf
file_size: 3191208
relation: main_file
- access_level: open_access
checksum: 44dc8a9fc003f0edd912968958715a23
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:10:00Z
date_updated: 2020-07-14T12:45:38Z
file_id: '4785'
file_name: IST-2017-725-v1+12_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Definition__Offenes_Wissen.pdf
file_size: 78315
relation: main_file
- access_level: open_access
checksum: 48133cecebfd839b77f84f557d530c00
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:10:01Z
date_updated: 2020-07-14T12:45:38Z
file_id: '4786'
file_name: IST-2017-725-v1+13_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Prinzipien_zu_offenen_bibliographischen_Daten.pdf
file_size: 90532
relation: main_file
- access_level: open_access
checksum: a359224ddfdb178fed72b228dcfb699a
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:10:02Z
date_updated: 2020-07-14T12:45:38Z
file_id: '4787'
file_name: IST-2017-725-v1+14_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Empfehlungen_zur_Öffnung_bibliothekarischer_Daten.pdf
file_size: 90771
relation: main_file
- access_level: open_access
checksum: 0d2dd31d537c7a495999149d00eaffbf
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:10:03Z
date_updated: 2020-07-14T12:45:38Z
file_id: '4788'
file_name: IST-2017-725-v1+15_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Glossar.pdf
file_size: 1830232
relation: main_file
file_date_updated: 2020-07-14T12:45:38Z
has_accepted_license: '1'
intvolume: ' 50'
language:
- iso: ger
month: '09'
oa: 1
oa_version: Published Version
publication_identifier:
eisbn:
- 9-783-1102-7873-6
isbn:
- ' 978-3-11-027634-3'
issn:
- 2191-3587
publication_status: published
publisher: De Gruyter
publist_id: '4621'
pubrep_id: '725'
quality_controlled: '1'
status: public
title: (Open) Linked Data in Bibliotheken
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: book
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 50
year: '2013'
...
---
_id: '2315'
abstract:
- lang: eng
text: ' We study the effects of random scatterers on the ground state of the
one-dimensional Lieb-Liniger model of interacting bosons on the unit interval
in the Gross-Pitaevskii regime. We prove that Bose Einstein condensation survives
even a strong random potential with a high density of scatterers. The character
of the wave function of the condensate, however, depends in an essential way on
the interplay between randomness and the strength of the two-body interaction.
For low density of scatterers or strong interactions the wave function extends
over the whole interval. High density of scatterers and weak interaction, on the
other hand, leads to localization of the wave function in a fragmented subset
of the interval. '
article_processing_charge: No
arxiv: 1
author:
- first_name: Robert
full_name: Seiringer, Robert
id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
last_name: Seiringer
orcid: 0000-0002-6781-0521
- first_name: Jakob
full_name: Yngvason, Jakob
last_name: Yngvason
- first_name: Valentin
full_name: Zagrebnov, Valentin
last_name: Zagrebnov
citation:
ama: 'Seiringer R, Yngvason J, Zagrebnov V. Disordered Bose-Einstein condensates
with interaction. In: World Scientific Publishing; 2013:610-619. doi:10.1142/9789814449243_0063'
apa: 'Seiringer, R., Yngvason, J., & Zagrebnov, V. (2013). Disordered Bose-Einstein
condensates with interaction (pp. 610–619). Presented at the ICMP: International
Congress on Mathematical Physics, World Scientific Publishing. https://doi.org/10.1142/9789814449243_0063'
chicago: Seiringer, Robert, Jakob Yngvason, and Valentin Zagrebnov. “Disordered
Bose-Einstein Condensates with Interaction,” 610–19. World Scientific Publishing,
2013. https://doi.org/10.1142/9789814449243_0063.
ieee: 'R. Seiringer, J. Yngvason, and V. Zagrebnov, “Disordered Bose-Einstein condensates
with interaction,” presented at the ICMP: International Congress on Mathematical
Physics, 2013, pp. 610–619.'
ista: 'Seiringer R, Yngvason J, Zagrebnov V. 2013. Disordered Bose-Einstein condensates
with interaction. ICMP: International Congress on Mathematical Physics, 610–619.'
mla: Seiringer, Robert, et al. Disordered Bose-Einstein Condensates with Interaction.
World Scientific Publishing, 2013, pp. 610–19, doi:10.1142/9789814449243_0063.
short: R. Seiringer, J. Yngvason, V. Zagrebnov, in:, World Scientific Publishing,
2013, pp. 610–619.
conference:
name: 'ICMP: International Congress on Mathematical Physics'
date_created: 2018-12-11T11:56:57Z
date_published: 2013-01-01T00:00:00Z
date_updated: 2021-01-12T06:56:43Z
doi: 10.1142/9789814449243_0063
extern: '1'
external_id:
arxiv:
- '1209.4046'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1209.4046
oa: 1
oa_version: None
page: 610-619
publication_status: published
publisher: World Scientific Publishing
publist_id: '4612'
status: public
title: Disordered Bose-Einstein condensates with interaction
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2013'
...
---
_id: '2319'
abstract:
- lang: eng
text: In a recent paper [7] we give the first rigorous derivation of the celebrated
Ginzburg-Landau (GL)theory, starting from the microscopic Bardeen- Cooper-Schrieffer
(BCS)model. Here we present our results in the simplified case of a one-dimensional
system of particles interacting via a δ-potential.
author:
- first_name: Rupert
full_name: Frank, Rupert L
last_name: Frank
- first_name: Christian
full_name: Hainzl, Christian
last_name: Hainzl
- first_name: Robert
full_name: Robert Seiringer
id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
last_name: Seiringer
orcid: 0000-0002-6781-0521
- first_name: Jan
full_name: Solovej, Jan P
last_name: Solovej
citation:
ama: 'Frank R, Hainzl C, Seiringer R, Solovej J. Derivation of Ginzburg-Landau
theory for a one-dimensional system with contact interaction. In: Springer; 2013:57-88.
doi:10.1007/978-3-0348-0531-5_3'
apa: 'Frank, R., Hainzl, C., Seiringer, R., & Solovej, J. (2013). Derivation
of Ginzburg-Landau theory for a one-dimensional system with contact interaction
(pp. 57–88). Presented at the OTAMP: Operator Theory, Analysis and Mathematical
Physics, Springer. https://doi.org/10.1007/978-3-0348-0531-5_3'
chicago: Frank, Rupert, Christian Hainzl, Robert Seiringer, and Jan Solovej. “ Derivation
of Ginzburg-Landau Theory for a One-Dimensional System with Contact Interaction,”
57–88. Springer, 2013. https://doi.org/10.1007/978-3-0348-0531-5_3.
ieee: 'R. Frank, C. Hainzl, R. Seiringer, and J. Solovej, “ Derivation of Ginzburg-Landau
theory for a one-dimensional system with contact interaction,” presented at the
OTAMP: Operator Theory, Analysis and Mathematical Physics, 2013, pp. 57–88.'
ista: 'Frank R, Hainzl C, Seiringer R, Solovej J. 2013. Derivation of Ginzburg-Landau
theory for a one-dimensional system with contact interaction. OTAMP: Operator
Theory, Analysis and Mathematical Physics, 57–88.'
mla: Frank, Rupert, et al. Derivation of Ginzburg-Landau Theory for a One-Dimensional
System with Contact Interaction. Springer, 2013, pp. 57–88, doi:10.1007/978-3-0348-0531-5_3.
short: R. Frank, C. Hainzl, R. Seiringer, J. Solovej, in:, Springer, 2013, pp. 57–88.
conference:
name: 'OTAMP: Operator Theory, Analysis and Mathematical Physics'
date_created: 2018-12-11T11:56:58Z
date_published: 2013-01-01T00:00:00Z
date_updated: 2021-01-12T06:56:45Z
day: '01'
doi: 10.1007/978-3-0348-0531-5_3
extern: 1
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1103.1866
month: '01'
oa: 1
page: 57 - 88
publication_status: published
publisher: Springer
publist_id: '4608'
quality_controlled: 0
status: public
title: ' Derivation of Ginzburg-Landau theory for a one-dimensional system with contact
interaction'
type: conference
year: '2013'
...
---
_id: '2327'
abstract:
- lang: eng
text: 'We define the model-measuring problem: given a model M and specification
φ, what is the maximal distance ρ such that all models M′ within distance ρ from
M satisfy (or violate) φ. The model measuring problem presupposes a distance function
on models. We concentrate on automatic distance functions, which are defined by
weighted automata. The model-measuring problem subsumes several generalizations
of the classical model-checking problem, in particular, quantitative model-checking
problems that measure the degree of satisfaction of a specification, and robustness
problems that measure how much a model can be perturbed without violating the
specification. We show that for automatic distance functions, and ω-regular linear-time
and branching-time specifications, the model-measuring problem can be solved.
We use automata-theoretic model-checking methods for model measuring, replacing
the emptiness question for standard word and tree automata by the optimal-weight
question for the weighted versions of these automata. We consider weighted automata
that accumulate weights by maximizing, summing, discounting, and limit averaging.
We give several examples of using the model-measuring problem to compute various
notions of robustness and quantitative satisfaction for temporal specifications.'
alternative_title:
- LNCS
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: Jan
full_name: Otop, Jan
id: 2FC5DA74-F248-11E8-B48F-1D18A9856A87
last_name: Otop
citation:
ama: Henzinger TA, Otop J. From model checking to model measuring. 2013;8052:273-287.
doi:10.1007/978-3-642-40184-8_20
apa: 'Henzinger, T. A., & Otop, J. (2013). From model checking to model measuring.
Presented at the CONCUR: Concurrency Theory, Buenos Aires, Argentina: Springer.
https://doi.org/10.1007/978-3-642-40184-8_20'
chicago: Henzinger, Thomas A, and Jan Otop. “From Model Checking to Model Measuring.”
Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-40184-8_20.
ieee: T. A. Henzinger and J. Otop, “From model checking to model measuring,” vol.
8052. Springer, pp. 273–287, 2013.
ista: Henzinger TA, Otop J. 2013. From model checking to model measuring. 8052,
273–287.
mla: Henzinger, Thomas A., and Jan Otop. From Model Checking to Model Measuring.
Vol. 8052, Springer, 2013, pp. 273–87, doi:10.1007/978-3-642-40184-8_20.
short: T.A. Henzinger, J. Otop, 8052 (2013) 273–287.
conference:
end_date: 2013-08-30
location: Buenos Aires, Argentina
name: 'CONCUR: Concurrency Theory'
start_date: 2013-08-27
corr_author: '1'
date_created: 2018-12-11T11:57:00Z
date_published: 2013-08-01T00:00:00Z
date_updated: 2024-10-21T06:02:58Z
day: '01'
ddc:
- '005'
- '000'
department:
- _id: ToHe
doi: 10.1007/978-3-642-40184-8_20
file:
- access_level: open_access
checksum: 4c04695c4bfdf2119cd4f5d1babc3e8a
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:17:45Z
date_updated: 2020-07-14T12:45:38Z
file_id: '5301'
file_name: IST-2013-129-v1+1_concur.pdf
file_size: 378587
relation: main_file
file_date_updated: 2020-07-14T12:45:38Z
has_accepted_license: '1'
intvolume: ' 8052'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Submitted Version
page: 273 - 287
publication_status: published
publisher: Springer
publist_id: '4599'
pubrep_id: '129'
quality_controlled: '1'
related_material:
record:
- id: '5417'
relation: earlier_version
status: public
scopus_import: '1'
series_title: Lecture Notes in Computer Science
status: public
title: From model checking to model measuring
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8052
year: '2013'
...
---
_id: '2328'
abstract:
- lang: eng
text: "Linearizability of concurrent data structures is usually proved by monolithic
simulation arguments relying on identifying the so-called linearization points.
Regrettably, such proofs, whether manual or automatic, are often complicated and
scale poorly to advanced non-blocking concurrency patterns, such as helping and
optimistic updates.\r\nIn response, we propose a more modular way of checking
linearizability of concurrent queue algorithms that does not involve identifying
linearization points. We reduce the task of proving linearizability with respect
to the queue specification to establishing four basic properties, each of which
can be proved independently by simpler arguments. As a demonstration of our approach,
we verify the Herlihy and Wing queue, an algorithm that is challenging to verify
by a simulation proof."
alternative_title:
- LNCS
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: Ali
full_name: Sezgin, Ali
id: 4C7638DA-F248-11E8-B48F-1D18A9856A87
last_name: Sezgin
- first_name: Viktor
full_name: Vafeiadis, Viktor
last_name: Vafeiadis
citation:
ama: Henzinger TA, Sezgin A, Vafeiadis V. Aspect-oriented linearizability proofs.
2013;8052:242-256. doi:10.1007/978-3-642-40184-8_18
apa: 'Henzinger, T. A., Sezgin, A., & Vafeiadis, V. (2013). Aspect-oriented
linearizability proofs. Presented at the CONCUR: Concurrency Theory, Buenos Aires,
Argentina: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-642-40184-8_18'
chicago: Henzinger, Thomas A, Ali Sezgin, and Viktor Vafeiadis. “Aspect-Oriented
Linearizability Proofs.” Lecture Notes in Computer Science. Schloss Dagstuhl -
Leibniz-Zentrum für Informatik, 2013. https://doi.org/10.1007/978-3-642-40184-8_18.
ieee: T. A. Henzinger, A. Sezgin, and V. Vafeiadis, “Aspect-oriented linearizability
proofs,” vol. 8052. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 242–256,
2013.
ista: Henzinger TA, Sezgin A, Vafeiadis V. 2013. Aspect-oriented linearizability
proofs. 8052, 242–256.
mla: Henzinger, Thomas A., et al. Aspect-Oriented Linearizability Proofs.
Vol. 8052, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013, pp. 242–56,
doi:10.1007/978-3-642-40184-8_18.
short: T.A. Henzinger, A. Sezgin, V. Vafeiadis, 8052 (2013) 242–256.
conference:
end_date: 2013-08-30
location: Buenos Aires, Argentina
name: 'CONCUR: Concurrency Theory'
start_date: 2013-08-27
date_created: 2018-12-11T11:57:01Z
date_published: 2013-08-01T00:00:00Z
date_updated: 2025-09-23T07:56:19Z
day: '01'
ddc:
- '000'
- '004'
department:
- _id: ToHe
doi: 10.1007/978-3-642-40184-8_18
ec_funded: 1
file:
- access_level: open_access
checksum: bdbb520de91751fe0136309ad4ef67e4
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:08:58Z
date_updated: 2020-07-14T12:45:39Z
file_id: '4721'
file_name: IST-2014-197-v1+1_main-queue-verification.pdf
file_size: 337059
relation: main_file
file_date_updated: 2020-07-14T12:45:39Z
has_accepted_license: '1'
intvolume: ' 8052'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Submitted Version
page: 242 - 256
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '4598'
pubrep_id: '197'
quality_controlled: '1'
related_material:
record:
- id: '1832'
relation: later_version
status: public
scopus_import: 1
series_title: Lecture Notes in Computer Science
status: public
title: Aspect-oriented linearizability proofs
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8052
year: '2013'
...
---
_id: '2329'
abstract:
- lang: eng
text: 'Two-player games on graphs are central in many problems in formal verification
and program analysis such as synthesis and verification of open systems. In this
work, we consider both finite-state game graphs, and recursive game graphs (or
pushdown game graphs) that model the control flow of sequential programs with
recursion. The objectives we study are multidimensional mean-payoff objectives,
where the goal of player 1 is to ensure that the mean-payoff is non-negative in
all dimensions. In pushdown games two types of strategies are relevant: (1) global
strategies, that depend on the entire global history; and (2) modular strategies,
that have only local memory and thus do not depend on the context of invocation.
Our main contributions are as follows: (1) We show that finite-state multidimensional
mean-payoff games can be solved in polynomial time if the number of dimensions
and the maximal absolute value of the weights are fixed; whereas if the number
of dimensions is arbitrary, then the problem is known to be coNP-complete. (2)
We show that pushdown graphs with multidimensional mean-payoff objectives can
be solved in polynomial time. For both (1) and (2) our algorithms are based on
hyperplane separation technique. (3) For pushdown games under global strategies
both one and multidimensional mean-payoff objectives problems are known to be
undecidable, and we show that under modular strategies the multidimensional problem
is also undecidable; under modular strategies the one-dimensional problem is NP-complete.
We show that if the number of modules, the number of exits, and the maximal absolute
value of the weights are fixed, then pushdown games under modular strategies with
one-dimensional mean-payoff objectives can be solved in polynomial time, and if
either the number of exits or the number of modules is unbounded, then the problem
is NP-hard. (4) Finally we show that a fixed parameter tractable algorithm for
finite-state multidimensional mean-payoff games or pushdown games under modular
strategies with one-dimensional mean-payoff objectives would imply the fixed parameter
tractability of parity games.'
alternative_title:
- LNCS
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Yaron
full_name: Velner, Yaron
last_name: Velner
citation:
ama: Chatterjee K, Velner Y. Hyperplane separation technique for multidimensional
mean-payoff games. 2013;8052:500-515. doi:10.1007/978-3-642-40184-8_35
apa: 'Chatterjee, K., & Velner, Y. (2013). Hyperplane separation technique for
multidimensional mean-payoff games. Presented at the CONCUR: Concurrency Theory,
Buenos Aires, Argentinia: Springer. https://doi.org/10.1007/978-3-642-40184-8_35'
chicago: Chatterjee, Krishnendu, and Yaron Velner. “Hyperplane Separation Technique
for Multidimensional Mean-Payoff Games.” Lecture Notes in Computer Science. Springer,
2013. https://doi.org/10.1007/978-3-642-40184-8_35.
ieee: K. Chatterjee and Y. Velner, “Hyperplane separation technique for multidimensional
mean-payoff games,” vol. 8052. Springer, pp. 500–515, 2013.
ista: Chatterjee K, Velner Y. 2013. Hyperplane separation technique for multidimensional
mean-payoff games. 8052, 500–515.
mla: Chatterjee, Krishnendu, and Yaron Velner. Hyperplane Separation Technique
for Multidimensional Mean-Payoff Games. Vol. 8052, Springer, 2013, pp. 500–15,
doi:10.1007/978-3-642-40184-8_35.
short: K. Chatterjee, Y. Velner, 8052 (2013) 500–515.
conference:
end_date: 2013-08-30
location: Buenos Aires, Argentinia
name: 'CONCUR: Concurrency Theory'
start_date: 2013-08-27
date_created: 2018-12-11T11:57:01Z
date_published: 2013-08-01T00:00:00Z
date_updated: 2025-09-10T11:00:30Z
day: '01'
department:
- _id: KrCh
doi: 10.1007/978-3-642-40184-8_35
ec_funded: 1
external_id:
arxiv:
- '1210.3141'
intvolume: ' 8052'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1210.3141
month: '08'
oa: 1
oa_version: Preprint
page: 500 - 515
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication_status: published
publisher: Springer
publist_id: '4597'
quality_controlled: '1'
related_material:
record:
- id: '717'
relation: later_version
status: public
scopus_import: 1
series_title: Lecture Notes in Computer Science
status: public
title: Hyperplane separation technique for multidimensional mean-payoff games
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8052
year: '2013'
...