@article{15312,
  abstract     = {The question of whether or not a given integral polynomial takes infinitely many square-free values has only been addressed unconditionally for polynomials of degree at most 3. We address this question, on average, for polynomials of arbitrary degree.},
  author       = {Browning, Timothy D and Shparlinski, Igor E.},
  issn         = {0022-314X},
  journal      = {Journal of Number Theory},
  pages        = {220--240},
  publisher    = {Elsevier},
  title        = {{Square-free values of random polynomials}},
  doi          = {10.1016/j.jnt.2024.02.013},
  volume       = {261},
  year         = {2024},
}

@unpublished{18295,
  abstract     = {By developing a suitable version of the circle method, we show that the space of degree e rational curves on a smooth hypersurface of degree d has only canonical singularities provided its dimension is sufficiently large with respect to e and d.},
  author       = {Glas, Jakob},
  booktitle    = {arXiv},
  title        = {{Canonical singularities on moduli spaces of rational curves via the  circle method}},
  doi          = {10.48550/arXiv.2405.16648},
  year         = {2024},
}

@unpublished{19013,
  abstract     = {We study the singularities of the moduli space of degree e maps from smooth genus g curves to an arbitrary smooth hypersurface of low degree. For e large compared to g, we show that these moduli spaces have at worst terminal singularities. Our main approach is to study the jet schemes of these moduli spaces by developing a suitable form of the circle method.},
  author       = {Glas, Jakob and Hase-Liu, Matthew },
  booktitle    = {arXiv},
  title        = {{Terminal singularities of the moduli space of curves on low degree hypersurfaces and the circle method}},
  doi          = {10.48550/arXiv.2412.14923},
  year         = {2024},
}

@article{14841,
  abstract     = {De novo heterozygous variants in KCNC2 encoding the voltage-gated potassium (K+) channel subunit Kv3.2 are a recently described cause of developmental and epileptic encephalopathy (DEE). A de novo variant in KCNC2 c.374G > A (p.Cys125Tyr) was identified via exome sequencing in a patient with DEE. Relative to wild-type Kv3.2, Kv3.2-p.Cys125Tyr induces K+ currents exhibiting a large hyperpolarizing shift in the voltage dependence of activation, accelerated activation, and delayed deactivation consistent with a relative stabilization of the open conformation, along with increased current density. Leveraging the cryogenic electron microscopy (cryo-EM) structure of Kv3.1, molecular dynamic simulations suggest that a strong π-π stacking interaction between the variant Tyr125 and Tyr156 in the α-6 helix of the T1 domain promotes a relative stabilization of the open conformation of the channel, which underlies the observed gain of function. A multicompartment computational model of a Kv3-expressing parvalbumin-positive cerebral cortex fast-spiking γ-aminobutyric acidergic (GABAergic) interneuron (PV-IN) demonstrates how the Kv3.2-Cys125Tyr variant impairs neuronal excitability and dysregulates inhibition in cerebral cortex circuits to explain the resulting epilepsy.},
  author       = {Clatot, Jerome and Currin, Christopher and Liang, Qiansheng and Pipatpolkai, Tanadet and Massey, Shavonne L. and Helbig, Ingo and Delemotte, Lucie and Vogels, Tim P and Covarrubias, Manuel and Goldberg, Ethan M.},
  issn         = {1091-6490},
  journal      = {Proceedings of the National Academy of Sciences of the United States of America},
  number       = {3},
  publisher    = {National Academy of Sciences},
  title        = {{A structurally precise mechanism links an epilepsy-associated KCNC2 potassium channel mutation to interneuron dysfunction}},
  doi          = {10.1073/pnas.2307776121},
  volume       = {121},
  year         = {2024},
}

