Copertina

An adequacy theorem between mixed powerdomains and probabilistic concurrency (extended version)

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autore principale:	Neves, Renato
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Logic in Computer Science
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

An extended type system with lambda-typed lambda-expressions (extended version)
di: Weber, Matthias
Pubblicazione: (2018)

Repairing General Game Descriptions (extended version)
di: He, Yifan, et al.
Pubblicazione: (2025)

Classical notions of computation and the Hasegawa-Thielecke theorem (extended version)
di: Mangel, Éléonore, et al.
Pubblicazione: (2025)

Benchmarks for Parity Games (extended version)
di: Keiren, Jeroen J. A.
Pubblicazione: (2014)

Correctly Communicating Software: Distributed, Asynchronous, and Beyond (extended version)
di: Heuvel, Bas van den
Pubblicazione: (2024)

Probabilistic Verification for Modular Network-on-Chip Systems (extended version)
di: Waddoups, Nick, et al.
Pubblicazione: (2025)

Sound Statistical Model Checking for Probabilities and Expected Rewards (extended version)
di: Budde, Carlos E., et al.
Pubblicazione: (2024)

Hyper Hoare Logic: (Dis-)Proving Program Hyperproperties (extended version)
di: Dardinier, Thibault, et al.
Pubblicazione: (2023)

Deductive Verification of Weak Memory Programs with View-based Protocols (extended version)
di: Şakar, Ömer, et al.
Pubblicazione: (2026)

Efficient Evidence Generation for Modal $μ$-Calculus Model Checking (extended version)
di: Stramaglia, Anna, et al.
Pubblicazione: (2025)

An Adequacy Theorem Between Mixed Powerdomains and Probabilistic Concurrency
di: Neves, Renato
Pubblicazione: (2025)

Multi-Objective Statistical Model Checking using Lightweight Strategy Sampling (extended version)
di: D'Argenio, Pedro R., et al.
Pubblicazione: (2025)

Validity of contextual formulas (extended version)
di: Esparza, Javier, et al.
Pubblicazione: (2024)

A Computationally Grounded Framework for Cognitive Attitudes (extended version)
di: de Lima, Tiago, et al.
Pubblicazione: (2024)

A categorical account of composition methods in logic (extended version)
di: Jakl, Tomáš, et al.
Pubblicazione: (2024)

Fair Mutual Exclusion for N Processes (extended version)
di: Hafidi, Yousra, et al.
Pubblicazione: (2021)

A quantitative probabilistic relational Hoare logic
di: Avanzini, Martin, et al.
Pubblicazione: (2024)

Incompleteness theorems via Turing category
di: Savelyev, Yasha
Pubblicazione: (2024)

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

The nonexistence of unicorns and many-sorted Löwenheim-Skolem theorems
di: Przybocki, Benjamin, et al.
Pubblicazione: (2024)

An abstract fixed-point theorem for Horn formula equations
di: Hetzl, Stefan, et al.
Pubblicazione: (2025)

An Adequate While-Language for Stochastic Hybrid Computation
di: Neves, Renato, et al.
Pubblicazione: (2025)

Ajtai's theorem for $T^2_2(R)$ and pebble games with backtracking
di: Ken, Eitetsu, et al.
Pubblicazione: (2024)

Logics with probabilistic team semantics and the Boolean negation
di: Hannula, Miika, et al.
Pubblicazione: (2023)

DTMC Model Checking by Path Abstraction Revisited (extended version)
di: Hartmanns, Arnd, et al.
Pubblicazione: (2025)

Non-deterministic, probabilistic, and quantum effects through the lens of event structures (Technical report)
di: Fernandes, Vítor, et al.
Pubblicazione: (2024)

Formal Verification of PLCs as a Service: A CERN-GSI Safety-Critical Case Study (extended version)
di: Lopez-Miguel, Ignacio D., et al.
Pubblicazione: (2025)

Statistical Model Checking Beyond Means: Quantiles, CVaR, and the DKW Inequality (extended version)
di: Budde, Carlos E., et al.
Pubblicazione: (2025)

Modulo quantifiers over functional vocabularies extending addition
di: Baskar, A., et al.
Pubblicazione: (2017)

On Presburger arithmetic extended with non-unary counting quantifiers
di: Habermehl, Peter, et al.
Pubblicazione: (2022)

Consistency of P-time event graphs is decidable in polynomial time (extended version)
di: Zorzenon, Davide, et al.
Pubblicazione: (2023)

Intuitionistic BV (Extended version)
di: Acclavio, Matteo, et al.
Pubblicazione: (2025)

A flexible specification approach for verifying total correctness of fine-grained concurrent modules
di: Fasse, Justus, et al.
Pubblicazione: (2023)

Semantical Analysis of Intuitionistic Modal Logics between CK and IK
di: de Groot, Jim, et al.
Pubblicazione: (2024)

The Complexity of Deciding Characteristic Formulae Modulo Nested Simulation (extended abstract)
di: Aceto, Luca, et al.
Pubblicazione: (2025)

Towards solid abelian groups: A formal proof of Nöbeling's theorem
di: Asgeirsson, Dagur
Pubblicazione: (2023)

Complexity of some modal logics of density (extended version)
di: Balbiani, Philippe, et al.
Pubblicazione: (2025)

The syntactic side of autonomous categories enriched over generalised metric spaces
di: Dahlqvist, Fredrik, et al.
Pubblicazione: (2022)

A concise proof of Commoner's theorem
di: Jancar, Petr
Pubblicazione: (2024)

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