---
_id: '12854'
abstract:
- lang: eng
text: "The main idea behind BUBAAK is to run multiple program analyses in parallel
and use runtime monitoring and enforcement to observe and control their progress
in real time. The analyses send information about (un)explored states of the program
and discovered invariants to a monitor. The monitor processes the received data
and can force an analysis to stop the search of certain program parts (which have
already been analyzed by other analyses), or to make it utilize a program invariant
found by another analysis.\r\nAt SV-COMP 2023, the implementation of data exchange
between the monitor and the analyses was not yet completed, which is why BUBAAK
only ran several analyses in parallel, without any coordination. Still, BUBAAK
won the meta-category FalsificationOverall and placed very well in several other
(sub)-categories of the competition."
acknowledgement: This work was supported by the ERC-2020-AdG 10102009 grant.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Marek
full_name: Chalupa, Marek
id: 87e34708-d6c6-11ec-9f5b-9391e7be2463
last_name: Chalupa
- 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: 'Chalupa M, Henzinger TA. Bubaak: Runtime monitoring of program verifiers.
In: Tools and Algorithms for the Construction and Analysis of Systems.
Vol 13994. Springer Nature; 2023:535-540. doi:10.1007/978-3-031-30820-8_32'
apa: 'Chalupa, M., & Henzinger, T. A. (2023). Bubaak: Runtime monitoring of
program verifiers. In Tools and Algorithms for the Construction and Analysis
of Systems (Vol. 13994, pp. 535–540). Paris, France: Springer Nature. https://doi.org/10.1007/978-3-031-30820-8_32'
chicago: 'Chalupa, Marek, and Thomas A Henzinger. “Bubaak: Runtime Monitoring of
Program Verifiers.” In Tools and Algorithms for the Construction and Analysis
of Systems, 13994:535–40. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-30820-8_32.'
ieee: 'M. Chalupa and T. A. Henzinger, “Bubaak: Runtime monitoring of program verifiers,”
in Tools and Algorithms for the Construction and Analysis of Systems, Paris,
France, 2023, vol. 13994, pp. 535–540.'
ista: 'Chalupa M, Henzinger TA. 2023. Bubaak: Runtime monitoring of program verifiers.
Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools
and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 13994,
535–540.'
mla: 'Chalupa, Marek, and Thomas A. Henzinger. “Bubaak: Runtime Monitoring of Program
Verifiers.” Tools and Algorithms for the Construction and Analysis of Systems,
vol. 13994, Springer Nature, 2023, pp. 535–40, doi:10.1007/978-3-031-30820-8_32.'
short: M. Chalupa, T.A. Henzinger, in:, Tools and Algorithms for the Construction
and Analysis of Systems, Springer Nature, 2023, pp. 535–540.
conference:
end_date: 2023-04-27
location: Paris, France
name: 'TACAS: Tools and Algorithms for the Construction and Analysis of Systems'
start_date: 2023-04-22
date_created: 2023-04-20T08:22:53Z
date_published: 2023-04-20T00:00:00Z
date_updated: 2023-04-25T07:02:43Z
day: '20'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1007/978-3-031-30820-8_32
ec_funded: 1
file:
- access_level: open_access
checksum: 120d2c2a38384058ad0630fdf8288312
content_type: application/pdf
creator: dernst
date_created: 2023-04-25T06:58:36Z
date_updated: 2023-04-25T06:58:36Z
file_id: '12864'
file_name: 2023_LNCS_Chalupa.pdf
file_size: 16096413
relation: main_file
success: 1
file_date_updated: 2023-04-25T06:58:36Z
has_accepted_license: '1'
intvolume: ' 13994'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '04'
oa: 1
oa_version: Published Version
page: 535-540
project:
- _id: 62781420-2b32-11ec-9570-8d9b63373d4d
call_identifier: H2020
grant_number: '101020093'
name: Vigilant Algorithmic Monitoring of Software
publication: Tools and Algorithms for the Construction and Analysis of Systems
publication_identifier:
eisbn:
- '9783031308208'
eissn:
- 1611-3349
isbn:
- '9783031308192'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
status: public
title: 'Bubaak: Runtime monitoring of program verifiers'
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: 13994
year: '2023'
...
---
_id: '12846'
abstract:
- lang: eng
text: We present a formula for the signed area of a spherical polygon via prequantization.
In contrast to the traditional formula based on the Gauss-Bonnet theorem that
requires measuring angles, the new formula mimics Green's theorem and is applicable
to a wider range of degenerate spherical curves and polygons.
acknowledgement: The authors acknowledge Chris Wojtan for his continuous support to
the present work through discussions and advice. The second author thanks Anna Sisak
for a fruitful discussion on prequantum bundles. This project was funded in part
by the European Research Council (ERC Consolidator Grant 101045083 CoDiNA).
article_number: '2303.14555'
article_processing_charge: No
author:
- first_name: Albert
full_name: Chern, Albert
last_name: Chern
- first_name: Sadashige
full_name: Ishida, Sadashige
id: 6F7C4B96-A8E9-11E9-A7CA-09ECE5697425
last_name: Ishida
citation:
ama: Chern A, Ishida S. Area formula for spherical polygons via prequantization.
arXiv. doi:10.48550/arXiv.2303.14555
apa: Chern, A., & Ishida, S. (n.d.). Area formula for spherical polygons via
prequantization. arXiv. https://doi.org/10.48550/arXiv.2303.14555
chicago: Chern, Albert, and Sadashige Ishida. “Area Formula for Spherical Polygons
via Prequantization.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2303.14555.
ieee: A. Chern and S. Ishida, “Area formula for spherical polygons via prequantization,”
arXiv. .
ista: Chern A, Ishida S. Area formula for spherical polygons via prequantization.
arXiv, 2303.14555.
mla: Chern, Albert, and Sadashige Ishida. “Area Formula for Spherical Polygons via
Prequantization.” ArXiv, 2303.14555, doi:10.48550/arXiv.2303.14555.
short: A. Chern, S. Ishida, ArXiv (n.d.).
date_created: 2023-04-18T19:16:06Z
date_published: 2023-03-25T00:00:00Z
date_updated: 2023-04-25T06:51:21Z
day: '25'
department:
- _id: GradSch
- _id: ChWo
doi: 10.48550/arXiv.2303.14555
external_id:
arxiv:
- '2303.14555'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2303.14555
month: '03'
oa: 1
oa_version: Preprint
project:
- _id: 34bc2376-11ca-11ed-8bc3-9a3b3961a088
grant_number: '101045083'
name: Computational Discovery of Numerical Algorithms for Animation and Simulation
of Natural Phenomena
publication: arXiv
publication_status: submitted
status: public
title: Area formula for spherical polygons via prequantization
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...
---
_id: '12856'
abstract:
- lang: eng
text: "As the complexity and criticality of software increase every year, so does
the importance of run-time monitoring. Third-party monitoring, with limited knowledge
of the monitored software, and best-effort monitoring, which keeps pace with the
monitored software, are especially valuable, yet underexplored areas of run-time
monitoring. Most existing monitoring frameworks do not support their combination
because they either require access to the monitored code for instrumentation purposes
or the processing of all observed events, or both.\r\n\r\nWe present a middleware
framework, VAMOS, for the run-time monitoring of software which is explicitly
designed to support third-party and best-effort scenarios. The design goals of
VAMOS are (i) efficiency (keeping pace at low overhead), (ii) flexibility (the
ability to monitor black-box code through a variety of different event channels,
and the connectability to monitors written in different specification languages),
and (iii) ease-of-use. To achieve its goals, VAMOS combines aspects of event broker
and event recognition systems with aspects of stream processing systems.\r\nWe
implemented a prototype toolchain for VAMOS and conducted experiments including
a case study of monitoring for data races. The results indicate that VAMOS enables
writing useful yet efficient monitors, is compatible with a variety of event sources
and monitor specifications, and simplifies key aspects of setting up a monitoring
system from scratch."
acknowledgement: This work was supported in part by the ERC-2020-AdG 101020093. The
authors would like to thank the anonymous FASE reviewers for their valuable feedback
and suggestions.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Marek
full_name: Chalupa, Marek
id: 87e34708-d6c6-11ec-9f5b-9391e7be2463
last_name: Chalupa
- first_name: Fabian
full_name: Mühlböck, Fabian
id: 6395C5F6-89DF-11E9-9C97-6BDFE5697425
last_name: Mühlböck
orcid: 0000-0003-1548-0177
- first_name: Stefanie
full_name: Muroya Lei, Stefanie
id: a376de31-8972-11ed-ae7b-d0251c13c8ff
last_name: Muroya Lei
- 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: 'Chalupa M, Mühlböck F, Muroya Lei S, Henzinger TA. Vamos: Middleware for best-effort
third-party monitoring. In: Fundamental Approaches to Software Engineering.
Vol 13991. Springer Nature; 2023:260-281. doi:10.1007/978-3-031-30826-0_15'
apa: 'Chalupa, M., Mühlböck, F., Muroya Lei, S., & Henzinger, T. A. (2023).
Vamos: Middleware for best-effort third-party monitoring. In Fundamental Approaches
to Software Engineering (Vol. 13991, pp. 260–281). Paris, France: Springer
Nature. https://doi.org/10.1007/978-3-031-30826-0_15'
chicago: 'Chalupa, Marek, Fabian Mühlböck, Stefanie Muroya Lei, and Thomas A Henzinger.
“Vamos: Middleware for Best-Effort Third-Party Monitoring.” In Fundamental
Approaches to Software Engineering, 13991:260–81. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-30826-0_15.'
ieee: 'M. Chalupa, F. Mühlböck, S. Muroya Lei, and T. A. Henzinger, “Vamos: Middleware
for best-effort third-party monitoring,” in Fundamental Approaches to Software
Engineering, Paris, France, 2023, vol. 13991, pp. 260–281.'
ista: 'Chalupa M, Mühlböck F, Muroya Lei S, Henzinger TA. 2023. Vamos: Middleware
for best-effort third-party monitoring. Fundamental Approaches to Software Engineering.
FASE: Fundamental Approaches to Software Engineering, LNCS, vol. 13991, 260–281.'
mla: 'Chalupa, Marek, et al. “Vamos: Middleware for Best-Effort Third-Party Monitoring.”
Fundamental Approaches to Software Engineering, vol. 13991, Springer Nature,
2023, pp. 260–81, doi:10.1007/978-3-031-30826-0_15.'
short: M. Chalupa, F. Mühlböck, S. Muroya Lei, T.A. Henzinger, in:, Fundamental
Approaches to Software Engineering, Springer Nature, 2023, pp. 260–281.
conference:
end_date: 2023-04-27
location: Paris, France
name: 'FASE: Fundamental Approaches to Software Engineering'
start_date: 2023-04-22
date_created: 2023-04-20T08:29:42Z
date_published: 2023-04-20T00:00:00Z
date_updated: 2023-04-25T07:19:07Z
day: '20'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1007/978-3-031-30826-0_15
ec_funded: 1
file:
- access_level: open_access
checksum: 17a7c8e08be609cf2408d37ea55e322c
content_type: application/pdf
creator: dernst
date_created: 2023-04-25T07:16:36Z
date_updated: 2023-04-25T07:16:36Z
file_id: '12865'
file_name: 2023_LNCS_ChalupaM.pdf
file_size: 580828
relation: main_file
success: 1
file_date_updated: 2023-04-25T07:16:36Z
has_accepted_license: '1'
intvolume: ' 13991'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: 260-281
project:
- _id: 62781420-2b32-11ec-9570-8d9b63373d4d
call_identifier: H2020
grant_number: '101020093'
name: Vigilant Algorithmic Monitoring of Software
publication: Fundamental Approaches to Software Engineering
publication_identifier:
eisbn:
- '9783031308260'
eissn:
- 1611-3349
isbn:
- '9783031308253'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '12407'
relation: earlier_version
status: public
status: public
title: 'Vamos: Middleware for best-effort third-party monitoring'
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: 13991
year: '2023'
...
---
_id: '12407'
abstract:
- lang: eng
text: "As the complexity and criticality of software increase every year, so does
the importance of run-time monitoring. Third-party monitoring, with limited knowledge
of the monitored software, and best-effort monitoring, which keeps pace with the
monitored software, are especially valuable, yet underexplored areas of run-time
monitoring. Most existing monitoring frameworks do not support their combination
because they either require access to the monitored code for instrumentation purposes
or the processing of all observed events, or both.\r\n\r\nWe present a middleware
framework, VAMOS, for the run-time monitoring of software which is explicitly
designed to support third-party and best-effort scenarios. The design goals of
VAMOS are (i) efficiency (keeping pace at low overhead), (ii) flexibility (the
ability to monitor black-box code through a variety of different event channels,
and the connectability to monitors written in different specification languages),
and (iii) ease-of-use. To achieve its goals, VAMOS combines aspects of event broker
and event recognition systems with aspects of stream processing systems.\r\n\r\nWe
implemented a prototype toolchain for VAMOS and conducted experiments including
a case study of monitoring for data races. The results indicate that VAMOS enables
writing useful yet efficient monitors, is compatible with a variety of event sources
and monitor specifications, and simplifies key aspects of setting up a monitoring
system from scratch."
acknowledgement: "This work was supported in part by the ERC-2020-AdG 101020093. \r\nThe
authors would like to thank the anonymous FASE reviewers for their valuable feedback
and suggestions."
alternative_title:
- IST Austria Technical Report
article_processing_charge: No
author:
- first_name: Marek
full_name: Chalupa, Marek
id: 87e34708-d6c6-11ec-9f5b-9391e7be2463
last_name: Chalupa
- first_name: Fabian
full_name: Mühlböck, Fabian
id: 6395C5F6-89DF-11E9-9C97-6BDFE5697425
last_name: Mühlböck
orcid: 0000-0003-1548-0177
- first_name: Stefanie
full_name: Muroya Lei, Stefanie
id: a376de31-8972-11ed-ae7b-d0251c13c8ff
last_name: Muroya Lei
- 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: 'Chalupa M, Mühlböck F, Muroya Lei S, Henzinger TA. VAMOS: Middleware for
Best-Effort Third-Party Monitoring. Institute of Science and Technology Austria;
2023. doi:10.15479/AT:ISTA:12407'
apa: 'Chalupa, M., Mühlböck, F., Muroya Lei, S., & Henzinger, T. A. (2023).
VAMOS: Middleware for Best-Effort Third-Party Monitoring. Institute of
Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:12407'
chicago: 'Chalupa, Marek, Fabian Mühlböck, Stefanie Muroya Lei, and Thomas A Henzinger.
VAMOS: Middleware for Best-Effort Third-Party Monitoring. Institute of
Science and Technology Austria, 2023. https://doi.org/10.15479/AT:ISTA:12407.'
ieee: 'M. Chalupa, F. Mühlböck, S. Muroya Lei, and T. A. Henzinger, VAMOS: Middleware
for Best-Effort Third-Party Monitoring. Institute of Science and Technology
Austria, 2023.'
ista: 'Chalupa M, Mühlböck F, Muroya Lei S, Henzinger TA. 2023. VAMOS: Middleware
for Best-Effort Third-Party Monitoring, Institute of Science and Technology Austria,
38p.'
mla: 'Chalupa, Marek, et al. VAMOS: Middleware for Best-Effort Third-Party Monitoring.
Institute of Science and Technology Austria, 2023, doi:10.15479/AT:ISTA:12407.'
short: 'M. Chalupa, F. Mühlböck, S. Muroya Lei, T.A. Henzinger, VAMOS: Middleware
for Best-Effort Third-Party Monitoring, Institute of Science and Technology Austria,
2023.'
date_created: 2023-01-27T03:18:08Z
date_published: 2023-01-27T00:00:00Z
date_updated: 2023-04-25T07:19:06Z
day: '27'
ddc:
- '005'
department:
- _id: ToHe
doi: 10.15479/AT:ISTA:12407
ec_funded: 1
file:
- access_level: open_access
checksum: 55426e463fdeafe9777fc3ff635154c7
content_type: application/pdf
creator: fmuehlbo
date_created: 2023-01-27T03:18:34Z
date_updated: 2023-01-27T03:18:34Z
file_id: '12408'
file_name: main.pdf
file_size: 662409
relation: main_file
success: 1
file_date_updated: 2023-01-27T03:18:34Z
has_accepted_license: '1'
keyword:
- runtime monitoring
- best effort
- third party
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: '38'
project:
- _id: 62781420-2b32-11ec-9570-8d9b63373d4d
call_identifier: H2020
grant_number: '101020093'
name: Vigilant Algorithmic Monitoring of Software
publication_identifier:
eissn:
- 2664-1690
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '12856'
relation: later_version
status: public
status: public
title: 'VAMOS: Middleware for Best-Effort Third-Party Monitoring'
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: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...
---
_id: '12866'
abstract:
- lang: eng
text: "Autism spectrum disorder (ASD) and epilepsy are frequently comorbid neurodevelopmental
disorders. Extensive research has demonstrated shared pathological pathways, etiologies,
and phenotypes. Many risk factors for these disorders, like genetic mutations
and environmental pressures, are linked to changes in childhood brain development,
which is a critical period for their manifestation.\r\nDecades of research have
yielded many signatures for ASD and epilepsy, some shared and others unique or
opposing. The anatomical, physiological, and behavioral correlates of these disorders
are discussed in this chapter in the context of understanding shared pathological
pathways. We end with important takeaways on the presentation, prevention, intervention,
and policy changes for ASD and epilepsy. This chapter aims to explore the complexity
of these disorders, both in etiology and phenotypes, with the further goal of
appreciating the expanse of unknowns still to explore about the brain."
alternative_title:
- 'Vol. 1: Biological Development and Physical Health'
article_processing_charge: No
author:
- first_name: Christopher
full_name: Currin, Christopher
id: e8321fc5-3091-11eb-8a53-83f309a11ac9
last_name: Currin
orcid: 0000-0002-4809-5059
- first_name: Chad
full_name: Beyer, Chad
last_name: Beyer
citation:
ama: 'Currin C, Beyer C. Altered childhood brain development in autism and epilepsy.
In: Halpern-Felsher B, ed. Encyclopedia of Child and Adolescent Health.
1st ed. Elsevier; 2023:86-98. doi:10.1016/b978-0-12-818872-9.00129-1'
apa: Currin, C., & Beyer, C. (2023). Altered childhood brain development in
autism and epilepsy. In B. Halpern-Felsher (Ed.), Encyclopedia of Child and
Adolescent Health (1st ed., pp. 86–98). Elsevier. https://doi.org/10.1016/b978-0-12-818872-9.00129-1
chicago: Currin, Christopher, and Chad Beyer. “Altered Childhood Brain Development
in Autism and Epilepsy.” In Encyclopedia of Child and Adolescent Health,
edited by Bonnie Halpern-Felsher, 1st ed., 86–98. Elsevier, 2023. https://doi.org/10.1016/b978-0-12-818872-9.00129-1.
ieee: C. Currin and C. Beyer, “Altered childhood brain development in autism and
epilepsy,” in Encyclopedia of Child and Adolescent Health, 1st ed., B.
Halpern-Felsher, Ed. Elsevier, 2023, pp. 86–98.
ista: 'Currin C, Beyer C. 2023.Altered childhood brain development in autism and
epilepsy. In: Encyclopedia of Child and Adolescent Health. Vol. 1: Biological
Development and Physical Health, , 86–98.'
mla: Currin, Christopher, and Chad Beyer. “Altered Childhood Brain Development in
Autism and Epilepsy.” Encyclopedia of Child and Adolescent Health, edited
by Bonnie Halpern-Felsher, 1st ed., Elsevier, 2023, pp. 86–98, doi:10.1016/b978-0-12-818872-9.00129-1.
short: C. Currin, C. Beyer, in:, B. Halpern-Felsher (Ed.), Encyclopedia of Child
and Adolescent Health, 1st ed., Elsevier, 2023, pp. 86–98.
date_created: 2023-04-25T07:52:43Z
date_published: 2023-02-01T00:00:00Z
date_updated: 2023-04-25T09:25:40Z
day: '01'
department:
- _id: TiVo
doi: 10.1016/b978-0-12-818872-9.00129-1
edition: '1'
editor:
- first_name: Bonnie
full_name: Halpern-Felsher, Bonnie
last_name: Halpern-Felsher
language:
- iso: eng
month: '02'
oa_version: None
page: 86-98
publication: Encyclopedia of Child and Adolescent Health
publication_identifier:
isbn:
- '9780128188736'
publication_status: published
publisher: Elsevier
quality_controlled: '1'
status: public
title: Altered childhood brain development in autism and epilepsy
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...
---
_id: '12809'
abstract:
- lang: eng
text: "Understanding the mechanisms of learning and memory formation has always
been one of\r\nthe main goals in neuroscience. Already Pavlov (1927) in his early
days has used his classic\r\nconditioning experiments to study the neural mechanisms
governing behavioral adaptation.\r\nWhat was not known back then was that the
part of the brain that is largely responsible for\r\nthis type of associative
learning is the cerebellum.\r\nSince then, plenty of theories on cerebellar learning
have emerged. Despite their differences,\r\none thing they all have in common
is that learning relies on synaptic and intrinsic plasticity.\r\nThe goal of my
PhD project was to unravel the molecular mechanisms underlying synaptic\r\nplasticity
in two synapses that have been shown to be implicated in motor learning, in an\r\neffort
to understand how learning and memory formation are processed in the cerebellum.\r\nOne
of the earliest and most well-known cerebellar theories postulates that motor
learning\r\nlargely depends on long-term depression at the parallel fiber-Purkinje
cell (PC-PC) synapse.\r\nHowever, the discovery of other types of plasticity in
the cerebellar circuitry, like long-term\r\npotentiation (LTP) at the PC-PC synapse,
potentiation of molecular layer interneurons (MLIs),\r\nand plasticity transfer
from the cortex to the cerebellar/ vestibular nuclei has increased the\r\npopularity
of the idea that multiple sites of plasticity might be involved in learning.\r\nStill
a lot remains unknown about the molecular mechanisms responsible for these types
of\r\nplasticity and whether they occur during physiological learning.\r\nIn the
first part of this thesis we have analyzed the variation and nanodistribution
of voltagegated calcium channels (VGCCs) and α-amino-3-hydroxy-5-methyl-4-isoxazolepropionic
acid\r\ntype glutamate receptors (AMPARs) on the parallel fiber-Purkinje cell
synapse after vestibuloocular reflex phase reversal adaptation, a behavior that
has been suggested to rely on PF-PC\r\nLTP. We have found that on the last day
of adaptation there is no learning trace in form of\r\nVGCCs nor AMPARs variation
at the PF-PC synapse, but instead a decrease in the number of\r\nPF-PC synapses.
These data seem to support the view that learning is only stored in the\r\ncerebellar
cortex in an initial learning phase, being transferred later to the vestibular
nuclei.\r\nNext, we have studied the role of MLIs in motor learning using a relatively
simple and well characterized behavioral paradigm – horizontal optokinetic reflex
(HOKR) adaptation. We\r\nhave found behavior-induced MLI potentiation in form
of release probability increase that\r\ncould be explained by the increase of
VGCCs at the presynaptic side. Our results strengthen\r\nthe idea of distributed
cerebellar plasticity contributing to learning and provide a novel\r\nmechanism
for release probability increase. "
acknowledged_ssus:
- _id: EM-Fac
- _id: Bio
- _id: PreCl
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Catarina
full_name: Alcarva, Catarina
id: 3A96634C-F248-11E8-B48F-1D18A9856A87
last_name: Alcarva
citation:
ama: 'Alcarva C. Plasticity in the cerebellum: What molecular mechanisms are behind
physiological learning. 2023. doi:10.15479/at:ista:12809'
apa: 'Alcarva, C. (2023). Plasticity in the cerebellum: What molecular mechanisms
are behind physiological learning. Institute of Science and Technology Austria.
https://doi.org/10.15479/at:ista:12809'
chicago: 'Alcarva, Catarina. “Plasticity in the Cerebellum: What Molecular Mechanisms
Are behind Physiological Learning.” Institute of Science and Technology Austria,
2023. https://doi.org/10.15479/at:ista:12809.'
ieee: 'C. Alcarva, “Plasticity in the cerebellum: What molecular mechanisms are
behind physiological learning,” Institute of Science and Technology Austria, 2023.'
ista: 'Alcarva C. 2023. Plasticity in the cerebellum: What molecular mechanisms
are behind physiological learning. Institute of Science and Technology Austria.'
mla: 'Alcarva, Catarina. Plasticity in the Cerebellum: What Molecular Mechanisms
Are behind Physiological Learning. Institute of Science and Technology Austria,
2023, doi:10.15479/at:ista:12809.'
short: 'C. Alcarva, Plasticity in the Cerebellum: What Molecular Mechanisms Are
behind Physiological Learning, Institute of Science and Technology Austria, 2023.'
date_created: 2023-04-06T07:54:09Z
date_published: 2023-04-06T00:00:00Z
date_updated: 2023-04-26T12:16:56Z
day: '06'
ddc:
- '570'
degree_awarded: PhD
department:
- _id: GradSch
- _id: RySh
doi: 10.15479/at:ista:12809
file:
- access_level: closed
checksum: 35b5997d2b0acb461f9d33d073da0df5
content_type: application/pdf
creator: cchlebak
date_created: 2023-04-07T06:16:06Z
date_updated: 2023-04-07T06:16:06Z
embargo: 2024-04-07
embargo_to: open_access
file_id: '12814'
file_name: Thesis_CatarinaAlcarva_final pdfA.pdf
file_size: 9881969
relation: main_file
- access_level: closed
checksum: 81198f63c294890f6d58e8b29782efdc
content_type: application/pdf
creator: cchlebak
date_created: 2023-04-07T06:17:11Z
date_updated: 2023-04-07T06:17:11Z
file_id: '12815'
file_name: Thesis_CatarinaAlcarva_final_for printing.pdf
file_size: 44201583
relation: source_file
- access_level: closed
checksum: 0317bf7f457bb585f99d453ffa69eb53
content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document
creator: cchlebak
date_created: 2023-04-07T06:18:05Z
date_updated: 2023-04-07T06:18:05Z
file_id: '12816'
file_name: Thesis_CatarinaAlcarva_final.docx
file_size: 84731244
relation: source_file
file_date_updated: 2023-04-07T06:18:05Z
has_accepted_license: '1'
language:
- iso: eng
month: '04'
oa_version: Published Version
page: '115'
project:
- _id: 267DFB90-B435-11E9-9278-68D0E5697425
name: 'Plasticity in the cerebellum: Which molecular mechanisms are behind physiological
learning?'
publication_identifier:
issn:
- 2663 - 337X
publication_status: published
publisher: Institute of Science and Technology Austria
status: public
supervisor:
- first_name: Ryuichi
full_name: Shigemoto, Ryuichi
id: 499F3ABC-F248-11E8-B48F-1D18A9856A87
last_name: Shigemoto
orcid: 0000-0001-8761-9444
title: 'Plasticity in the cerebellum: What molecular mechanisms are behind physiological
learning'
type: dissertation
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2023'
...
---
_id: '13048'
abstract:
- lang: eng
text: In this paper we introduce a pruning of the medial axis called the (λ,α)-medial
axis (axλα). We prove that the (λ,α)-medial axis of a set K is stable in a Gromov-Hausdorff
sense under weak assumptions. More formally we prove that if K and K′ are close
in the Hausdorff (dH) sense then the (λ,α)-medial axes of K and K′ are close as
metric spaces, that is the Gromov-Hausdorff distance (dGH) between the two is
1/4-Hölder in the sense that dGH (axλα(K),axλα(K′)) ≲ dH(K,K′)1/4. The Hausdorff
distance between the two medial axes is also bounded, by dH (axλα(K),λα(K′)) ≲
dH(K,K′)1/2. These quantified stability results provide guarantees for practical
computations of medial axes from approximations. Moreover, they provide key ingredients
for studying the computability of the medial axis in the context of computable
analysis.
acknowledgement: "We are greatly indebted to Erin Chambers for posing a number of
questions that eventually led to this paper. We would also like to thank the other
organizers of the workshop on ‘Algorithms\r\nfor the medial axis’. We are also indebted
to Tatiana Ezubova for helping with the search for and translation of Russian literature.
The second author thanks all members of the Edelsbrunner and Datashape groups for
the atmosphere in which the research was conducted.\r\nThe research leading to these
results has received funding from the European Research Council (ERC) under the
European Union’s Seventh Framework Programme (FP/2007-2013) / ERC Grant Agreement
No. 339025 GUDHI (Algorithmic Foundations of Geometry Understanding in Higher Dimensions).
Supported by the European Union’s Horizon 2020 research and innovation programme
under the Marie Skłodowska-Curie grant agreement No. 754411. The Austrian science
fund (FWF) M-3073."
article_processing_charge: No
author:
- first_name: André
full_name: Lieutier, André
last_name: Lieutier
- first_name: Mathijs
full_name: Wintraecken, Mathijs
id: 307CFBC8-F248-11E8-B48F-1D18A9856A87
last_name: Wintraecken
orcid: 0000-0002-7472-2220
citation:
ama: 'Lieutier A, Wintraecken M. Hausdorff and Gromov-Hausdorff stable subsets of
the medial axis. In: Proceedings of the 55th Annual ACM Symposium on Theory
of Computing. Association for Computing Machinery; 2023:1768-1776. doi:10.1145/3564246.3585113'
apa: 'Lieutier, A., & Wintraecken, M. (2023). Hausdorff and Gromov-Hausdorff
stable subsets of the medial axis. In Proceedings of the 55th Annual ACM Symposium
on Theory of Computing (pp. 1768–1776). Orlando, FL, United States: Association
for Computing Machinery. https://doi.org/10.1145/3564246.3585113'
chicago: Lieutier, André, and Mathijs Wintraecken. “Hausdorff and Gromov-Hausdorff
Stable Subsets of the Medial Axis.” In Proceedings of the 55th Annual ACM Symposium
on Theory of Computing, 1768–76. Association for Computing Machinery, 2023.
https://doi.org/10.1145/3564246.3585113.
ieee: A. Lieutier and M. Wintraecken, “Hausdorff and Gromov-Hausdorff stable subsets
of the medial axis,” in Proceedings of the 55th Annual ACM Symposium on Theory
of Computing, Orlando, FL, United States, 2023, pp. 1768–1776.
ista: 'Lieutier A, Wintraecken M. 2023. Hausdorff and Gromov-Hausdorff stable subsets
of the medial axis. Proceedings of the 55th Annual ACM Symposium on Theory of
Computing. STOC: Symposium on Theory of Computing, 1768–1776.'
mla: Lieutier, André, and Mathijs Wintraecken. “Hausdorff and Gromov-Hausdorff Stable
Subsets of the Medial Axis.” Proceedings of the 55th Annual ACM Symposium on
Theory of Computing, Association for Computing Machinery, 2023, pp. 1768–76,
doi:10.1145/3564246.3585113.
short: A. Lieutier, M. Wintraecken, in:, Proceedings of the 55th Annual ACM Symposium
on Theory of Computing, Association for Computing Machinery, 2023, pp. 1768–1776.
conference:
end_date: 2023-06-23
location: Orlando, FL, United States
name: 'STOC: Symposium on Theory of Computing'
start_date: 2023-06-20
date_created: 2023-05-22T08:02:02Z
date_published: 2023-06-02T00:00:00Z
date_updated: 2023-05-22T08:15:19Z
day: '02'
department:
- _id: HeEd
doi: 10.1145/3564246.3585113
ec_funded: 1
external_id:
arxiv:
- '2303.04014'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2303.04014
month: '06'
oa: 1
oa_version: Preprint
page: 1768-1776
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
- _id: fc390959-9c52-11eb-aca3-afa58bd282b2
grant_number: M03073
name: Learning and triangulating manifolds via collapses
publication: Proceedings of the 55th Annual ACM Symposium on Theory of Computing
publication_identifier:
isbn:
- '9781450399135'
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
status: public
title: Hausdorff and Gromov-Hausdorff stable subsets of the medial axis
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...
---
_id: '13053'
abstract:
- lang: eng
text: 'Deep neural networks (DNNs) often have to be compressed, via pruning and/or
quantization, before they can be deployed in practical settings. In this work
we propose a new compression-aware minimizer dubbed CrAM that modifies the optimization
step in a principled way, in order to produce models whose local loss behavior
is stable under compression operations such as pruning. Thus, dense models trained
via CrAM should be compressible post-training, in a single step, without significant
accuracy loss. Experimental results on standard benchmarks, such as residual networks
for ImageNet classification and BERT models for language modelling, show that
CrAM produces dense models that can be more accurate than the standard SGD/Adam-based
baselines, but which are stable under weight pruning: specifically, we can prune
models in one-shot to 70-80% sparsity with almost no accuracy loss, and to 90%
with reasonable (∼1%) accuracy loss, which is competitive with gradual compression
methods. Additionally, CrAM can produce sparse models which perform well for transfer
learning, and it also works for semi-structured 2:4 pruning patterns supported
by GPU hardware. The code for reproducing the results is available at this https
URL .'
acknowledged_ssus:
- _id: ScienComp
acknowledgement: "AP, EK, DA received funding from the European Research Council (ERC)
under the European\r\nUnion’s Horizon 2020 research and innovation programme (grant
agreement No 805223 ScaleML). AV acknowledges the support of the French Agence Nationale
de la Recherche (ANR), under grant ANR-21-CE48-0016 (project COMCOPT). We further
acknowledge the support from the Scientific Service Units (SSU) of ISTA through
resources provided by Scientific Computing (SciComp)-"
article_processing_charge: No
author:
- first_name: Elena-Alexandra
full_name: Peste, Elena-Alexandra
id: 32D78294-F248-11E8-B48F-1D18A9856A87
last_name: Peste
- first_name: Adrian
full_name: Vladu, Adrian
last_name: Vladu
- first_name: Eldar
full_name: Kurtic, Eldar
id: 47beb3a5-07b5-11eb-9b87-b108ec578218
last_name: Kurtic
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
citation:
ama: 'Peste E-A, Vladu A, Kurtic E, Lampert C, Alistarh D-A. CrAM: A Compression-Aware
Minimizer. In: 11th International Conference on Learning Representations .'
apa: 'Peste, E.-A., Vladu, A., Kurtic, E., Lampert, C., & Alistarh, D.-A. (n.d.).
CrAM: A Compression-Aware Minimizer. In 11th International Conference on Learning
Representations . Kigali, Rwanda .'
chicago: 'Peste, Elena-Alexandra, Adrian Vladu, Eldar Kurtic, Christoph Lampert,
and Dan-Adrian Alistarh. “CrAM: A Compression-Aware Minimizer.” In 11th International
Conference on Learning Representations , n.d.'
ieee: 'E.-A. Peste, A. Vladu, E. Kurtic, C. Lampert, and D.-A. Alistarh, “CrAM:
A Compression-Aware Minimizer,” in 11th International Conference on Learning
Representations , Kigali, Rwanda .'
ista: 'Peste E-A, Vladu A, Kurtic E, Lampert C, Alistarh D-A. CrAM: A Compression-Aware
Minimizer. 11th International Conference on Learning Representations . ICLR: International
Conference on Learning Representations.'
mla: 'Peste, Elena-Alexandra, et al. “CrAM: A Compression-Aware Minimizer.” 11th
International Conference on Learning Representations .'
short: E.-A. Peste, A. Vladu, E. Kurtic, C. Lampert, D.-A. Alistarh, in:, 11th International
Conference on Learning Representations , n.d.
conference:
end_date: 2023-05-05
location: 'Kigali, Rwanda '
name: 'ICLR: International Conference on Learning Representations'
start_date: 2023-05-01
date_created: 2023-05-23T11:36:18Z
date_published: 2023-05-01T00:00:00Z
date_updated: 2023-06-01T12:54:45Z
department:
- _id: GradSch
- _id: DaAl
- _id: ChLa
ec_funded: 1
external_id:
arxiv:
- '2207.14200'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://openreview.net/pdf?id=_eTZBs-yedr
month: '05'
oa: 1
oa_version: Preprint
project:
- _id: 268A44D6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '805223'
name: Elastic Coordination for Scalable Machine Learning
publication: '11th International Conference on Learning Representations '
publication_status: accepted
quality_controlled: '1'
related_material:
record:
- id: '13074'
relation: dissertation_contains
status: public
status: public
title: 'CrAM: A Compression-Aware Minimizer'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...
---
_id: '13143'
abstract:
- lang: eng
text: "GIMPS and PrimeGrid are large-scale distributed projects dedicated to searching
giant prime numbers, usually of special forms like Mersenne and Proth primes.
The numbers in the current search-space are millions of digits large and the participating
volunteers need to run resource-consuming primality tests. Once a candidate prime
N has been found, the only way for another party to independently verify the primality
of N used to be by repeating the expensive primality test. To avoid the need for
second recomputation of each primality test, these projects have recently adopted
certifying mechanisms that enable efficient verification of performed tests. However,
the mechanisms presently in place only detect benign errors and there is no guarantee
against adversarial behavior: a malicious volunteer can mislead the project to
reject a giant prime as being non-prime.\r\nIn this paper, we propose a practical,
cryptographically-sound mechanism for certifying the non-primality of Proth numbers.
That is, a volunteer can – parallel to running the primality test for N – generate
an efficiently verifiable proof at a little extra cost certifying that N is not
prime. The interactive protocol has statistical soundness and can be made non-interactive
using the Fiat-Shamir heuristic.\r\nOur approach is based on a cryptographic primitive
called Proof of Exponentiation (PoE) which, for a group G, certifies that a tuple
(x,y,T)∈G2×N satisfies x2T=y (Pietrzak, ITCS 2019 and Wesolowski, J. Cryptol.
2020). In particular, we show how to adapt Pietrzak’s PoE at a moderate additional
cost to make it a cryptographically-sound certificate of non-primality."
acknowledgement: 'We are grateful to Pavel Atnashev for clarifying via e-mail several
aspects of the primality tests implementated in the PrimeGrid project. Pavel Hubáček
is supported by the Czech Academy of Sciences (RVO 67985840), the Grant Agency of
the Czech Republic under the grant agreement no. 19-27871X, and by the Charles University
project UNCE/SCI/004. Chethan Kamath is supported by Azrieli International Postdoctoral
Fellowship, ISF grants 484/18 and 1789/19, and ERC StG project SPP: Secrecy Preserving
Proofs.'
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Charlotte
full_name: Hoffmann, Charlotte
id: 0f78d746-dc7d-11ea-9b2f-83f92091afe7
last_name: Hoffmann
- first_name: Pavel
full_name: Hubáček, Pavel
last_name: Hubáček
- first_name: Chethan
full_name: Kamath, Chethan
last_name: Kamath
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
citation:
ama: 'Hoffmann C, Hubáček P, Kamath C, Pietrzak KZ. Certifying giant nonprimes.
In: Public-Key Cryptography - PKC 2023. Vol 13940. Springer Nature; 2023:530-553.
doi:10.1007/978-3-031-31368-4_19'
apa: 'Hoffmann, C., Hubáček, P., Kamath, C., & Pietrzak, K. Z. (2023). Certifying
giant nonprimes. In Public-Key Cryptography - PKC 2023 (Vol. 13940, pp.
530–553). Atlanta, GA, United States: Springer Nature. https://doi.org/10.1007/978-3-031-31368-4_19'
chicago: Hoffmann, Charlotte, Pavel Hubáček, Chethan Kamath, and Krzysztof Z Pietrzak.
“Certifying Giant Nonprimes.” In Public-Key Cryptography - PKC 2023, 13940:530–53.
Springer Nature, 2023. https://doi.org/10.1007/978-3-031-31368-4_19.
ieee: C. Hoffmann, P. Hubáček, C. Kamath, and K. Z. Pietrzak, “Certifying giant
nonprimes,” in Public-Key Cryptography - PKC 2023, Atlanta, GA, United
States, 2023, vol. 13940, pp. 530–553.
ista: 'Hoffmann C, Hubáček P, Kamath C, Pietrzak KZ. 2023. Certifying giant nonprimes.
Public-Key Cryptography - PKC 2023. PKC: Public-Key Cryptography, LNCS, vol. 13940,
530–553.'
mla: Hoffmann, Charlotte, et al. “Certifying Giant Nonprimes.” Public-Key Cryptography
- PKC 2023, vol. 13940, Springer Nature, 2023, pp. 530–53, doi:10.1007/978-3-031-31368-4_19.
short: C. Hoffmann, P. Hubáček, C. Kamath, K.Z. Pietrzak, in:, Public-Key Cryptography
- PKC 2023, Springer Nature, 2023, pp. 530–553.
conference:
end_date: 2023-05-10
location: Atlanta, GA, United States
name: 'PKC: Public-Key Cryptography'
start_date: 2023-05-07
date_created: 2023-06-18T22:00:47Z
date_published: 2023-05-02T00:00:00Z
date_updated: 2023-06-19T08:03:37Z
day: '02'
department:
- _id: KrPi
doi: 10.1007/978-3-031-31368-4_19
intvolume: ' 13940'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2023/238
month: '05'
oa: 1
oa_version: Submitted Version
page: 530-553
publication: Public-Key Cryptography - PKC 2023
publication_identifier:
eissn:
- 1611-3349
isbn:
- '9783031313677'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Certifying giant nonprimes
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 13940
year: '2023'
...
---
_id: '13142'
abstract:
- lang: eng
text: Reinforcement learning has received much attention for learning controllers
of deterministic systems. We consider a learner-verifier framework for stochastic
control systems and survey recent methods that formally guarantee a conjunction
of reachability and safety properties. Given a property and a lower bound on the
probability of the property being satisfied, our framework jointly learns a control
policy and a formal certificate to ensure the satisfaction of the property with
a desired probability threshold. Both the control policy and the formal certificate
are continuous functions from states to reals, which are learned as parameterized
neural networks. While in the deterministic case, the certificates are invariant
and barrier functions for safety, or Lyapunov and ranking functions for liveness,
in the stochastic case the certificates are supermartingales. For certificate
verification, we use interval arithmetic abstract interpretation to bound the
expected values of neural network functions.
acknowledgement: This work was supported in part by the ERC-2020-AdG 101020093, ERC
CoG 863818 (FoRM-SMArt) and the European Union’s Horizon 2020 research and innovation
programme under the Marie Skłodowska-Curie Grant Agreement No. 665385.
alternative_title:
- LNCS
article_processing_charge: No
author:
- 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
- first_name: Mathias
full_name: Lechner, Mathias
id: 3DC22916-F248-11E8-B48F-1D18A9856A87
last_name: Lechner
- first_name: Dorde
full_name: Zikelic, Dorde
id: 294AA7A6-F248-11E8-B48F-1D18A9856A87
last_name: Zikelic
citation:
ama: 'Chatterjee K, Henzinger TA, Lechner M, Zikelic D. A learner-verifier framework
for neural network controllers and certificates of stochastic systems. In: Tools
and Algorithms for the Construction and Analysis of Systems . Vol 13993. Springer
Nature; 2023:3-25. doi:10.1007/978-3-031-30823-9_1'
apa: 'Chatterjee, K., Henzinger, T. A., Lechner, M., & Zikelic, D. (2023). A
learner-verifier framework for neural network controllers and certificates of
stochastic systems. In Tools and Algorithms for the Construction and Analysis
of Systems (Vol. 13993, pp. 3–25). Paris, France: Springer Nature. https://doi.org/10.1007/978-3-031-30823-9_1'
chicago: Chatterjee, Krishnendu, Thomas A Henzinger, Mathias Lechner, and Dorde
Zikelic. “A Learner-Verifier Framework for Neural Network Controllers and Certificates
of Stochastic Systems.” In Tools and Algorithms for the Construction and Analysis
of Systems , 13993:3–25. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-30823-9_1.
ieee: K. Chatterjee, T. A. Henzinger, M. Lechner, and D. Zikelic, “A learner-verifier
framework for neural network controllers and certificates of stochastic systems,”
in Tools and Algorithms for the Construction and Analysis of Systems ,
Paris, France, 2023, vol. 13993, pp. 3–25.
ista: 'Chatterjee K, Henzinger TA, Lechner M, Zikelic D. 2023. A learner-verifier
framework for neural network controllers and certificates of stochastic systems.
Tools and Algorithms for the Construction and Analysis of Systems . TACAS: Tools
and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 13993,
3–25.'
mla: Chatterjee, Krishnendu, et al. “A Learner-Verifier Framework for Neural Network
Controllers and Certificates of Stochastic Systems.” Tools and Algorithms for
the Construction and Analysis of Systems , vol. 13993, Springer Nature, 2023,
pp. 3–25, doi:10.1007/978-3-031-30823-9_1.
short: K. Chatterjee, T.A. Henzinger, M. Lechner, D. Zikelic, in:, Tools and Algorithms
for the Construction and Analysis of Systems , Springer Nature, 2023, pp. 3–25.
conference:
end_date: 2023-04-27
location: Paris, France
name: 'TACAS: Tools and Algorithms for the Construction and Analysis of Systems'
start_date: 2023-04-22
date_created: 2023-06-18T22:00:47Z
date_published: 2023-04-22T00:00:00Z
date_updated: 2023-06-19T08:30:54Z
day: '22'
ddc:
- '000'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1007/978-3-031-30823-9_1
ec_funded: 1
file:
- access_level: open_access
checksum: 3d8a8bb24d211bc83360dfc2fd744307
content_type: application/pdf
creator: dernst
date_created: 2023-06-19T08:29:30Z
date_updated: 2023-06-19T08:29:30Z
file_id: '13150'
file_name: 2023_LNCS_Chatterjee.pdf
file_size: 528455
relation: main_file
success: 1
file_date_updated: 2023-06-19T08:29:30Z
has_accepted_license: '1'
intvolume: ' 13993'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: 3-25
project:
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
publication: 'Tools and Algorithms for the Construction and Analysis of Systems '
publication_identifier:
eissn:
- 1611-3349
isbn:
- '9783031308222'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: A learner-verifier framework for neural network controllers and certificates
of stochastic systems
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: 13993
year: '2023'
...