English
Related papers

Related papers: Union and intersection contracts are hard, actuall…

200 papers

Autonomous systems typically leverage layered control architectures with a combination of discrete and continuous models operating at different timescales. As a result, layered systems form a new class of hybrid systems composed of systems…

Systems and Control · Electrical Eng. & Systems 2024-09-24 Manuel Mazo , Will Compton , Max H. Cohen , Aaron D. Ames

Bidirectional typing combines two modes of typing: type checking, which checks that a program satisfies a known type, and type synthesis, which determines a type from the program. Using checking enables bidirectional typing to support…

Programming Languages · Computer Science 2022-03-21 Jana Dunfield , Neel Krishnaswami

Implementing smart contracts to automate the performance of high-value over-the-counter (OTC) financial derivatives is a formidable challenge. Due to the regulatory framework and the scale of financial risk if a contract were to go wrong,…

Software Engineering · Computer Science 2018-05-31 Christopher D. Clack , Gabriel Vanca

Distributed systems have become increasingly prevalent in the software industry. Due to their intrinsic complexity, much research has focused on the verification of their behaviour. An active research line is around behaviour models that…

Programming Languages · Computer Science 2026-04-09 Francisco Parrinha , João Mota , António Ravara

The flow of contracting systems contracts 1-dimensional polygons (i.e. lines) at an exponential rate. One reason for the usefulness of contracting systems is that many interconnections of contracting sub-systems yield an overall contracting…

Dynamical Systems · Mathematics 2022-10-20 Ron Ofir , Michael Margaliot , Yoash Levron , Jean-Jacques Slotine

We consider a hypergraph (I,C), with possible multiple (hyper)edges and loops, in which the vertices $i\in I$ are interpreted as agents, and the edges $c\in C$ as contracts that can be concluded between agents. The preferences of each agent…

Combinatorics · Mathematics 2023-05-16 Vladimir I. Danilov , Alexander V. Karzanov

Many problems, especially those with a composite structure, can naturally be expressed in higher order logic. From a KR perspective modeling these problems in an intuitive way is a challenging task. In this paper we study the graph mining…

Logic in Computer Science · Computer Science 2016-09-01 Matthias van der Hallen , Sergey Paramonov , Michael Leuschel , Gerda Janssens

When scripts in untyped languages grow into large programs, maintaining them becomes difficult. A lack of explicit type annotations in typical scripting languages forces programmers to must (re)discover critical pieces of design information…

Programming Languages · Computer Science 2011-06-15 Sam Tobin-Hochstadt , Matthias Felleisen

Coupled oscillator networks often display transitions between qualitatively different phase-locked solutions -- such as synchrony and rotating wave solutions -- following perturbation or parameter variation. In the limit of weak coupling,…

Dynamical Systems · Mathematics 2025-10-10 Jorge L. Ocampo-Espindola , István Z. Kiss , Christian Bick , Kyle C. A. Wedgwood

Web Services provide interoperable mechanisms for describing, locating and invoking services over the Internet; composition further enables to build complex services out of simpler ones for complex B2B applications. While current studies on…

Software Engineering · Computer Science 2013-11-12 Manuel Mazzara , Michele Ciavotta

Robustness of two coupled networks system has been studied only for dependency coupling (S. Buldyrev et. al., Nature, 2010) and only for connectivity coupling (E. A. Leicht and R. M. D'Souza, arxiv:09070894). Here we study, using a…

Physics and Society · Physics 2015-05-28 Yanqing Hu , Baruch Ksherim , Reuven Cohen , Shlomo Havlin

In this paper we study the state complexity of catenation combined with symmetric difference. First, an upper bound is computed using some combinatoric tools. Then, this bound is shown to be tight by giving a witness for it. Moreover, we…

Formal Languages and Automata Theory · Computer Science 2015-05-14 Pascal Caron , Jean-Gabriel Luque , Ludovic Mignot , Bruno Patrou

The complexity of the list homomorphism problem for signed graphs appears difficult to classify. Existing results focus on special classes of signed graphs, such as trees and reflexive signed graphs. Irreflexive signed graphs are in a…

Discrete Mathematics · Computer Science 2024-04-22 Jan Bok , Richard Brewster , Tomás Feder , Pavol Hell , Nikola Jedličková

We show that the predictability of letters in written English texts depends strongly on their position in the word. The first letters are usually the least easy to predict. This agrees with the intuitive notion that words are well defined…

Physics and Society · Physics 2017-04-24 Thomas Schürmann , Peter Grassberger

We present a new approach to automated reasoning about higher-order programs by extending symbolic execution to use behavioral contracts as symbolic values, enabling symbolic approximation of higher-order behavior. Our approach is based on…

Programming Languages · Computer Science 2012-04-27 Sam Tobin-Hochstadt , David Van Horn

Linear and substructural types are powerful tools, but adding them to standard functional programming languages often means introducing extra annotations and typing machinery. We propose a lightweight substructural type system design that…

Programming Languages · Computer Science 2015-02-18 Edward Gan , Jesse A. Tov , Greg Morrisett

There has recently been an explosion of interest in how "higher-order" structures emerge in complex systems. This "emergent" organization has been found in a variety of natural and artificial systems, although at present the field lacks a…

Information Theory · Computer Science 2024-01-30 Thomas F. Varley , Joshua Bongard

The asynchronous systems $f$ are the models of the asynchronous circuits from digital electrical engineering. They are multi-valued functions that associate to each input $u:\mathbf{R}\to \{0,1\}^{m}$ a set of states $x\in f(u),$ where…

General Literature · Computer Science 2007-05-23 Serban E. Vlad

Nowadays, smart contracts have become increasingly popular and, as with software development in general, testing is the standard method for verifying their correctness. However, smart contracts require a higher level of certainty regarding…

Software Engineering · Computer Science 2023-07-06 Alexandre Mota , Fei Yang , Cristiano Teixeira

Typestate systems are notoriously complex as they require sophisticated machinery for tracking aliasing. We propose a new, transition-oriented foundation for typestate in the setting of impure functional programming. Our approach relies on…

Programming Languages · Computer Science 2024-09-27 Hannes Saffrich , Yuki Nishida , Peter Thiemann
‹ Prev 1 8 9 10 Next ›