scholarly journals Better late than never: a fully-abstract semantics for classical processes

2019 ◽  
Vol 3 (POPL) ◽  
pp. 1-29 ◽  
Author(s):  
Wen Kokke ◽  
Fabrizio Montesi ◽  
Marco Peressotti
Keyword(s):  
Abstract Semantics

scholarly journals A fully abstract semantics for a first-order functional language with logic variables

1991 ◽  
Vol 13 (4) ◽  
pp. 577-625 ◽  
Author(s):  
Radha Jagadeesan ◽  
Keshav Pingali ◽  
Prakash Panangaden
Keyword(s):  
Functional Language ◽  
First Order ◽  
Abstract Semantics

ABSTRACT SEMANTICS FOR ESM SYSTEMS

1996 ◽  
Vol 26 (3,4) ◽  
pp. 315-339 ◽  
Author(s):  
D. Janssens ◽  
T. Mens
Keyword(s):  
Abstract Semantics

scholarly journals Refractory access disorders and the organization of concrete and abstract semantics: Do they differ?

Neurocase ◽  
2008 ◽  
Vol 14 (2) ◽  
pp. 131-140 ◽  
Author(s):  
A. Cris Hamilton ◽  
H. Branch Coslett
Keyword(s):  
Abstract Semantics

scholarly journals A fully abstract semantics for value-passing CCS for trees

2019 ◽  
Vol 13 (4) ◽  
pp. 828-849
Author(s):  
Ying Jiang ◽  
Shichao Liu ◽  
Thomas Ehrhard
Keyword(s):  
Abstract Semantics

scholarly journals Abstract interpretation of temporal concurrent constraint programs

2014 ◽  
Vol 15 (3) ◽  
pp. 312-357 ◽  
Author(s):  
MORENO FALASCHI ◽  
CARLOS OLARTE ◽  
CATUSCIA PALAMIDESSI
Keyword(s):  
Abstract Interpretation ◽  
Data Flow ◽  
Reactive Systems ◽  
Security Protocols ◽  
Denotational Semantics ◽  
Security Protocol ◽  
Mobile Systems ◽  
Abstract Domains ◽  
Concurrent Constraint Programming ◽  
Abstract Semantics

AbstractTimed Concurrent Constraint Programming (tcc) is a declarative model for concurrency offering a logic for specifying reactive systems, i.e., systems that continuously interact with the environment. The universaltccformalism (utcc) is an extension oftccwith the ability to express mobility. Here mobility is understood as communication of private names as typically done for mobile systems and security protocols. In this paper we consider the denotational semantics fortcc, and extend it to a “collecting” semantics forutccbased on closure operators over sequences of constraints. Relying on this semantics, we formalize a general framework for data flow analyses oftccandutccprograms by abstract interpretation techniques. The concrete and abstract semantics that we propose are compositional, thus allowing us to reduce the complexity of data flow analyses. We show that our method is sound and parametric with respect to the abstract domain. Thus, different analyses can be performed by instantiating the framework. We illustrate how it is possible to reuse abstract domains previously defined for logic programming to perform, for instance, a groundness analysis fortccprograms. We show the applicability of this analysis in the context of reactive systems. Furthermore, we also make use of the abstract semantics to exhibit a secrecy flaw in a security protocol. We also show how it is possible to make an analysis which may show thattccprograms are suspension-free. This can be useful for several purposes, such as for optimizing compilation or for debugging.

scholarly journals Operational and abstract semantics of the query language G-Log

2002 ◽  
Vol 275 (1-2) ◽  
pp. 521-560 ◽  
Author(s):  
Agostino Cortesi ◽  
Agostino Dovier ◽  
Elisa Quintarelli ◽  
Letizia Tanca
Keyword(s):  
Query Language ◽  
Abstract Semantics
Sign in / Sign up

Export Citation Format

Share Document