Results 61 to 70 of about 11,766 (228)

A Domain-Specific Language for Incremental and Modular Design of Large-Scale Verifiably-Safe Flow Networks (Preliminary Report) [PDF]

Electronic Proceedings in Theoretical Computer Science, 2011
We define a domain-specific language (DSL) to inductively assemble flow networks from small networks or modules to produce arbitrarily large ones, with interchangeable functionally-equivalent parts.
Azer Bestavros, Assaf Kfoury
doaj   +1 more source

An Adequate While-Language for Hybrid Computation

, 2019
Hybrid computation combines discrete and continuous dynamics in the form of an entangled mixture inherently present both in various natural phenomena, and in applications ranging from control theory to microbiology.
Goncharov, Sergey, Neves, Renato
core   +1 more source

Denotational Semantics and Refinement [PDF]

Electronic Workshops in Computing, 1997
Denotational descriptions are frequently presented in terms of a sequence of descriptions of programming languages of increasing complexity. We discuss a formal approach to the study of such description sequences in terms of a refinement relation, showing how the informal use made of this approach in tutorial introductions to denotational semantics may
Steve Riddle, Peter J. L. Wallis
openaire   +1 more source

A synthesis view of counterfactuals

Philosophy and Phenomenological Research, EarlyView.
Abstract There are two prominent views of counterfactuals in the literature—variably strict conditional accounts developed by Stalnaker 1968 and D. K. Lewis 1973, and strict conditional accounts defended by von Fintel 2001, Gillies 2007, and others. Unfortunately, both views face serious challenges. This paper argues that traditional strict conditional
Sarah Moss
wiley   +1 more source

The I in logic

Theoria, 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

Verification of Control System Runtime Using an Executable Semantic Model

Algorithms
The paper outlines a methodology for validating the accuracy of a control system’s runtime implementation. The runtime takes the form of a virtual machine executing portable code compliant with IEC 61131-3 standards.
Jan Sadolewski, Bartosz Trybus
doaj   +1 more source

QRB-Domains and the Probabilistic Powerdomain [PDF]

Logical Methods in Computer Science, 2012
Is there any Cartesian-closed category of continuous domains that would be closed under Jones and Plotkin's probabilistic powerdomain construction? This is a major open problem in the area of denotational semantics of probabilistic higher-order languages.
Jean Goubault-Larrecq
doaj   +1 more source

Winged horses, rascals and discourse referents

Theoria, EarlyView.
Abstract This paper discusses some remarks Kaplan made in ‘Bob and Carol and Ted and Alice’ concerning empty names. I show how his objections to a particular view involving descriptions derived from Ramsification can be avoided by a nearby alternative framed in terms of discourse reference.
Andreas Stokke
wiley   +1 more source

A proof-theoretic view on scheduling in concurrency [PDF]

Electronic Proceedings in Theoretical Computer Science, 2014
This paper elaborates on a new approach of the question of the proof-theoretic study of concurrent interaction called "proofs as schedules". Observing that proof theory is well suited to the description of confluent systems while concurrency has non ...
Emmanuel Beffara
doaj   +1 more source

Modular Denotational Semantics for Effects with Guarded Interaction Trees [PDF]

, 2023
Dan Frumin, Amin Timany, Lars Birkedal
openalex   +1 more source