Filters








2,451 Hits in 3.9 sec

Full-Abstraction for Must Testing Preorders [chapter]

Giovanni Bernardi, Adrian Francalanza
2017 Lecture Notes in Computer Science  
The client must preorder relates tests (clients) instead of processes (servers).  ...  The existing characterisation of this preorder is unsatisfactory for it relies on the notion of usable clients which, in turn, are defined using an existential quantification over the servers that ensure  ...  Preorders for clients first appeared for compliance testing [2] , and were subsequently investigated in [3, 5] for must testing [11] and extended to include peers.  ... 
doi:10.1007/978-3-319-59746-1_13 fatcat:rugs36qo2nf7bpixvy575ynvl4

Full Abstraction for PCF (extended abstract) [chapter]

Samson Abramsky, Pasquale Malacaria, Radha Jagadeesan
1994 Lecture Notes in Computer Science  
The Full Abstraction Problem for PCF [Plo77, Mil77, BCL85, Cur92b] is one of the longest-standing problems in the semantics of programming languages.  ...  This is the first syntax-independent description of the fully abstract model for PCF.  ...  ) Full Abstraction in Section 4).  ... 
doi:10.1007/3-540-57887-0_87 fatcat:lmhjsi5t4fevrjhhb6gzzp3tba

Real-Reward Testing for Probabilistic Processes (Extended Abstract)

Yuxin Deng, Rob van Glabbeek, Matthew Hennessy, Carroll Morgan
2011 Electronic Proceedings in Theoretical Computer Science  
We show that for convergent processes with finitely many states and transitions, but not in the presence of divergence, the real-reward must-testing preorder coincides with the nonnegative-reward must-testing  ...  We introduce a notion of real-valued reward testing for probabilistic processes by extending the traditional nonnegative-reward testing with negative rewards.  ...  As remarked, in [6] we established that for finitary processes the nonnegative-reward must-testing preorder (⊑ nrmust ) coincides with the probabilistic must-testing preorder (⊑ pmust ), and likewise  ... 
doi:10.4204/eptcs.57.5 fatcat:qtvju32mybasbfhfu5dxsedzp4

Adaptable Processes (Extended Abstract) [chapter]

Mario Bravetti, Cinzia Di Giusto, Jorge A. Pérez, Gianluigi Zavattaro
2011 Lecture Notes in Computer Science  
This allows to express a wide range of evolvability patterns for processes.  ...  Rather than a specification language, our calculus intends to be a basis for investigating the fundamental properties of evolvable processes and for developing richer languages with evolvability capabilities  ...  Process CTRL i abstracts the part of the system which controls scaling policies for group i.  ... 
doi:10.1007/978-3-642-21461-5_6 fatcat:rmuiuyb5vrdlbodnkaztz3x6dm

A Theory of Encodings and Expressiveness (Extended Abstract) [chapter]

Rob van Glabbeek
2018 Lecture Notes in Computer Science  
This paper proposes a definition of what it means for one system description language to encode another one, thereby enabling an ordering of system description languages with respect to expressive power  ...  A comparison of full abstraction with the approach of the present paper appears in [18] .  ...  theory of testing of [9] .  ... 
doi:10.1007/978-3-319-89366-2_10 fatcat:l6qrrsnysrf2hfmyop4bqhtwma

Using Higher-Order Contracts to Model Session Types (Extended Abstract) [chapter]

Giovanni Bernardi, Matthew Hennessy
2014 Lecture Notes in Computer Science  
A crucial step in the proof of full-abstraction is showing that every contract has a non-empty denotation.  ...  In this paper we show that higher-order web-service contracts can be used to provide a fully-abstract model of recursive higher-order session types.  ...  Acknowledgements The authors would like to thank the reviewers, and reviewers of a previous version of this paper, for their insightful comments and questions.  ... 
doi:10.1007/978-3-662-44584-6_27 fatcat:g67oi5thffbebab5auvi2ojmny

A Safety and Liveness Theory for Total Reversibility (Extended Abstract) [article]

Claudio Antares Mezzina, Vasileios Koutavas
2016 arXiv   pre-print
We develop fully abstract models for these preorders in a reversible calculus, which are based only on forward transitions, thus providing a simple proof technique for refinement of such systems.  ...  Similar to previous work on communicating transactions, liveness and safety respectively correspond to the should-testing and inverse may-testing preorders.  ...  The most common ones are may-and must-testing [5] and should-testing [17] preorders. The may-testing preorder is known to correspond to the preservation of safety properties.  ... 
arXiv:1604.05555v2 fatcat:curlubumjfgj7h4za33fq5wweu

The Security Picalculus and Non-interference (Extended Abstract)

Matthew Hennessy
2003 Electronical Notes in Theoretical Computer Science  
We define typed versions of may and must equivalences for the security π-calculus, where the tests are parameterised relative to a security level.  ...  Using these alternative characterisations we prove non-interference results with respect to may and must testing.  ...  However by restricting the type system, to confine read capabilities to a single security level, we show that a similar result holds formust . In this extended abstract all proofs are omitted.  ... 
doi:10.1016/s1571-0661(03)50006-8 fatcat:fvqladfz4rfprkxpwwsbk2mbcm