@article{15171,
  abstract     = {The brain’s functionality is developed and maintained through synaptic plasticity. As synapses undergo plasticity, they also affect each other. The nature of such ‘co-dependency’ is difficult to disentangle experimentally, because multiple synapses must be monitored simultaneously. To help understand the experimentally observed phenomena, we introduce a framework that formalizes synaptic co-dependency between different connection types. The resulting model explains how inhibition can gate excitatory plasticity while neighboring excitatory–excitatory interactions determine the strength of long-term potentiation. Furthermore, we show how the interplay between excitatory and inhibitory synapses can account for the quick rise and long-term stability of a variety of synaptic weight profiles, such as orientation tuning and dendritic clustering of co-active synapses. In recurrent neuronal networks, co-dependent plasticity produces rich and stable motor cortex-like dynamics with high input sensitivity. Our results suggest an essential role for the neighborly synaptic interaction during learning, connecting micro-level physiology with network-wide phenomena.},
  author       = {Agnes, Everton J. and Vogels, Tim P},
  issn         = {1546-1726},
  journal      = {Nature Neuroscience},
  pages        = {964--974},
  publisher    = {Springer Nature},
  title        = {{Co-dependent excitatory and inhibitory plasticity accounts for quick, stable and long-lasting memories in biological networks}},
  doi          = {10.1038/s41593-024-01597-4},
  volume       = {27},
  year         = {2024},
}

@article{14887,
  abstract     = {Episodic memories are encoded by experience-activated neuronal ensembles that remain necessary and sufficient for recall. However, the temporal evolution of memory engrams after initial encoding is unclear. In this study, we employed computational and experimental approaches to examine how the neural composition and selectivity of engrams change with memory consolidation. Our spiking neural network model yielded testable predictions: memories transition from unselective to selective as neurons drop out of and drop into engrams; inhibitory activity during recall is essential for memory selectivity; and inhibitory synaptic plasticity during memory consolidation is critical for engrams to become selective. Using activity-dependent labeling, longitudinal calcium imaging and a combination of optogenetic and chemogenetic manipulations in mouse dentate gyrus, we conducted contextual fear conditioning experiments that supported our model’s predictions. Our results reveal that memory engrams are dynamic and that changes in engram composition mediated by inhibitory plasticity are crucial for the emergence of memory selectivity.},
  author       = {Feitosa Tomé, Douglas and Zhang, Ying and Aida, Tomomi and Mosto, Olivia and Lu, Yifeng and Chen, Mandy and Sadeh, Sadra and Roy, Dheeraj S. and Clopath, Claudia},
  issn         = {1546-1726},
  journal      = {Nature Neuroscience},
  pages        = {561--572},
  publisher    = {Springer Nature},
  title        = {{Dynamic and selective engrams emerge with memory consolidation}},
  doi          = {10.1038/s41593-023-01551-w},
  volume       = {27},
  year         = {2024},
}

@article{15169,
  abstract     = {Interpretation of extracellular recordings can be challenging due to the long range of electric field. This challenge can be mitigated by estimating the current source density (CSD). Here we introduce kCSD-python, an open Python package implementing Kernel Current Source Density (kCSD) method and related tools to facilitate CSD analysis of experimental data and the interpretation of results. We show how to counter the limitations imposed by noise and assumptions in the method itself. kCSD-python allows CSD estimation for an arbitrary distribution of electrodes in 1D, 2D, and 3D, assuming distributions of sources in tissue, a slice, or in a single cell, and includes a range of diagnostic aids. We demonstrate its features in a Jupyter Notebook tutorial which illustrates a typical analytical workflow and main functionalities useful in validating analysis results.},
  author       = {Chintaluri, Chaitanya and Bejtka, Marta and Sredniawa, Wladyslaw and Czerwinski, Michal and Dzik, Jakub M. and Jedrzejewska-Szmek, Joanna and Wojciki, Daniel K.},
  issn         = {1553-7358},
  journal      = {PLoS Computational Biology},
  number       = {3},
  publisher    = {Public Library of Science},
  title        = {{kCSD-python, reliable current source density estimation with quality control}},
  doi          = {10.1371/journal.pcbi.1011941},
  volume       = {20},
  year         = {2024},
}

