---
_id: '9103'
abstract:
- lang: eng
text: 'We introduce LRT-NG, a set of techniques and an associated toolset that computes
a reachtube (an over-approximation of the set of reachable states over a given
time horizon) of a nonlinear dynamical system. LRT-NG significantly advances the
state-of-the-art Langrangian Reachability and its associated tool LRT. From a
theoretical perspective, LRT-NG is superior to LRT in three ways. First, it uses
for the first time an analytically computed metric for the propagated ball which
is proven to minimize the ball’s volume. We emphasize that the metric computation
is the centerpiece of all bloating-based techniques. Secondly, it computes the
next reachset as the intersection of two balls: one based on the Cartesian metric
and the other on the new metric. While the two metrics were previously considered
opposing approaches, their joint use considerably tightens the reachtubes. Thirdly,
it avoids the "wrapping effect" associated with the validated integration of the
center of the reachset, by optimally absorbing the interval approximation in the
radius of the next ball. From a tool-development perspective, LRT-NG is superior
to LRT in two ways. First, it is a standalone tool that no longer relies on CAPD.
This required the implementation of the Lohner method and a Runge-Kutta time-propagation
method. Secondly, it has an improved interface, allowing the input model and initial
conditions to be provided as external input files. Our experiments on a comprehensive
set of benchmarks, including two Neural ODEs, demonstrates LRT-NG’s superior performance
compared to LRT, CAPD, and Flow*.'
acknowledgement: "The authors would like to thank Ramin Hasani and Guillaume Berger
for intellectual discussions about the research which lead to the generation of
new ideas. ML was supported in part by the Austrian Science Fund (FWF) under grant
Z211-N23 (Wittgenstein Award). Smolka’s research was supported by NSF grants CPS-1446832
and CCF-1918225. Gruenbacher is funded by FWF project W1255-N23. JC was partially
supported by NAWA Polish Returns grant\r\nPPN/PPO/2018/1/00029.\r\n"
article_processing_charge: No
author:
- first_name: Sophie
full_name: Gruenbacher, Sophie
last_name: Gruenbacher
- first_name: Jacek
full_name: Cyranka, Jacek
last_name: Cyranka
- first_name: Mathias
full_name: Lechner, Mathias
id: 3DC22916-F248-11E8-B48F-1D18A9856A87
last_name: Lechner
- first_name: Md Ariful
full_name: Islam, Md Ariful
last_name: Islam
- first_name: Scott A.
full_name: Smolka, Scott A.
last_name: Smolka
- first_name: Radu
full_name: Grosu, Radu
last_name: Grosu
citation:
ama: 'Gruenbacher S, Cyranka J, Lechner M, Islam MA, Smolka SA, Grosu R. Lagrangian
reachtubes: The next generation. In: Proceedings of the 59th IEEE Conference
on Decision and Control. Vol 2020. IEEE; 2020:1556-1563. doi:10.1109/CDC42340.2020.9304042'
apa: 'Gruenbacher, S., Cyranka, J., Lechner, M., Islam, M. A., Smolka, S. A., &
Grosu, R. (2020). Lagrangian reachtubes: The next generation. In Proceedings
of the 59th IEEE Conference on Decision and Control (Vol. 2020, pp. 1556–1563).
Jeju Islang, Korea (South): IEEE. https://doi.org/10.1109/CDC42340.2020.9304042'
chicago: 'Gruenbacher, Sophie, Jacek Cyranka, Mathias Lechner, Md Ariful Islam,
Scott A. Smolka, and Radu Grosu. “Lagrangian Reachtubes: The next Generation.”
In Proceedings of the 59th IEEE Conference on Decision and Control, 2020:1556–63.
IEEE, 2020. https://doi.org/10.1109/CDC42340.2020.9304042.'
ieee: 'S. Gruenbacher, J. Cyranka, M. Lechner, M. A. Islam, S. A. Smolka, and R.
Grosu, “Lagrangian reachtubes: The next generation,” in Proceedings of the
59th IEEE Conference on Decision and Control, Jeju Islang, Korea (South),
2020, vol. 2020, pp. 1556–1563.'
ista: 'Gruenbacher S, Cyranka J, Lechner M, Islam MA, Smolka SA, Grosu R. 2020.
Lagrangian reachtubes: The next generation. Proceedings of the 59th IEEE Conference
on Decision and Control. CDC: Conference on Decision and Control vol. 2020, 1556–1563.'
mla: 'Gruenbacher, Sophie, et al. “Lagrangian Reachtubes: The next Generation.”
Proceedings of the 59th IEEE Conference on Decision and Control, vol. 2020,
IEEE, 2020, pp. 1556–63, doi:10.1109/CDC42340.2020.9304042.'
short: S. Gruenbacher, J. Cyranka, M. Lechner, M.A. Islam, S.A. Smolka, R. Grosu,
in:, Proceedings of the 59th IEEE Conference on Decision and Control, IEEE, 2020,
pp. 1556–1563.
conference:
end_date: 2020-12-18
location: Jeju Islang, Korea (South)
name: 'CDC: Conference on Decision and Control'
start_date: 2020-12-14
date_created: 2021-02-07T23:01:14Z
date_published: 2020-12-14T00:00:00Z
date_updated: 2021-02-09T09:20:58Z
day: '14'
department:
- _id: ToHe
doi: 10.1109/CDC42340.2020.9304042
external_id:
arxiv:
- '2012.07458'
intvolume: ' 2020'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2012.07458
month: '12'
oa: 1
oa_version: Preprint
page: 1556-1563
project:
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
publication: Proceedings of the 59th IEEE Conference on Decision and Control
publication_identifier:
isbn:
- '9781728174471'
issn:
- '07431546'
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Lagrangian reachtubes: The next generation'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2020
year: '2020'
...
---
_id: '10672'
abstract:
- lang: eng
text: The family of feedback alignment (FA) algorithms aims to provide a more biologically
motivated alternative to backpropagation (BP), by substituting the computations
that are unrealistic to be implemented in physical brains. While FA algorithms
have been shown to work well in practice, there is a lack of rigorous theory proofing
their learning capabilities. Here we introduce the first feedback alignment algorithm
with provable learning guarantees. In contrast to existing work, we do not require
any assumption about the size or depth of the network except that it has a single
output neuron, i.e., such as for binary classification tasks. We show that our
FA algorithm can deliver its theoretical promises in practice, surpassing the
learning performance of existing FA methods and matching backpropagation in binary
classification tasks. Finally, we demonstrate the limits of our FA variant when
the number of output neurons grows beyond a certain quantity.
acknowledgement: "This research was supported in part by the Austrian Science Fund
(FWF) under grant Z211-N23\r\n(Wittgenstein Award).\r\n"
article_processing_charge: No
author:
- first_name: Mathias
full_name: Lechner, Mathias
id: 3DC22916-F248-11E8-B48F-1D18A9856A87
last_name: Lechner
citation:
ama: 'Lechner M. Learning representations for binary-classification without backpropagation.
In: 8th International Conference on Learning Representations. ICLR; 2020.'
apa: 'Lechner, M. (2020). Learning representations for binary-classification without
backpropagation. In 8th International Conference on Learning Representations.
Virtual ; Addis Ababa, Ethiopia: ICLR.'
chicago: Lechner, Mathias. “Learning Representations for Binary-Classification without
Backpropagation.” In 8th International Conference on Learning Representations.
ICLR, 2020.
ieee: M. Lechner, “Learning representations for binary-classification without backpropagation,”
in 8th International Conference on Learning Representations, Virtual ;
Addis Ababa, Ethiopia, 2020.
ista: 'Lechner M. 2020. Learning representations for binary-classification without
backpropagation. 8th International Conference on Learning Representations. ICLR:
International Conference on Learning Representations.'
mla: Lechner, Mathias. “Learning Representations for Binary-Classification without
Backpropagation.” 8th International Conference on Learning Representations,
ICLR, 2020.
short: M. Lechner, in:, 8th International Conference on Learning Representations,
ICLR, 2020.
conference:
end_date: 2020-05-01
location: Virtual ; Addis Ababa, Ethiopia
name: 'ICLR: International Conference on Learning Representations'
start_date: 2020-04-26
date_created: 2022-01-25T15:50:00Z
date_published: 2020-03-11T00:00:00Z
date_updated: 2023-04-03T07:33:40Z
day: '11'
ddc:
- '000'
department:
- _id: GradSch
- _id: ToHe
file:
- access_level: open_access
checksum: ea13d42dd4541ddb239b6a75821fd6c9
content_type: application/pdf
creator: mlechner
date_created: 2022-01-26T07:35:17Z
date_updated: 2022-01-26T07:35:17Z
file_id: '10677'
file_name: iclr_2020.pdf
file_size: 249431
relation: main_file
success: 1
file_date_updated: 2022-01-26T07:35:17Z
has_accepted_license: '1'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-nd/3.0/
main_file_link:
- open_access: '1'
url: https://openreview.net/forum?id=Bke61krFvS
month: '03'
oa: 1
oa_version: Published Version
project:
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
publication: 8th International Conference on Learning Representations
publication_status: published
publisher: ICLR
quality_controlled: '1'
scopus_import: '1'
status: public
title: Learning representations for binary-classification without backpropagation
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND
3.0)
short: CC BY-NC-ND (3.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2020'
...
---
_id: '7808'
abstract:
- lang: eng
text: Quantization converts neural networks into low-bit fixed-point computations
which can be carried out by efficient integer-only hardware, and is standard practice
for the deployment of neural networks on real-time embedded devices. However,
like their real-numbered counterpart, quantized networks are not immune to malicious
misclassification caused by adversarial attacks. We investigate how quantization
affects a network’s robustness to adversarial attacks, which is a formal verification
question. We show that neither robustness nor non-robustness are monotonic with
changing the number of bits for the representation and, also, neither are preserved
by quantization from a real-numbered network. For this reason, we introduce a
verification method for quantized neural networks which, using SMT solving over
bit-vectors, accounts for their exact, bit-precise semantics. We built a tool
and analyzed the effect of quantization on a classifier for the MNIST dataset.
We demonstrate that, compared to our method, existing methods for the analysis
of real-numbered networks often derive false conclusions about their quantizations,
both when determining robustness and when detecting attacks, and that existing
methods for quantized networks often miss attacks. Furthermore, we applied our
method beyond robustness, showing how the number of bits in quantization enlarges
the gender bias of a predictor for students’ grades.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Mirco
full_name: Giacobbe, Mirco
id: 3444EA5E-F248-11E8-B48F-1D18A9856A87
last_name: Giacobbe
orcid: 0000-0001-8180-0904
- 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
citation:
ama: 'Giacobbe M, Henzinger TA, Lechner M. How many bits does it take to quantize
your neural network? In: International Conference on Tools and Algorithms for
the Construction and Analysis of Systems. Vol 12079. Springer Nature; 2020:79-97.
doi:10.1007/978-3-030-45237-7_5'
apa: 'Giacobbe, M., Henzinger, T. A., & Lechner, M. (2020). How many bits does
it take to quantize your neural network? In International Conference on Tools
and Algorithms for the Construction and Analysis of Systems (Vol. 12079, pp.
79–97). Dublin, Ireland: Springer Nature. https://doi.org/10.1007/978-3-030-45237-7_5'
chicago: Giacobbe, Mirco, Thomas A Henzinger, and Mathias Lechner. “How Many Bits
Does It Take to Quantize Your Neural Network?” In International Conference
on Tools and Algorithms for the Construction and Analysis of Systems, 12079:79–97.
Springer Nature, 2020. https://doi.org/10.1007/978-3-030-45237-7_5.
ieee: M. Giacobbe, T. A. Henzinger, and M. Lechner, “How many bits does it take
to quantize your neural network?,” in International Conference on Tools and
Algorithms for the Construction and Analysis of Systems, Dublin, Ireland,
2020, vol. 12079, pp. 79–97.
ista: 'Giacobbe M, Henzinger TA, Lechner M. 2020. How many bits does it take to
quantize your neural network? International Conference on Tools and Algorithms
for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for
the Construction and Analysis of Systems, LNCS, vol. 12079, 79–97.'
mla: Giacobbe, Mirco, et al. “How Many Bits Does It Take to Quantize Your Neural
Network?” International Conference on Tools and Algorithms for the Construction
and Analysis of Systems, vol. 12079, Springer Nature, 2020, pp. 79–97, doi:10.1007/978-3-030-45237-7_5.
short: M. Giacobbe, T.A. Henzinger, M. Lechner, in:, International Conference on
Tools and Algorithms for the Construction and Analysis of Systems, Springer Nature,
2020, pp. 79–97.
conference:
end_date: 2020-04-30
location: Dublin, Ireland
name: 'TACAS: Tools and Algorithms for the Construction and Analysis of Systems'
start_date: 2020-04-25
date_created: 2020-05-10T22:00:49Z
date_published: 2020-04-17T00:00:00Z
date_updated: 2023-06-23T07:01:11Z
day: '17'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1007/978-3-030-45237-7_5
file:
- access_level: open_access
checksum: f19905a42891fe5ce93d69143fa3f6fb
content_type: application/pdf
creator: dernst
date_created: 2020-05-26T12:48:15Z
date_updated: 2020-07-14T12:48:03Z
file_id: '7893'
file_name: 2020_TACAS_Giacobbe.pdf
file_size: 2744030
relation: main_file
file_date_updated: 2020-07-14T12:48:03Z
has_accepted_license: '1'
intvolume: ' 12079'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '04'
oa: 1
oa_version: Published Version
page: 79-97
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
publication: International Conference on Tools and Algorithms for the Construction
and Analysis of Systems
publication_identifier:
eissn:
- '16113349'
isbn:
- '9783030452360'
issn:
- '03029743'
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '11362'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: How many bits does it take to quantize your neural network?
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: 12079
year: '2020'
...
---
_id: '6761'
abstract:
- lang: eng
text: In resource allocation games, selfish players share resources that are needed
in order to fulfill their objectives. The cost of using a resource depends on
the load on it. In the traditional setting, the players make their choices concurrently
and in one-shot. That is, a strategy for a player is a subset of the resources.
We introduce and study dynamic resource allocation games. In this setting, the
game proceeds in phases. In each phase each player chooses one resource. A scheduler
dictates the order in which the players proceed in a phase, possibly scheduling
several players to proceed concurrently. The game ends when each player has collected
a set of resources that fulfills his objective. The cost for each player then
depends on this set as well as on the load on the resources in it – we consider
both congestion and cost-sharing games. We argue that the dynamic setting is the
suitable setting for many applications in practice. We study the stability of
dynamic resource allocation games, where the appropriate notion of stability is
that of subgame perfect equilibrium, study the inefficiency incurred due to selfish
behavior, and also study problems that are particular to the dynamic setting,
like constraints on the order in which resources can be chosen or the problem
of finding a scheduler that achieves stability.
article_processing_charge: No
article_type: original
author:
- first_name: Guy
full_name: Avni, Guy
id: 463C8BC2-F248-11E8-B48F-1D18A9856A87
last_name: Avni
orcid: 0000-0001-5588-8287
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Orna
full_name: Kupferman, Orna
last_name: Kupferman
citation:
ama: Avni G, Henzinger TA, Kupferman O. Dynamic resource allocation games. Theoretical
Computer Science. 2020;807:42-55. doi:10.1016/j.tcs.2019.06.031
apa: Avni, G., Henzinger, T. A., & Kupferman, O. (2020). Dynamic resource allocation
games. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2019.06.031
chicago: Avni, Guy, Thomas A Henzinger, and Orna Kupferman. “Dynamic Resource Allocation
Games.” Theoretical Computer Science. Elsevier, 2020. https://doi.org/10.1016/j.tcs.2019.06.031.
ieee: G. Avni, T. A. Henzinger, and O. Kupferman, “Dynamic resource allocation games,”
Theoretical Computer Science, vol. 807. Elsevier, pp. 42–55, 2020.
ista: Avni G, Henzinger TA, Kupferman O. 2020. Dynamic resource allocation games.
Theoretical Computer Science. 807, 42–55.
mla: Avni, Guy, et al. “Dynamic Resource Allocation Games.” Theoretical Computer
Science, vol. 807, Elsevier, 2020, pp. 42–55, doi:10.1016/j.tcs.2019.06.031.
short: G. Avni, T.A. Henzinger, O. Kupferman, Theoretical Computer Science 807 (2020)
42–55.
date_created: 2019-08-04T21:59:20Z
date_published: 2020-02-06T00:00:00Z
date_updated: 2023-08-17T13:52:49Z
day: '06'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1016/j.tcs.2019.06.031
external_id:
isi:
- '000512219400004'
file:
- access_level: open_access
checksum: e86635417f45eb2cd75778f91382f737
content_type: application/pdf
creator: dernst
date_created: 2020-10-09T06:31:22Z
date_updated: 2020-10-09T06:31:22Z
file_id: '8639'
file_name: 2020_TheoreticalCS_Avni.pdf
file_size: 1413001
relation: main_file
success: 1
file_date_updated: 2020-10-09T06:31:22Z
has_accepted_license: '1'
intvolume: ' 807'
isi: 1
language:
- iso: eng
month: '02'
oa: 1
oa_version: Submitted Version
page: 42-55
project:
- _id: 25F2ACDE-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Rigorous Systems Engineering
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
- _id: 264B3912-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: M02369
name: Formal Methods meets Algorithmic Game Theory
publication: Theoretical Computer Science
publication_identifier:
issn:
- '03043975'
publication_status: published
publisher: Elsevier
quality_controlled: '1'
related_material:
record:
- id: '1341'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Dynamic resource allocation games
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 807
year: '2020'
...
---
_id: '7505'
abstract:
- lang: eng
text: Neural networks have demonstrated unmatched performance in a range of classification
tasks. Despite numerous efforts of the research community, novelty detection remains
one of the significant limitations of neural networks. The ability to identify
previously unseen inputs as novel is crucial for our understanding of the decisions
made by neural networks. At runtime, inputs not falling into any of the categories
learned during training cannot be classified correctly by the neural network.
Existing approaches treat the neural network as a black box and try to detect
novel inputs based on the confidence of the output predictions. However, neural
networks are not trained to reduce their confidence for novel inputs, which limits
the effectiveness of these approaches. We propose a framework to monitor a neural
network by observing the hidden layers. We employ a common abstraction from program
analysis - boxes - to identify novel behaviors in the monitored layers, i.e.,
inputs that cause behaviors outside the box. For each neuron, the boxes range
over the values seen in training. The framework is efficient and flexible to achieve
a desired trade-off between raising false warnings and detecting novel inputs.
We illustrate the performance and the robustness to variability in the unknown
classes on popular image-classification benchmarks.
acknowledgement: We thank Christoph Lampert and Nikolaus Mayer for fruitful discussions.
This research was supported in part by the Austrian Science Fund (FWF) under grants
S11402-N23 (RiSE/SHiNE) and Z211-N23 (Wittgenstein Award) and the European Union’s
Horizon 2020 research and innovation programme under the Marie SkłodowskaCurie grant
agreement No. 754411.
alternative_title:
- Frontiers in Artificial Intelligence and Applications
article_processing_charge: No
author:
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000-0002-2985-7724
- first_name: Anna
full_name: Lukina, Anna
id: CBA4D1A8-0FE8-11E9-BDE6-07BFE5697425
last_name: Lukina
- first_name: Christian
full_name: Schilling, Christian
id: 3A2F4DCE-F248-11E8-B48F-1D18A9856A87
last_name: Schilling
orcid: 0000-0003-3658-1065
citation:
ama: 'Henzinger TA, Lukina A, Schilling C. Outside the box: Abstraction-based monitoring
of neural networks. In: 24th European Conference on Artificial Intelligence.
Vol 325. IOS Press; 2020:2433-2440. doi:10.3233/FAIA200375'
apa: 'Henzinger, T. A., Lukina, A., & Schilling, C. (2020). Outside the box:
Abstraction-based monitoring of neural networks. In 24th European Conference
on Artificial Intelligence (Vol. 325, pp. 2433–2440). Santiago de Compostela,
Spain: IOS Press. https://doi.org/10.3233/FAIA200375'
chicago: 'Henzinger, Thomas A, Anna Lukina, and Christian Schilling. “Outside the
Box: Abstraction-Based Monitoring of Neural Networks.” In 24th European Conference
on Artificial Intelligence, 325:2433–40. IOS Press, 2020. https://doi.org/10.3233/FAIA200375.'
ieee: 'T. A. Henzinger, A. Lukina, and C. Schilling, “Outside the box: Abstraction-based
monitoring of neural networks,” in 24th European Conference on Artificial Intelligence,
Santiago de Compostela, Spain, 2020, vol. 325, pp. 2433–2440.'
ista: 'Henzinger TA, Lukina A, Schilling C. 2020. Outside the box: Abstraction-based
monitoring of neural networks. 24th European Conference on Artificial Intelligence.
ECAI: European Conference on Artificial Intelligence, Frontiers in Artificial
Intelligence and Applications, vol. 325, 2433–2440.'
mla: 'Henzinger, Thomas A., et al. “Outside the Box: Abstraction-Based Monitoring
of Neural Networks.” 24th European Conference on Artificial Intelligence,
vol. 325, IOS Press, 2020, pp. 2433–40, doi:10.3233/FAIA200375.'
short: T.A. Henzinger, A. Lukina, C. Schilling, in:, 24th European Conference on
Artificial Intelligence, IOS Press, 2020, pp. 2433–2440.
conference:
end_date: 2020-09-08
location: Santiago de Compostela, Spain
name: 'ECAI: European Conference on Artificial Intelligence'
start_date: 2020-08-29
date_created: 2020-02-21T16:44:03Z
date_published: 2020-02-24T00:00:00Z
date_updated: 2023-08-18T06:38:16Z
day: '24'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.3233/FAIA200375
ec_funded: 1
external_id:
arxiv:
- '1911.09032'
isi:
- '000650971303002'
file:
- access_level: open_access
checksum: 80642fa0b6cd7da95dcd87d63789ad5e
content_type: application/pdf
creator: dernst
date_created: 2020-09-21T07:12:32Z
date_updated: 2020-09-21T07:12:32Z
file_id: '8540'
file_name: 2020_ECAI_Henzinger.pdf
file_size: 1692214
relation: main_file
success: 1
file_date_updated: 2020-09-21T07:12:32Z
has_accepted_license: '1'
intvolume: ' 325'
isi: 1
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc/4.0/
month: '02'
oa: 1
oa_version: Published Version
page: 2433-2440
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
publication: 24th European Conference on Artificial Intelligence
publication_status: published
publisher: IOS Press
quality_controlled: '1'
status: public
title: 'Outside the box: Abstraction-based monitoring of neural networks'
tmp:
image: /images/cc_by_nc.png
legal_code_url: https://creativecommons.org/licenses/by-nc/4.0/legalcode
name: Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)
short: CC BY-NC (4.0)
type: conference
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 325
year: '2020'
...
---
_id: '8194'
abstract:
- lang: eng
text: 'Fixed-point arithmetic is a popular alternative to floating-point arithmetic
on embedded systems. Existing work on the verification of fixed-point programs
relies on custom formalizations of fixed-point arithmetic, which makes it hard
to compare the described techniques or reuse the implementations. In this paper,
we address this issue by proposing and formalizing an SMT theory of fixed-point
arithmetic. We present an intuitive yet comprehensive syntax of the fixed-point
theory, and provide formal semantics for it based on rational arithmetic. We also
describe two decision procedures for this theory: one based on the theory of bit-vectors
and the other on the theory of reals. We implement the two decision procedures,
and evaluate our implementations using existing mature SMT solvers on a benchmark
suite we created. Finally, we perform a case study of using the theory we propose
to verify properties of quantized neural networks.'
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Marek
full_name: Baranowski, Marek
last_name: Baranowski
- first_name: Shaobo
full_name: He, Shaobo
last_name: He
- first_name: Mathias
full_name: Lechner, Mathias
id: 3DC22916-F248-11E8-B48F-1D18A9856A87
last_name: Lechner
- first_name: Thanh Son
full_name: Nguyen, Thanh Son
last_name: Nguyen
- first_name: Zvonimir
full_name: Rakamarić, Zvonimir
last_name: Rakamarić
citation:
ama: 'Baranowski M, He S, Lechner M, Nguyen TS, Rakamarić Z. An SMT theory of fixed-point
arithmetic. In: Automated Reasoning. Vol 12166. Springer Nature; 2020:13-31.
doi:10.1007/978-3-030-51074-9_2'
apa: 'Baranowski, M., He, S., Lechner, M., Nguyen, T. S., & Rakamarić, Z. (2020).
An SMT theory of fixed-point arithmetic. In Automated Reasoning (Vol. 12166,
pp. 13–31). Paris, France: Springer Nature. https://doi.org/10.1007/978-3-030-51074-9_2'
chicago: Baranowski, Marek, Shaobo He, Mathias Lechner, Thanh Son Nguyen, and Zvonimir
Rakamarić. “An SMT Theory of Fixed-Point Arithmetic.” In Automated Reasoning,
12166:13–31. Springer Nature, 2020. https://doi.org/10.1007/978-3-030-51074-9_2.
ieee: M. Baranowski, S. He, M. Lechner, T. S. Nguyen, and Z. Rakamarić, “An SMT
theory of fixed-point arithmetic,” in Automated Reasoning, Paris, France,
2020, vol. 12166, pp. 13–31.
ista: 'Baranowski M, He S, Lechner M, Nguyen TS, Rakamarić Z. 2020. An SMT theory
of fixed-point arithmetic. Automated Reasoning. IJCAR: International Joint Conference
on Automated Reasoning, LNCS, vol. 12166, 13–31.'
mla: Baranowski, Marek, et al. “An SMT Theory of Fixed-Point Arithmetic.” Automated
Reasoning, vol. 12166, Springer Nature, 2020, pp. 13–31, doi:10.1007/978-3-030-51074-9_2.
short: M. Baranowski, S. He, M. Lechner, T.S. Nguyen, Z. Rakamarić, in:, Automated
Reasoning, Springer Nature, 2020, pp. 13–31.
conference:
end_date: 2020-07-04
location: Paris, France
name: 'IJCAR: International Joint Conference on Automated Reasoning'
start_date: 2020-07-01
date_created: 2020-08-02T22:00:59Z
date_published: 2020-06-24T00:00:00Z
date_updated: 2023-08-22T08:27:25Z
day: '24'
department:
- _id: ToHe
doi: 10.1007/978-3-030-51074-9_2
external_id:
isi:
- '000884318000002'
intvolume: ' 12166'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1007/978-3-030-51074-9_2
month: '06'
oa: 1
oa_version: Published Version
page: 13-31
project:
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
publication: Automated Reasoning
publication_identifier:
eissn:
- '16113349'
isbn:
- '9783030510732'
issn:
- '03029743'
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: An SMT theory of fixed-point arithmetic
type: conference
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 12166
year: '2020'
...
---
_id: '8679'
abstract:
- lang: eng
text: A central goal of artificial intelligence in high-stakes decision-making applications
is to design a single algorithm that simultaneously expresses generalizability
by learning coherent representations of their world and interpretable explanations
of its dynamics. Here, we combine brain-inspired neural computation principles
and scalable deep learning architectures to design compact neural controllers
for task-specific compartments of a full-stack autonomous vehicle control system.
We discover that a single algorithm with 19 control neurons, connecting 32 encapsulated
input features to outputs by 253 synapses, learns to map high-dimensional inputs
into steering commands. This system shows superior generalizability, interpretability
and robustness compared with orders-of-magnitude larger black-box learning systems.
The obtained neural agents enable high-fidelity autonomy for task-specific parts
of a complex autonomous system.
article_processing_charge: No
article_type: original
author:
- first_name: Mathias
full_name: Lechner, Mathias
id: 3DC22916-F248-11E8-B48F-1D18A9856A87
last_name: Lechner
- first_name: Ramin
full_name: Hasani, Ramin
last_name: Hasani
- first_name: Alexander
full_name: Amini, Alexander
last_name: Amini
- 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: Daniela
full_name: Rus, Daniela
last_name: Rus
- first_name: Radu
full_name: Grosu, Radu
last_name: Grosu
citation:
ama: Lechner M, Hasani R, Amini A, Henzinger TA, Rus D, Grosu R. Neural circuit
policies enabling auditable autonomy. Nature Machine Intelligence. 2020;2:642-652.
doi:10.1038/s42256-020-00237-3
apa: Lechner, M., Hasani, R., Amini, A., Henzinger, T. A., Rus, D., & Grosu,
R. (2020). Neural circuit policies enabling auditable autonomy. Nature Machine
Intelligence. Springer Nature. https://doi.org/10.1038/s42256-020-00237-3
chicago: Lechner, Mathias, Ramin Hasani, Alexander Amini, Thomas A Henzinger, Daniela
Rus, and Radu Grosu. “Neural Circuit Policies Enabling Auditable Autonomy.” Nature
Machine Intelligence. Springer Nature, 2020. https://doi.org/10.1038/s42256-020-00237-3.
ieee: M. Lechner, R. Hasani, A. Amini, T. A. Henzinger, D. Rus, and R. Grosu, “Neural
circuit policies enabling auditable autonomy,” Nature Machine Intelligence,
vol. 2. Springer Nature, pp. 642–652, 2020.
ista: Lechner M, Hasani R, Amini A, Henzinger TA, Rus D, Grosu R. 2020. Neural circuit
policies enabling auditable autonomy. Nature Machine Intelligence. 2, 642–652.
mla: Lechner, Mathias, et al. “Neural Circuit Policies Enabling Auditable Autonomy.”
Nature Machine Intelligence, vol. 2, Springer Nature, 2020, pp. 642–52,
doi:10.1038/s42256-020-00237-3.
short: M. Lechner, R. Hasani, A. Amini, T.A. Henzinger, D. Rus, R. Grosu, Nature
Machine Intelligence 2 (2020) 642–652.
date_created: 2020-10-19T13:46:06Z
date_published: 2020-10-01T00:00:00Z
date_updated: 2023-08-22T10:36:06Z
day: '01'
department:
- _id: ToHe
doi: 10.1038/s42256-020-00237-3
external_id:
isi:
- '000583337200011'
intvolume: ' 2'
isi: 1
language:
- iso: eng
month: '10'
oa_version: None
page: 642-652
project:
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
publication: Nature Machine Intelligence
publication_identifier:
eissn:
- 2522-5839
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
link:
- description: News on IST Homepage
relation: press_release
url: https://ist.ac.at/en/news/new-deep-learning-models/
scopus_import: '1'
status: public
title: Neural circuit policies enabling auditable autonomy
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 2
year: '2020'
...
---
_id: '8704'
abstract:
- lang: eng
text: Traditional robotic control suits require profound task-specific knowledge
for designing, building and testing control software. The rise of Deep Learning
has enabled end-to-end solutions to be learned entirely from data, requiring minimal
knowledge about the application area. We design a learning scheme to train end-to-end
linear dynamical systems (LDS)s by gradient descent in imitation learning robotic
domains. We introduce a new regularization loss component together with a learning
algorithm that improves the stability of the learned autonomous system, by forcing
the eigenvalues of the internal state updates of an LDS to be negative reals.
We evaluate our approach on a series of real-life and simulated robotic experiments,
in comparison to linear and nonlinear Recurrent Neural Network (RNN) architectures.
Our results show that our stabilizing method significantly improves test performance
of LDS, enabling such linear models to match the performance of contemporary nonlinear
RNN architectures. A video of the obstacle avoidance performance of our method
on a mobile robot, in unseen environments, compared to other methods can be viewed
at https://youtu.be/mhEsCoNao5E.
acknowledgement: M.L. is supported in parts by the Austrian Science Fund (FWF) under
grant Z211-N23 (Wittgenstein Award). R.H., and R.G. are partially supported by the
Horizon-2020 ECSELProject grant No. 783163 (iDev40), and the Austrian Research Promotion
Agency (FFG), Project No. 860424. R.H. and D.R. is partially supported by the Boeing
Company.
alternative_title:
- ICRA
article_processing_charge: No
author:
- first_name: Mathias
full_name: Lechner, Mathias
id: 3DC22916-F248-11E8-B48F-1D18A9856A87
last_name: Lechner
- first_name: Ramin
full_name: Hasani, Ramin
last_name: Hasani
- first_name: Daniela
full_name: Rus, Daniela
last_name: Rus
- first_name: Radu
full_name: Grosu, Radu
last_name: Grosu
citation:
ama: 'Lechner M, Hasani R, Rus D, Grosu R. Gershgorin loss stabilizes the recurrent
neural network compartment of an end-to-end robot learning scheme. In: Proceedings
- IEEE International Conference on Robotics and Automation. IEEE; 2020:5446-5452.
doi:10.1109/ICRA40945.2020.9196608'
apa: 'Lechner, M., Hasani, R., Rus, D., & Grosu, R. (2020). Gershgorin loss
stabilizes the recurrent neural network compartment of an end-to-end robot learning
scheme. In Proceedings - IEEE International Conference on Robotics and Automation
(pp. 5446–5452). Paris, France: IEEE. https://doi.org/10.1109/ICRA40945.2020.9196608'
chicago: Lechner, Mathias, Ramin Hasani, Daniela Rus, and Radu Grosu. “Gershgorin
Loss Stabilizes the Recurrent Neural Network Compartment of an End-to-End Robot
Learning Scheme.” In Proceedings - IEEE International Conference on Robotics
and Automation, 5446–52. IEEE, 2020. https://doi.org/10.1109/ICRA40945.2020.9196608.
ieee: M. Lechner, R. Hasani, D. Rus, and R. Grosu, “Gershgorin loss stabilizes the
recurrent neural network compartment of an end-to-end robot learning scheme,”
in Proceedings - IEEE International Conference on Robotics and Automation,
Paris, France, 2020, pp. 5446–5452.
ista: 'Lechner M, Hasani R, Rus D, Grosu R. 2020. Gershgorin loss stabilizes the
recurrent neural network compartment of an end-to-end robot learning scheme. Proceedings
- IEEE International Conference on Robotics and Automation. ICRA: International
Conference on Robotics and Automation, ICRA, , 5446–5452.'
mla: Lechner, Mathias, et al. “Gershgorin Loss Stabilizes the Recurrent Neural Network
Compartment of an End-to-End Robot Learning Scheme.” Proceedings - IEEE International
Conference on Robotics and Automation, IEEE, 2020, pp. 5446–52, doi:10.1109/ICRA40945.2020.9196608.
short: M. Lechner, R. Hasani, D. Rus, R. Grosu, in:, Proceedings - IEEE International
Conference on Robotics and Automation, IEEE, 2020, pp. 5446–5452.
conference:
end_date: 2020-08-31
location: Paris, France
name: 'ICRA: International Conference on Robotics and Automation'
start_date: 2020-05-31
date_created: 2020-10-25T23:01:19Z
date_published: 2020-05-01T00:00:00Z
date_updated: 2023-08-22T10:40:15Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1109/ICRA40945.2020.9196608
external_id:
isi:
- '000712319503110'
file:
- access_level: open_access
checksum: fccf7b986ac78046918a298cc6849a50
content_type: application/pdf
creator: dernst
date_created: 2020-11-06T10:58:49Z
date_updated: 2020-11-06T10:58:49Z
file_id: '8733'
file_name: 2020_ICRA_Lechner.pdf
file_size: 1070010
relation: main_file
success: 1
file_date_updated: 2020-11-06T10:58:49Z
has_accepted_license: '1'
isi: 1
language:
- iso: eng
month: '05'
oa: 1
oa_version: Submitted Version
page: 5446-5452
project:
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
publication: Proceedings - IEEE International Conference on Robotics and Automation
publication_identifier:
isbn:
- '9781728173955'
issn:
- '10504729'
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: Gershgorin loss stabilizes the recurrent neural network compartment of an end-to-end
robot learning scheme
type: conference
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
year: '2020'
...
---
_id: '8750'
abstract:
- lang: eng
text: "Efficiently handling time-triggered and possibly nondeterministic switches\r\nfor
hybrid systems reachability is a challenging task. In this paper we present\r\nan
approach based on conservative set-based enclosure of the dynamics that can\r\nhandle
systems with uncertain parameters and inputs, where the uncertainties\r\nare bound
to given intervals. The method is evaluated on the plant model of an\r\nexperimental
electro-mechanical braking system with periodic controller. In\r\nthis model,
the fast-switching controller dynamics requires simulation time\r\nscales of the
order of nanoseconds. Accurate set-based computations for\r\nrelatively large
time horizons are known to be expensive. However, by\r\nappropriately decoupling
the time variable with respect to the spatial\r\nvariables, and enclosing the
uncertain parameters using interval matrix maps\r\nacting on zonotopes, we show
that the computation time can be lowered to 5000\r\ntimes faster with respect
to previous works. This is a step forward in formal\r\nverification of hybrid
systems because reduced run-times allow engineers to\r\nintroduce more expressiveness
in their models with a relatively inexpensive\r\ncomputational cost."
article_number: '9314994'
article_processing_charge: No
author:
- first_name: Marcelo
full_name: Forets, Marcelo
last_name: Forets
- first_name: Daniel
full_name: Freire, Daniel
last_name: Freire
- first_name: Christian
full_name: Schilling, Christian
id: 3A2F4DCE-F248-11E8-B48F-1D18A9856A87
last_name: Schilling
orcid: 0000-0003-3658-1065
citation:
ama: 'Forets M, Freire D, Schilling C. Efficient reachability analysis of parametric
linear hybrid systems with time-triggered transitions. In: 18th ACM-IEEE International
Conference on Formal Methods and Models for System Design. IEEE; 2020. doi:10.1109/MEMOCODE51338.2020.9314994'
apa: 'Forets, M., Freire, D., & Schilling, C. (2020). Efficient reachability
analysis of parametric linear hybrid systems with time-triggered transitions.
In 18th ACM-IEEE International Conference on Formal Methods and Models for
System Design. Virtual Conference: IEEE. https://doi.org/10.1109/MEMOCODE51338.2020.9314994'
chicago: Forets, Marcelo, Daniel Freire, and Christian Schilling. “Efficient Reachability
Analysis of Parametric Linear Hybrid Systems with Time-Triggered Transitions.”
In 18th ACM-IEEE International Conference on Formal Methods and Models for
System Design. IEEE, 2020. https://doi.org/10.1109/MEMOCODE51338.2020.9314994.
ieee: M. Forets, D. Freire, and C. Schilling, “Efficient reachability analysis of
parametric linear hybrid systems with time-triggered transitions,” in 18th
ACM-IEEE International Conference on Formal Methods and Models for System Design,
Virtual Conference, 2020.
ista: 'Forets M, Freire D, Schilling C. 2020. Efficient reachability analysis of
parametric linear hybrid systems with time-triggered transitions. 18th ACM-IEEE
International Conference on Formal Methods and Models for System Design. MEMOCODE:
Conference on Formal Methods and Models for System Design, 9314994.'
mla: Forets, Marcelo, et al. “Efficient Reachability Analysis of Parametric Linear
Hybrid Systems with Time-Triggered Transitions.” 18th ACM-IEEE International
Conference on Formal Methods and Models for System Design, 9314994, IEEE,
2020, doi:10.1109/MEMOCODE51338.2020.9314994.
short: M. Forets, D. Freire, C. Schilling, in:, 18th ACM-IEEE International Conference
on Formal Methods and Models for System Design, IEEE, 2020.
conference:
end_date: 2020-12-04
location: Virtual Conference
name: 'MEMOCODE: Conference on Formal Methods and Models for System Design'
start_date: 2020-12-02
date_created: 2020-11-10T07:04:57Z
date_published: 2020-12-04T00:00:00Z
date_updated: 2023-08-22T12:48:18Z
day: '04'
department:
- _id: ToHe
doi: 10.1109/MEMOCODE51338.2020.9314994
ec_funded: 1
external_id:
arxiv:
- '2006.12325'
isi:
- '000661920400013'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2006.12325
month: '12'
oa: 1
oa_version: Preprint
project:
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: 18th ACM-IEEE International Conference on Formal Methods and Models for
System Design
publication_identifier:
isbn:
- '9781728191485'
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: Efficient reachability analysis of parametric linear hybrid systems with time-triggered
transitions
type: conference
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
year: '2020'
...
---
_id: '8287'
abstract:
- lang: eng
text: Reachability analysis aims at identifying states reachable by a system within
a given time horizon. This task is known to be computationally expensive for linear
hybrid systems. Reachability analysis works by iteratively applying continuous
and discrete post operators to compute states reachable according to continuous
and discrete dynamics, respectively. In this paper, we enhance both of these operators
and make sure that most of the involved computations are performed in low-dimensional
state space. In particular, we improve the continuous-post operator by performing
computations in high-dimensional state space only for time intervals relevant
for the subsequent application of the discrete-post operator. Furthermore, the
new discrete-post operator performs low-dimensional computations by leveraging
the structure of the guard and assignment of a considered transition. We illustrate
the potential of our approach on a number of challenging benchmarks.
article_processing_charge: No
author:
- first_name: Sergiy
full_name: Bogomolov, Sergiy
last_name: Bogomolov
- first_name: Marcelo
full_name: Forets, Marcelo
last_name: Forets
- first_name: Goran
full_name: Frehse, Goran
last_name: Frehse
- first_name: Kostiantyn
full_name: Potomkin, Kostiantyn
last_name: Potomkin
- first_name: Christian
full_name: Schilling, Christian
id: 3A2F4DCE-F248-11E8-B48F-1D18A9856A87
last_name: Schilling
orcid: 0000-0003-3658-1065
citation:
ama: 'Bogomolov S, Forets M, Frehse G, Potomkin K, Schilling C. Reachability analysis
of linear hybrid systems via block decomposition. In: Proceedings of the International
Conference on Embedded Software. ; 2020.'
apa: Bogomolov, S., Forets, M., Frehse, G., Potomkin, K., & Schilling, C. (2020).
Reachability analysis of linear hybrid systems via block decomposition. In Proceedings
of the International Conference on Embedded Software. Virtual .
chicago: Bogomolov, Sergiy, Marcelo Forets, Goran Frehse, Kostiantyn Potomkin, and
Christian Schilling. “Reachability Analysis of Linear Hybrid Systems via Block
Decomposition.” In Proceedings of the International Conference on Embedded
Software, 2020.
ieee: S. Bogomolov, M. Forets, G. Frehse, K. Potomkin, and C. Schilling, “Reachability
analysis of linear hybrid systems via block decomposition,” in Proceedings
of the International Conference on Embedded Software, Virtual , 2020.
ista: 'Bogomolov S, Forets M, Frehse G, Potomkin K, Schilling C. 2020. Reachability
analysis of linear hybrid systems via block decomposition. Proceedings of the
International Conference on Embedded Software. EMSOFT: International Conference
on Embedded Software.'
mla: Bogomolov, Sergiy, et al. “Reachability Analysis of Linear Hybrid Systems via
Block Decomposition.” Proceedings of the International Conference on Embedded
Software, 2020.
short: S. Bogomolov, M. Forets, G. Frehse, K. Potomkin, C. Schilling, in:, Proceedings
of the International Conference on Embedded Software, 2020.
conference:
end_date: 2020-09-25
location: 'Virtual '
name: 'EMSOFT: International Conference on Embedded Software'
start_date: 2020-09-20
date_created: 2020-08-24T12:56:20Z
date_published: 2020-01-01T00:00:00Z
date_updated: 2023-08-22T13:27:32Z
ddc:
- '000'
department:
- _id: ToHe
ec_funded: 1
external_id:
arxiv:
- '1905.02458'
file:
- access_level: open_access
checksum: d19e97d0f8a3a441dc078ec812297d75
content_type: application/pdf
creator: cschilli
date_created: 2020-08-24T12:53:15Z
date_updated: 2020-08-24T12:53:15Z
file_id: '8288'
file_name: 2020EMSOFT.pdf
file_size: 696384
relation: main_file
success: 1
file_date_updated: 2020-08-24T12:53:15Z
has_accepted_license: '1'
keyword:
- reachability
- hybrid systems
- decomposition
language:
- iso: eng
oa: 1
oa_version: Preprint
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25C5A090-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z00312
name: The Wittgenstein Prize
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: Proceedings of the International Conference on Embedded Software
publication_status: published
quality_controlled: '1'
related_material:
record:
- id: '8790'
relation: later_version
status: public
status: public
title: Reachability analysis of linear hybrid systems via block decomposition
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: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2020'
...
---
_id: '8790'
abstract:
- lang: eng
text: Reachability analysis aims at identifying states reachable by a system within
a given time horizon. This task is known to be computationally expensive for linear
hybrid systems. Reachability analysis works by iteratively applying continuous
and discrete post operators to compute states reachable according to continuous
and discrete dynamics, respectively. In this article, we enhance both of these
operators and make sure that most of the involved computations are performed in
low-dimensional state space. In particular, we improve the continuous-post operator
by performing computations in high-dimensional state space only for time intervals
relevant for the subsequent application of the discrete-post operator. Furthermore,
the new discrete-post operator performs low-dimensional computations by leveraging
the structure of the guard and assignment of a considered transition. We illustrate
the potential of our approach on a number of challenging benchmarks.
acknowledgement: 'This research was supported in part by the Austrian Science Fund
(FWF) under grants S11402-N23 (RiSE/SHiNE) and Z211-N23 (Wittgenstein Award), the
European Union’s Horizon 2020 research and innovation programme under the Marie
Skłodowska-Curie grant agreement No. 754411, and the Air Force Office of Scientific
Research under award number FA2386-17-1-4065. Any opinions, findings, and conclusions
or recommendations expressed in this material are those of the authors and do not
necessarily reflect the views of the United States Air Force. '
article_processing_charge: No
article_type: original
author:
- first_name: Sergiy
full_name: Bogomolov, Sergiy
id: 369D9A44-F248-11E8-B48F-1D18A9856A87
last_name: Bogomolov
orcid: 0000-0002-0686-0365
- first_name: Marcelo
full_name: Forets, Marcelo
last_name: Forets
- first_name: Goran
full_name: Frehse, Goran
last_name: Frehse
- first_name: Kostiantyn
full_name: Potomkin, Kostiantyn
last_name: Potomkin
- first_name: Christian
full_name: Schilling, Christian
id: 3A2F4DCE-F248-11E8-B48F-1D18A9856A87
last_name: Schilling
orcid: 0000-0003-3658-1065
citation:
ama: Bogomolov S, Forets M, Frehse G, Potomkin K, Schilling C. Reachability analysis
of linear hybrid systems via block decomposition. IEEE Transactions on Computer-Aided
Design of Integrated Circuits and Systems. 2020;39(11):4018-4029. doi:10.1109/TCAD.2020.3012859
apa: Bogomolov, S., Forets, M., Frehse, G., Potomkin, K., & Schilling, C. (2020).
Reachability analysis of linear hybrid systems via block decomposition. IEEE
Transactions on Computer-Aided Design of Integrated Circuits and Systems.
IEEE. https://doi.org/10.1109/TCAD.2020.3012859
chicago: Bogomolov, Sergiy, Marcelo Forets, Goran Frehse, Kostiantyn Potomkin, and
Christian Schilling. “Reachability Analysis of Linear Hybrid Systems via Block
Decomposition.” IEEE Transactions on Computer-Aided Design of Integrated Circuits
and Systems. IEEE, 2020. https://doi.org/10.1109/TCAD.2020.3012859.
ieee: S. Bogomolov, M. Forets, G. Frehse, K. Potomkin, and C. Schilling, “Reachability
analysis of linear hybrid systems via block decomposition,” IEEE Transactions
on Computer-Aided Design of Integrated Circuits and Systems, vol. 39, no.
11. IEEE, pp. 4018–4029, 2020.
ista: Bogomolov S, Forets M, Frehse G, Potomkin K, Schilling C. 2020. Reachability
analysis of linear hybrid systems via block decomposition. IEEE Transactions on
Computer-Aided Design of Integrated Circuits and Systems. 39(11), 4018–4029.
mla: Bogomolov, Sergiy, et al. “Reachability Analysis of Linear Hybrid Systems via
Block Decomposition.” IEEE Transactions on Computer-Aided Design of Integrated
Circuits and Systems, vol. 39, no. 11, IEEE, 2020, pp. 4018–29, doi:10.1109/TCAD.2020.3012859.
short: S. Bogomolov, M. Forets, G. Frehse, K. Potomkin, C. Schilling, IEEE Transactions
on Computer-Aided Design of Integrated Circuits and Systems 39 (2020) 4018–4029.
date_created: 2020-11-22T23:01:25Z
date_published: 2020-11-01T00:00:00Z
date_updated: 2023-08-22T13:27:33Z
day: '01'
department:
- _id: ToHe
doi: 10.1109/TCAD.2020.3012859
ec_funded: 1
external_id:
arxiv:
- '1905.02458'
isi:
- '000587712700072'
intvolume: ' 39'
isi: 1
issue: '11'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1905.02458
month: '11'
oa: 1
oa_version: Preprint
page: 4018-4029
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: IEEE Transactions on Computer-Aided Design of Integrated Circuits and
Systems
publication_identifier:
eissn:
- '19374151'
issn:
- '02780070'
publication_status: published
publisher: IEEE
quality_controlled: '1'
related_material:
record:
- id: '8287'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Reachability analysis of linear hybrid systems via block decomposition
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 39
year: '2020'
...
---
_id: '9197'
abstract:
- lang: eng
text: In this paper we introduce and study all-pay bidding games, a class of two
player, zero-sum games on graphs. The game proceeds as follows. We place a token
on some vertex in the graph and assign budgets to the two players. Each turn,
each player submits a sealed legal bid (non-negative and below their remaining
budget), which is deducted from their budget and the highest bidder moves the
token onto an adjacent vertex. The game ends once a sink is reached, and Player
1 pays Player 2 the outcome that is associated with the sink. The players attempt
to maximize their expected outcome. Our games model settings where effort (of
no inherent value) needs to be invested in an ongoing and stateful manner. On
the negative side, we show that even in simple games on DAGs, optimal strategies
may require a distribution over bids with infinite support. A central quantity
in bidding games is the ratio of the players budgets. On the positive side, we
show a simple FPTAS for DAGs, that, for each budget ratio, outputs an approximation
for the optimal strategy for that ratio. We also implement it, show that it performs
well, and suggests interesting properties of these games. Then, given an outcome
c, we show an algorithm for finding the necessary and sufficient initial ratio
for guaranteeing outcome c with probability 1 and a strategy ensuring such. Finally,
while the general case has not previously been studied, solving the specific game
in which Player 1 wins iff he wins the first two auctions, has been long stated
as an open question, which we solve.
acknowledgement: This research was supported by the Austrian Science Fund (FWF) under
grants S11402-N23 (RiSE/SHiNE), Z211-N23 (Wittgenstein Award), and M 2369-N33 (Meitner
fellowship).
article_processing_charge: No
article_type: original
author:
- first_name: Guy
full_name: Avni, Guy
id: 463C8BC2-F248-11E8-B48F-1D18A9856A87
last_name: Avni
orcid: 0000-0001-5588-8287
- first_name: Rasmus
full_name: Ibsen-Jensen, Rasmus
id: 3B699956-F248-11E8-B48F-1D18A9856A87
last_name: Ibsen-Jensen
orcid: 0000-0003-4783-0389
- first_name: Josef
full_name: Tkadlec, Josef
id: 3F24CCC8-F248-11E8-B48F-1D18A9856A87
last_name: Tkadlec
orcid: 0000-0002-1097-9684
citation:
ama: Avni G, Ibsen-Jensen R, Tkadlec J. All-pay bidding games on graphs. Proceedings
of the AAAI Conference on Artificial Intelligence. 2020;34(02):1798-1805.
doi:10.1609/aaai.v34i02.5546
apa: 'Avni, G., Ibsen-Jensen, R., & Tkadlec, J. (2020). All-pay bidding games
on graphs. Proceedings of the AAAI Conference on Artificial Intelligence.
New York, NY, United States: Association for the Advancement of Artificial Intelligence.
https://doi.org/10.1609/aaai.v34i02.5546'
chicago: Avni, Guy, Rasmus Ibsen-Jensen, and Josef Tkadlec. “All-Pay Bidding Games
on Graphs.” Proceedings of the AAAI Conference on Artificial Intelligence.
Association for the Advancement of Artificial Intelligence, 2020. https://doi.org/10.1609/aaai.v34i02.5546.
ieee: G. Avni, R. Ibsen-Jensen, and J. Tkadlec, “All-pay bidding games on graphs,”
Proceedings of the AAAI Conference on Artificial Intelligence, vol. 34,
no. 02. Association for the Advancement of Artificial Intelligence, pp. 1798–1805,
2020.
ista: Avni G, Ibsen-Jensen R, Tkadlec J. 2020. All-pay bidding games on graphs.
Proceedings of the AAAI Conference on Artificial Intelligence. 34(02), 1798–1805.
mla: Avni, Guy, et al. “All-Pay Bidding Games on Graphs.” Proceedings of the
AAAI Conference on Artificial Intelligence, vol. 34, no. 02, Association for
the Advancement of Artificial Intelligence, 2020, pp. 1798–805, doi:10.1609/aaai.v34i02.5546.
short: G. Avni, R. Ibsen-Jensen, J. Tkadlec, Proceedings of the AAAI Conference
on Artificial Intelligence 34 (2020) 1798–1805.
conference:
end_date: 2020-02-12
location: New York, NY, United States
name: 'AAAI: Conference on Artificial Intelligence'
start_date: 2020-02-07
date_created: 2021-02-25T09:05:18Z
date_published: 2020-04-03T00:00:00Z
date_updated: 2023-09-05T12:40:00Z
day: '03'
department:
- _id: ToHe
- _id: KrCh
doi: 10.1609/aaai.v34i02.5546
external_id:
arxiv:
- '1911.08360'
intvolume: ' 34'
issue: '02'
language:
- iso: eng
month: '04'
oa_version: Preprint
page: 1798-1805
project:
- _id: 25F2ACDE-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Rigorous Systems Engineering
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
- _id: 264B3912-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: M02369
name: Formal Methods meets Algorithmic Game Theory
publication: Proceedings of the AAAI Conference on Artificial Intelligence
publication_identifier:
eissn:
- 2374-3468
isbn:
- '9781577358350'
issn:
- 2159-5399
publication_status: published
publisher: Association for the Advancement of Artificial Intelligence
quality_controlled: '1'
scopus_import: '1'
status: public
title: All-pay bidding games on graphs
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 34
year: '2020'
...
---
_id: '8623'
abstract:
- lang: eng
text: We introduce the monitoring of trace properties under assumptions. An assumption
limits the space of possible traces that the monitor may encounter. An assumption
may result from knowledge about the system that is being monitored, about the
environment, or about another, connected monitor. We define monitorability under
assumptions and study its theoretical properties. In particular, we show that
for every assumption A, the boolean combinations of properties that are safe or
co-safe relative to A are monitorable under A. We give several examples and constructions
on how an assumption can make a non-monitorable property monitorable, and how
an assumption can make a monitorable property monitorable with fewer resources,
such as integer registers.
acknowledgement: This research was supported in part by the Austrian Science Fund
(FWF) under grant Z211-N23 (Wittgenstein Award).
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000-0002-2985-7724
- first_name: Naci E
full_name: Sarac, Naci E
id: 8C6B42F8-C8E6-11E9-A03A-F2DCE5697425
last_name: Sarac
citation:
ama: 'Henzinger TA, Sarac NE. Monitorability under assumptions. In: Runtime Verification.
Vol 12399. Springer Nature; 2020:3-18. doi:10.1007/978-3-030-60508-7_1'
apa: 'Henzinger, T. A., & Sarac, N. E. (2020). Monitorability under assumptions.
In Runtime Verification (Vol. 12399, pp. 3–18). Los Angeles, CA, United
States: Springer Nature. https://doi.org/10.1007/978-3-030-60508-7_1'
chicago: Henzinger, Thomas A, and Naci E Sarac. “Monitorability under Assumptions.”
In Runtime Verification, 12399:3–18. Springer Nature, 2020. https://doi.org/10.1007/978-3-030-60508-7_1.
ieee: T. A. Henzinger and N. E. Sarac, “Monitorability under assumptions,” in Runtime
Verification, Los Angeles, CA, United States, 2020, vol. 12399, pp. 3–18.
ista: 'Henzinger TA, Sarac NE. 2020. Monitorability under assumptions. Runtime Verification.
RV: Runtime Verification, LNCS, vol. 12399, 3–18.'
mla: Henzinger, Thomas A., and Naci E. Sarac. “Monitorability under Assumptions.”
Runtime Verification, vol. 12399, Springer Nature, 2020, pp. 3–18, doi:10.1007/978-3-030-60508-7_1.
short: T.A. Henzinger, N.E. Sarac, in:, Runtime Verification, Springer Nature, 2020,
pp. 3–18.
conference:
end_date: 2020-10-09
location: Los Angeles, CA, United States
name: 'RV: Runtime Verification'
start_date: 2020-10-06
date_created: 2020-10-07T15:05:37Z
date_published: 2020-10-02T00:00:00Z
date_updated: 2023-09-05T15:08:26Z
day: '02'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1007/978-3-030-60508-7_1
external_id:
isi:
- '000728160600001'
file:
- access_level: open_access
checksum: 00661f9b7034f52e18bf24fa552b8194
content_type: application/pdf
creator: esarac
date_created: 2020-10-15T14:28:06Z
date_updated: 2020-10-15T14:28:06Z
file_id: '8665'
file_name: monitorability.pdf
file_size: 478148
relation: main_file
success: 1
file_date_updated: 2020-10-15T14:28:06Z
has_accepted_license: '1'
intvolume: ' 12399'
isi: 1
language:
- iso: eng
month: '10'
oa: 1
oa_version: Submitted Version
page: 3-18
project:
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
publication: Runtime Verification
publication_identifier:
eissn:
- 1611-3349
isbn:
- '9783030605070'
- '9783030605087'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Monitorability under assumptions
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 12399
year: '2020'
...
---
_id: '8195'
abstract:
- lang: eng
text: This paper presents a foundation for refining concurrent programs with structured
control flow. The verification problem is decomposed into subproblems that aid
interactive program development, proof reuse, and automation. The formalization
in this paper is the basis of a new design and implementation of the Civl verifier.
acknowledgement: "Bernhard Kragl and Thomas A. Henzinger were supported by\r\nthe
Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award)."
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Bernhard
full_name: Kragl, Bernhard
id: 320FC952-F248-11E8-B48F-1D18A9856A87
last_name: Kragl
orcid: 0000-0001-7745-9117
- first_name: Shaz
full_name: Qadeer, Shaz
last_name: Qadeer
- 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: 'Kragl B, Qadeer S, Henzinger TA. Refinement for structured concurrent programs.
In: Computer Aided Verification. Vol 12224. Springer Nature; 2020:275-298.
doi:10.1007/978-3-030-53288-8_14'
apa: Kragl, B., Qadeer, S., & Henzinger, T. A. (2020). Refinement for structured
concurrent programs. In Computer Aided Verification (Vol. 12224, pp. 275–298).
Springer Nature. https://doi.org/10.1007/978-3-030-53288-8_14
chicago: Kragl, Bernhard, Shaz Qadeer, and Thomas A Henzinger. “Refinement for Structured
Concurrent Programs.” In Computer Aided Verification, 12224:275–98. Springer
Nature, 2020. https://doi.org/10.1007/978-3-030-53288-8_14.
ieee: B. Kragl, S. Qadeer, and T. A. Henzinger, “Refinement for structured concurrent
programs,” in Computer Aided Verification, 2020, vol. 12224, pp. 275–298.
ista: Kragl B, Qadeer S, Henzinger TA. 2020. Refinement for structured concurrent
programs. Computer Aided Verification. , LNCS, vol. 12224, 275–298.
mla: Kragl, Bernhard, et al. “Refinement for Structured Concurrent Programs.” Computer
Aided Verification, vol. 12224, Springer Nature, 2020, pp. 275–98, doi:10.1007/978-3-030-53288-8_14.
short: B. Kragl, S. Qadeer, T.A. Henzinger, in:, Computer Aided Verification, Springer
Nature, 2020, pp. 275–298.
date_created: 2020-08-03T11:45:35Z
date_published: 2020-07-14T00:00:00Z
date_updated: 2023-09-07T13:18:00Z
day: '14'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1007/978-3-030-53288-8_14
external_id:
isi:
- '000695276000014'
file:
- access_level: open_access
content_type: application/pdf
creator: dernst
date_created: 2020-08-06T08:14:54Z
date_updated: 2020-08-06T08:14:54Z
file_id: '8201'
file_name: 2020_LNCS_Kragl.pdf
file_size: 804237
relation: main_file
success: 1
file_date_updated: 2020-08-06T08:14:54Z
has_accepted_license: '1'
intvolume: ' 12224'
isi: 1
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: 275-298
project:
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
publication: Computer Aided Verification
publication_identifier:
eisbn:
- '9783030532888'
eissn:
- 1611-3349
isbn:
- '9783030532871'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '8332'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Refinement for structured concurrent programs
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: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 12224
year: '2020'
...
---
_id: '8012'
abstract:
- lang: eng
text: Asynchronous programs are notoriously difficult to reason about because they
spawn computation tasks which take effect asynchronously in a nondeterministic
way. Devising inductive invariants for such programs requires understanding and
stating complex relationships between an unbounded number of computation tasks
in arbitrarily long executions. In this paper, we introduce inductive sequentialization,
a new proof rule that sidesteps this complexity via a sequential reduction, a
sequential program that captures every behavior of the original program up to
reordering of coarse-grained commutative actions. A sequential reduction of a
concurrent program is easy to reason about since it corresponds to a simple execution
of the program in an idealized synchronous environment, where processes act in
a fixed order and at the same speed. We have implemented and integrated our proof
rule in the CIVL verifier, allowing us to provably derive fine-grained implementations
of asynchronous programs. We have successfully applied our proof rule to a diverse
set of message-passing protocols, including leader election protocols, two-phase
commit, and Paxos.
article_processing_charge: No
author:
- first_name: Bernhard
full_name: Kragl, Bernhard
id: 320FC952-F248-11E8-B48F-1D18A9856A87
last_name: Kragl
orcid: 0000-0001-7745-9117
- first_name: Constantin
full_name: Enea, Constantin
last_name: Enea
- 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: Suha Orhun
full_name: Mutluergil, Suha Orhun
last_name: Mutluergil
- first_name: Shaz
full_name: Qadeer, Shaz
last_name: Qadeer
citation:
ama: 'Kragl B, Enea C, Henzinger TA, Mutluergil SO, Qadeer S. Inductive sequentialization
of asynchronous programs. In: Proceedings of the 41st ACM SIGPLAN Conference
on Programming Language Design and Implementation. Association for Computing
Machinery; 2020:227-242. doi:10.1145/3385412.3385980'
apa: 'Kragl, B., Enea, C., Henzinger, T. A., Mutluergil, S. O., & Qadeer, S.
(2020). Inductive sequentialization of asynchronous programs. In Proceedings
of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation
(pp. 227–242). London, United Kingdom: Association for Computing Machinery. https://doi.org/10.1145/3385412.3385980'
chicago: Kragl, Bernhard, Constantin Enea, Thomas A Henzinger, Suha Orhun Mutluergil,
and Shaz Qadeer. “Inductive Sequentialization of Asynchronous Programs.” In Proceedings
of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation,
227–42. Association for Computing Machinery, 2020. https://doi.org/10.1145/3385412.3385980.
ieee: B. Kragl, C. Enea, T. A. Henzinger, S. O. Mutluergil, and S. Qadeer, “Inductive
sequentialization of asynchronous programs,” in Proceedings of the 41st ACM
SIGPLAN Conference on Programming Language Design and Implementation, London,
United Kingdom, 2020, pp. 227–242.
ista: 'Kragl B, Enea C, Henzinger TA, Mutluergil SO, Qadeer S. 2020. Inductive sequentialization
of asynchronous programs. Proceedings of the 41st ACM SIGPLAN Conference on Programming
Language Design and Implementation. PLDI: Programming Language Design and Implementation,
227–242.'
mla: Kragl, Bernhard, et al. “Inductive Sequentialization of Asynchronous Programs.”
Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design
and Implementation, Association for Computing Machinery, 2020, pp. 227–42,
doi:10.1145/3385412.3385980.
short: B. Kragl, C. Enea, T.A. Henzinger, S.O. Mutluergil, S. Qadeer, in:, Proceedings
of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation,
Association for Computing Machinery, 2020, pp. 227–242.
conference:
end_date: 2020-06-20
location: London, United Kingdom
name: 'PLDI: Programming Language Design and Implementation'
start_date: 2020-06-15
date_created: 2020-06-25T11:40:16Z
date_published: 2020-06-01T00:00:00Z
date_updated: 2023-09-07T13:18:00Z
day: '01'
department:
- _id: ToHe
doi: 10.1145/3385412.3385980
external_id:
isi:
- '000614622300016'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1145/3385412.3385980
month: '06'
oa: 1
oa_version: Published Version
page: 227-242
project:
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
publication: Proceedings of the 41st ACM SIGPLAN Conference on Programming Language
Design and Implementation
publication_identifier:
isbn:
- '9781450376136'
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
related_material:
record:
- id: '8332'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Inductive sequentialization of asynchronous programs
type: conference
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
year: '2020'
...
---
_id: '10861'
abstract:
- lang: eng
text: We introduce in this paper AMT2.0, a tool for qualitative and quantitative
analysis of hybrid continuous and Boolean signals that combine numerical values
and discrete events. The evaluation of the signals is based on rich temporal specifications
expressed in extended signal temporal logic, which integrates timed regular expressions
within signal temporal logic. The tool features qualitative monitoring (property
satisfaction checking), trace diagnostics for explaining and justifying property
violations and specification-driven measurement of quantitative features of the
signal. We demonstrate the tool functionality on several running examples and
case studies, and evaluate its performance.
article_processing_charge: No
article_type: original
author:
- first_name: Dejan
full_name: Nickovic, Dejan
id: 41BCEE5C-F248-11E8-B48F-1D18A9856A87
last_name: Nickovic
- first_name: Olivier
full_name: Lebeltel, Olivier
last_name: Lebeltel
- first_name: Oded
full_name: Maler, Oded
last_name: Maler
- first_name: Thomas
full_name: Ferrere, Thomas
id: 40960E6E-F248-11E8-B48F-1D18A9856A87
last_name: Ferrere
orcid: 0000-0001-5199-3143
- first_name: Dogan
full_name: Ulus, Dogan
last_name: Ulus
citation:
ama: 'Nickovic D, Lebeltel O, Maler O, Ferrere T, Ulus D. AMT 2.0: Qualitative and
quantitative trace analysis with extended signal temporal logic. International
Journal on Software Tools for Technology Transfer. 2020;22(6):741-758. doi:10.1007/s10009-020-00582-z'
apa: 'Nickovic, D., Lebeltel, O., Maler, O., Ferrere, T., & Ulus, D. (2020).
AMT 2.0: Qualitative and quantitative trace analysis with extended signal temporal
logic. International Journal on Software Tools for Technology Transfer.
Springer Nature. https://doi.org/10.1007/s10009-020-00582-z'
chicago: 'Nickovic, Dejan, Olivier Lebeltel, Oded Maler, Thomas Ferrere, and Dogan
Ulus. “AMT 2.0: Qualitative and Quantitative Trace Analysis with Extended Signal
Temporal Logic.” International Journal on Software Tools for Technology Transfer.
Springer Nature, 2020. https://doi.org/10.1007/s10009-020-00582-z.'
ieee: 'D. Nickovic, O. Lebeltel, O. Maler, T. Ferrere, and D. Ulus, “AMT 2.0: Qualitative
and quantitative trace analysis with extended signal temporal logic,” International
Journal on Software Tools for Technology Transfer, vol. 22, no. 6. Springer
Nature, pp. 741–758, 2020.'
ista: 'Nickovic D, Lebeltel O, Maler O, Ferrere T, Ulus D. 2020. AMT 2.0: Qualitative
and quantitative trace analysis with extended signal temporal logic. International
Journal on Software Tools for Technology Transfer. 22(6), 741–758.'
mla: 'Nickovic, Dejan, et al. “AMT 2.0: Qualitative and Quantitative Trace Analysis
with Extended Signal Temporal Logic.” International Journal on Software Tools
for Technology Transfer, vol. 22, no. 6, Springer Nature, 2020, pp. 741–58,
doi:10.1007/s10009-020-00582-z.'
short: D. Nickovic, O. Lebeltel, O. Maler, T. Ferrere, D. Ulus, International Journal
on Software Tools for Technology Transfer 22 (2020) 741–758.
date_created: 2022-03-18T10:10:53Z
date_published: 2020-08-03T00:00:00Z
date_updated: 2023-09-08T11:52:02Z
day: '03'
department:
- _id: ToHe
doi: 10.1007/s10009-020-00582-z
external_id:
isi:
- '000555398600001'
intvolume: ' 22'
isi: 1
issue: '6'
keyword:
- Information Systems
- Software
language:
- iso: eng
month: '08'
oa_version: None
page: 741-758
publication: International Journal on Software Tools for Technology Transfer
publication_identifier:
eissn:
- 1433-2787
issn:
- 1433-2779
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '299'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: 'AMT 2.0: Qualitative and quantitative trace analysis with extended signal
temporal logic'
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 22
year: '2020'
...
---
_id: '8332'
abstract:
- lang: eng
text: "Designing and verifying concurrent programs is a notoriously challenging,
time consuming, and error prone task, even for experts. This is due to the sheer
number of possible interleavings of a concurrent program, all of which have to
be tracked and accounted for in a formal proof. Inventing an inductive invariant
that captures all interleavings of a low-level implementation is theoretically
possible, but practically intractable. We develop a refinement-based verification
framework that provides mechanisms to simplify proof construction by decomposing
the verification task into smaller subtasks.\r\n\r\nIn a first line of work, we
present a foundation for refinement reasoning over structured concurrent programs.
We introduce layered concurrent programs as a compact notation to represent multi-layer
refinement proofs. A layered concurrent program specifies a sequence of connected
concurrent programs, from most concrete to most abstract, such that common parts
of different programs are written exactly once. Each program in this sequence
is expressed as structured concurrent program, i.e., a program over (potentially
recursive) procedures, imperative control flow, gated atomic actions, structured
parallelism, and asynchronous concurrency. This is in contrast to existing refinement-based
verifiers, which represent concurrent systems as flat transition relations. We
present a powerful refinement proof rule that decomposes refinement checking over
structured programs into modular verification conditions. Refinement checking
is supported by a new form of modular, parameterized invariants, called yield
invariants, and a linear permission system to enhance local reasoning.\r\n\r\nIn
a second line of work, we present two new reduction-based program transformations
that target asynchronous programs. These transformations reduce the number of
interleavings that need to be considered, thus reducing the complexity of invariants.
Synchronization simplifies the verification of asynchronous programs by introducing
the fiction, for proof purposes, that asynchronous operations complete synchronously.
Synchronization summarizes an asynchronous computation as immediate atomic effect.
Inductive sequentialization establishes sequential reductions that captures every
behavior of the original program up to reordering of coarse-grained commutative
actions. A sequential reduction of a concurrent program is easy to reason about
since it corresponds to a simple execution of the program in an idealized synchronous
environment, where processes act in a fixed order and at the same speed.\r\n\r\nOur
approach is implemented the CIVL verifier, which has been successfully used for
the verification of several complex concurrent programs. In our methodology, the
overall correctness of a program is established piecemeal by focusing on the invariant
required for each refinement step separately. While the programmer does the creative
work of specifying the chain of programs and the inductive invariant justifying
each link in the chain, the tool automatically constructs the verification conditions
underlying each refinement step."
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Bernhard
full_name: Kragl, Bernhard
id: 320FC952-F248-11E8-B48F-1D18A9856A87
last_name: Kragl
orcid: 0000-0001-7745-9117
citation:
ama: 'Kragl B. Verifying concurrent programs: Refinement, synchronization, sequentialization.
2020. doi:10.15479/AT:ISTA:8332'
apa: 'Kragl, B. (2020). Verifying concurrent programs: Refinement, synchronization,
sequentialization. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:8332'
chicago: 'Kragl, Bernhard. “Verifying Concurrent Programs: Refinement, Synchronization,
Sequentialization.” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:8332.'
ieee: 'B. Kragl, “Verifying concurrent programs: Refinement, synchronization, sequentialization,”
Institute of Science and Technology Austria, 2020.'
ista: 'Kragl B. 2020. Verifying concurrent programs: Refinement, synchronization,
sequentialization. Institute of Science and Technology Austria.'
mla: 'Kragl, Bernhard. Verifying Concurrent Programs: Refinement, Synchronization,
Sequentialization. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:8332.'
short: 'B. Kragl, Verifying Concurrent Programs: Refinement, Synchronization, Sequentialization,
Institute of Science and Technology Austria, 2020.'
date_created: 2020-09-04T12:24:12Z
date_published: 2020-09-03T00:00:00Z
date_updated: 2023-09-13T08:45:08Z
day: '03'
ddc:
- '000'
degree_awarded: PhD
department:
- _id: ToHe
doi: 10.15479/AT:ISTA:8332
file:
- access_level: open_access
checksum: 26fe261550f691280bda4c454bf015c7
content_type: application/pdf
creator: bkragl
date_created: 2020-09-04T12:17:47Z
date_updated: 2020-09-04T12:17:47Z
file_id: '8333'
file_name: kragl-thesis.pdf
file_size: 1348815
relation: main_file
- access_level: closed
checksum: b9694ce092b7c55557122adba8337ebc
content_type: application/zip
creator: bkragl
date_created: 2020-09-04T13:00:17Z
date_updated: 2020-09-04T13:00:17Z
file_id: '8335'
file_name: kragl-thesis.zip
file_size: 372312
relation: source_file
file_date_updated: 2020-09-04T13:00:17Z
has_accepted_license: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: '120'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '133'
relation: part_of_dissertation
status: public
- id: '8012'
relation: part_of_dissertation
status: public
- id: '8195'
relation: part_of_dissertation
status: public
- id: '160'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000-0002-2985-7724
title: 'Verifying concurrent programs: Refinement, synchronization, sequentialization'
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2020'
...
---
_id: '9202'
abstract:
- lang: eng
text: We propose a novel hybridization method for stability analysis that over-approximates
nonlinear dynamical systems by switched systems with linear inclusion dynamics.
We observe that existing hybridization techniques for safety analysis that over-approximate
nonlinear dynamical systems by switched affine inclusion dynamics and provide
fixed approximation error, do not suffice for stability analysis. Hence, we propose
a hybridization method that provides a state-dependent error which converges to
zero as the state tends to the equilibrium point. The crux of our hybridization
computation is an elegant recursive algorithm that uses partial derivatives of
a given function to obtain upper and lower bound matrices for the over-approximating
linear inclusion. We illustrate our method on some examples to demonstrate the
application of the theory for stability analysis. In particular, our method is
able to establish stability of a nonlinear system which does not admit a polynomial
Lyapunov function.
acknowledgement: Miriam Garc´ıa Soto was partially supported by the Austrian Science
Fund (FWF) under grant Z211-N23 (Wittgenstein Award). Pavithra Prabhakar was partially
supported by NSF CAREER Award No. 1552668, NSF Award No. 2008957 and ONR YIP Award
No. N000141712577.
article_processing_charge: No
author:
- first_name: Miriam
full_name: Garcia Soto, Miriam
id: 4B3207F6-F248-11E8-B48F-1D18A9856A87
last_name: Garcia Soto
orcid: 0000-0003-2936-5719
- first_name: Pavithra
full_name: Prabhakar, Pavithra
last_name: Prabhakar
citation:
ama: 'Garcia Soto M, Prabhakar P. Hybridization for stability verification of nonlinear
switched systems. In: 2020 IEEE Real-Time Systems Symposium. IEEE; 2020:244-256.
doi:10.1109/RTSS49844.2020.00031'
apa: 'Garcia Soto, M., & Prabhakar, P. (2020). Hybridization for stability verification
of nonlinear switched systems. In 2020 IEEE Real-Time Systems Symposium
(pp. 244–256). Houston, TX, USA : IEEE. https://doi.org/10.1109/RTSS49844.2020.00031'
chicago: Garcia Soto, Miriam, and Pavithra Prabhakar. “Hybridization for Stability
Verification of Nonlinear Switched Systems.” In 2020 IEEE Real-Time Systems
Symposium, 244–56. IEEE, 2020. https://doi.org/10.1109/RTSS49844.2020.00031.
ieee: M. Garcia Soto and P. Prabhakar, “Hybridization for stability verification
of nonlinear switched systems,” in 2020 IEEE Real-Time Systems Symposium,
Houston, TX, USA , 2020, pp. 244–256.
ista: 'Garcia Soto M, Prabhakar P. 2020. Hybridization for stability verification
of nonlinear switched systems. 2020 IEEE Real-Time Systems Symposium. RTTS: Real-Time
Systems Symposium, 244–256.'
mla: Garcia Soto, Miriam, and Pavithra Prabhakar. “Hybridization for Stability Verification
of Nonlinear Switched Systems.” 2020 IEEE Real-Time Systems Symposium,
IEEE, 2020, pp. 244–56, doi:10.1109/RTSS49844.2020.00031.
short: M. Garcia Soto, P. Prabhakar, in:, 2020 IEEE Real-Time Systems Symposium,
IEEE, 2020, pp. 244–256.
conference:
end_date: 2020-12-04
location: 'Houston, TX, USA '
name: 'RTTS: Real-Time Systems Symposium'
start_date: 2020-12-01
date_created: 2021-02-26T16:38:24Z
date_published: 2020-12-01T00:00:00Z
date_updated: 2024-02-22T13:25:19Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1109/RTSS49844.2020.00031
external_id:
isi:
- '000680435100021'
file:
- access_level: open_access
checksum: 8f97f229316c3b3a6f0cf99297aa0941
content_type: application/pdf
creator: mgarcias
date_created: 2021-02-26T16:38:14Z
date_updated: 2021-02-26T16:38:14Z
file_id: '9203'
file_name: main.pdf
file_size: 1125794
relation: main_file
file_date_updated: 2021-02-26T16:38:14Z
has_accepted_license: '1'
isi: 1
language:
- iso: eng
month: '12'
oa: 1
oa_version: Submitted Version
page: 244-256
project:
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
publication: 2020 IEEE Real-Time Systems Symposium
publication_identifier:
eisbn:
- '9781728183244'
eissn:
- 2576-3172
publication_status: published
publisher: IEEE
quality_controlled: '1'
status: public
title: Hybridization for stability verification of nonlinear switched systems
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2020'
...
---
_id: '7426'
abstract:
- lang: eng
text: This paper presents a novel abstraction technique for analyzing Lyapunov and
asymptotic stability of polyhedral switched systems. A polyhedral switched system
is a hybrid system in which the continuous dynamics is specified by polyhedral
differential inclusions, the invariants and guards are specified by polyhedral
sets and the switching between the modes do not involve reset of variables. A
finite state weighted graph abstracting the polyhedral switched system is constructed
from a finite partition of the state–space, such that the satisfaction of certain
graph conditions, such as the absence of cycles with product of weights on the
edges greater than (or equal) to 1, implies the stability of the system. However,
the graph is in general conservative and hence, the violation of the graph conditions
does not imply instability. If the analysis fails to establish stability due to
the conservativeness in the approximation, a counterexample (cycle with product
of edge weights greater than or equal to 1) indicating a potential reason for
the failure is returned. Further, a more precise approximation of the switched
system can be constructed by considering a finer partition of the state–space
in the construction of the finite weighted graph. We present experimental results
on analyzing stability of switched systems using the above method.
article_number: '100856'
article_processing_charge: No
article_type: original
author:
- first_name: Miriam
full_name: Garcia Soto, Miriam
id: 4B3207F6-F248-11E8-B48F-1D18A9856A87
last_name: Garcia Soto
orcid: 0000−0003−2936−5719
- first_name: Pavithra
full_name: Prabhakar, Pavithra
last_name: Prabhakar
citation:
ama: 'Garcia Soto M, Prabhakar P. Abstraction based verification of stability of
polyhedral switched systems. Nonlinear Analysis: Hybrid Systems. 2020;36(5).
doi:10.1016/j.nahs.2020.100856'
apa: 'Garcia Soto, M., & Prabhakar, P. (2020). Abstraction based verification
of stability of polyhedral switched systems. Nonlinear Analysis: Hybrid Systems.
Elsevier. https://doi.org/10.1016/j.nahs.2020.100856'
chicago: 'Garcia Soto, Miriam, and Pavithra Prabhakar. “Abstraction Based Verification
of Stability of Polyhedral Switched Systems.” Nonlinear Analysis: Hybrid Systems.
Elsevier, 2020. https://doi.org/10.1016/j.nahs.2020.100856.'
ieee: 'M. Garcia Soto and P. Prabhakar, “Abstraction based verification of stability
of polyhedral switched systems,” Nonlinear Analysis: Hybrid Systems, vol.
36, no. 5. Elsevier, 2020.'
ista: 'Garcia Soto M, Prabhakar P. 2020. Abstraction based verification of stability
of polyhedral switched systems. Nonlinear Analysis: Hybrid Systems. 36(5), 100856.'
mla: 'Garcia Soto, Miriam, and Pavithra Prabhakar. “Abstraction Based Verification
of Stability of Polyhedral Switched Systems.” Nonlinear Analysis: Hybrid Systems,
vol. 36, no. 5, 100856, Elsevier, 2020, doi:10.1016/j.nahs.2020.100856.'
short: 'M. Garcia Soto, P. Prabhakar, Nonlinear Analysis: Hybrid Systems 36 (2020).'
date_created: 2020-02-02T23:00:59Z
date_published: 2020-05-01T00:00:00Z
date_updated: 2023-08-17T14:32:54Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1016/j.nahs.2020.100856
external_id:
isi:
- '000528828600003'
file:
- access_level: open_access
checksum: 560abfddb53f9fe921b6744f59f2cfaa
content_type: application/pdf
creator: dernst
date_created: 2020-10-21T13:16:45Z
date_updated: 2022-05-16T22:30:04Z
embargo: 2022-05-15
file_id: '8688'
file_name: 2020_NAHS_GarciaSoto.pdf
file_size: 818774
relation: main_file
file_date_updated: 2022-05-16T22:30:04Z
has_accepted_license: '1'
intvolume: ' 36'
isi: 1
issue: '5'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-nd/4.0/
month: '05'
oa: 1
oa_version: Submitted Version
project:
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
publication: 'Nonlinear Analysis: Hybrid Systems'
publication_identifier:
issn:
- 1751-570X
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Abstraction based verification of stability of polyhedral switched systems
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
(CC BY-NC-ND 4.0)
short: CC BY-NC-ND (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 36
year: '2020'
...
---
_id: '10877'
abstract:
- lang: eng
text: 'This report presents the results of a friendly competition for formal verification
of continuous and hybrid systems with piecewise constant dynamics. The friendly
competition took place as part of the workshop Applied Verification for Continuous
and Hybrid Systems (ARCH) in 2019. In this third edition, six tools have been
applied to solve five different benchmark problems in the category for piecewise
constant dynamics: BACH, Lyse, Hy- COMP, PHAVer/SX, PHAVerLite, and VeriSiMPL.
Compared to last year, a new tool has participated (HyCOMP) and PHAVerLite has
replaced PHAVer-lite. The result is a snap- shot of the current landscape of tools
and the types of benchmarks they are particularly suited for. Due to the diversity
of problems, we are not ranking tools, yet the presented results probably provide
the most complete assessment of tools for the safety verification of continuous
and hybrid systems with piecewise constant dynamics up to this date.'
acknowledgement: "The authors gratefully acknowledge \fnancial support by the European
Commission project\r\nUnCoVerCPS under grant number 643921. Lei Bu is supported
by the National Natural Science\r\nFoundation of China (No.61572249)."
alternative_title:
- EPiC Series in Computing
article_processing_charge: No
author:
- first_name: Goran
full_name: Frehse, Goran
last_name: Frehse
- first_name: Alessandro
full_name: Abate, Alessandro
last_name: Abate
- first_name: Dieky
full_name: Adzkiya, Dieky
last_name: Adzkiya
- first_name: Anna
full_name: Becchi, Anna
last_name: Becchi
- first_name: Lei
full_name: Bu, Lei
last_name: Bu
- first_name: Alessandro
full_name: Cimatti, Alessandro
last_name: Cimatti
- first_name: Mirco
full_name: Giacobbe, Mirco
id: 3444EA5E-F248-11E8-B48F-1D18A9856A87
last_name: Giacobbe
orcid: 0000-0001-8180-0904
- first_name: Alberto
full_name: Griggio, Alberto
last_name: Griggio
- first_name: Sergio
full_name: Mover, Sergio
last_name: Mover
- first_name: Muhammad Syifa'ul
full_name: Mufid, Muhammad Syifa'ul
last_name: Mufid
- first_name: Idriss
full_name: Riouak, Idriss
last_name: Riouak
- first_name: Stefano
full_name: Tonetta, Stefano
last_name: Tonetta
- first_name: Enea
full_name: Zaffanella, Enea
last_name: Zaffanella
citation:
ama: 'Frehse G, Abate A, Adzkiya D, et al. ARCH-COMP19 Category Report: Hybrid systems
with piecewise constant dynamics. In: Frehse G, Althoff M, eds. ARCH19. 6th
International Workshop on Applied Verification of Continuous and Hybrid Systems.
Vol 61. EasyChair; 2019:1-13. doi:10.29007/rjwn'
apa: 'Frehse, G., Abate, A., Adzkiya, D., Becchi, A., Bu, L., Cimatti, A., … Zaffanella,
E. (2019). ARCH-COMP19 Category Report: Hybrid systems with piecewise constant
dynamics. In G. Frehse & M. Althoff (Eds.), ARCH19. 6th International Workshop
on Applied Verification of Continuous and Hybrid Systems (Vol. 61, pp. 1–13).
Montreal, Canada: EasyChair. https://doi.org/10.29007/rjwn'
chicago: 'Frehse, Goran, Alessandro Abate, Dieky Adzkiya, Anna Becchi, Lei Bu, Alessandro
Cimatti, Mirco Giacobbe, et al. “ARCH-COMP19 Category Report: Hybrid Systems with
Piecewise Constant Dynamics.” In ARCH19. 6th International Workshop on Applied
Verification of Continuous and Hybrid Systems, edited by Goran Frehse and
Matthias Althoff, 61:1–13. EasyChair, 2019. https://doi.org/10.29007/rjwn.'
ieee: 'G. Frehse et al., “ARCH-COMP19 Category Report: Hybrid systems with
piecewise constant dynamics,” in ARCH19. 6th International Workshop on Applied
Verification of Continuous and Hybrid Systems, Montreal, Canada, 2019, vol.
61, pp. 1–13.'
ista: 'Frehse G, Abate A, Adzkiya D, Becchi A, Bu L, Cimatti A, Giacobbe M, Griggio
A, Mover S, Mufid MS, Riouak I, Tonetta S, Zaffanella E. 2019. ARCH-COMP19 Category
Report: Hybrid systems with piecewise constant dynamics. ARCH19. 6th International
Workshop on Applied Verification of Continuous and Hybrid Systems. ARCH: International
Workshop on Applied Verification on Continuous and Hybrid Systems, EPiC Series
in Computing, vol. 61, 1–13.'
mla: 'Frehse, Goran, et al. “ARCH-COMP19 Category Report: Hybrid Systems with Piecewise
Constant Dynamics.” ARCH19. 6th International Workshop on Applied Verification
of Continuous and Hybrid Systems, edited by Goran Frehse and Matthias Althoff,
vol. 61, EasyChair, 2019, pp. 1–13, doi:10.29007/rjwn.'
short: G. Frehse, A. Abate, D. Adzkiya, A. Becchi, L. Bu, A. Cimatti, M. Giacobbe,
A. Griggio, S. Mover, M.S. Mufid, I. Riouak, S. Tonetta, E. Zaffanella, in:, G.
Frehse, M. Althoff (Eds.), ARCH19. 6th International Workshop on Applied Verification
of Continuous and Hybrid Systems, EasyChair, 2019, pp. 1–13.
conference:
end_date: 2019-04-15
location: Montreal, Canada
name: 'ARCH: International Workshop on Applied Verification on Continuous and Hybrid
Systems'
start_date: 2019-04-15
date_created: 2022-03-18T12:29:23Z
date_published: 2019-05-25T00:00:00Z
date_updated: 2022-05-17T07:09:47Z
day: '25'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.29007/rjwn
editor:
- first_name: Goran
full_name: Frehse, Goran
last_name: Frehse
- first_name: Matthias
full_name: Althoff, Matthias
last_name: Althoff
file:
- access_level: open_access
checksum: 4b92e333db7b4e2349501a804dfede69
content_type: application/pdf
creator: dernst
date_created: 2022-05-17T06:55:49Z
date_updated: 2022-05-17T06:55:49Z
file_id: '11391'
file_name: 2019_EPiCs_Frehse.pdf
file_size: 346415
relation: main_file
success: 1
file_date_updated: 2022-05-17T06:55:49Z
has_accepted_license: '1'
intvolume: ' 61'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: 1-13
publication: ARCH19. 6th International Workshop on Applied Verification of Continuous
and Hybrid Systems
publication_identifier:
issn:
- 2398-7340
publication_status: published
publisher: EasyChair
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'ARCH-COMP19 Category Report: Hybrid systems with piecewise constant dynamics'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 61
year: '2019'
...