Linear Compressed Pattern Matching for Polynomial Rewriting (Extended Abstract)

Manfred Schmidt-Schauss
2013 Electronic Proceedings in Theoretical Computer Science  
This paper is an extended abstract of an analysis of term rewriting where the terms in the rewrite rules as well as the term to be rewritten are compressed by a singleton tree grammar (STG).  ...  (ii) under STG-compression and for left-linear rewrite rules a sequence of n rewriting steps can be performed in polynomial time, and (iii) for compressed rewrite rules where the left hand sides are either  ...  In this extended abstract (of [23] ) we report informally on progress in finding algorithms operating on STGs for answering the submatching question, and which only operate on the STGs.  ... 
doi:10.4204/eptcs.110.5 fatcat:3fluqdpemvhbdmufsavq5bycc4

Process Behaviour: Formulae vs. Tests (Extended Abstract)

Andrea Cerone, Matthew Hennessy
2010 Electronic Proceedings in Theoretical Computer Science  
We first characterise subsets of this property logic which can be captured by tests. Then we show that those subsets of the property logic capture precisely the power of tests.  ...  Process behaviour is often defined either in terms of the tests they satisfy, or in terms of the logical properties they enjoy.  ...  Then for every φ ∈ mustHML, there exists a test t must (φ) such that φ must-represents the test t must (φ). Proof.  ... 
doi:10.4204/eptcs.41.3 fatcat:txsrzb2zoree5lbpjiyx4okq3m

Effective models of polymorphism, subtyping and recursion (extended abstract) [chapter]

John Mitchell, Ramesh Viswanathan
1996 Lecture Notes in Computer Science  
This is consistent with trends away from natural numbers in the eld of abstract recursion theory.  ...  Speci cally, the polymorphic xed point is computable by a single algorithm at all types when we construct the model over untyped call-by-value lambda terms, but not when we use G odel numbers for computable  ...  Thus, for any p e r R and x; y: R, w e de ne x R y i 8f: R * 1 1: f x implies f y For x R ; y R 2 R , we de ne x R R y R i x R y; R is easily seen to be a preorder.  ... 
doi:10.1007/3-540-61440-0_126 fatcat:iken7bnudrh4zdbvlgiec4jiwa

A Sorted Semantic Framework for Applied Process Calculi (Extended Abstract) [chapter]

Johannes Borgström, Ramūnas Gutkovas, Joachim Parrow, Björn Victor, Johannes Åman Pohjola
2014 Lecture Notes in Computer Science  
To this end, we extend our previous work on psi-calculi with novel abstract patterns and pattern matching, and add sorts to the data term language, giving sufficient criteria for subject reduction to hold  ...  This definition of support coincides with the usual definition of free names for abstract syntax trees that may contain binders.  ...  We write a#T for a ∈ n(T ), and extend this to finite sets and tuples by conjunction . A function f is equivariant if (a b)(f (T )) = f ((a b)T ) always.  ... 
doi:10.1007/978-3-319-14128-2_7 fatcat:3iz7ilyzz5ch7dsawbd5qtqgae

A Sorted Semantic Framework for Applied Process Calculi (Extended Abstract) [chapter]

Johannes Borgström, Ramūnas Gutkovas, Joachim Parrow, Björn Victor, Johannes Åman Pohjola
2014 Lecture Notes in Computer Science  
To this end, we extend our previous work on psi-calculi with novel abstract patterns and pattern matching, and add sorts to the data term language, giving sufficient criteria for subject reduction to hold  ...  This definition of support coincides with the usual definition of free names for abstract syntax trees that may contain binders.  ...  We write a#T for a ∈ n(T ), and extend this to finite sets and tuples by conjunction . A function f is equivariant if (a b)(f (T )) = f ((a b)T ) always.  ... 
doi:10.1007/978-3-319-05119-2_7 fatcat:fpfn3m6zmbdq5ixi5btoo7lm6a

Basic observables for processes [chapter]

Michele Boreale, Rocco Nicola, Rosario Pugliese
1997 Lecture Notes in Computer Science  
A new form of testing preorder, which we call safe{must, also emerges.  ...  The alternative characterizations we o er shed light on the di erences between these preorders, and on the rôle played in their de nition by tests for divergence.  ...  Vogler for interesting discussions and suggestions and to F. Focardi for a rst debugging of the ideas presented in the paper.  ... 
doi:10.1007/3-540-63165-8_204 fatcat:3hjiwvqspfcyvn7hlb5zzdb3qa

Basic Observables for Processes

Michele Boreale, Rosario Pugliese
1999 Information and Computation  
A new form of testing preorder, which we call safe-must, also emerges.  ...  The alternative characterizations we offer shed light on the differences between these preorders and on the role played in their definition by tests for divergence. ] 1999 Academic Press Article ID inco  ...  Vogler for interesting discussions and suggestions and to F. Focardi for a first debugging of the ideas presented in the paper.  ... 
doi:10.1006/inco.1998.2755 fatcat:jiiruzwjzfdcxjdh3bennjgqiy
« Previous Showing results 1 — 15 out of 2,451 results