@article{17092,
  abstract     = {Memories are thought to be stored in neural ensembles known as engrams that are specifically reactivated during memory recall. Recent studies have found that memory engrams of two events that happened close in time tend to overlap in the hippocampus and the amygdala, and these overlaps have been shown to support memory linking. It has been hypothesized that engram overlaps arise from the mechanisms that regulate memory allocation itself, involving neural excitability, but the exact process remains unclear. Indeed, most theoretical studies focus on synaptic plasticity and little is known about the role of intrinsic plasticity, which could be mediated by neural excitability and serve as a complementary mechanism for forming memory engrams. Here, we developed a rate-based recurrent neural network that includes both synaptic plasticity and neural excitability. We obtained structural and functional overlap of memory engrams for contexts that are presented close in time, consistent with experimental and computational studies. We then investigated the role of excitability in memory allocation at the network level and unveiled competitive mechanisms driven by inhibition. This work suggests mechanisms underlying the role of intrinsic excitability in memory allocation and linking, and yields predictions regarding the formation and the overlap of memory engrams.},
  author       = {Delamare, Geoffroy and Feitosa Tomé, Douglas and Clopath, Claudia},
  issn         = {1529-2401},
  journal      = {Journal of Neuroscience},
  number       = {21},
  publisher    = {Society for Neuroscience},
  title        = {{Intrinsic neural excitability biases allocation and overlap of memory engrams}},
  doi          = {10.1523/JNEUROSCI.0846-23.2024},
  volume       = {44},
  year         = {2024},
}

@article{18930,
  abstract     = {We study sumsets 𝒜 + ℬ in the set of squares 𝒮 (and, more generally, in the set of kth powers 𝒮k, where k ≥2 is an integer). It is known by a result of Gyarmati that 𝒜 + ℬ ⊂ 𝒮k ∩[1,N] implies that min(|𝒜|,|ℬ|) =Ok(logN). Here, we study how the upper bound on |ℬ| decreases, when the size of |𝒜| increases (or vice versa). In particular, if |𝒜| ≥ Ck1m m(logN)1m , then |ℬ| = Ok(m2logN), for sufficiently large N, a positive integer m and an explicit constant C > 0. For example, with m ∼ loglogN this gives: If |𝒜| ≥ CkloglogN,then |ℬ| = Ok(logN(loglogN)2).},
  author       = {Elsholtz, Christian and Wurzinger, Lena},
  issn         = {1464-3847},
  journal      = {The Quarterly Journal of Mathematics},
  number       = {4},
  pages        = {1243--1254},
  publisher    = {Oxford University Press},
  title        = {{Sumsets in the set of squares}},
  doi          = {10.1093/qmath/haae044},
  volume       = {75},
  year         = {2024},
}

@inproceedings{17327,
  abstract     = {Sequential decision-making in probabilistic environments is a fundamental problem with many applications in AI and economics. In this paper, we present an algorithm for synthesizing sequential decision-making agents that optimize statistical properties such as maximum and average response times. In the general setting of sequential decision-making, the environment is modeled as a random process that generates inputs. The agent responds to each input, aiming to maximize rewards and minimize costs within a specified time horizon. The corresponding synthesis problem is known to be PSPACE-hard. We consider the special case where the input distribution, reward, and cost depend on input-output statistics specified by counter automata. For such problems, this paper presents the first PTIME synthesis algorithms. We introduce the notion of statistical abstraction, which clusters statistically indistinguishable input-output sequences into equivalence classes. This abstraction allows for a dynamic programming algorithm whose complexity grows polynomially with the considered horizon, making the statistical case exponentially more efficient than the general case. We evaluate our algorithm on three different application scenarios of a client-server protocol, where multiple clients compete via bidding to gain access to the service offered by the server. The synthesized policies optimize profit while guaranteeing that none of the server’s clients is disproportionately starved of the service.},
  author       = {Cano, Filip and Henzinger, Thomas A and Könighofer, Bettina and Kueffner, Konstantin and Mallik, Kaushik},
  booktitle    = {9th International Conference on Formal Structures for Computation and Deduction},
  isbn         = {9783959773232},
  issn         = {1868-8969},
  location     = {Tallinn, Estonia},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  title        = {{Abstraction-based decision making for statistical properties}},
  doi          = {10.4230/LIPIcs.FSCD.2024.2},
  volume       = {299},
  year         = {2024},
}

