Results 91 to 100 of about 11,408 (204)
Disentangling Parallelism and Interference in Game Semantics [PDF]
Logical Methods in Computer ScienceGame semantics is a denotational semantics presenting compositionally the computational behaviour of various kinds of effectful programs. One of its celebrated achievement is to have obtained full abstraction results for programming languages with a ...
Simon Castellan, Pierre Clairambault
doaj +1 more source
An algebraic basis for specifying and enforcing access control in security systems [PDF]
, 2000 Security services in a multi-user environment are often based on access control mechanisms. Static aspects of an access control policy can be formalised using abstract algebraic models.
Pahl, Claus
core
Enriched Lawvere Theories for Operational Semantics
, 2019 Enriched Lawvere theories are a generalization of Lawvere theories that allow us to describe the operational semantics of formal systems. For example, a graph enriched Lawvere theory describes structures that have a graph of operations of each arity ...
Baez, John C., Williams, Christian
core +1 more source
Theoretical Computer Science, 1984 In this paper we propose a new denotational semantics for CSP. The domains used in the semantics are very simple, compared to those used in other approaches to the semantics of CSP. Moreover, our denotations are more abstract than those of the other approaches.
openaire +1 more source
Operational and denotational semantics of prolog
The Journal of Logic Programming, 1987 A Vienna Definition Language operational semantics of PROLOG, which includes the cut, the database, and the extra-logical operations, is presented. This semantics serves as the basis for deriving a denotational-continuation-style semantics of PROLOG through a systematic transformation of the operational semantics by a method described by Berry.
Arbab, Bijan, Berry, Daniel M.
openaire +1 more source
Distributed measurement-based quantum computation
, 2005 We develop a formal model for distributed measurement-based quantum computations, adopting an agent-based view, such that computations are described locally where possible. Because the network quantum state is in general entangled, we need to model it as
D'Hondt, Ellie +3 more
core +1 more source
Realisability Semantics for Intersection Types and Expansion Variables [PDF]
, 2008 Expansion was invented at the end of the 1970s for calculating principal typings for $\lambda$-terms in type systems with intersection types. Expansion variables (E-variables) were invented at the end of the 1990s to simplify and help mechanise expansion.
Kamareddine, Fairouz +3 more
core +2 more sources
, 2014 The Clock Constraint Specification Language (CCSL) has been informally introduced in the specifications of the \uml Profile for Modeling and Analysis of Real-Time and Embedded systems (MARTE). In a previous report entitled ``Syntax and Semantics of the Clock Constraint Specification Language'', we equipped a kernel of CCSL with an operational semantics.
Deantoni, Julien +2 more
openaire +1 more source
Denotational and operational semantics for prolog
The Journal of Logic Programming, 1988 The semantics of PROLOG programs is usually given in terms of the model theory of first-order logic. However, this does not adequately characterize the computational behavior of PROLOG programs. PROLOG implementations typically use a sequential evaluation strategy based on the textual order of clauses and literals in a program, as well as nonlogical ...
Debray, Saumya K., Mishra, Prateek
openaire +1 more source