---
_id: '10293'
abstract:
- lang: eng
text: "Indirect reciprocity in evolutionary game theory is a prominent mechanism
for explaining the evolution of cooperation among unrelated individuals. In contrast
to direct reciprocity, which is based on individuals meeting repeatedly, and conditionally
cooperating by using their own experiences, indirect reciprocity is based on individuals’
reputations. If a player helps another, this increases the helper’s public standing,
benefitting them in the future. This lets cooperation in the population emerge
without individuals having to meet more than once. While the two modes of reciprocity
are intertwined, they are difficult to compare. Thus, they are usually studied
in isolation. Direct reciprocity can maintain cooperation with simple strategies,
and is robust against noise even when players do not remember more\r\nthan their
partner’s last action. Meanwhile, indirect reciprocity requires its successful
strategies, or social norms, to be more complex. Exhaustive search previously
identified eight such norms, called the “leading eight”, which excel at maintaining
cooperation. However, as the first result of this thesis, we show that the leading
eight break down once we remove the fundamental assumption that information is
synchronized and public, such that everyone agrees on reputations. Once we consider
a more realistic scenario of imperfect information, where reputations are private,
and individuals occasionally misinterpret or miss observations, the leading eight
do not promote cooperation anymore. Instead, minor initial disagreements can proliferate,
fragmenting populations into subgroups. In a next step, we consider ways to mitigate
this issue. We first explore whether introducing “generosity” can stabilize cooperation
when players use the leading eight strategies in noisy environments. This approach
of modifying strategies to include probabilistic elements for coping with errors
is known to work well in direct reciprocity. However, as we show here, it fails
for the more complex norms of indirect reciprocity. Imperfect information still
prevents cooperation from evolving. On the other hand, we succeeded to show in
this thesis that modifying the leading eight to use “quantitative assessment”,
i.e. tracking reputation scores on a scale beyond good and bad, and making overall
judgments of others based on a threshold, is highly successful, even when noise
increases in the environment. Cooperation can flourish when reputations\r\nare
more nuanced, and players have a broader understanding what it means to be “good.”
Finally, we present a single theoretical framework that unites the two modes of
reciprocity despite their differences. Within this framework, we identify a novel
simple and successful strategy for indirect reciprocity, which can cope with noisy
environments and has an analogue in direct reciprocity. We can also analyze decision
making when different sources of information are available. Our results help highlight
that for sustaining cooperation, already the most simple rules of reciprocity
can be sufficient."
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Laura
full_name: Schmid, Laura
id: 38B437DE-F248-11E8-B48F-1D18A9856A87
last_name: Schmid
orcid: 0000-0002-6978-7329
citation:
ama: Schmid L. Evolution of cooperation via (in)direct reciprocity under imperfect
information. 2021. doi:10.15479/at:ista:10293
apa: Schmid, L. (2021). Evolution of cooperation via (in)direct reciprocity under
imperfect information. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:10293
chicago: Schmid, Laura. “Evolution of Cooperation via (in)Direct Reciprocity under
Imperfect Information.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:10293.
ieee: L. Schmid, “Evolution of cooperation via (in)direct reciprocity under imperfect
information,” Institute of Science and Technology Austria, 2021.
ista: Schmid L. 2021. Evolution of cooperation via (in)direct reciprocity under
imperfect information. Institute of Science and Technology Austria.
mla: Schmid, Laura. Evolution of Cooperation via (in)Direct Reciprocity under
Imperfect Information. Institute of Science and Technology Austria, 2021,
doi:10.15479/at:ista:10293.
short: L. Schmid, Evolution of Cooperation via (in)Direct Reciprocity under Imperfect
Information, Institute of Science and Technology Austria, 2021.
date_created: 2021-11-15T17:12:57Z
date_published: 2021-11-17T00:00:00Z
date_updated: 2025-07-14T09:10:09Z
day: '17'
ddc:
- '519'
- '576'
degree_awarded: PhD
department:
- _id: GradSch
- _id: KrCh
doi: 10.15479/at:ista:10293
ec_funded: 1
file:
- access_level: closed
checksum: 86a05b430756ca12ae8107b6e6f3c1e5
content_type: application/zip
creator: lschmid
date_created: 2021-11-18T12:41:46Z
date_updated: 2022-12-20T23:30:08Z
embargo_to: open_access
file_id: '10305'
file_name: submission_new.zip
file_size: 29703124
relation: source_file
- access_level: open_access
checksum: d940af042e94660c6b6a7b4f0b184d47
content_type: application/pdf
creator: lschmid
date_created: 2021-11-18T12:59:15Z
date_updated: 2022-12-20T23:30:08Z
embargo: 2022-10-18
file_id: '10306'
file_name: thesis_new_upload.pdf
file_size: 8320985
relation: main_file
file_date_updated: 2022-12-20T23:30:08Z
has_accepted_license: '1'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
page: '171'
project:
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '9997'
relation: part_of_dissertation
status: public
- id: '2'
relation: part_of_dissertation
status: public
- id: '9402'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
title: Evolution of cooperation via (in)direct reciprocity under imperfect information
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2021'
...
---
_id: '9393'
abstract:
- lang: eng
text: "We consider the core algorithmic problems related to verification of systems
with respect to three classical quantitative properties, namely, the mean-payoff,
the ratio, and the minimum initial credit for energy property. The algorithmic
problem given a graph and a quantitative property asks to compute the optimal
value (the infimum value over all traces) from every node of the graph. We consider
graphs with bounded treewidth—a class that contains the control flow graphs of
most programs. Let n denote the number of nodes of a graph, m the number of edges
(for bounded treewidth \U0001D45A=\U0001D442(\U0001D45B)) and W the largest absolute
value of the weights. Our main theoretical results are as follows. First, for
the minimum initial credit problem we show that (1) for general graphs the problem
can be solved in \U0001D442(\U0001D45B2⋅\U0001D45A) time and the associated decision
problem in \U0001D442(\U0001D45B⋅\U0001D45A) time, improving the previous known
\U0001D442(\U0001D45B3⋅\U0001D45A⋅log(\U0001D45B⋅\U0001D44A)) and \U0001D442(\U0001D45B2⋅\U0001D45A)
bounds, respectively; and (2) for bounded treewidth graphs we present an algorithm
that requires \U0001D442(\U0001D45B⋅log\U0001D45B) time. Second, for bounded treewidth
graphs we present an algorithm that approximates the mean-payoff value within
a factor of 1+\U0001D716 in time \U0001D442(\U0001D45B⋅log(\U0001D45B/\U0001D716))
as compared to the classical exact algorithms on general graphs that require quadratic
time. Third, for the ratio property we present an algorithm that for bounded treewidth
graphs works in time \U0001D442(\U0001D45B⋅log(|\U0001D44E⋅\U0001D44F|))=\U0001D442(\U0001D45B⋅log(\U0001D45B⋅\U0001D44A)),
when the output is \U0001D44E\U0001D44F, as compared to the previously best known
algorithm on general graphs with running time \U0001D442(\U0001D45B2⋅log(\U0001D45B⋅\U0001D44A)).
We have implemented some of our algorithms and show that they present a significant
speedup on standard benchmarks."
acknowledgement: 'The research was partly supported by Austrian Science Fund (FWF)
Grant No P23499- N23, FWF NFN Grant No S11407-N23 (RiSE/SHiNE), ERC Start Grant
(279307: Graph Games), and Microsoft faculty fellows award.'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Rasmus
full_name: Ibsen-Jensen, Rasmus
id: 3B699956-F248-11E8-B48F-1D18A9856A87
last_name: Ibsen-Jensen
orcid: 0000-0003-4783-0389
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
citation:
ama: Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. Faster algorithms for quantitative
verification in bounded treewidth graphs. Formal Methods in System Design.
2021;57:401-428. doi:10.1007/s10703-021-00373-5
apa: Chatterjee, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2021). Faster algorithms
for quantitative verification in bounded treewidth graphs. Formal Methods in
System Design. Springer. https://doi.org/10.1007/s10703-021-00373-5
chicago: Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis.
“Faster Algorithms for Quantitative Verification in Bounded Treewidth Graphs.”
Formal Methods in System Design. Springer, 2021. https://doi.org/10.1007/s10703-021-00373-5.
ieee: K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, “Faster algorithms for
quantitative verification in bounded treewidth graphs,” Formal Methods in System
Design, vol. 57. Springer, pp. 401–428, 2021.
ista: Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2021. Faster algorithms for
quantitative verification in bounded treewidth graphs. Formal Methods in System
Design. 57, 401–428.
mla: Chatterjee, Krishnendu, et al. “Faster Algorithms for Quantitative Verification
in Bounded Treewidth Graphs.” Formal Methods in System Design, vol. 57,
Springer, 2021, pp. 401–28, doi:10.1007/s10703-021-00373-5.
short: K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Formal Methods in System
Design 57 (2021) 401–428.
date_created: 2021-05-16T22:01:47Z
date_published: 2021-09-01T00:00:00Z
date_updated: 2023-10-10T11:13:20Z
day: '01'
department:
- _id: KrCh
doi: 10.1007/s10703-021-00373-5
ec_funded: 1
external_id:
arxiv:
- '1504.07384'
isi:
- '000645490300001'
intvolume: ' 57'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1504.07384
month: '09'
oa: 1
oa_version: Preprint
page: 401-428
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: Formal Methods in System Design
publication_identifier:
eissn:
- 1572-8102
issn:
- 0925-9856
publication_status: published
publisher: Springer
quality_controlled: '1'
scopus_import: '1'
status: public
title: Faster algorithms for quantitative verification in bounded treewidth graphs
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 57
year: '2021'
...
---
_id: '9640'
abstract:
- lang: eng
text: 'Selection and random drift determine the probability that novel mutations
fixate in a population. Population structure is known to affect the dynamics of
the evolutionary process. Amplifiers of selection are population structures that
increase the fixation probability of beneficial mutants compared to well-mixed
populations. Over the past 15 years, extensive research has produced remarkable
structures called strong amplifiers which guarantee that every beneficial mutation
fixates with high probability. But strong amplification has come at the cost of
considerably delaying the fixation event, which can slow down the overall rate
of evolution. However, the precise relationship between fixation probability and
time has remained elusive. Here we characterize the slowdown effect of strong
amplification. First, we prove that all strong amplifiers must delay the fixation
event at least to some extent. Second, we construct strong amplifiers that delay
the fixation event only marginally as compared to the well-mixed populations.
Our results thus establish a tight relationship between fixation probability and
time: Strong amplification always comes at a cost of a slowdown, but more than
a marginal slowdown is not needed.'
acknowledgement: 'K.C. acknowledges support from ERC Start grant no. (279307: Graph
Games), ERC Consolidator grant no. (863818: ForM-SMart), Austrian Science Fund (FWF)
grant no. P23499-N23 and S11407-N23 (RiSE). M.A.N. acknowledges support from Office
of Naval Research grant N00014-16-1-2914 and from the John Templeton Foundation.'
article_number: '4009'
article_processing_charge: No
article_type: original
author:
- first_name: Josef
full_name: Tkadlec, Josef
id: 3F24CCC8-F248-11E8-B48F-1D18A9856A87
last_name: Tkadlec
orcid: 0000-0002-1097-9684
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Martin A.
full_name: Nowak, Martin A.
last_name: Nowak
citation:
ama: Tkadlec J, Pavlogiannis A, Chatterjee K, Nowak MA. Fast and strong amplifiers
of natural selection. Nature Communications. 2021;12(1). doi:10.1038/s41467-021-24271-w
apa: Tkadlec, J., Pavlogiannis, A., Chatterjee, K., & Nowak, M. A. (2021). Fast
and strong amplifiers of natural selection. Nature Communications. Springer
Nature. https://doi.org/10.1038/s41467-021-24271-w
chicago: Tkadlec, Josef, Andreas Pavlogiannis, Krishnendu Chatterjee, and Martin
A. Nowak. “Fast and Strong Amplifiers of Natural Selection.” Nature Communications.
Springer Nature, 2021. https://doi.org/10.1038/s41467-021-24271-w.
ieee: J. Tkadlec, A. Pavlogiannis, K. Chatterjee, and M. A. Nowak, “Fast and strong
amplifiers of natural selection,” Nature Communications, vol. 12, no. 1.
Springer Nature, 2021.
ista: Tkadlec J, Pavlogiannis A, Chatterjee K, Nowak MA. 2021. Fast and strong amplifiers
of natural selection. Nature Communications. 12(1), 4009.
mla: Tkadlec, Josef, et al. “Fast and Strong Amplifiers of Natural Selection.” Nature
Communications, vol. 12, no. 1, 4009, Springer Nature, 2021, doi:10.1038/s41467-021-24271-w.
short: J. Tkadlec, A. Pavlogiannis, K. Chatterjee, M.A. Nowak, Nature Communications
12 (2021).
date_created: 2021-07-11T22:01:15Z
date_published: 2021-06-29T00:00:00Z
date_updated: 2025-07-14T09:10:05Z
day: '29'
ddc:
- '510'
department:
- _id: KrCh
doi: 10.1038/s41467-021-24271-w
ec_funded: 1
external_id:
isi:
- '000671752100003'
pmid:
- '34188036'
file:
- access_level: open_access
checksum: 5767418926a7f7fb76151de29473dae0
content_type: application/pdf
creator: cziletti
date_created: 2021-07-19T13:02:20Z
date_updated: 2021-07-19T13:02:20Z
file_id: '9692'
file_name: 2021_NatCoom_Tkadlec.pdf
file_size: 628992
relation: main_file
success: 1
file_date_updated: 2021-07-19T13:02:20Z
has_accepted_license: '1'
intvolume: ' 12'
isi: 1
issue: '1'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
pmid: 1
project:
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication: Nature Communications
publication_identifier:
eissn:
- '20411723'
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Fast and strong amplifiers of natural selection
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 12
year: '2021'
...
---
_id: '7346'
abstract:
- lang: eng
text: 'The Price of Anarchy (PoA) is a well-established game-theoretic concept to
shed light on coordination issues arising in open distributed systems. Leaving
agents to selfishly optimize comes with the risk of ending up in sub-optimal states
(in terms of performance and/or costs), compared to a centralized system design.
However, the PoA relies on strong assumptions about agents'' rationality (e.g.,
resources and information) and interactions, whereas in many distributed systems
agents interact locally with bounded resources. They do so repeatedly over time
(in contrast to "one-shot games"), and their strategies may evolve. Using a more
realistic evolutionary game model, this paper introduces a realized evolutionary
Price of Anarchy (ePoA). The ePoA allows an exploration of equilibrium selection
in dynamic distributed systems with multiple equilibria, based on local interactions
of simple memoryless agents. Considering a fundamental game related to virus propagation
on networks, we present analytical bounds on the ePoA in basic network topologies
and for different strategy update dynamics. In particular, deriving stationary
distributions of the stochastic evolutionary process, we find that the Nash equilibria
are not always the most abundant states, and that different processes can feature
significant off-equilibrium behavior, leading to a significantly higher ePoA compared
to the PoA studied traditionally in the literature. '
alternative_title:
- LIPIcs
article_number: '21'
article_processing_charge: No
arxiv: 1
author:
- first_name: Laura
full_name: Schmid, Laura
id: 38B437DE-F248-11E8-B48F-1D18A9856A87
last_name: Schmid
orcid: 0000-0002-6978-7329
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
citation:
ama: 'Schmid L, Chatterjee K, Schmid S. The evolutionary price of anarchy: Locally
bounded agents in a dynamic virus game. In: Proceedings of the 23rd International
Conference on Principles of Distributed Systems. Vol 153. Schloss Dagstuhl
- Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.OPODIS.2019.21'
apa: 'Schmid, L., Chatterjee, K., & Schmid, S. (2020). The evolutionary price
of anarchy: Locally bounded agents in a dynamic virus game. In Proceedings
of the 23rd International Conference on Principles of Distributed Systems
(Vol. 153). Neuchâtel, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPIcs.OPODIS.2019.21'
chicago: 'Schmid, Laura, Krishnendu Chatterjee, and Stefan Schmid. “The Evolutionary
Price of Anarchy: Locally Bounded Agents in a Dynamic Virus Game.” In Proceedings
of the 23rd International Conference on Principles of Distributed Systems,
Vol. 153. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.OPODIS.2019.21.'
ieee: 'L. Schmid, K. Chatterjee, and S. Schmid, “The evolutionary price of anarchy:
Locally bounded agents in a dynamic virus game,” in Proceedings of the 23rd
International Conference on Principles of Distributed Systems, Neuchâtel,
Switzerland, 2020, vol. 153.'
ista: 'Schmid L, Chatterjee K, Schmid S. 2020. The evolutionary price of anarchy:
Locally bounded agents in a dynamic virus game. Proceedings of the 23rd International
Conference on Principles of Distributed Systems. OPODIS: International Conference
on Principles of Distributed Systems, LIPIcs, vol. 153, 21.'
mla: 'Schmid, Laura, et al. “The Evolutionary Price of Anarchy: Locally Bounded
Agents in a Dynamic Virus Game.” Proceedings of the 23rd International Conference
on Principles of Distributed Systems, vol. 153, 21, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2020, doi:10.4230/LIPIcs.OPODIS.2019.21.'
short: L. Schmid, K. Chatterjee, S. Schmid, in:, Proceedings of the 23rd International
Conference on Principles of Distributed Systems, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2020.
conference:
end_date: 2019-12-19
location: Neuchâtel, Switzerland
name: 'OPODIS: International Conference on Principles of Distributed Systems'
start_date: 2019-12-17
date_created: 2020-01-21T16:00:26Z
date_published: 2020-02-10T00:00:00Z
date_updated: 2023-02-23T13:05:49Z
day: '10'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.4230/LIPIcs.OPODIS.2019.21
external_id:
arxiv:
- '1906.00110'
file:
- access_level: open_access
checksum: 9a91916ac2c21ab42458fcda39ef0b8d
content_type: application/pdf
creator: dernst
date_created: 2020-03-23T09:14:06Z
date_updated: 2020-07-14T12:47:56Z
file_id: '7608'
file_name: 2019_LIPIcS_Schmid.pdf
file_size: 630752
relation: main_file
file_date_updated: 2020-07-14T12:47:56Z
has_accepted_license: '1'
intvolume: ' 153'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Preprint
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication: Proceedings of the 23rd International Conference on Principles of Distributed
Systems
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'The evolutionary price of anarchy: Locally bounded agents in a dynamic virus
game'
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: 153
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
arxiv: 1
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: '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
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: '7810'
abstract:
- lang: eng
text: "Interprocedural data-flow analyses form an expressive and useful paradigm
of numerous static analysis applications, such as live variables analysis, alias
analysis and null pointers analysis. The most widely-used framework for interprocedural
data-flow analysis is IFDS, which encompasses distributive data-flow functions
over a finite domain. On-demand data-flow analyses restrict the focus of the analysis
on specific program locations and data facts. This setting provides a natural
split between (i) an offline (or preprocessing) phase, where the program is partially
analyzed and analysis summaries are created, and (ii) an online (or query) phase,
where analysis queries arrive on demand and the summaries are used to speed up
answering queries.\r\nIn this work, we consider on-demand IFDS analyses where
the queries concern program locations of the same procedure (aka same-context
queries). We exploit the fact that flow graphs of programs have low treewidth
to develop faster algorithms that are space and time optimal for many common data-flow
analyses, in both the preprocessing and the query phase. We also use treewidth
to develop query solutions that are embarrassingly parallelizable, i.e. the total
work for answering each query is split to a number of threads such that each thread
performs only a constant amount of work. Finally, we implement a static analyzer
based on our algorithms, and perform a series of on-demand analysis experiments
on standard benchmarks. Our experimental results show a drastic speed-up of the
queries after only a lightweight preprocessing phase, which significantly outperforms
existing techniques."
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Amir Kafshdar
full_name: Goharshady, Amir Kafshdar
id: 391365CE-F248-11E8-B48F-1D18A9856A87
last_name: Goharshady
orcid: 0000-0003-1702-6584
- 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: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
citation:
ama: 'Chatterjee K, Goharshady AK, Ibsen-Jensen R, Pavlogiannis A. Optimal and perfectly
parallel algorithms for on-demand data-flow analysis. In: European Symposium
on Programming. Vol 12075. Springer Nature; 2020:112-140. doi:10.1007/978-3-030-44914-8_5'
apa: 'Chatterjee, K., Goharshady, A. K., Ibsen-Jensen, R., & Pavlogiannis, A.
(2020). Optimal and perfectly parallel algorithms for on-demand data-flow analysis.
In European Symposium on Programming (Vol. 12075, pp. 112–140). Dublin,
Ireland: Springer Nature. https://doi.org/10.1007/978-3-030-44914-8_5'
chicago: Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen,
and Andreas Pavlogiannis. “Optimal and Perfectly Parallel Algorithms for On-Demand
Data-Flow Analysis.” In European Symposium on Programming, 12075:112–40.
Springer Nature, 2020. https://doi.org/10.1007/978-3-030-44914-8_5.
ieee: K. Chatterjee, A. K. Goharshady, R. Ibsen-Jensen, and A. Pavlogiannis, “Optimal
and perfectly parallel algorithms for on-demand data-flow analysis,” in European
Symposium on Programming, Dublin, Ireland, 2020, vol. 12075, pp. 112–140.
ista: 'Chatterjee K, Goharshady AK, Ibsen-Jensen R, Pavlogiannis A. 2020. Optimal
and perfectly parallel algorithms for on-demand data-flow analysis. European Symposium
on Programming. ESOP: Programming Languages and Systems, LNCS, vol. 12075, 112–140.'
mla: Chatterjee, Krishnendu, et al. “Optimal and Perfectly Parallel Algorithms for
On-Demand Data-Flow Analysis.” European Symposium on Programming, vol.
12075, Springer Nature, 2020, pp. 112–40, doi:10.1007/978-3-030-44914-8_5.
short: K. Chatterjee, A.K. Goharshady, R. Ibsen-Jensen, A. Pavlogiannis, in:, European
Symposium on Programming, Springer Nature, 2020, pp. 112–140.
conference:
end_date: 2020-04-30
location: Dublin, Ireland
name: 'ESOP: Programming Languages and Systems'
start_date: 2020-04-25
date_created: 2020-05-10T22:00:50Z
date_published: 2020-04-18T00:00:00Z
date_updated: 2025-06-02T08:53:42Z
day: '18'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1007/978-3-030-44914-8_5
external_id:
isi:
- '000681656800005'
file:
- access_level: open_access
checksum: 8618b80f4cf7b39a60e61a6445ad9807
content_type: application/pdf
creator: dernst
date_created: 2020-05-26T13:34:48Z
date_updated: 2020-07-14T12:48:03Z
file_id: '7895'
file_name: 2020_LNCS_Chatterjee.pdf
file_size: 651250
relation: main_file
file_date_updated: 2020-07-14T12:48:03Z
has_accepted_license: '1'
intvolume: ' 12075'
isi: 1
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: 112-140
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
- _id: 266EEEC0-B435-11E9-9278-68D0E5697425
name: Quantitative Game-theoretic Analysis of Blockchain Applications and Smart
Contracts
- _id: 267066CE-B435-11E9-9278-68D0E5697425
name: Quantitative Analysis of Probablistic Systems with a focus on Crypto-currencies
publication: European Symposium on Programming
publication_identifier:
eissn:
- '16113349'
isbn:
- '9783030449131'
issn:
- '03029743'
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '8934'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Optimal and perfectly parallel algorithms for on-demand data-flow analysis
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: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 12075
year: '2020'
...
---
_id: '8089'
abstract:
- lang: eng
text: "We consider the classical problem of invariant generation for programs with
polynomial assignments and focus on synthesizing invariants that are a conjunction
of strict polynomial inequalities. We present a sound and semi-complete method
based on positivstellensaetze, i.e. theorems in semi-algebraic geometry that characterize
positive polynomials over a semi-algebraic set.\r\n\r\nOn the theoretical side,
the worst-case complexity of our approach is subexponential, whereas the worst-case
complexity of the previous complete method (Kapur, ACA 2004) is doubly-exponential.
Even when restricted to linear invariants, the best previous complexity for complete
invariant generation is exponential (Colon et al, CAV 2003). On the practical
side, we reduce the invariant generation problem to quadratic programming (QCLP),
which is a classical optimization problem with many industrial solvers. We demonstrate
the applicability of our approach by providing experimental results on several
academic benchmarks. To the best of our knowledge, the only previous invariant
generation method that provides completeness guarantees for invariants consisting
of polynomial inequalities is (Kapur, ACA 2004), which relies on quantifier elimination
and cannot even handle toy programs such as our running example."
article_processing_charge: No
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Hongfei
full_name: Fu, Hongfei
id: 3AAD03D6-F248-11E8-B48F-1D18A9856A87
last_name: Fu
- first_name: Amir Kafshdar
full_name: Goharshady, Amir Kafshdar
id: 391365CE-F248-11E8-B48F-1D18A9856A87
last_name: Goharshady
orcid: 0000-0003-1702-6584
- first_name: Ehsan Kafshdar
full_name: Goharshady, Ehsan Kafshdar
last_name: Goharshady
citation:
ama: 'Chatterjee K, Fu H, Goharshady AK, Goharshady EK. Polynomial invariant generation
for non-deterministic recursive programs. In: Proceedings of the 41st ACM SIGPLAN
Conference on Programming Language Design and Implementation. Association
for Computing Machinery; 2020:672-687. doi:10.1145/3385412.3385969'
apa: 'Chatterjee, K., Fu, H., Goharshady, A. K., & Goharshady, E. K. (2020).
Polynomial invariant generation for non-deterministic recursive programs. In Proceedings
of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation
(pp. 672–687). London, United Kingdom: Association for Computing Machinery. https://doi.org/10.1145/3385412.3385969'
chicago: Chatterjee, Krishnendu, Hongfei Fu, Amir Kafshdar Goharshady, and Ehsan
Kafshdar Goharshady. “Polynomial Invariant Generation for Non-Deterministic Recursive
Programs.” In Proceedings of the 41st ACM SIGPLAN Conference on Programming
Language Design and Implementation, 672–87. Association for Computing Machinery,
2020. https://doi.org/10.1145/3385412.3385969.
ieee: K. Chatterjee, H. Fu, A. K. Goharshady, and E. K. Goharshady, “Polynomial
invariant generation for non-deterministic recursive programs,” in Proceedings
of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation,
London, United Kingdom, 2020, pp. 672–687.
ista: 'Chatterjee K, Fu H, Goharshady AK, Goharshady EK. 2020. Polynomial invariant
generation for non-deterministic recursive programs. Proceedings of the 41st ACM
SIGPLAN Conference on Programming Language Design and Implementation. PLDI: Programming
Language Design and Implementation, 672–687.'
mla: Chatterjee, Krishnendu, et al. “Polynomial Invariant Generation for Non-Deterministic
Recursive Programs.” Proceedings of the 41st ACM SIGPLAN Conference on Programming
Language Design and Implementation, Association for Computing Machinery, 2020,
pp. 672–87, doi:10.1145/3385412.3385969.
short: K. Chatterjee, H. Fu, A.K. Goharshady, E.K. Goharshady, in:, Proceedings
of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation,
Association for Computing Machinery, 2020, pp. 672–687.
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-07-05T22:00:45Z
date_published: 2020-06-11T00:00:00Z
date_updated: 2025-06-02T08:53:42Z
day: '11'
department:
- _id: KrCh
doi: 10.1145/3385412.3385969
external_id:
arxiv:
- '1902.04373'
isi:
- '000614622300045'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1902.04373
month: '06'
oa: 1
oa_version: Preprint
page: 672-687
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
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: '8934'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Polynomial invariant generation for non-deterministic recursive programs
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
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
arxiv: 1
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: '8600'
abstract:
- lang: eng
text: 'A vector addition system with states (VASS) consists of a finite set of states
and counters. A transition changes the current state to the next state, and every
counter is either incremented, or decremented, or left unchanged. A state and
value for each counter is a configuration; and a computation is an infinite sequence
of configurations with transitions between successive configurations. A probabilistic
VASS consists of a VASS along with a probability distribution over the transitions
for each state. Qualitative properties such as state and configuration reachability
have been widely studied for VASS. In this work we consider multi-dimensional
long-run average objectives for VASS and probabilistic VASS. For a counter, the
cost of a configuration is the value of the counter; and the long-run average
value of a computation for the counter is the long-run average of the costs of
the configurations in the computation. The multi-dimensional long-run average
problem given a VASS and a threshold value for each counter, asks whether there
is a computation such that for each counter the long-run average value for the
counter does not exceed the respective threshold. For probabilistic VASS, instead
of the existence of a computation, we consider whether the expected long-run average
value for each counter does not exceed the respective threshold. Our main results
are as follows: we show that the multi-dimensional long-run average problem (a)
is NP-complete for integer-valued VASS; (b) is undecidable for natural-valued
VASS (i.e., nonnegative counters); and (c) can be solved in polynomial time for
probabilistic integer-valued VASS, and probabilistic natural-valued VASS when
all computations are non-terminating.'
alternative_title:
- LIPIcs
article_number: '23'
article_processing_charge: No
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000-0002-2985-7724
- first_name: Jan
full_name: Otop, Jan
id: 2FC5DA74-F248-11E8-B48F-1D18A9856A87
last_name: Otop
citation:
ama: 'Chatterjee K, Henzinger TA, Otop J. Multi-dimensional long-run average problems
for vector addition systems with states. In: 31st International Conference
on Concurrency Theory. Vol 171. Schloss Dagstuhl - Leibniz-Zentrum für Informatik;
2020. doi:10.4230/LIPIcs.CONCUR.2020.23'
apa: 'Chatterjee, K., Henzinger, T. A., & Otop, J. (2020). Multi-dimensional
long-run average problems for vector addition systems with states. In 31st
International Conference on Concurrency Theory (Vol. 171). Virtual: Schloss
Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2020.23'
chicago: Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Multi-Dimensional
Long-Run Average Problems for Vector Addition Systems with States.” In 31st
International Conference on Concurrency Theory, Vol. 171. Schloss Dagstuhl
- Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.CONCUR.2020.23.
ieee: K. Chatterjee, T. A. Henzinger, and J. Otop, “Multi-dimensional long-run average
problems for vector addition systems with states,” in 31st International Conference
on Concurrency Theory, Virtual, 2020, vol. 171.
ista: 'Chatterjee K, Henzinger TA, Otop J. 2020. Multi-dimensional long-run average
problems for vector addition systems with states. 31st International Conference
on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol.
171, 23.'
mla: Chatterjee, Krishnendu, et al. “Multi-Dimensional Long-Run Average Problems
for Vector Addition Systems with States.” 31st International Conference on
Concurrency Theory, vol. 171, 23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2020, doi:10.4230/LIPIcs.CONCUR.2020.23.
short: K. Chatterjee, T.A. Henzinger, J. Otop, in:, 31st International Conference
on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.
conference:
end_date: 2020-09-04
location: Virtual
name: 'CONCUR: Conference on Concurrency Theory'
start_date: 2020-09-01
date_created: 2020-10-04T22:01:36Z
date_published: 2020-08-06T00:00:00Z
date_updated: 2021-01-12T08:20:15Z
day: '06'
ddc:
- '000'
department:
- _id: KrCh
- _id: ToHe
doi: 10.4230/LIPIcs.CONCUR.2020.23
external_id:
arxiv:
- '2007.08917'
file:
- access_level: open_access
checksum: 5039752f644c4b72b9361d21a5e31baf
content_type: application/pdf
creator: dernst
date_created: 2020-10-05T14:04:25Z
date_updated: 2020-10-05T14:04:25Z
file_id: '8610'
file_name: 2020_LIPIcsCONCUR_Chatterjee.pdf
file_size: 601231
relation: main_file
success: 1
file_date_updated: 2020-10-05T14:04:25Z
has_accepted_license: '1'
intvolume: ' 171'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/3.0/
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _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
publication: 31st International Conference on Concurrency Theory
publication_identifier:
isbn:
- '9783959771603'
issn:
- '18688969'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: Multi-dimensional long-run average problems for vector addition systems with
states
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/3.0/legalcode
name: Creative Commons Attribution 3.0 Unported (CC BY 3.0)
short: CC BY (3.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 171
year: '2020'
...
---
_id: '8728'
abstract:
- lang: eng
text: Discrete-time Markov Chains (MCs) and Markov Decision Processes (MDPs) are
two standard formalisms in system analysis. Their main associated quantitative
objectives are hitting probabilities, discounted sum, and mean payoff. Although
there are many techniques for computing these objectives in general MCs/MDPs,
they have not been thoroughly studied in terms of parameterized algorithms, particularly
when treewidth is used as the parameter. This is in sharp contrast to qualitative
objectives for MCs, MDPs and graph games, for which treewidth-based algorithms
yield significant complexity improvements. In this work, we show that treewidth
can also be used to obtain faster algorithms for the quantitative problems. For
an MC with n states and m transitions, we show that each of the classical quantitative
objectives can be computed in O((n+m)⋅t2) time, given a tree decomposition
of the MC with width t. Our results also imply a bound of O(κ⋅(n+m)⋅t2) for
each objective on MDPs, where κ is the number of strategy-iteration refinements
required for the given input and objective. Finally, we make an experimental evaluation
of our new algorithms on low-treewidth MCs and MDPs obtained from the DaCapo benchmark
suite. Our experiments show that on low-treewidth MCs and MDPs, our algorithms
outperform existing well-established methods by one or more orders of magnitude.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Ali
full_name: Asadi, Ali
last_name: Asadi
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Amir Kafshdar
full_name: Goharshady, Amir Kafshdar
id: 391365CE-F248-11E8-B48F-1D18A9856A87
last_name: Goharshady
orcid: 0000-0003-1702-6584
- first_name: Kiarash
full_name: Mohammadi, Kiarash
last_name: Mohammadi
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
citation:
ama: 'Asadi A, Chatterjee K, Goharshady AK, Mohammadi K, Pavlogiannis A. Faster
algorithms for quantitative analysis of MCs and MDPs with small treewidth. In:
Automated Technology for Verification and Analysis. Vol 12302. Springer
Nature; 2020:253-270. doi:10.1007/978-3-030-59152-6_14'
apa: 'Asadi, A., Chatterjee, K., Goharshady, A. K., Mohammadi, K., & Pavlogiannis,
A. (2020). Faster algorithms for quantitative analysis of MCs and MDPs with small
treewidth. In Automated Technology for Verification and Analysis (Vol.
12302, pp. 253–270). Hanoi, Vietnam: Springer Nature. https://doi.org/10.1007/978-3-030-59152-6_14'
chicago: Asadi, Ali, Krishnendu Chatterjee, Amir Kafshdar Goharshady, Kiarash Mohammadi,
and Andreas Pavlogiannis. “Faster Algorithms for Quantitative Analysis of MCs
and MDPs with Small Treewidth.” In Automated Technology for Verification and
Analysis, 12302:253–70. Springer Nature, 2020. https://doi.org/10.1007/978-3-030-59152-6_14.
ieee: A. Asadi, K. Chatterjee, A. K. Goharshady, K. Mohammadi, and A. Pavlogiannis,
“Faster algorithms for quantitative analysis of MCs and MDPs with small treewidth,”
in Automated Technology for Verification and Analysis, Hanoi, Vietnam,
2020, vol. 12302, pp. 253–270.
ista: 'Asadi A, Chatterjee K, Goharshady AK, Mohammadi K, Pavlogiannis A. 2020.
Faster algorithms for quantitative analysis of MCs and MDPs with small treewidth.
Automated Technology for Verification and Analysis. ATVA: Automated Technology
for Verification and Analysis, LNCS, vol. 12302, 253–270.'
mla: Asadi, Ali, et al. “Faster Algorithms for Quantitative Analysis of MCs and
MDPs with Small Treewidth.” Automated Technology for Verification and Analysis,
vol. 12302, Springer Nature, 2020, pp. 253–70, doi:10.1007/978-3-030-59152-6_14.
short: A. Asadi, K. Chatterjee, A.K. Goharshady, K. Mohammadi, A. Pavlogiannis,
in:, Automated Technology for Verification and Analysis, Springer Nature, 2020,
pp. 253–270.
conference:
end_date: 2020-10-23
location: Hanoi, Vietnam
name: 'ATVA: Automated Technology for Verification and Analysis'
start_date: 2020-10-19
date_created: 2020-11-06T07:30:05Z
date_published: 2020-10-12T00:00:00Z
date_updated: 2025-06-02T08:53:43Z
day: '12'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1007/978-3-030-59152-6_14
external_id:
isi:
- '000723555700014'
file:
- access_level: open_access
checksum: ae83f27e5b189d5abc2e7514f1b7e1b5
content_type: application/pdf
creator: dernst
date_created: 2020-11-06T07:41:03Z
date_updated: 2020-11-06T07:41:03Z
file_id: '8729'
file_name: 2020_LNCS_ATVA_Asadi_accepted.pdf
file_size: 726648
relation: main_file
success: 1
file_date_updated: 2020-11-06T07:41:03Z
has_accepted_license: '1'
intvolume: ' 12302'
isi: 1
language:
- iso: eng
month: '10'
oa: 1
oa_version: Submitted Version
page: 253-270
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
- _id: 267066CE-B435-11E9-9278-68D0E5697425
name: Quantitative Analysis of Probablistic Systems with a focus on Crypto-currencies
publication: Automated Technology for Verification and Analysis
publication_identifier:
eisbn:
- '9783030591526'
eissn:
- 1611-3349
isbn:
- '9783030591519'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '8934'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Faster algorithms for quantitative analysis of MCs and MDPs with small treewidth
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 12302
year: '2020'
...
---
_id: '8788'
abstract:
- lang: eng
text: 'We consider a real-time setting where an environment releases sequences of
firm-deadline tasks, and an online scheduler chooses on-the-fly the ones to execute
on a single processor so as to maximize cumulated utility. The competitive ratio
is a well-known performance measure for the scheduler: it gives the worst-case
ratio, among all possible choices for the environment, of the cumulated utility
of the online scheduler versus an offline scheduler that knows these choices in
advance. Traditionally, competitive analysis is performed by hand, while automated
techniques are rare and only handle static environments with independent tasks.
We present a quantitative-verification framework for precedence-aware competitive
analysis, where task releases may depend on preceding scheduling choices, i.e.,
the environment can respond to scheduling decisions dynamically . We consider
two general classes of precedences: 1) follower precedences force the release
of a dependent task upon the completion of a set of precursor tasks, while and
2) pairing precedences modify the characteristics of a dependent task provided
the completion of a set of precursor tasks. Precedences make competitive analysis
challenging, as the online and offline schedulers operate on diverging sequences.
We make a formal presentation of our framework, and use a GPU-based implementation
to analyze ten well-known schedulers on precedence-based application examples
taken from the existing literature: 1) a handshake protocol (HP); 2) network packet-switching;
3) query scheduling (QS); and 4) a sporadic-interrupt setting. Our experimental
results show that precedences and task parameters can vary drastically the best
scheduler. Our framework thus supports application designers in choosing the best
scheduler among a given set automatically.'
acknowledgement: 'This work was supported by the Austrian Science Foundation (FWF)
under the NFN RiSE/SHiNE under Grant S11405 and Grant S11407. This article was presented
in the International Conference on Embedded Software 2020 and appears as part of
the ESWEEK-TCAD special issue. '
article_processing_charge: No
article_type: original
author:
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
- first_name: Nico
full_name: Schaumberger, Nico
last_name: Schaumberger
- first_name: Ulrich
full_name: Schmid, Ulrich
last_name: Schmid
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
citation:
ama: Pavlogiannis A, Schaumberger N, Schmid U, Chatterjee K. Precedence-aware automated
competitive analysis of real-time scheduling. IEEE Transactions on Computer-Aided
Design of Integrated Circuits and Systems. 2020;39(11):3981-3992. doi:10.1109/TCAD.2020.3012803
apa: Pavlogiannis, A., Schaumberger, N., Schmid, U., & Chatterjee, K. (2020).
Precedence-aware automated competitive analysis of real-time scheduling. IEEE
Transactions on Computer-Aided Design of Integrated Circuits and Systems.
IEEE. https://doi.org/10.1109/TCAD.2020.3012803
chicago: Pavlogiannis, Andreas, Nico Schaumberger, Ulrich Schmid, and Krishnendu
Chatterjee. “Precedence-Aware Automated Competitive Analysis of Real-Time Scheduling.”
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.
IEEE, 2020. https://doi.org/10.1109/TCAD.2020.3012803.
ieee: A. Pavlogiannis, N. Schaumberger, U. Schmid, and K. Chatterjee, “Precedence-aware
automated competitive analysis of real-time scheduling,” IEEE Transactions
on Computer-Aided Design of Integrated Circuits and Systems, vol. 39, no.
11. IEEE, pp. 3981–3992, 2020.
ista: Pavlogiannis A, Schaumberger N, Schmid U, Chatterjee K. 2020. Precedence-aware
automated competitive analysis of real-time scheduling. IEEE Transactions on Computer-Aided
Design of Integrated Circuits and Systems. 39(11), 3981–3992.
mla: Pavlogiannis, Andreas, et al. “Precedence-Aware Automated Competitive Analysis
of Real-Time Scheduling.” IEEE Transactions on Computer-Aided Design of Integrated
Circuits and Systems, vol. 39, no. 11, IEEE, 2020, pp. 3981–92, doi:10.1109/TCAD.2020.3012803.
short: A. Pavlogiannis, N. Schaumberger, U. Schmid, K. Chatterjee, IEEE Transactions
on Computer-Aided Design of Integrated Circuits and Systems 39 (2020) 3981–3992.
date_created: 2020-11-22T23:01:24Z
date_published: 2020-11-01T00:00:00Z
date_updated: 2023-08-22T13:27:05Z
day: '01'
department:
- _id: KrCh
doi: 10.1109/TCAD.2020.3012803
external_id:
isi:
- '000587712700069'
intvolume: ' 39'
isi: 1
issue: '11'
language:
- iso: eng
month: '11'
oa_version: None
page: 3981-3992
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
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'
scopus_import: '1'
status: public
title: Precedence-aware automated competitive analysis of real-time scheduling
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 39
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
arxiv: 1
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: '10190'
abstract:
- lang: eng
text: 'The verification of concurrent programs remains an open challenge, as thread
interaction has to be accounted for, which leads to state-space explosion. Stateless
model checking battles this problem by exploring traces rather than states of
the program. As there are exponentially many traces, dynamic partial-order reduction
(DPOR) techniques are used to partition the trace space into equivalence classes,
and explore a few representatives from each class. The standard equivalence that
underlies most DPOR techniques is the happens-before equivalence, however recent
works have spawned a vivid interest towards coarser equivalences. The efficiency
of such approaches is a product of two parameters: (i) the size of the partitioning
induced by the equivalence, and (ii) the time spent by the exploration algorithm
in each class of the partitioning. In this work, we present a new equivalence,
called value-happens-before and show that it has two appealing features. First,
value-happens-before is always at least as coarse as the happens-before equivalence,
and can be even exponentially coarser. Second, the value-happens-before partitioning
is efficiently explorable when the number of threads is bounded. We present an
algorithm called value-centric DPOR (VCDPOR), which explores the underlying partitioning
using polynomial time per class. Finally, we perform an experimental evaluation
of VCDPOR on various benchmarks, and compare it against other state-of-the-art
approaches. Our results show that value-happens-before typically induces a significant
reduction in the size of the underlying partitioning, which leads to a considerable
reduction in the running time for exploring the whole partitioning.'
acknowledgement: "The authors would also like to thank anonymous referees for their
valuable comments and helpful suggestions. This work is supported by the Austrian
Science Fund (FWF) NFN grants S11407-N23 (RiSE/SHiNE) and S11402-N23 (RiSE/SHiNE),
by the Vienna Science and Technology Fund (WWTF) Project ICT15-003, and by the Austrian
Science Fund (FWF) Schrodinger grant J-4220.\r\n"
article_number: '124'
article_processing_charge: No
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
- first_name: Viktor
full_name: Toman, Viktor
id: 3AF3DA7C-F248-11E8-B48F-1D18A9856A87
last_name: Toman
orcid: 0000-0001-9036-063X
citation:
ama: 'Chatterjee K, Pavlogiannis A, Toman V. Value-centric dynamic partial order
reduction. In: Proceedings of the 34th ACM International Conference on Object-Oriented
Programming, Systems, Languages, and Applications. Vol 3. ACM; 2019. doi:10.1145/3360550'
apa: 'Chatterjee, K., Pavlogiannis, A., & Toman, V. (2019). Value-centric dynamic
partial order reduction. In Proceedings of the 34th ACM International Conference
on Object-Oriented Programming, Systems, Languages, and Applications (Vol.
3). Athens, Greece: ACM. https://doi.org/10.1145/3360550'
chicago: Chatterjee, Krishnendu, Andreas Pavlogiannis, and Viktor Toman. “Value-Centric
Dynamic Partial Order Reduction.” In Proceedings of the 34th ACM International
Conference on Object-Oriented Programming, Systems, Languages, and Applications,
Vol. 3. ACM, 2019. https://doi.org/10.1145/3360550.
ieee: K. Chatterjee, A. Pavlogiannis, and V. Toman, “Value-centric dynamic partial
order reduction,” in Proceedings of the 34th ACM International Conference on
Object-Oriented Programming, Systems, Languages, and Applications, Athens,
Greece, 2019, vol. 3.
ista: 'Chatterjee K, Pavlogiannis A, Toman V. 2019. Value-centric dynamic partial
order reduction. Proceedings of the 34th ACM International Conference on Object-Oriented
Programming, Systems, Languages, and Applications. OOPSLA: Object-oriented Programming,
Systems, Languages and Applications vol. 3, 124.'
mla: Chatterjee, Krishnendu, et al. “Value-Centric Dynamic Partial Order Reduction.”
Proceedings of the 34th ACM International Conference on Object-Oriented Programming,
Systems, Languages, and Applications, vol. 3, 124, ACM, 2019, doi:10.1145/3360550.
short: K. Chatterjee, A. Pavlogiannis, V. Toman, in:, Proceedings of the 34th ACM
International Conference on Object-Oriented Programming, Systems, Languages, and
Applications, ACM, 2019.
conference:
end_date: 2019-10-25
location: Athens, Greece
name: 'OOPSLA: Object-oriented Programming, Systems, Languages and Applications'
start_date: 2019-10-23
date_created: 2021-10-27T14:57:06Z
date_published: 2019-10-10T00:00:00Z
date_updated: 2025-07-14T09:10:15Z
day: '10'
ddc:
- '000'
department:
- _id: GradSch
- _id: KrCh
doi: 10.1145/3360550
external_id:
arxiv:
- '1909.00989'
file:
- access_level: open_access
checksum: 2149979c46964c4d117af06ccb6c0834
content_type: application/pdf
creator: cchlebak
date_created: 2021-11-12T11:41:56Z
date_updated: 2021-11-12T11:41:56Z
file_id: '10278'
file_name: 2019_ACM_Chatterjee.pdf
file_size: 570829
relation: main_file
success: 1
file_date_updated: 2021-11-12T11:41:56Z
has_accepted_license: '1'
intvolume: ' 3'
keyword:
- safety
- risk
- reliability and quality
- software
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://dl.acm.org/doi/10.1145/3360550
month: '10'
oa: 1
oa_version: Published Version
project:
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Moderne Concurrency Paradigms
publication: Proceedings of the 34th ACM International Conference on Object-Oriented
Programming, Systems, Languages, and Applications
publication_identifier:
eissn:
- 2475-1421
publication_status: published
publisher: ACM
quality_controlled: '1'
related_material:
record:
- id: '10199'
relation: dissertation_contains
status: public
status: public
title: Value-centric dynamic partial order reduction
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
volume: 3
year: '2019'
...
---
_id: '5948'
abstract:
- lang: eng
text: We study the termination problem for nondeterministic probabilistic programs.
We consider the bounded termination problem that asks whether the supremum of
the expected termination time over all schedulers is bounded. First, we show that
ranking supermartingales (RSMs) are both sound and complete for proving bounded
termination over nondeterministic probabilistic programs. For nondeterministic
probabilistic programs a previous result claimed that RSMs are not complete for
bounded termination, whereas our result corrects the previous flaw and establishes
completeness with a rigorous proof. Second, we present the first sound approach
to establish lower bounds on expected termination time through RSMs.
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Hongfei
full_name: Fu, Hongfei
last_name: Fu
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
citation:
ama: 'Fu H, Chatterjee K. Termination of nondeterministic probabilistic programs.
In: International Conference on Verification, Model Checking, and Abstract
Interpretation. Vol 11388. Springer Nature; 2019:468-490. doi:10.1007/978-3-030-11245-5_22'
apa: 'Fu, H., & Chatterjee, K. (2019). Termination of nondeterministic probabilistic
programs. In International Conference on Verification, Model Checking, and
Abstract Interpretation (Vol. 11388, pp. 468–490). Cascais, Portugal: Springer
Nature. https://doi.org/10.1007/978-3-030-11245-5_22'
chicago: Fu, Hongfei, and Krishnendu Chatterjee. “Termination of Nondeterministic
Probabilistic Programs.” In International Conference on Verification, Model
Checking, and Abstract Interpretation, 11388:468–90. Springer Nature, 2019.
https://doi.org/10.1007/978-3-030-11245-5_22.
ieee: H. Fu and K. Chatterjee, “Termination of nondeterministic probabilistic programs,”
in International Conference on Verification, Model Checking, and Abstract Interpretation,
Cascais, Portugal, 2019, vol. 11388, pp. 468–490.
ista: 'Fu H, Chatterjee K. 2019. Termination of nondeterministic probabilistic programs.
International Conference on Verification, Model Checking, and Abstract Interpretation.
VMCAI: Verification, Model Checking, and Abstract Interpretation, LNCS, vol. 11388,
468–490.'
mla: Fu, Hongfei, and Krishnendu Chatterjee. “Termination of Nondeterministic Probabilistic
Programs.” International Conference on Verification, Model Checking, and Abstract
Interpretation, vol. 11388, Springer Nature, 2019, pp. 468–90, doi:10.1007/978-3-030-11245-5_22.
short: H. Fu, K. Chatterjee, in:, International Conference on Verification, Model
Checking, and Abstract Interpretation, Springer Nature, 2019, pp. 468–490.
conference:
end_date: 2019-01-15
location: Cascais, Portugal
name: 'VMCAI: Verification, Model Checking, and Abstract Interpretation'
start_date: 2019-01-13
date_created: 2019-02-10T22:59:17Z
date_published: 2019-01-11T00:00:00Z
date_updated: 2025-06-02T08:53:41Z
day: '11'
department:
- _id: KrCh
doi: 10.1007/978-3-030-11245-5_22
external_id:
arxiv:
- '1701.02944'
isi:
- '000931943000022'
intvolume: ' 11388'
isi: 1
language:
- iso: eng
main_file_link:
- url: https://arxiv.org/abs/1701.02944
month: '01'
oa_version: Preprint
page: 468-490
project:
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication: International Conference on Verification, Model Checking, and Abstract
Interpretation
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Termination of nondeterministic probabilistic programs
type: conference
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 11388
year: '2019'
...
---
_id: '6035'
abstract:
- lang: eng
text: 'We present JuliaReach, a toolbox for set-based reachability analysis of dynamical
systems. JuliaReach consists of two main packages: Reachability, containing implementations
of reachability algorithms for continuous and hybrid systems, and LazySets, a
standalone library that implements state-of-the-art algorithms for calculus with
convex sets. The library offers both concrete and lazy set representations, where
the latter stands for the ability to delay set computations until they are needed.
The choice of the programming language Julia and the accompanying documentation
of our toolbox allow researchers to easily translate set-based algorithms from
mathematics to software in a platform-independent way, while achieving runtime
performance that is comparable to statically compiled languages. Combining lazy
operations in high dimensions and explicit computations in low dimensions, JuliaReach
can be applied to solve complex, large-scale problems.'
article_processing_charge: No
arxiv: 1
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. JuliaReach: A toolbox
for set-based reachability. In: Proceedings of the 22nd International Conference
on Hybrid Systems: Computation and Control. Vol 22. ACM; 2019:39-44. doi:10.1145/3302504.3311804'
apa: 'Bogomolov, S., Forets, M., Frehse, G., Potomkin, K., & Schilling, C. (2019).
JuliaReach: A toolbox for set-based reachability. In Proceedings of the 22nd
International Conference on Hybrid Systems: Computation and Control (Vol.
22, pp. 39–44). Montreal, QC, Canada: ACM. https://doi.org/10.1145/3302504.3311804'
chicago: 'Bogomolov, Sergiy, Marcelo Forets, Goran Frehse, Kostiantyn Potomkin,
and Christian Schilling. “JuliaReach: A Toolbox for Set-Based Reachability.” In
Proceedings of the 22nd International Conference on Hybrid Systems: Computation
and Control, 22:39–44. ACM, 2019. https://doi.org/10.1145/3302504.3311804.'
ieee: 'S. Bogomolov, M. Forets, G. Frehse, K. Potomkin, and C. Schilling, “JuliaReach:
A toolbox for set-based reachability,” in Proceedings of the 22nd International
Conference on Hybrid Systems: Computation and Control, Montreal, QC, Canada,
2019, vol. 22, pp. 39–44.'
ista: 'Bogomolov S, Forets M, Frehse G, Potomkin K, Schilling C. 2019. JuliaReach:
A toolbox for set-based reachability. Proceedings of the 22nd International Conference
on Hybrid Systems: Computation and Control. HSCC: Hybrid Systems Computation and
Control vol. 22, 39–44.'
mla: 'Bogomolov, Sergiy, et al. “JuliaReach: A Toolbox for Set-Based Reachability.”
Proceedings of the 22nd International Conference on Hybrid Systems: Computation
and Control, vol. 22, ACM, 2019, pp. 39–44, doi:10.1145/3302504.3311804.'
short: 'S. Bogomolov, M. Forets, G. Frehse, K. Potomkin, C. Schilling, in:, Proceedings
of the 22nd International Conference on Hybrid Systems: Computation and Control,
ACM, 2019, pp. 39–44.'
conference:
end_date: 2019-04-18
location: Montreal, QC, Canada
name: 'HSCC: Hybrid Systems Computation and Control'
start_date: 2019-04-16
date_created: 2019-02-18T14:43:28Z
date_published: 2019-04-16T00:00:00Z
date_updated: 2023-08-24T14:47:21Z
day: '16'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1145/3302504.3311804
ec_funded: 1
external_id:
arxiv:
- '1901.10736'
isi:
- '000516713900005'
file:
- access_level: open_access
checksum: 28ed56439aea5991c3122d4730fd828f
content_type: application/pdf
creator: cschilli
date_created: 2019-03-05T09:27:18Z
date_updated: 2020-07-14T12:47:17Z
file_id: '6067'
file_name: hscc19.pdf
file_size: 3784414
relation: main_file
file_date_updated: 2020-07-14T12:47:17Z
has_accepted_license: '1'
intvolume: ' 22'
isi: 1
keyword:
- reachability analysis
- hybrid systems
- lazy computation
language:
- iso: eng
month: '04'
oa: 1
oa_version: Submitted Version
page: 39-44
project:
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: 'Proceedings of the 22nd International Conference on Hybrid Systems:
Computation and Control'
publication_identifier:
isbn:
- '9781450362825'
publication_status: published
publisher: ACM
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'JuliaReach: A toolbox for set-based reachability'
type: conference
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 22
year: '2019'
...
---
_id: '6042'
abstract:
- lang: eng
text: Static program analyzers are increasingly effective in checking correctness
properties of programs and reporting any errors found, often in the form of error
traces. However, developers still spend a significant amount of time on debugging.
This involves processing long error traces in an effort to localize a bug to a
relatively small part of the program and to identify its cause. In this paper,
we present a technique for automated fault localization that, given a program
and an error trace, efficiently narrows down the cause of the error to a few statements.
These statements are then ranked in terms of their suspiciousness. Our technique
relies only on the semantics of the given program and does not require any test
cases or user guidance. In experiments on a set of C benchmarks, we show that
our technique is effective in quickly isolating the cause of error while out-performing
other state-of-the-art fault-localization techniques.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Maria
full_name: Christakis, Maria
last_name: Christakis
- first_name: Matthias
full_name: Heizmann, Matthias
last_name: Heizmann
- first_name: Muhammad Numair
full_name: Mansur, Muhammad Numair
last_name: Mansur
- first_name: Christian
full_name: Schilling, Christian
id: 3A2F4DCE-F248-11E8-B48F-1D18A9856A87
last_name: Schilling
orcid: 0000-0003-3658-1065
- first_name: Valentin
full_name: Wüstholz, Valentin
last_name: Wüstholz
citation:
ama: 'Christakis M, Heizmann M, Mansur MN, Schilling C, Wüstholz V. Semantic fault
localization and suspiciousness ranking. In: 25th International Conference
on Tools and Algorithms for the Construction and Analysis of Systems . Vol
11427. Springer Nature; 2019:226-243. doi:10.1007/978-3-030-17462-0_13'
apa: 'Christakis, M., Heizmann, M., Mansur, M. N., Schilling, C., & Wüstholz,
V. (2019). Semantic fault localization and suspiciousness ranking. In 25th
International Conference on Tools and Algorithms for the Construction and Analysis
of Systems (Vol. 11427, pp. 226–243). Prague, Czech Republic: Springer Nature.
https://doi.org/10.1007/978-3-030-17462-0_13'
chicago: Christakis, Maria, Matthias Heizmann, Muhammad Numair Mansur, Christian
Schilling, and Valentin Wüstholz. “Semantic Fault Localization and Suspiciousness
Ranking.” In 25th International Conference on Tools and Algorithms for the
Construction and Analysis of Systems , 11427:226–43. Springer Nature, 2019.
https://doi.org/10.1007/978-3-030-17462-0_13.
ieee: M. Christakis, M. Heizmann, M. N. Mansur, C. Schilling, and V. Wüstholz, “Semantic
fault localization and suspiciousness ranking,” in 25th International Conference
on Tools and Algorithms for the Construction and Analysis of Systems , Prague,
Czech Republic, 2019, vol. 11427, pp. 226–243.
ista: 'Christakis M, Heizmann M, Mansur MN, Schilling C, Wüstholz V. 2019. Semantic
fault localization and suspiciousness ranking. 25th 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. 11427,
226–243.'
mla: Christakis, Maria, et al. “Semantic Fault Localization and Suspiciousness Ranking.”
25th International Conference on Tools and Algorithms for the Construction
and Analysis of Systems , vol. 11427, Springer Nature, 2019, pp. 226–43, doi:10.1007/978-3-030-17462-0_13.
short: M. Christakis, M. Heizmann, M.N. Mansur, C. Schilling, V. Wüstholz, in:,
25th International Conference on Tools and Algorithms for the Construction and
Analysis of Systems , Springer Nature, 2019, pp. 226–243.
conference:
end_date: 2019-04-11
location: Prague, Czech Republic
name: 'TACAS: Tools and Algorithms for the Construction and Analysis of Systems'
start_date: 2019-04-06
date_created: 2019-02-18T16:44:06Z
date_published: 2019-04-04T00:00:00Z
date_updated: 2023-08-24T14:47:45Z
day: '04'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1007/978-3-030-17462-0_13
ec_funded: 1
external_id:
isi:
- '000681166500013'
file:
- access_level: open_access
checksum: 9998496f6fe202c0a19124b4209154c6
content_type: application/pdf
creator: dernst
date_created: 2019-05-10T14:16:05Z
date_updated: 2020-07-14T12:47:17Z
file_id: '6408'
file_name: 2019_LNCS_Christakis.pdf
file_size: 773083
relation: main_file
file_date_updated: 2020-07-14T12:47:17Z
has_accepted_license: '1'
intvolume: ' 11427'
isi: 1
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: 226-243
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication: '25th International Conference on Tools and Algorithms for the Construction
and Analysis of Systems '
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Semantic fault localization and suspiciousness ranking
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: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 11427
year: '2019'
...
---
_id: '6056'
abstract:
- lang: eng
text: In today's programmable blockchains, smart contracts are limited to being
deterministic and non-probabilistic. This lack of randomness is a consequential
limitation, given that a wide variety of real-world financial contracts, such
as casino games and lotteries, depend entirely on randomness. As a result, several
ad-hoc random number generation approaches have been developed to be used in smart
contracts. These include ideas such as using an oracle or relying on the block
hash. However, these approaches are manipulatable, i.e. their output can be tampered
with by parties who might not be neutral, such as the owner of the oracle or the
miners.We propose a novel game-theoretic approach for generating provably unmanipulatable
pseudorandom numbers on the blockchain. Our approach allows smart contracts to
access a trustworthy source of randomness that does not rely on potentially compromised
miners or oracles, hence enabling the creation of a new generation of smart contracts
that are not limited to being non-probabilistic and can be drawn from the much
more general class of probabilistic programs.
article_number: '8751326'
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Amir Kafshdar
full_name: Goharshady, Amir Kafshdar
id: 391365CE-F248-11E8-B48F-1D18A9856A87
last_name: Goharshady
orcid: 0000-0003-1702-6584
- first_name: Arash
full_name: Pourdamghani, Arash
last_name: Pourdamghani
citation:
ama: 'Chatterjee K, Goharshady AK, Pourdamghani A. Probabilistic smart contracts:
Secure randomness on the blockchain. In: IEEE International Conference on Blockchain
and Cryptocurrency. IEEE; 2019. doi:10.1109/BLOC.2019.8751326'
apa: 'Chatterjee, K., Goharshady, A. K., & Pourdamghani, A. (2019). Probabilistic
smart contracts: Secure randomness on the blockchain. In IEEE International
Conference on Blockchain and Cryptocurrency. Seoul, Korea: IEEE. https://doi.org/10.1109/BLOC.2019.8751326'
chicago: 'Chatterjee, Krishnendu, Amir Kafshdar Goharshady, and Arash Pourdamghani.
“Probabilistic Smart Contracts: Secure Randomness on the Blockchain.” In IEEE
International Conference on Blockchain and Cryptocurrency. IEEE, 2019. https://doi.org/10.1109/BLOC.2019.8751326.'
ieee: 'K. Chatterjee, A. K. Goharshady, and A. Pourdamghani, “Probabilistic smart
contracts: Secure randomness on the blockchain,” in IEEE International Conference
on Blockchain and Cryptocurrency, Seoul, Korea, 2019.'
ista: 'Chatterjee K, Goharshady AK, Pourdamghani A. 2019. Probabilistic smart contracts:
Secure randomness on the blockchain. IEEE International Conference on Blockchain
and Cryptocurrency. IEEE International Conference on Blockchain and Cryptocurrency,
8751326.'
mla: 'Chatterjee, Krishnendu, et al. “Probabilistic Smart Contracts: Secure Randomness
on the Blockchain.” IEEE International Conference on Blockchain and Cryptocurrency,
8751326, IEEE, 2019, doi:10.1109/BLOC.2019.8751326.'
short: K. Chatterjee, A.K. Goharshady, A. Pourdamghani, in:, IEEE International
Conference on Blockchain and Cryptocurrency, IEEE, 2019.
conference:
end_date: 2019-05-17
location: Seoul, Korea
name: IEEE International Conference on Blockchain and Cryptocurrency
start_date: 2019-05-14
date_created: 2019-02-26T09:03:15Z
date_published: 2019-05-01T00:00:00Z
date_updated: 2024-03-25T23:30:18Z
day: '01'
department:
- _id: KrCh
doi: 10.1109/BLOC.2019.8751326
ec_funded: 1
external_id:
arxiv:
- '1902.07986'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1902.07986
month: '05'
oa: 1
oa_version: Preprint
project:
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 266EEEC0-B435-11E9-9278-68D0E5697425
name: Quantitative Game-theoretic Analysis of Blockchain Applications and Smart
Contracts
- _id: 267066CE-B435-11E9-9278-68D0E5697425
name: Quantitative Analysis of Probablistic Systems with a focus on Crypto-currencies
publication: IEEE International Conference on Blockchain and Cryptocurrency
publication_status: published
publisher: IEEE
quality_controlled: '1'
related_material:
record:
- id: '8934'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: 'Probabilistic smart contracts: Secure randomness on the blockchain'
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2019'
...
---
_id: '6175'
abstract:
- lang: eng
text: "We consider the problem of expected cost analysis over nondeterministic probabilistic
programs,\r\nwhich aims at automated methods for analyzing the resource-usage
of such programs.\r\nPrevious approaches for this problem could only handle nonnegative
bounded costs.\r\nHowever, in many scenarios, such as queuing networks or analysis
of cryptocurrency protocols,\r\nboth positive and negative costs are necessary
and the costs are unbounded as well.\r\n\r\nIn this work, we present a sound and
efficient approach to obtain polynomial bounds on the\r\nexpected accumulated
cost of nondeterministic probabilistic programs.\r\nOur approach can handle (a)
general positive and negative costs with bounded updates in\r\nvariables; and
(b) nonnegative costs with general updates to variables.\r\nWe show that several
natural examples which could not be\r\nhandled by previous approaches are captured
in our framework.\r\n\r\nMoreover, our approach leads to an efficient polynomial-time
algorithm, while no\r\nprevious approach for cost analysis of probabilistic programs
could guarantee polynomial runtime.\r\nFinally, we show the effectiveness of our
approach using experimental results on a variety of programs for which we efficiently
synthesize tight resource-usage bounds."
article_processing_charge: No
arxiv: 1
author:
- first_name: Peixin
full_name: Wang, Peixin
last_name: Wang
- first_name: Hongfei
full_name: Fu, Hongfei
id: 3AAD03D6-F248-11E8-B48F-1D18A9856A87
last_name: Fu
- first_name: Amir Kafshdar
full_name: Goharshady, Amir Kafshdar
id: 391365CE-F248-11E8-B48F-1D18A9856A87
last_name: Goharshady
orcid: 0000-0003-1702-6584
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Xudong
full_name: Qin, Xudong
last_name: Qin
- first_name: Wenjun
full_name: Shi, Wenjun
last_name: Shi
citation:
ama: 'Wang P, Fu H, Goharshady AK, Chatterjee K, Qin X, Shi W. Cost analysis of
nondeterministic probabilistic programs. In: PLDI 2019: Proceedings of the
40th ACM SIGPLAN Conference on Programming Language Design and Implementation.
Association for Computing Machinery; 2019:204-220. doi:10.1145/3314221.3314581'
apa: 'Wang, P., Fu, H., Goharshady, A. K., Chatterjee, K., Qin, X., & Shi, W.
(2019). Cost analysis of nondeterministic probabilistic programs. In PLDI 2019:
Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design
and Implementation (pp. 204–220). Phoenix, AZ, United States: Association
for Computing Machinery. https://doi.org/10.1145/3314221.3314581'
chicago: 'Wang, Peixin, Hongfei Fu, Amir Kafshdar Goharshady, Krishnendu Chatterjee,
Xudong Qin, and Wenjun Shi. “Cost Analysis of Nondeterministic Probabilistic Programs.”
In PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming
Language Design and Implementation, 204–20. Association for Computing Machinery,
2019. https://doi.org/10.1145/3314221.3314581.'
ieee: 'P. Wang, H. Fu, A. K. Goharshady, K. Chatterjee, X. Qin, and W. Shi, “Cost
analysis of nondeterministic probabilistic programs,” in PLDI 2019: Proceedings
of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation,
Phoenix, AZ, United States, 2019, pp. 204–220.'
ista: 'Wang P, Fu H, Goharshady AK, Chatterjee K, Qin X, Shi W. 2019. Cost analysis
of nondeterministic probabilistic programs. PLDI 2019: Proceedings of the 40th
ACM SIGPLAN Conference on Programming Language Design and Implementation. PLDI:
Conference on Programming Language Design and Implementation, 204–220.'
mla: 'Wang, Peixin, et al. “Cost Analysis of Nondeterministic Probabilistic Programs.”
PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language
Design and Implementation, Association for Computing Machinery, 2019, pp.
204–20, doi:10.1145/3314221.3314581.'
short: 'P. Wang, H. Fu, A.K. Goharshady, K. Chatterjee, X. Qin, W. Shi, in:, PLDI
2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design
and Implementation, Association for Computing Machinery, 2019, pp. 204–220.'
conference:
end_date: 2019-06-26
location: Phoenix, AZ, United States
name: 'PLDI: Conference on Programming Language Design and Implementation'
start_date: 2019-06-22
date_created: 2019-03-25T10:13:25Z
date_published: 2019-06-08T00:00:00Z
date_updated: 2025-06-02T08:53:45Z
day: '08'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1145/3314221.3314581
ec_funded: 1
external_id:
arxiv:
- '1902.04659'
isi:
- '000523190300014'
file:
- access_level: open_access
checksum: 703a5e9b8c8587f2a44085ffd9a4db64
content_type: application/pdf
creator: akafshda
date_created: 2019-03-25T10:11:22Z
date_updated: 2020-07-14T12:47:20Z
file_id: '6176'
file_name: paper.pdf
file_size: 4051066
relation: main_file
file_date_updated: 2020-07-14T12:47:20Z
has_accepted_license: '1'
isi: 1
keyword:
- Program Cost Analysis
- Program Termination
- Probabilistic Programs
- Martingales
language:
- iso: eng
month: '06'
oa: 1
oa_version: Submitted Version
page: 204-220
project:
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 266EEEC0-B435-11E9-9278-68D0E5697425
name: Quantitative Game-theoretic Analysis of Blockchain Applications and Smart
Contracts
publication: 'PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming
Language Design and Implementation'
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
related_material:
record:
- id: '5457'
relation: earlier_version
status: public
- id: '8934'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Cost analysis of nondeterministic probabilistic programs
type: conference
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
year: '2019'
...
---
_id: '6378'
abstract:
- lang: eng
text: 'In today''s cryptocurrencies, Hashcash proof of work is the most commonly-adopted
approach to mining. In Hashcash, when a miner decides to add a block to the chain,
she has to solve the difficult computational puzzle of inverting a hash function.
While Hashcash has been successfully adopted in both Bitcoin and Ethereum, it
has attracted significant and harsh criticism due to its massive waste of electricity,
its carbon footprint and environmental effects, and the inherent lack of usefulness
in inverting a hash function. Various other mining protocols have been suggested,
including proof of stake, in which a miner''s chance of adding the next block
is proportional to her current balance. However, such protocols lead to a higher
entry cost for new miners who might not still have any stake in the cryptocurrency,
and can in the worst case lead to an oligopoly, where the rich have complete control
over mining. In this paper, we propose Hybrid Mining: a new mining protocol that
combines solving real-world useful problems with Hashcash. Our protocol allows
new miners to join the network by taking part in Hashcash mining without having
to own an initial stake. It also allows nodes of the network to submit hard computational
problems whose solutions are of interest in the real world, e.g.~protein folding
problems. Then, miners can choose to compete in solving these problems, in lieu
of Hashcash, for adding a new block. Hence, Hybrid Mining incentivizes miners
to solve useful problems, such as hard computational problems arising in biology,
in a distributed manner. It also gives researchers in other areas an easy-to-use
tool to outsource their hard computations to the blockchain network, which has
enormous computational power, by paying a reward to the miner who solves the problem
for them. Moreover, our protocol provides strong security guarantees and is at
least as resilient to double spending as Bitcoin.'
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Amir Kafshdar
full_name: Goharshady, Amir Kafshdar
id: 391365CE-F248-11E8-B48F-1D18A9856A87
last_name: Goharshady
orcid: 0000-0003-1702-6584
- first_name: Arash
full_name: Pourdamghani, Arash
last_name: Pourdamghani
citation:
ama: 'Chatterjee K, Goharshady AK, Pourdamghani A. Hybrid Mining: Exploiting blockchain’s
computational power for distributed problem solving. In: Proceedings of the
34th ACM Symposium on Applied Computing. Vol Part F147772. ACM; 2019:374-381.
doi:10.1145/3297280.3297319'
apa: 'Chatterjee, K., Goharshady, A. K., & Pourdamghani, A. (2019). Hybrid Mining:
Exploiting blockchain’s computational power for distributed problem solving. In
Proceedings of the 34th ACM Symposium on Applied Computing (Vol. Part F147772,
pp. 374–381). Limassol, Cyprus: ACM. https://doi.org/10.1145/3297280.3297319'
chicago: 'Chatterjee, Krishnendu, Amir Kafshdar Goharshady, and Arash Pourdamghani.
“Hybrid Mining: Exploiting Blockchain’s Computational Power for Distributed Problem
Solving.” In Proceedings of the 34th ACM Symposium on Applied Computing,
Part F147772:374–81. ACM, 2019. https://doi.org/10.1145/3297280.3297319.'
ieee: 'K. Chatterjee, A. K. Goharshady, and A. Pourdamghani, “Hybrid Mining: Exploiting
blockchain’s computational power for distributed problem solving,” in Proceedings
of the 34th ACM Symposium on Applied Computing, Limassol, Cyprus, 2019, vol.
Part F147772, pp. 374–381.'
ista: 'Chatterjee K, Goharshady AK, Pourdamghani A. 2019. Hybrid Mining: Exploiting
blockchain’s computational power for distributed problem solving. Proceedings
of the 34th ACM Symposium on Applied Computing. ACM Symposium on Applied Computing
vol. Part F147772, 374–381.'
mla: 'Chatterjee, Krishnendu, et al. “Hybrid Mining: Exploiting Blockchain’s Computational
Power for Distributed Problem Solving.” Proceedings of the 34th ACM Symposium
on Applied Computing, vol. Part F147772, ACM, 2019, pp. 374–81, doi:10.1145/3297280.3297319.'
short: K. Chatterjee, A.K. Goharshady, A. Pourdamghani, in:, Proceedings of the
34th ACM Symposium on Applied Computing, ACM, 2019, pp. 374–381.
conference:
end_date: 2019-04-12
location: Limassol, Cyprus
name: ACM Symposium on Applied Computing
start_date: 2019-04-08
date_created: 2019-05-06T12:11:36Z
date_published: 2019-04-01T00:00:00Z
date_updated: 2025-06-02T08:53:46Z
day: '01'
ddc:
- '004'
department:
- _id: KrCh
doi: 10.1145/3297280.3297319
ec_funded: 1
external_id:
isi:
- '000474685800049'
file:
- access_level: open_access
checksum: fbfbcd5a0c7a743862bfc3045539a614
content_type: application/pdf
creator: dernst
date_created: 2019-05-06T12:09:27Z
date_updated: 2020-07-14T12:47:29Z
file_id: '6379'
file_name: 2019_ACM_Chatterjee.pdf
file_size: 1023934
relation: main_file
file_date_updated: 2020-07-14T12:47:29Z
has_accepted_license: '1'
isi: 1
language:
- iso: eng
month: '04'
oa: 1
oa_version: Submitted Version
page: 374-381
project:
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication: Proceedings of the 34th ACM Symposium on Applied Computing
publication_identifier:
isbn:
- '9781450359337'
publication_status: published
publisher: ACM
pubrep_id: '1069'
quality_controlled: '1'
related_material:
record:
- id: '8934'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: 'Hybrid Mining: Exploiting blockchain’s computational power for distributed
problem solving'
type: conference
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: Part F147772
year: '2019'
...