Results 1 to 10 of about 11,389 (185)
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
Quantum Alternation: Prospects and Problems [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 We propose a notion of quantum control in a quantum programming language which permits the superposition of finitely many quantum operations without performing a measurement.
Costin Bădescu, Prakash Panangaden
doaj +4 more sources
A Model of Cooperative Threads [PDF]
Logical Methods in Computer Science, 2010 We develop a model of concurrent imperative programming with threads. We focus on a small imperative language with cooperative threads which execute without interruption until they terminate or explicitly yield control.
Martín Abadi, Gordon D. Plotkin
doaj +12 more sources
Denotational Semantics of the Simplified Lambda-Mu Calculus and a New Deduction System of Classical Type Theory [PDF]
Electronic Proceedings in Theoretical Computer Science, 2016 Classical (or Boolean) type theory is the type theory that allows the type inference (σ \to \bot) \to \bot => σ (the type counterpart of double-negation elimination), where σ is any type and \bot is absurdity type.
Ken Akiba
doaj +4 more sources
Probabilistic modal {\mu}-calculus with independent product [PDF]
Logical Methods in Computer Science, 2012 The probabilistic modal {\mu}-calculus is a fixed-point logic designed for expressing properties of probabilistic labeled transition systems (PLTS's). Two equivalent semantics have been studied for this logic, both assigning to each state a value in the ...
Matteo Mio
doaj +4 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.
Ryan Kavanagh
exaly +3 more sources
Smart Choices and the Selection Monad [PDF]
Logical Methods in Computer Science, 2023 Describing systems in terms of choices and their resulting costs and rewards offers the promise of freeing algorithm designers and programmers from specifying how those choices should be made; in implementations, the choices can be realized by ...
Martin Abadi, Gordon Plotkin
doaj +1 more source
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 +1 more source
Denotational Semantics of A User-Oriented, Domain-Specific Language [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 This paper presents the formal definition of a domain-specific language, named Pantagruel, following the methodology proposed by David Schmidt for language development.
Julien Mercadal +2 more
doaj +1 more source
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 +1 more source