Analyzing realizability by Troelstra's methods
نویسندگان
چکیده
منابع مشابه
Analyzing Conversations: Realizability, Synchronizability, and Verification
Conversations provide an intuitive and simple model for analyzing interactions among composite web services. A conversation is the global sequence of messages exchanged among the peers participating to a composite web service. Interactions in a composite web service can be analyzed by investigating the temporal properties of its conversations. Conversations can be specified in a top-down or bot...
متن کاملAnalyzing Architecture Description Languages for Formal Analysis, Usability, and Realizability
Research on Software Architectures has been active since the early nineties, leading to a number of different architecture description languages (ADL). Given their importance in facilitating the communication of crucial system properties to different stakeholders and their analysis early on in the development of a system this is understandable. After all these years one would have hoped that we...
متن کاملNormalization by realizability also evaluates
For those of us that generally live in the world of syntax, semantic proof techniques such as realizability or logical relations/parametricity sometimes feel like magic. Why do they work? At which point in the proof is “the real work” done? Bernardy and Lasson [4] express realizability and parametricity models as syntactic models – but the abstraction/adequacy theorems are still explained as me...
متن کاملMethods of Analyzing Group Tasks
^ In this report, it Is argued that description and classification of group tasks can best be approached from a theoretical rather than empirical or factor analytic perspective. It Is pointed out that p«evlous attempts at task classification generally focus on one of three aspects of the task and group situation. The literature of group task analysis dealing with each of these aspects is then r...
متن کاملFew guidelines for analyzing methods
All these dimensions are not necessarily simultaneously present. For instance, if we are dealing with a simple problem for which an exact polynomial algorithm is known, the problem instance space is often restricted to the positive integers, corresponding to the instance size. Indeed, in this case, we are mainly interested by the evolution of the computational effort with the problem size growt...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 2002
ISSN: 0168-0072
DOI: 10.1016/s0168-0072(01)00080-x