Sciweavers

183 search results - page 6 / 37
» Trace Semantics is Fully Abstract
Sort
View
ENTCS
2007
86views more  ENTCS 2007»
14 years 9 months ago
Sequentiality and the CPS Semantics of Fresh Names
We investigate the domain-theoretic denotational semantics of a CPS with fresh name declaration. This is the target of a fully abstract CPS translation from the nu-calculus with ļ...
James Laird
93
Voted
CSMR
2010
IEEE
14 years 4 months ago
A Heuristic-Based Approach to Identify Concepts in Execution Traces
Abstract--Concept or feature identification, i.e., the identification of the source code fragments implementing a particular feature, is a crucial task during software understandin...
Fatemeh Asadi, Massimiliano Di Penta, Giuliano Ant...
FOSSACS
2009
Springer
15 years 4 months ago
Full Abstraction for Reduced ML
traction for Reduced ML Andrzej S. Murawski and Nikos Tzevelekos Oxford University Computing Laboratory Wolfson Building, Parks Road, Oxford OX1 3QD, UK We present the first effe...
Andrzej S. Murawski, Nikos Tzevelekos
WOTUG
2008
14 years 11 months ago
Representation and Implementation of CSP and VCR Traces
Abstract. Communicating Sequential Processes (CSP) was developed around a formal algebra of processes and a semantics based on traces (and failures and divergences). A trace is a r...
Neil C. C. Brown, Marc L. Smith
ENTCS
2008
91views more  ENTCS 2008»
14 years 9 months ago
A Name Abstraction Functor for Named Sets
bstraction Functor for Named Sets Vincenzo Ciancia 1 Ugo Montanari 1 Department of Computer Science University of Pisa lem of dening fully abstract operational models of name pass...
Vincenzo Ciancia, Ugo Montanari