@article{17886,
  abstract     = {Thin pancake-like neuronal networks cultured on top of a planar microelectrode array have been extensively tried out in neuroengineering, as a substrate for the mobile robot’s control unit, i.e., as a cyborg’s brain. Most of these attempts failed due to intricate self-organizing dynamics in the neuronal systems. In particular, the networks may exhibit an emergent spatial map of steady nucleation sites (“n-sites”) of spontaneous population spikes. Being unpredictable and independent of the surface electrode locations, the n-sites drastically change local ability of the network to generate spikes. Here, using a spiking neuronal network model with generative spatially-embedded connectome, we systematically show in simulations that the number, location, and relative activity of spontaneously formed n-sites (“the vitals”) crucially depend on the samplings of three distributions: (1) the network distribution of neuronal excitability, (2) the distribution of connections between neurons of the network, and (3) the distribution of maximal amplitudes of a single synaptic current pulse. Moreover, blocking the dynamics of a small fraction (about 4%) of non-pacemaker neurons having the highest excitability was enough to completely suppress the occurrence of population spikes and their n-sites. This key result is explained theoretically. Remarkably, the n-sites occur taking into account only short-term synaptic plasticity, i.e., without a Hebbian-type plasticity. As the spiking network model used in this study is strictly deterministic, all simulation results can be accurately reproduced. The model, which has already demonstrated a very high richness-to-complexity ratio, can also be directly extended into the three-dimensional case, e.g., for targeting peculiarities of spiking dynamics in cerebral (or brain) organoids. We recommend the model as an excellent illustrative tool for teaching network-level computational neuroscience, complementing a few benchmark models.},
  author       = {Zendrikov, Dmitrii and Paraskevov, Alexander},
  issn         = {1879-2782},
  journal      = {Neural Networks},
  publisher    = {Elsevier},
  title        = {{The vitals for steady nucleation maps of spontaneous spiking coherence in autonomous two-dimensional neuronal networks}},
  doi          = {10.1016/j.neunet.2024.106589},
  volume       = {180},
  year         = {2024},
}

@article{14400,
  abstract     = {We consider the problem of computing the maximal probability of satisfying an 
-regular specification for stochastic, continuous-state, nonlinear systems evolving in discrete time. The problem reduces, after automata-theoretic constructions, to finding the maximal probability of satisfying a parity condition on a (possibly hybrid) state space. While characterizing the exact satisfaction probability is open, we show that a lower bound on this probability can be obtained by (I) computing an under-approximation of the qualitative winning region, i.e., states from which the parity condition can be enforced almost surely, and (II) computing the maximal probability of reaching this qualitative winning region.
The heart of our approach is a technique to symbolically compute the under-approximation of the qualitative winning region in step (I) via a finite-state abstraction of the original system as a 
-player parity game. Our abstraction procedure uses only the support of the probabilistic evolution; it does not use precise numerical transition probabilities. We prove that the winning set in the abstract -player game induces an under-approximation of the qualitative winning region in the original synthesis problem, along with a policy to solve it. By combining these contributions with (a) a symbolic fixpoint algorithm to solve 
-player games and (b) existing techniques for reachability policy synthesis in stochastic nonlinear systems, we get an abstraction-based algorithm for finding a lower bound on the maximal satisfaction probability.
We have implemented the abstraction-based algorithm in Mascot-SDS, where we combined the outlined abstraction step with our tool Genie (Majumdar et al., 2023) that solves 
-player parity games (through a reduction to Rabin games) more efficiently than existing algorithms. We evaluated our implementation on the nonlinear model of a perturbed bistable switch from the literature. We show empirically that the lower bound on the winning region computed by our approach is precise, by comparing against an over-approximation of the qualitative winning region. Moreover, our implementation outperforms a recently proposed tool for solving this problem by a large margin.},
  author       = {Majumdar, Rupak and Mallik, Kaushik and Schmuck, Anne Kathrin and Soudjani, Sadegh},
  issn         = {1751-570X},
  journal      = {Nonlinear Analysis: Hybrid Systems},
  number       = {2},
  publisher    = {Elsevier},
  title        = {{Symbolic control for stochastic systems via finite parity games}},
  doi          = {10.1016/j.nahs.2023.101430},
  volume       = {51},
  year         = {2024},
}

