Zobrazeno 1 - 10
of 24
pro vyhledávání: '"Metzger, Niklas"'
Information flow guided synthesis is a compositional approach to the automated construction of distributed systems where the assumptions between the components are captured as information-flow requirements. Information-flow requirements are hyperprop
Externí odkaz:
http://arxiv.org/abs/2407.12298
Publikováno v:
Computer Aided Verification: 36th International Conference, CAV 2024, Proceedings, Part III, Lecture Notes in Computer Science, vol 14683, Springer
We present an automata-based algorithm to synthesize omega-regular causes for omega-regular effects on executions of a reactive system, such as counterexamples uncovered by a model checker. Our theory is a generalization of temporal causality, which
Externí odkaz:
http://arxiv.org/abs/2405.10912
Hyperproperties express the relationship between multiple executions of a system. This is needed in many AI-related fields, such as knowledge representation and planning, to capture system properties related to knowledge, information flow, and privac
Externí odkaz:
http://arxiv.org/abs/2404.09652
We introduce Hyper$^2$LTL, a temporal logic for the specification of hyperproperties that allows for second-order quantification over sets of traces. Unlike first-order temporal logics for hyperproperties, such as HyperLTL, Hyper$^2$LTL can express c
Externí odkaz:
http://arxiv.org/abs/2305.17935
Autor:
Coenen, Norine, Dachselt, Raimund, Finkbeiner, Bernd, Frenkel, Hadar, Hahn, Christopher, Horak, Tom, Metzger, Niklas, Siber, Julian
Hyperproperties relate multiple computation traces to each other. Model checkers for hyperproperties thus return, in case a system model violates the specification, a set of traces as a counterexample. Fixing the erroneous relations between traces in
Externí odkaz:
http://arxiv.org/abs/2206.02074
Autor:
Hahn, Christopher, Schmitt, Frederik, Tillman, Julia J., Metzger, Niklas, Siber, Julian, Finkbeiner, Bernd
We study the generalization abilities of language models when translating natural language into formal specifications with complex semantics. In particular, we fine-tune language models on three datasets consisting of English sentences and their corr
Externí odkaz:
http://arxiv.org/abs/2206.01962
In this paper, we study the computation of how much an input token in a Transformer model influences its prediction. We formalize a method to construct a flow network out of the attention values of encoder-only Transformer models and extend it to gen
Externí odkaz:
http://arxiv.org/abs/2205.15389
Compositional synthesis relies on the discovery of assumptions, i.e., restrictions on the behavior of the remainder of the system that allow a component to realize its specification. In order to avoid losing valid solutions, these assumptions should
Externí odkaz:
http://arxiv.org/abs/2205.12085
The verification of cyber-physical systems operating in a safety-critical environment requires formal system models. The validity of the verification hinges on the precision of the model: possible behavior not captured in the model can result in form
Externí odkaz:
http://arxiv.org/abs/2111.05613
Autor:
Horak, Tom, Coenen, Norine, Metzger, Niklas, Hahn, Christopher, Flemisch, Tamara, Méndez, Julián, Dimov, Dennis, Finkbeiner, Bernd, Dachselt, Raimund
Model checkers provide algorithms for proving that a mathematical model of a system satisfies a given specification. In case of a violation, a counterexample that shows the erroneous behavior is returned. Understanding these counterexamples is challe
Externí odkaz:
http://arxiv.org/abs/2108.03698