Zobrazeno 1 - 10
of 468
pro vyhledávání: '"P. Kroening"'
Autor:
Eniser, Hasan Ferit, Zhang, Hanliang, David, Cristina, Wang, Meng, Christakis, Maria, Paulsen, Brandon, Dodds, Joey, Kroening, Daniel
Large language models (LLMs) show promise in code translation - the task of translating code written in one programming language to another language - due to their ability to write code in most programming languages. However, LLM's effectiveness on t
Externí odkaz:
http://arxiv.org/abs/2405.11514
Rust is a programming language that combines memory safety and low-level control, providing C-like performance while guaranteeing the absence of undefined behaviors by default. Rust's growing popularity has prompted research on safe and correct trans
Externí odkaz:
http://arxiv.org/abs/2404.18852
Autor:
Mitta, Rohan, Hasanbeig, Hosein, Wang, Jun, Kroening, Daniel, Kantaros, Yiannis, Abate, Alessandro
This paper addresses the problem of maintaining safety during training in Reinforcement Learning (RL), such that the safety constraint violations are bounded at any point during learning. In a variety of RL applications the safety of the agent is par
Externí odkaz:
http://arxiv.org/abs/2312.11314
Autor:
Kelly, David A., Chockler, Hana, Kroening, Daniel, Blake, Nathan, Ramaswamy, Aditi, Navaratnarajah, Melane, Shivakumar, Aaditya
In this paper, we propose a new black-box explainability algorithm and tool, YO-ReX, for efficient explanation of the outputs of object detectors. The new algorithm computes explanations for all objects detected in the image simultaneously. Hence, co
Externí odkaz:
http://arxiv.org/abs/2311.14081
Existing explanation tools for image classifiers usually give only a single explanation for an image's classification. For many images, however, both humans and image classifiers accept more than one explanation for the image label. Thus, restricting
Externí odkaz:
http://arxiv.org/abs/2309.14309
The C Bounded Model Checker (CBMC) demonstrates the violation of assertions in C programs, or proves safety of the assertions under a given bound. CBMC implements a bit-precise translation of an input C program, annotated with assertions and with loo
Externí odkaz:
http://arxiv.org/abs/2302.02384
JBMC is an open-source SAT- and SMT-based bounded model checking tool for verifying Java bytecode. JBMC relies on an operational model of the Java libraries, which conservatively approximates their semantics, to verify assertion violations, array out
Externí odkaz:
http://arxiv.org/abs/2302.02381
2LS ("tools") is a verification tool for C programs, built upon the CPROVER framework. It allows one to verify user-specified assertions, memory safety properties (e.g. buffer overflows), numerical overflows, division by zero, memory leaks, and termi
Externí odkaz:
http://arxiv.org/abs/2302.02380
LCRL is a software tool that implements model-free Reinforcement Learning (RL) algorithms over unknown Markov Decision Processes (MDPs), synthesising policies that satisfy a given linear temporal specification with maximal probability. LCRL leverages
Externí odkaz:
http://arxiv.org/abs/2209.10341
We present a new active model-learning approach to generating abstractions of a system implementation, as finite state automata (FSAs), from execution traces. Given an implementation and a set of observable system variables, the generated automata ad
Externí odkaz:
http://arxiv.org/abs/2112.05990