@article{15258,
  abstract     = {Inclusion at academic events is facing increased scrutiny as the communities these events serve raise their expectations for who can practically attend. Active efforts in recent years to bring more diversity to academic events have brought progress and created momentum. However, we must reflect on these efforts and determine which underrepresented groups are being disadvantaged. Inclusion at academic events is important to ensure diversity of discourse and opinion, to help build networks, and to avoid academic siloing. All of these contribute to the development of a robust and resilient academic field. We have developed these Ten Simple Rules both to amplify the voices that have been speaking out and to celebrate the progress of many Equity, Diversity, and Inclusivity practices that continue to drive the organisation of academic events. The Rules aim to raise awareness as well as provide actionable suggestions and tools to support these initiatives further. This aims to support academic organisations such as the Deep Learning Indaba, Neuromatch Academy, the IBRO-Simons Computational Neuroscience Imbizo, Biodiversity Information Standards (TDWG), Arabs in Neuroscience, FAIRPoints, and OLS (formerly Open Life Science). This article is a call to action for organisers to reevaluate the impact and reach of their inclusive practices.},
  author       = {Hall, Siobhan Mackenzie and Kochin, Daniel and Carne, Carmel and Herterich, Patricia and Lewers, Kristen Lenay and Abdelhack, Mohamed and Ramasubramanian, Arun and Michael Alphonse, Juno Felecia and Ung, Visotheary and El-Gebali, Sara and Currin, Christopher and Plomp, Esther and Thompson, Rachel and Sharan, Malvika},
  issn         = {1553-7358},
  journal      = {PLOS Computational Biology},
  number       = {3},
  publisher    = {Public Library of Science},
  title        = {{Ten simple rules for pushing boundaries of inclusion at academic events}},
  doi          = {10.1371/journal.pcbi.1011797},
  volume       = {20},
  year         = {2024},
}

@article{15295,
  abstract     = {Background: Benzodiazepines and antidepressants are effective agents for the treatment of generalized anxiety disorder (GAD), with the HAM-A frequently used as a primary outcome measure. The GAD literature is inconsistent regarding which medications are more effective for somatic versus psychic symptoms of GAD, and treatment guidelines do not advocate for prescribing based on subtype. This meta-analysis aimed to determine whether benzodiazepines and antidepressants have a differential impact on the somatic versus psychic subscales of the HAM-A in GAD.

Methods: An electronic search was undertaken for randomized controlled trials of either benzodiazepines or antidepressants for GAD that reported treatment response using the HAM-A subscales. Data were extracted by independent reviewers. A random effects assessment of weighted mean difference with 95% confidence intervals and subgroup difference was applied. All analysis was done on SPSS 26. An assessment of bias, and of quality of evidence was performed.

Results: 24 randomized controlled trials met the inclusion criteria: 18 antidepressant trials, 5 benzodiazepine trials and 1 of both. 14 studies were assessed as having between some and high risk of bias, while 10 were assessed as having low risk of bias. Benzodiazepines (WMD of 1.81 [CI 1.03, 2.58]) were significantly more effective than antidepressants (WMD of 0.83 [CI 0.64, 1.02]) for reducing somatic symptoms of GAD (Chi2 = 5.81, p = 0.02), and were also more effective (WMD of 2.46 [CI 1.83, 3.09]) in reducing psychic symptoms than antidepressants (WMD of 1.83 [CI 1.55, 2.10]), although this comparison did not reach statistical significance (Chi2 = 3.31, p = 0.07).

Conclusion: The finding that benzodiazepines were significantly more effective than antidepressants for somatic symptoms needs to be weighed up against potential benefits of antidepressants over benzodiazepines. It may be useful for future treatment guidelines for GAD to explicitly consider symptom subtype.},
  author       = {Beyer, Chad and Currin, Christopher and Williams, Taryn and Stein, Dan J.},
  issn         = {1532-8384},
  journal      = {Comprehensive Psychiatry},
  publisher    = {Elsevier},
  title        = {{Meta-analysis of the comparative efficacy of benzodiazepines and antidepressants for psychic versus somatic symptoms of generalized anxiety disorder}},
  doi          = {10.1016/j.comppsych.2024.152479},
  volume       = {132},
  year         = {2024},
}

