Results 11 to 20 of about 230,502 (255)
A Denotational Semantics for SPARC TSO [PDF]
Logical Methods in Computer Science, 2019 The SPARC TSO weak memory model is defined axiomatically, with a non-compositional formulation that makes modular reasoning about programs difficult.
Ryan Kavanagh, Stephen Brookes
doaj +10 more sources
On 0-Complete Partial Metric Spaces and Quantitative Fixed Point Techniques in Denotational Semantics [PDF]
Abstract and Applied Analysis, 2013 In 1994, Matthews introduced the notion of partial metric space with the aim of providing a quantitative mathematical model suitable for program verification.
N. Shahzad, O. Valero
doaj +3 more sources
On the Interpretation of Denotational Semantics
PhilosophiesThe denotational approach to the semantics of programming languages views program meanings as elements of domains, abstract partially ordered structures that form the basis of a mathematical theory of computation.
Felice Cardone
doaj +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.
E. M. Clarke +9 more
core +14 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
openaire +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
+7 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 +3 more sources
On infinite computations in denotational semantics
Theoretical Computer Science, 1983 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
openaire +4 more sources
Denotational cost semantics for functional languages with inductive types [PDF]
ACM SIGPLAN International Conference on Functional Programming, 2015 A central method for analyzing the asymptotic complexity of a functional program is to extract and then solve a recurrence that expresses evaluation cost in terms of input size.
N. Danner +2 more
semanticscholar +5 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
openaire +3 more sources