Publication

An Equational Theory for Transactions

Related publications (38)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Orthologic with Axioms

Viktor Kuncak, Simon Guilloud

We study the proof theory and algorithms for orthologic, a logical system based on ortholattices, which have shown practical relevance in simplification and normalization of verification conditions. Ortholattices weaken Boolean algebras while having po ...

2024

A 1,3,2-Diazaphospholene-Catalyzed Reductive Claisen Rearrangement

Nicolai Cramer, Pavel Alexandrovich Donets, John Henry Reed, Solène Florie Miaskiewicz

1,3,2-Diazaphospholenes (DAPs) are an emerging class of organic hydrides. In this work, we exploited them as efficient catalysts for very mild reductive Claisen rearrangements. The method is tolerant towards a wide variety of functional groups and operates ...

2019

The Operational Semantics and Implementation of a Core Dart language

Zhivka Gucevska

In this report we present the specification of the operational semantics of Dart Kernel and a reference implementation of Dart Kernel in Dart. We design a CESK-like machine to specify the operational semantics of Dart Kernel and we implement an interpreter ...

2017

Type Soundness Proofs with Definitional Interpreters

Tiark Rompf, Nada Amin

While type soundness proofs are taught in every graduate PL class, the gap between realistic languages and what is accessible to formal proofs is large. In the case of Scala, it has been shown that its formal model, the Dependent Object Types (DOT) calculu ...

Assoc Computing Machinery2017

Offer semantics: Achieving compositionality, flattening and full expressiveness for the glue operators in BIP

Simon Bliudze, Eduard Baranov

Based on a concise but comprehensive overview of some fundamental properties required from component-based frameworks, namely compositionality, incrementality, flattening, modularity and expressiveness, we review three modifications of the semantics of glu ...

Elsevier2015

Offer Semantics: Achieving Compositionality, Flattening and Full Expressiveness for the Glue Operators in BIP

Simon Bliudze, Eduard Baranov

2014

An Operational Semantics for Hybrid Systems Involving Behavioral Abstraction

Simon Bliudze

We discuss the challenges of building a simulation framework for hybrid systems, in particular the well-known Zeno effect and correct composition of models idealised by abstracting irrelevant behavioural details (e.g. the bounce dynamics of a bouncing ball ...

Linköping University Electronic Press, Linköpings universitet2014

RSP-QL Semantics: a Unifying Query Model to Explain Heterogeneity of RDF Stream Processing Systems

Jean Paul Calbimonte Perez

RDF and SPARQL are established standards for data interchange and querying on the Web. While they have been shown to be useful and applicable in many scenarios, they are not sufficiently adequate for dealing with streams of data and their intrinsic continu ...

2014

Extended Connectors: Structuring Glue Operators in BIP

Simon Bliudze, Eduard Baranov

Based on a variation of the BIP operational semantics using the offer predicate introduced in our previous work, we extend the algebras used to model glue operators in BIP to encompass priorities. This extension uses the Algebra of Causal Interaction Trees ...

2013

Stochastic fragments: A framework for the exact reduction of the stochastic semantics of rule-based models

Tatjana Petrov

In this paper, we propose an abstract interpretation-based framework for reducing the state space of stochastic semantics for protein protein interaction networks. Our approach consists in quotienting the state space of networks. Yet interestingly, we do n ...

2013