@inproceedings{17053,
  abstract     = {We introduce a formalization of ternary simulation as abstract interpretation along with a widening operator to speed up convergence. With the same goal, we present a subsumption algorithm that can determine termination earlier than the usual approach using hash sets. Additionally, we introduce a narrowing operator that utilizes recent advances in backbone extraction, allowing to increase the overapproximation precision in simulation at any time. The experiments evaluate the presented techniques in the context of hardware model checking.},
  author       = {Froleyks, Nils and Yu, Zhengqi and Biere, Armin},
  booktitle    = {27th Workshop on Methods and Description Languages for Modeling and Verification of Circuits and Systems},
  isbn         = {9783800762682},
  location     = {Kaiserslautern, Germany},
  pages        = {148--151},
  publisher    = {VDE Verlag},
  title        = {{Ternary simulation as abstract interpretation (Work in Progress)}},
  year         = {2024},
}

@misc{23182,
  abstract     = {This online resource contains the simulation data and program codes required for reproducing all results of the study described in the article, and Supplementary Figures and Videos.},
  author       = {Zendrikov, Dmitrii and Paraskevov, Alexander},
  publisher    = {Figshare},
  title        = {{Supplementary Material for the article entitled "The vitals for steady nucleation maps of spontaneous spiking coherence in autonomous two-dimensional neuronal networks"}},
  doi          = {10.6084/m9.figshare.24527848},
  year         = {2024},
}

