FORTE
2011
13 years 5 months ago
2011
We present a new, streamlined language of global types equipped with a trace-based semantics and whose features and restrictions are semantically justified. The multi-party sessio...
DLOG
2011
13 years 5 months ago
2011
Evolution of Knowledge Bases expressed in Description Logics (DLs) proved its importance. Most studies on evolution in DLs have focused on modelbased approaches to evolution semant...
CORR
2011
Springer
13 years 5 months ago
2011
Springer
Contemporary use of the term ’intension’ derives from the traditional logical Frege-Russell’s doctrine that an idea (logic formula) has both an extension and an intension. Al...
ENTCS
2011
13 years 8 months ago
2011
This paper presents a game semantics for a simply-typed λ-calculus with qbits constants and associated quantum operations. The resulting language is expressive enough to encode a...
CORR
2011
Springer
13 years 8 months ago
2011
Springer
Privacy policies often place requirements on the purposes for which a governed entity may use personal information. For example, regulations, such as HIPAA, require that hospital ...
JUCS
2010
13 years 8 months ago
2010
: We develop and study the concept of dataflow process networks as used for example by Kahn to suit exact computation over data types related to real numbers, such as continuous fu...
JLP
2010
13 years 8 months ago
2010
The aim of the paper is to give a formal compositional semantics for Spiking Neural P systems (SNP systems) by following the Structural Operational Semantics (SOS) approach. A pro...
IFIP
2010
Springer
13 years 8 months ago
2010
Springer
Modern embedded systems are often heterogeneous in that their design requires several description paradigms, based on different models of computation and concurrency (MoCCs). In th...
IFIP
2010
Springer
13 years 8 months ago
2010
Springer
We propose a timed broadcasting calculus for wireless systems. The operational semantics of our calculus is given both in terms of a Reduction Semantics and in terms of a Labelled ...
TCS
2011
13 years 8 months ago
2011
We give a semantic account of the execution time (i.e. the number of cut elimination steps leading to the normal form) of an untyped MELL net. We first prove that: 1) a net is he...