Zobrazeno 1 - 10
of 215
pro vyhledávání: '"Viswanathan, Mahesh"'
The classical `decision problem' asks whether a given formula of first-order logic is satisfiable. In this work we consider an extension of this problem to regular first-order theories, i.e. (infinite) regular sets of formulae. Building on the beauti
Externí odkaz:
http://arxiv.org/abs/2410.17185
The rapid evolution of Large Language Models (LLMs) has transformed them from basic conversational tools into sophisticated entities capable of complex reasoning and decision-making. These advancements have led to the development of specialized LLM-b
Externí odkaz:
http://arxiv.org/abs/2410.22339
Security properties of real-time systems often involve reasoning about hyper-properties, as opposed to properties of single executions or trees of executions. These hyper-properties need to additionally be expressive enough to reason about real-time
Externí odkaz:
http://arxiv.org/abs/2405.12104
Autor:
Miller, Kristina, Zeitler, Christopher K., Shen, William, Hobbs, Kerianne, Mitra, Sayan, Schierman, John, Viswanathan, Mahesh
A runtime assurance system (RTA) for a given plant enables the exercise of an untrusted or experimental controller while assuring safety with a backup (or safety) controller. The relevant computational design problem is to create a logic that assures
Externí odkaz:
http://arxiv.org/abs/2310.04288
We consider the problem of checking the differential privacy of online randomized algorithms that process a stream of inputs and produce outputs corresponding to each input. This paper generalizes an automaton model called DiP automata (See arXiv:210
Externí odkaz:
http://arxiv.org/abs/2309.06615
Runtime assurance (RTA) addresses the problem of keeping an autonomous system safe while using an untrusted (or experimental) controller. This can be done via logic that explicitly switches between the untrusted controller and a safety controller, or
Externí odkaz:
http://arxiv.org/abs/2306.04585
Deadlocks are one of the most notorious concurrency bugs, and significant research has focused on detecting them efficiently. Dynamic predictive analyses work by observing concurrent executions, and reason about alternative interleavings that can wit
Externí odkaz:
http://arxiv.org/abs/2304.03692
A hyperproperty relates executions of a program and is used to formalize security objectives such as confidentiality, non-interference, privacy, and anonymity. Formally, a hyperproperty is a collection of allowable sets of executions. A program viola
Externí odkaz:
http://arxiv.org/abs/2301.11521
Dynamic techniques are a scalable and effective way to analyze concurrent programs. Instead of analyzing all behaviors of a program, these techniques detect errors by focusing on a single program execution. Often a crucial step in these techniques is
Externí odkaz:
http://arxiv.org/abs/2201.06325
Publikováno v:
Proceedings of the 27th ACM Conference on Innovation and Technology in Computer Science Education Vol 1 (ITiCSE 2022)
Proof Blocks is a software tool which enables students to write proofs by dragging and dropping prewritten proof lines into the correct order. These proofs can be graded completely automatically, enabling students to receive rapid feedback on how the
Externí odkaz:
http://arxiv.org/abs/2106.11032