@inproceedings{18066,
  abstract     = {Graph games lie at the algorithmic core of many automated design problems in computer science. These are games usually played between two players on a given graph, where the players keep moving a token along the edges according to pre-determined rules (turn-based, concurrent, etc.), and the winner is decided based on the infinite path (aka play) traversed by the token from a given initial position. In bidding games, the players initially get some monetary budgets which they need to use to bid for the privilege of moving the token at each step. Each round of bidding affects the players' available budgets, which is the only form of update that the budgets experience. We introduce bidding games with charging where the players can additionally improve their budgets during the game by collecting vertex-dependent monetary rewards, aka the "charges." Unlike traditional bidding games (where all charges are zero), bidding games with charging allow non-trivial recurrent behaviors. For example, a reachability objective may require multiple detours to vertices with high charges to earn additional budget. We show that, nonetheless, the central property of traditional bidding games generalizes to bidding games with charging: For each vertex there exists a threshold ratio, which is the necessary and sufficient fraction of the total budget for winning the game from that vertex. While the thresholds of traditional bidding games correspond to unique fixed points of linear systems of equations, in games with charging, these fixed points are no longer unique. This significantly complicates the proof of existence and the algorithmic computation of thresholds for infinite-duration objectives. We also provide the lower complexity bounds for computing thresholds for Rabin and Streett objectives, which are the first known lower bounds in any form of bidding games (with or without charging), and we solve the following repair problem for safety and reachability games that have unsatisfiable objectives: Can we distribute a given amount of charge to the players in a way such that the objective can be satisfied?},
  author       = {Avni, Guy and Goharshady, Ehsan Kafshdar and Henzinger, Thomas A and Mallik, Kaushik},
  booktitle    = {35th International Conference on Concurrency Theory},
  isbn         = {9783959773393},
  issn         = {1868-8969},
  location     = {Calgary, Canada},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  title        = {{Bidding games with charging}},
  doi          = {10.4230/LIPIcs.CONCUR.2024.8},
  volume       = {311},
  year         = {2024},
}

@inproceedings{18067,
  abstract     = {An automaton 𝒜 is history-deterministic if its nondeterminism can be resolved on the fly, only using the prefix of the word read so far. This mild form of nondeterminism has attracted particular attention for its applications in synthesis problems. An automaton 𝒜 is guidable with respect to a class C of automata if it can fairly simulate every automaton in C, whose language is contained in that of 𝒜. In other words, guidable automata are those for which inclusion and simulation coincide, making them particularly interesting for model-checking. We study the connection between these two notions, and specifically the question of when they coincide. For classes of automata on which they do, deciding guidability, an otherwise challenging decision problem, reduces to deciding history-determinism, a problem that is starting to be well-understood for many classes. We provide a selection of sufficient criteria for a class of automata to guarantee the coincidence of the notions, and use them to show that the notions coincide for the most common automata classes, among which are ω-regular automata and many infinite-state automata with safety and reachability acceptance conditions, including vector addition systems with states, one-counter nets, pushdown-, Parikh-, and timed-automata. We also demonstrate that history-determinism and guidability do not always coincide, for example, for the classes of timed automata with a fixed number of clocks.},
  author       = {Boker, Udi and Henzinger, Thomas A and Lehtinen, Karoliina and Prakash, Aditya},
  booktitle    = {35th International Conference on Concurrency Theory},
  isbn         = {9783959773393},
  issn         = {1868-8969},
  location     = {Calgary, Canada},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  title        = {{History-determinism vs fair simulation}},
  doi          = {10.4230/LIPIcs.CONCUR.2024.12},
  volume       = {311},
  year         = {2024},
}

@inproceedings{15376,
  abstract     = {Sequential decision-making tasks often require satisfaction of multiple, partially-contradictory objectives. Existing approaches are monolithic, where a single policy fulfills all objectives. We present auction-based scheduling, a decentralized framework for multi-objective sequential decision making. Each objective is fulfilled using a separate and independent policy. Composition of policies is performed at runtime, where at each step, the policies simultaneously bid from pre-allocated budgets for the privilege of choosing the next action. The framework allows policies to be independently created, modified, and replaced. We study path planning problems on finite graphs with two temporal objectives and present algorithms to synthesize policies together with bidding policies in a decentralized manner. We consider three categories of decentralized synthesis problems, parameterized by the assumptions that the policies make on each other. We identify a class of assumptions called assume-admissible for which synthesis is always possible for graphs whose every vertex has at most two outgoing edges.},
  author       = {Avni, Guy and Mallik, Kaushik and Sadhukhan, Suman},
  booktitle    = {30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems},
  isbn         = {9783031572555},
  issn         = {1611-3349},
  location     = {Luxembourg City, Luxembourg},
  pages        = {153--172},
  publisher    = {Springer Nature},
  title        = {{Auction-based scheduling}},
  doi          = {10.1007/978-3-031-57256-2_8},
  volume       = {14572},
  year         = {2024},
}

@inproceedings{17413,
  abstract     = {Certification helps to increase trust in formal verification of safety-critical systems which require assurance on their correctness. In hardware model checking, a widely used formal verification technique, phase abstraction is considered one of the most commonly used preprocessing techniques. We present an approach to certify an extended form of phase abstraction using a generic certificate format. As in earlier works our approach involves constructing a witness circuit with an inductive invariant property that certifies the correctness of the entire model checking process, which is then validated by an independent certificate checker. We have implemented and evaluated the proposed approach including certification for various preprocessing configurations on hardware model checking competition benchmarks. As an improvement on previous work in this area, the proposed method is able to efficiently complete certification with an overhead of a fraction of model checking time.},
  author       = {Froleyks, Nils and Yu, Zhengqi and Biere, Armin and Heljanko, Keijo},
  booktitle    = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
  isbn         = {9783031634970},
  issn         = {1611-3349},
  location     = {Nancy, France},
  pages        = {284--303},
  publisher    = {Springer Nature},
  title        = {{Certifying phase abstraction}},
  doi          = {10.1007/978-3-031-63498-7_17},
  volume       = {14739},
  year         = {2024},
}

