Results 1 to 10 of about 85,558 (251)
A Denotational Semantics for Communicating Unstructured Code [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 An important property of programming language semantics is that they should be compositional. However, unstructured low-level code contains goto-like commands making it hard to define a semantics that is compositional. In this paper, we follow the ideas
Nils Jähnig +2 more
doaj +7 more sources
A Denotational Semantics for SPARC TSO
Electronic Notes in Theoretical Computer Science, 2018 The SPARC TSO weak memory model is defined axiomatically, with a non-compositional formulation that makes modular reasoning about programs difficult. Our denotational approach uses pomsets to provide a compositional semantics capturing exactly the behaviours permitted by SPARC TSO.
Ryan Kavanagh, Stephen Brookes
core +7 more sources
A denotational semantics for Timed Linda [PDF]
Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming, 2001 In [5] we introduced a Timed Linda language (T-Linda) whic hwas obtained by a natural timed interpretation of the usual constructs of the Linda model and by including a simple primitive for specifying time-outs. Here we define a denotational model for T-Linda which is based on timed reactive sequences.
Frank S. de Boer +2 more
openalex +7 more sources
Denotational Semantics of Hybrid Automata [PDF]
The Journal of Logic and Algebraic Programming, 2006 AbstractWe introduce a denotational semantics for non-linear hybrid automata and relate it to the operational semantics given in terms of hybrid trajectories. The semantics is defined as least fixpoint of an operator on the continuous domain of functions of time that take values in the lattice of compact subsets of n-dimensional Euclidean space.
Abbas Edalat, Dirk Pattinson
openalex +5 more sources
On infinite computations in denotational semantics
Theoretical Computer Science, 1984 AbstractFinite and, especially, infinite computations in languages with iteration or recursion are studied in the framework of denotational semantics, and a theorem is proved which relates their syntactic and semantic characterizations. A general proof method is presented to establish this type of relations, and it is shown how—in an induction on the ...
J. W. de Bakker +2 more
openalex +3 more sources
A denotational semantics for Prolog [PDF]
ACM Transactions on Programming Languages and Systems, 1989 A denotational semantics is presented for the language Pro.og. Metapredicates are not considered. Conventional control sequencing is assumed for Prolog's execution. The semantics is nonstandard, and goal continuations are used to explicate the sequencing.
Tim Nicholson, Norman Foo
openalex +3 more sources
On the equivalence of game and denotational semantics for the probabilistic mu-calculus [PDF]
Logical Methods in Computer Science, 2012 The probabilistic (or quantitative) modal mu-calculus is a fixed-point logic de- signed for expressing properties of probabilistic labeled transition systems (PLTS).
Matteo Mio
doaj +2 more sources
Semantics-based Automated Web Testing [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 We present TAO, a software testing tool performing automated test and oracle generation based on a semantic approach. TAO entangles grammar-based test generation with automated semantics evaluation using a denotational semantics framework.
Hai-Feng Guo, Qing Ouyang, Harvey Siy
doaj +5 more sources
Parametric Denotational Semantics for Extensible Language Definition and Program Analysis [PDF]
arXiv, 2018 We present a novel approach to construction of a formal semantics for a programming language. Our approach, using a parametric denotational semantics, allows the semantics to be easily extended to support new language features, and abstracted to define program analyses. We apply this in analysing a duck-typed, reflective, curried dynamic language.
In-Ho Yi
arxiv +3 more sources
A Denotational Semantics for First-Order Logic [PDF]
, 2000 In Apt and Bezem [AB99] (see cs.LO/9811017) we provided a computational interpretation of first-order formulas over arbitrary interpretations. Here we complement this work by introducing a denotational semantics for first-order logic.
Krzysztof R. Apt
openalex +7 more sources