We are improving our search experience. To check which content you have full access to, or for advanced search, go back to the old search.

Search

Please fill in this field.
Filters applied:
Computer science

Search Results

Showing 1-20 of 4,225 results

  1. A Denotational Approach to Release/Acquire Concurrency

    We present a compositional denotational semantics for a functional language with first-class parallel composition and shared-memory operations whose...
    Yotam Dvir, Ohad Kammar, Ori Lahav in Programming Languages and Systems
    Conference paper Open access 2024

  2. Denotational Semantics for Symbolic Execution

    Symbolic execution is a technique to systematically explore all possible paths through a program. This technique can be formally explained by means...
    Erik Voogd, Åsmund Aqissiaq Arild Kløvstad, Einar Broch Johnsen in Theoretical Aspects of Computing – ICTAC 2023
    Conference paper 2023

  3. Denotational semantics of channel mobility in UTP-CSP

    In this paper, we present the denotational semantics for channel mobility in the Unifying Theories of Programming (UTP) semantics framework. The...

    Gerard Ekembe Ngondi in Formal Aspects of Computing
    Article Open access 27 May 2021

  4. Equivalence of Denotational and Operational Semantics for Interaction Languages

    Message Sequence Charts (MSC) and Sequence Diagrams (SD) are graphical models representing the behaviours of distributed and concurrent systems via...
    Erwan Mahe, Christophe Gaston, Pascale Le Gall in Theoretical Aspects of Software Engineering
    Conference paper 2022

  5. Semantic mutation operator for a fast and efficient design of bent Boolean functions

    Boolean functions are important cryptographic primitives with extensive use in symmetric cryptography. These functions need to possess various...

    Jakub Husa, Lukáš Sekanina in Genetic Programming and Evolvable Machines
    Article 08 December 2023

  6. Spiking neural P systems and their semantics in Haskell

    We use the functional programming language Haskell to design semantic interpreters for the spiking neural P systems. Haskell provides an appropriate...

    Gabriel Ciobanu, Eneia Nicolae Todoran in Natural Computing
    Article 10 August 2022

  7. Denotational and Algebraic Semantics for the CaIT Calculus

    The Internet of Things (IoT) has been wildly used in various fields of our lives, such as health care, smart environment, transportation, etc....
    Ningning Chen, Huibiao Zhu in Theoretical Aspects of Computing – ICTAC 2022
    Conference paper 2022

  8. Theoretical and Practical Approaches to the Denotational Semantics for MDESL based on UTP

    The hardware description language Verilog has been standardized and widely used in industry. Multithreaded Discrete Event Simulation Language (MDESL)...

    Feng Sheng, Huibiao Zhu, ... Jonathan P. Bowen in Formal Aspects of Computing
    Article 15 June 2020

  9. Interlingual Semantic Validation

    The validation of machine translation systems has depended on metrics that compare both form and content of the translated text, where direct human...
    Carolina Gallardo, Jesús Cardeñosa, Samantha Baragaño in Flexible Query Answering Systems
    Conference paper 2023

  10. A process calculus BigrTiMo of mobile systems and its formal semantics

    In this paper, we present a process calculus called BigrTiMo that combines the rTiMo calculus and the Bigraph model. BigrTiMo calculus is capable of...

    Wanling **e, Huibiao Zhu, Qiwen Xu in Formal Aspects of Computing
    Article 06 March 2021

  11. A Denotational Semantics of Solidity in Isabelle/HOL

    Smart contracts are programs, usually automating legal agreements such as financial transactions. Thus, bugs in smart contracts can lead to large...
    Diego Marmsoler, Achim D. Brucker in Software Engineering and Formal Methods
    Conference paper 2021

  12. Category Theory in Isabelle/HOL as a Basis for Meta-logical Investigation

    This paper presents meta-logical investigations based on category theory using the proof assistant Isabelle/HOL. We demonstrate the potential of a...
    Jonas Bayer, Alexey Gonus, ... Dana S. Scott in Intelligent Computer Mathematics
    Conference paper 2023

  13. An Experiment with Denotational Semantics

    The paper is devoted to showing how to systematically design a programming language in “reverse order”, i.e., from denotations to syntax. This...

    Andrzej Blikle in SN Computer Science
    Article Open access 14 August 2019

  14. Experimenting with an Intrinsically-Typed Probabilistic Programming Language in Coq

    Although the formalization of probabilistic programs already has several applications in the fields of security proofs and artificial intelligence,...
    Ayumu Saito, Reynald Affeldt in Programming Languages and Systems
    Conference paper 2023

  15. Language Theory and Semantics

    This chapter discusses language theory and includes a discussion on the syntax of languages including grammars, parse trees, and derivations from...
    Gerard O’Regan in Mathematical Foundations of Software Engineering
    Chapter 2023

  16. Programming with Union, Intersection, and Negation Types

    In this essay I present the advantages and, I dare say, the beauty of programming in a language with set-theoretic types, that is, types that include...
    Giuseppe Castagna in The French School of Programming
    Chapter 2024

  17. Formal Analysis by Abstract Interpretation Case Studies in Modern Protocols

    The book provides a gentle introduction and definition of the denotational-based abstract interpretation method. The book demonstrates how the above...

    Benjamin Aziz in SpringerBriefs in Applied Sciences and Technology
    Book 2022

  18. Formalized High Level Synthesis with Applications to Cryptographic Hardware

    Verification of hardware-based cryptographic accelerators connects a low-level RTL implementation to the abstract algorithm itself; generally, the...
    William Harrison, Ian Blumenfeld, ... Jared Ziegler in NASA Formal Methods
    Conference paper 2023

  19. Declarative Pearl: Rigged Contracts

    Over 20 years ago, Peyton Jones et al. embarked on an adventure in financial engineering with their functional pearl on “Composing Contracts”. They...
    Alexander Vandenbroucke, Tom Schrijvers in Functional and Logic Programming
    Conference paper 2024

  20. Trace Semantics and Algebraic Laws for Total Store Order Memory Model

    Modern multiprocessors deploy a variety of weak memory models (WMMs). Total Store Order (TSO) is a widely-used weak memory model in SPARC...

    Li-Li **ao, Hui-Biao Zhu, Qi-Wen Xu in Journal of Computer Science and Technology
    Article 30 November 2021
Did you find what you were looking for? Share feedback.