Imagen de Portada

A framework to measure the robustness of programs in the unpredictable environment

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Castiglioni, Valentina, Loreti, Michele, Tini, Simone
Formato:	Preprint
Publicado:	2021
Materias:	Logic in Computer Science
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

A Spatial Logic for Simplicial Models
por: Loreti, Michele, et al.
Publicado: (2021)

Measuring Robustness in Cyber-Physical Systems under Sensor Attacks
por: Xiang, Jian, et al.
Publicado: (2024)

Extended multi-adjoint logic programming
por: Cornejo, M. Eugenia, et al.
Publicado: (2024)

Syntax and semantics of multi-adjoint normal logic programming
por: Cornejo, M. Eugenia, et al.
Publicado: (2024)

Proof complexity of positive branching programs
por: Das, Anupam, et al.
Publicado: (2021)

Proofs as stateful programs: A first-order logic with abstract Hoare triples, and an interpretation into an imperative language
por: Powell, Thomas
Publicado: (2023)

Measuring robustness of dynamical systems. Relating time and space to length and precision
por: Blanc, Manon, et al.
Publicado: (2023)

Set-like operations on propositional logic programs
por: Antić, Christian
Publicado: (2026)

On the specification of modal systems: A comparison of three frameworks
por: Aceto, Luca, et al.
Publicado: (2024)

Rough sets semantics for the three-valued extension of first-order Priest's da Costa logic
por: Castiglioni, José Luis, et al.
Publicado: (2025)

The domino problem is decidable for robust tilesets
por: Aubrun, Nathalie, et al.
Publicado: (2024)

Foundations of logic programming in hybrid-dynamic quantum logic
por: Gaina, Daniel
Publicado: (2024)

A framework for computing upper bounds in passive learning settings
por: Bordais, Benjamin, et al.
Publicado: (2025)

POPACheck: A Model Checker for Probabilistic Pushdown Automata
por: Pontiggia, Francesco, et al.
Publicado: (2025)

A Tree-Shaped Tableau for Checking the Satisfiability of Signal Temporal Logic with Bounded Temporal Operators
por: Melani, Beatrice, et al.
Publicado: (2025)

Bringing memory to Boolean networks: a unifying framework
por: Gadouleau, Maximilien, et al.
Publicado: (2024)

ZFLean: a framework for set-level mathematics in Lean
por: Trélat, Vincent
Publicado: (2026)

Operational semantics and program verification using many-sorted hybrid modal logic
por: Leustean, Ioana, et al.
Publicado: (2019)

Interpolation for Converse PDL
por: Kloibhofer, Johannes, et al.
Publicado: (2025)

Process discovery on deviant traces and other stranger things
por: Chesani, Federico, et al.
Publicado: (2021)

A rewriting-logic-with-SMT-based formal analysis and parameter synthesis framework for parametric time Petri nets
por: Arias, Jaime, et al.
Publicado: (2024)

An implicit function theorem for the stream calculus
por: Boreale, Michele, et al.
Publicado: (2023)

Variable Elimination as Rewriting in a Linear Lambda Calculus
por: Ehrhard, Thomas, et al.
Publicado: (2025)

Bayesian Networks and Proof-Nets: a proof-theoretical account of Bayesian Inference
por: Ehrhard, Thomas, et al.
Publicado: (2024)

Gödel Incompleteness Theorem for PAC Learnable Theory from the view of complexity measurement
por: Ma, Zhifeng, et al.
Publicado: (2024)

A feasible and unitary quantum programming language
por: Díaz-Caro, Alejandro, et al.
Publicado: (2023)

The QBF Gallery 2023
por: Heisinger, Simone, et al.
Publicado: (2026)

A programming language characterizing quantum polynomial time
por: Hainry, Emmanuel, et al.
Publicado: (2022)

A Logic of Inability
por: Wang, Shanxia
Publicado: (2026)

Sequent Calculi for Data-Aware Modal Logics
por: Areces, Carlos, et al.
Publicado: (2025)

A denotationally-based program logic for higher-order store
por: Aagaard, Frederik Lerbjerg, et al.
Publicado: (2023)

A Study on Actions for Atomic Logics
por: Espejo-Boix, Raül
Publicado: (2024)

A modal approach towards substitutions
por: Tu, Yaxin, et al.
Publicado: (2025)

A logic for default deontic reasoning
por: Piazza, Mario, et al.
Publicado: (2025)

A Logic of Secrecy on Simplicial Models
por: Wang, Shanxia
Publicado: (2026)

A Cobham theorem for scalar multiplication
por: Hieronymi, Philipp, et al.
Publicado: (2024)

A Coalgebraic Semantics for Intuitionistic Modal Logic
por: Almeida, Rodrigo Nicolau, et al.
Publicado: (2024)

The Arithmetical Hierarchy: A Realizability-Theoretic Perspective
por: Kihara, Takayuki
Publicado: (2024)

Guarded Successor: A Novel Temporal Logic
por: Asor, Ohad
Publicado: (2024)

A proof-theoretic approach to abstract interpretation
por: D'Silva, Vijay, et al.
Publicado: (2026)