English
Related papers

Related papers: Interacting Safely with an Unsafe Environment

200 papers

Formal deductive systems are very common in computer science. They are used to represent logics, programming languages, and security systems. Moreover, writing programs that manipulate them and that reason about them is important and…

Programming Languages · Computer Science 2018-05-21 Francisco Ferreira Ruiz

We present an approach to type theory in which the typing judgments do not have explicit contexts. Instead of judgments of shape "Gamma |- A : B", our systems just have judgments of shape "A : B". A key feature is that we distinguish free…

Logic in Computer Science · Computer Science 2010-09-16 Herman Geuvers , Robbert Krebbers , James McKinna , Freek Wiedijk

The need for systems to explain behavior to users has become more evident with the rise of complex technology like machine learning or self-adaptation. In general, the need for an explanation arises when the behavior of a system does not…

Software Engineering · Computer Science 2021-08-16 Mersedeh Sadeghi , Verena Klös , Andreas Vogelsang

Dedukti is a very expressive logical framework which unlike most frameworks, such as the Edinburgh Logical Framework (LF), allows for the representation of computation alongside deduction. However, unlike LF encodings, Dedukti encodings…

Logic in Computer Science · Computer Science 2022-05-09 Thiago Felicissimo

We present a unifying framework for type systems for process calculi. The core of the system provides an accurate correspondence between essentially functional processes and linear logic proofs; fragments of this system correspond to…

Logic in Computer Science · Computer Science 2015-05-29 Emmanuel Beffara

Type-level programming is an increasingly popular way to obtain additional type safety. Unfortunately, it remains a second-class citizen in the majority of industrially-used programming languages. We propose a new dependently-typed system…

Programming Languages · Computer Science 2020-11-17 Georg Stefan Schmid , Olivier Blanvillain , Jad Hamza , Viktor Kunčak

As AI systems become more advanced, companies and regulators will make difficult decisions about whether it is safe to train and deploy them. To prepare for these decisions, we investigate how developers could make a 'safety case,' which is…

Computers and Society · Computer Science 2024-03-20 Joshua Clymer , Nick Gabrieli , David Krueger , Thomas Larsen

Global-type formalisms enable to describe the overall behaviour of distributed systems and at the same time to enforce safety properties for communications between system components. Our goal is that of amending a weakness of such…

Logic in Computer Science · Computer Science 2018-10-08 Franco Barbanera , Ugo de'Liguoro , Rolf Hennicker

Explainable systems expose information about why certain observed effects are happening to the agents interacting with them. We argue that this constitutes a positive flow of information that needs to be specified, verified, and balanced…

Logic in Computer Science · Computer Science 2025-09-24 Bernd Finkbeiner , Hadar Frenkel , Julian Siber

Maps that are not completely positive (CP) are often useful to describe the dynamics of open systems. An apparent violation of complete positivity can occur because there are prior correlations of the principal system with the environment,…

Quantum Physics · Physics 2008-04-21 Hilary Carteret , Daniel R. Terno , Karol Zyczkowski

Multiparty sessions with asynchronous communications and global types play an important role for the modelling of interaction protocols in distributed systems. In designing such calculi the aim is to enforce, by typing, good properties for…

Logic in Computer Science · Computer Science 2023-06-22 Francesco Dagnino , Paola Giannini , Mariangiola Dezani-Ciancaglini

We sketch a simple language of concurrent objects which explores the design space between type systems and continuous testing. In our language, programs are collections of communicating automata checked automatically for multiparty…

Programming Languages · Computer Science 2016-09-08 Roly Perera , Simon J. Gay

We define a proof system for exceptions which is close to the syntax for exceptions, in the sense that the exceptions do not appear explicitly in the type of any expression. This proof system is sound with respect to the intended…

Logic in Computer Science · Computer Science 2012-03-15 Jean-Guillaume Dumas , Dominique Duval , Laurent Fousse , Jean-Claude Reynaud

Transparency is often deemed critical to enable effective real-world deployment of intelligent systems. Yet the motivations for and benefits of different types of transparency can vary significantly depending on context, and objective…

Computers and Society · Computer Science 2019-08-20 Adrian Weller

The safety of automated driving systems must be justified by convincing arguments and supported by compelling evidence to persuade certification agencies, regulatory entities, and the general public to allow the systems on public roads.…

Software Engineering · Computer Science 2024-10-28 Jonas Krook , Yuvaraj Selvaraj , Wolfgang Ahrendt , Martin Fabian

In recent years, there has been an increased need for the use of active systems - systems required to act automatically based on events, or changes in the environment. Such systems span many areas, from active databases to applications that…

Artificial Intelligence · Computer Science 2012-07-09 Segev Wasserkrug , Avigdor Gal , Opher Etzion

A class of models intended to be as minimal and structureless as possible is introduced. Even in cases with simple rules, rich and complex behavior is found to emerge, and striking correspondences to some important core known features of…

Discrete Mathematics · Computer Science 2020-10-07 Stephen Wolfram

We propose here to look at how abstract a model of a usable system can be, but still say something useful and interesting, so this paper is an exercise in abstraction and formalisation, with usability-of-design as an example target use. We…

Human-Computer Interaction · Computer Science 2024-03-14 Steve Reeves

It is well known that liveness properties cannot be proven using standard simulation arguments. This issue has been mitigated by extending standard notions of simulation for transition systems to fairness-preserving simulations for systems…

Logic in Computer Science · Computer Science 2026-05-27 Arthur Correnson , Iona Kuhn , Bernd Finkbeiner

The standard assumptions that underlie many conceptual and quantitative frameworks do not hold for many complex physical, biological, and social systems. Complex systems science clarifies when and why such assumptions fail and provides…

Physics and Society · Physics 2020-11-11 Alexander F. Siegenfeld , Yaneer Bar-Yam
‹ Prev 1 2 3 10 Next ›