English
Related papers

Related papers: Infinitary Refinement Types for Temporal Propertie…

200 papers

In this paper, we study infinite dimensional stochastic systems having both unbounded control and observation operators. First of all, using a semigroup approach, we give another take of the well-posedness of such systems treated in [SIAM…

Optimization and Control · Mathematics 2021-05-31 Fatima-Zahra Lahbiri , Said Hadd

By using the degree theory and the $\tau-$topology of Kryszewski and Szulkin, we establish a version of the Fountain Theorem for strongly indefinite functionals. The abstract result will be applied for studying the existence of infinitely…

Analysis of PDEs · Mathematics 2013-06-18 Cyril J. Batkam , Fabrice Colin

An infinite structure has the finite length property (over a given field) if, for each of its finite powers, chains of equivariant subspaces in the corresponding free vector space are bounded in length. Prior work showed that the countable…

Combinatorics · Mathematics 2026-05-22 Jingjie Yang , Mikołaj Bojańczyk , Bartek Klin

We show that for a variety which admits a quasi-finite period map, finiteness (resp.~non-Zariski-density) of $S$-integral points implies finiteness (resp.~non-Zariski-density) of points over all $\mathbb{Z}$-finitely generated integral…

Algebraic Geometry · Mathematics 2021-05-12 Ariyan Javanpeykar , Daniel Litt

Recursive saturation and resplendence are two important notions in models of arithmetic. Kaye, Kossak, and Kotlarski introduced the notion of arithmetic saturation and argued that recursive saturation might not be as rigid as first assumed.…

Logic · Mathematics 2007-05-23 Fredrik Engström

The depth-bounded fragment of the pi-calculus is an expressive class of systems enjoying decidability of some important verification problems. Unfortunately membership of the fragment is undecidable. We propose a novel type system,…

Logic in Computer Science · Computer Science 2015-02-24 Emanuele D'Osualdo , Luke Ong

In this paper we consider the specification and verification of infinite-state systems using temporal logic. In particular, we describe parameterised systems using a new variety of first-order temporal logic that is both powerful enough for…

Logic in Computer Science · Computer Science 2007-05-23 Clare Dixon , Michael Fisher , Boris Konev , Alexei Lisitsa

We present a logically principled foundation for systematizing, in a way that works with any computational effect and evaluation order, SMT constraint generation seen in refinement type systems for functional programming languages. By…

Programming Languages · Computer Science 2023-08-21 Dimitrios J. Economou , Neel Krishnaswami , Jana Dunfield

The infinitary lambda calculi pioneered by Kennaway et al. extend the basic lambda calculus by metric completion to infinite terms and reductions. Depending on the chosen metric, the resulting infinitary calculi exhibit different notions of…

Logic in Computer Science · Computer Science 2018-05-18 Patrick Bahr

In this paper the turnpike property is established for a non-convex optimal control problem in discrete time. The functional is defined by the notion of the ideal convergence and can be considered as an analogue of the terminal functional…

Optimization and Control · Mathematics 2022-11-01 Musa Mammadov , Piotr Szuca

We give several new examples of computable structures of high Scott rank. For earlier known computable structures of Scott rank $\omega_1^{CK}$, the computable infinitary theory is $\aleph_0$-categorical. Millar and Sacks asked whether this…

Logic · Mathematics 2016-06-06 Matthew Harrison-Trainor , Gregory Igusa , Julia F. Knight

Various verification techniques for temporal properties transform temporal verification to safety verification. For infinite-state systems, these transformations are inherently imprecise. That is, for some instances, the temporal property…

Logic in Computer Science · Computer Science 2021-06-03 Oded Padon , Jochen Hoenicke , Kenneth L. McMillan , Andreas Podelski , Mooly Sagiv , Sharon Shoham

This dissertation introduces executable refinement types, which refine structural types by semi-decidable predicates, and establishes their metatheory and accompanying implementation techniques. These results are useful for undecidable type…

Programming Languages · Computer Science 2014-03-14 Kenneth Knowles

A theoretical analysis of the finite element method for a generalized Robin boundary value problem, which involves a second-order differential operator on the boundary, is presented. If $\Omega$ is a general smooth domain with a curved…

Numerical Analysis · Mathematics 2023-10-03 Takahito Kashiwabara

The aim of this paper is to refine and extend proposals by Sozeau and Tabareau and by Voevodsky for universe polymorphism in type theory. In those systems judgments can depend on explicit constraints between universe levels. We here present…

Logic in Computer Science · Computer Science 2024-10-29 Marc Bezem , Thierry Coquand , Peter Dybjer , Martín Escardó

In this contribution we revisit regular model checking, a powerful framework that has been successfully applied for the verification of infinite-state systems, especially parameterized systems (concurrent systems with an arbitrary number of…

Logic in Computer Science · Computer Science 2021-11-23 Anthony W. Lin , Philipp Rümmer

A mass-conservative high-order unfitted finite element method for convection-diffusion equations in evolving domains is proposed. The space-time method presented in [P. Hansbo, M. G. Larson, S. Zahedi, Comput. Methods Appl. Mech. Engrg. 307…

Numerical Analysis · Mathematics 2024-05-01 Sebastian Myrbäck , Sara Zahedi

We show a universal algebraic local characterisation of the expressive power of finite-valued languages with domains of arbitrary cardinality and containing arbitrary many cost functions.

General Topology · Mathematics 2023-03-20 Friedrich Martin Schneider , Caterina Viola

We consider an infinite system of quasilinear first-order partial differential equations, generalized to contain spacial integration, which describes an incompressible fluid mixture of infinite components in a line segment whose motion is…

Analysis of PDEs · Mathematics 2014-09-19 Tetsuya Hattori

It was shown in \cite{sc12} that for a certain class of structures $\I$, $\I$-indexed indiscernible sets have the modeling property just in case the age of $\I$ is a Ramsey class. We expand this known class of structures from ordered…

Logic · Mathematics 2016-02-10 Lynn Scow