Formal Semantics and Automated Reasoning for Probabilistic Programs Modeling Epistemic and Aleatoric Uncertainty
This work formalizes the syntax and semantics of a probabilistic programming language based on Hehner's predicative probabilistic programming, introducing Iverson brackets to separate relations from arithmetic. It establishes constructive semantics for probabilistic loops using fixed-point theorems, enriches the semantics to handle subdistributions and superdistributions, and mechanizes the theory in Isabelle/UTP for automated reasoning.
Formal Verification of Higher-Dimensional Quantum Protocols Using Communicating Quantum Processes
This paper presents preliminary results in extending the theory of behavioral equivalence in the Communicating Quantum Processes (CQP) formalism to verify higher-dimensional quantum protocols using qudits.
Impact of Local Congruences on Attribute Reduction in Formal Concept Analysis
Local congruences can modify the equivalence classes induced by attribute reduction in formal concept analysis, leading to changes in the reduced concept lattice that need to be carefully analyzed.
Well-Behaved (Co)algebraic Semantics of Regular Expressions Formally Verified in Dafny
The denotational and operational semantics of regular expressions are formally verified to coincide, up to pointwise bisimilarity, using the Dafny programming language and verification system.
Presheaf Automata: A Generalized Formalism for Modeling Concurrent Systems
Presheaf automata provide a unified framework for modeling and analyzing various automata-like formalisms, including higher-dimensional automata, Petri nets, and vector addition systems.
Compactness Lemma for Recursive Functions: A Formal Verification Approach
The compactness lemma states that any recursive function can be simulated by a finite unrolling of the function. This paper presents a new proof technique for formally verifying the compactness lemma using a pattern stepping bisimulation approach.
Effective Formal Verification of Processor Designs Using Tautology-Induced Universal Properties
TIUP effectively uses tautologies as abstract specifications to formally verify processor designs, covering both data and control paths, and simplifying the verification process for engineers.
Transition Algebras: A Logical System for Modeling Concurrent Systems
Transition algebras enhance many-sorted first-order logic with features from dynamic logics, enabling the formal specification and verification of concurrent systems.
문맥 자유 문자열 다이어그램 언어
문맥 자유 언어 이론을 모노이드 범주로 확장하여 문맥 자유 문자열 다이어그램 언어를 정의하고, 이들 언어가 정규 문자열 다이어그램 언어의 단사사상 아래에서 표현될 수 있음을 보여준다.
Efficient Monitoring of Complex Second-Order Hyperproperties in Multi-Agent Systems
This paper presents the first monitoring algorithm for the expressive class of second-order hyperproperties, which can capture complex system properties like common knowledge that cannot be expressed in first-order logics.
© 2024 by Linnk AI