Results 91 to 100 of about 5,812 (235)

Promising Compilation to ARMv8.3

open access: yesТруды Института системного программирования РАН, 2018
Concurrent programs have behaviors, which cannot be explained by interleaving execution of their threads on a single processing unit due to optimizations, which are performed by modern compilers and CPUs.
A. V. Podkopaev, O. Lahav, V. Vafeiadis
doaj   +1 more source

On the Naturalistic Grounds of Grounding

open access: yesRatio, EarlyView.
ABSTRACT This paper examines whether grounding can be naturalized. We adopt a tripartite framework—Ocat (scientific catalogue of existents), Otyp (ontological types), and metaphysics (natures/modal profiles)—and show that classifying as such the relata of putative grounding claims forces a dilemma.
Raoni Arroyo, Jonas R. Becker Arenhart
wiley   +1 more source

Zappa–Szép Skew Braces: A Unified Framework for Mutual Interactions in Noncommutative Algebra

open access: yesMathematics
This paper introduces and systematically develops the theory of Zappa–Szép skew braces, a novel algebraic structure that provides a unified framework for bidirectional group interactions, thereby generalizing the classical constructions of semidirect ...
Suha Wazzan, David A. Oluyori
doaj   +1 more source

On the logic of theory change: iteration of expansion

open access: yesJournal of the Brazilian Computer Society, 2018
Constructing models that allow for iterated changes is one of the most studied problems in the literature on belief change. However, up to now, iteration of expansion was only studied as a special case of consistent revision and, as far we know, there is
Eduardo Fermé, Renata Wassermann
doaj   +1 more source

Sound and Complete Axiomatization of Trace Semantics for Probabilistic Systems

open access: yesElectronic Notes in Theoretical Computer Science, 2011
AbstractWe present a sound and complete axiomatization of finite complete trace semantics for generative probabilistic transition systems. Our approach is coalgebraic, which opens the door to axiomatize other types of systems. In order to prove soundness and completeness, we employ determinization and show that coalgebraic traces can be recovered via ...
A.M. Silva (Alexandra), A. Sokolova
openaire   +2 more sources

Faith Seeking Prompting: Reimagining Theological Education in the Era of Generative AI

open access: yesTeaching Theology &Religion, EarlyView.
ABSTRACT By juxtaposing Gutenberg's invention of movable type with today's generative‐AI “Gutenberg moment,” this article reimagines theological education in the age of AI. It surveys pioneering implementations of AI in theological education, most notably at Acadia Divinity College, and highlights a growing landscape of AI‐driven courses, chatbots, and
Jordan Zhixi Wang
wiley   +1 more source

An Axiomatic Semantics for VDM++: OO Aspects

open access: yes, 1993
This document will be revised to reflect comments from partners. Intermediate translation to VDM replaced by direct generation of proof rules from the abstract syntax. State type is replaced by attributes and methods represented as actions.
Stuart Kent   +3 more
core  

Invariant Elimination of Definite Iterations over Arrays in C Programs Verification

open access: yesМоделирование и анализ информационных систем, 2017
This work represents the further development of the method for definite iteration verification [7]. It extends the mixed axiomatic semantics method [1] suggested for C-light program verification. This extension includes a verification method for definite
Ilya V. Maryasov   +2 more
doaj   +1 more source

The I in logic

open access: yesTheoria, EarlyView.
Abstract This paper argues for the significance of Kaplan's logic LD in two ways: first, by looking at how logic got along before we had LD, and second, by using it to bring out the similarity between David Hume's thesis that one cannot deduce claims about the future on the basis of premises only about the past, and the so‐called "essentiality" of the ...
Gillian Russell
wiley   +1 more source

An Axiomatic Semantics for Functional Reactive Programming

open access: yes, 2008
Functional reactive programming (FRP) is a paradigm extending functional languages with primitives which operate on state. Typical FRP systems contain many dozens of such primitives.
King, Christopher T.
core  

Home - About - Disclaimer - Privacy