References of "Electronic Notes in Theoretical Computer Science"
     in
Bookmark and Share    
Full Text
Peer Reviewed
See detailSkalpel: A Type Error Slicer for Standard ML
Rahli, Vincent UL; Wells, Joe B.; Pirie, John et al

in Electronic Notes in Theoretical Computer Science (2015)

Detailed reference viewed: 118 (2 UL)
Full Text
Peer Reviewed
See detailAutomated Generation of Platform-Variant Applications from Platform-Independent Models via Templates
Amalio, Nuno UL; Glodt, Christian UL; Pinto, Frederico et al

in Electronic Notes in Theoretical Computer Science (2011), 279(3), 3-25

Model-driven development raises the level of abstraction so that software engineers can focus on design rather than implementation and platform-specific details. This paper presents a model-centric ... [more ▼]

Model-driven development raises the level of abstraction so that software engineers can focus on design rather than implementation and platform-specific details. This paper presents a model-centric approach to MDD, where platform code is generated from a platform-independent model describing platform-variant families of products. The generation is done via templates; the variation point lies in the alternative execution platforms. Our approach is based on EP, a formal executable modelling language, supplemented with OCL, and FTL, a formal language of templates. The paper illustrates the approach by generating applications from the same abstract model that run on both Googleâ Android and Apple iPhone mobile platforms. The paper contribution are: (a) it realises the MDD approach using formal languages, in particular the use of a formal language of templates and (b) it illustrates the approach by generating code for two distinct platforms. [less ▲]

Detailed reference viewed: 77 (1 UL)
Full Text
Peer Reviewed
See detailCoalition Description Logic for Individuals
Seylan, I.; Jamroga, Wojciech UL

in Electronic Notes in Theoretical Computer Science (2010), 262

Detailed reference viewed: 77 (2 UL)
Full Text
Peer Reviewed
See detailSecurity of RFID protocols - A case study
van Deursen, Ton UL; Radomirovic, Sasa UL

in Electronic Notes in Theoretical Computer Science (2009), 244

Detailed reference viewed: 96 (1 UL)
Full Text
Peer Reviewed
See detailSimplified Reducibility Proofs of Church-Rosser for beta- and beta-eta-reduction
Kamareddine, Fairouz; Rahli, Vincent UL

in Electronic Notes in Theoretical Computer Science (2009), 247

Detailed reference viewed: 51 (3 UL)
Full Text
Peer Reviewed
See detailHedaquin: A reputation-based health data quality indicator
van Deursen, Ton UL; Koster, Paul; Petkovic, Milan

in Electronic Notes in Theoretical Computer Science (2008), 1997(2), 159-167

Detailed reference viewed: 77 (1 UL)
Full Text
Peer Reviewed
See detailChosen-name attacks: An overlooked class of type-flaw attacks
Ceelen, Pieter UL; Mauw, Sjouke UL; Radomirovic, Sasa UL

in Electronic Notes in Theoretical Computer Science (2008), 197(2), 31-43

In the context of Dolev-Yao style analysis of security protocols, we consider the capability of an intruder to dynamically choose and assign names to agents. This capability has been overlooked in all ... [more ▼]

In the context of Dolev-Yao style analysis of security protocols, we consider the capability of an intruder to dynamically choose and assign names to agents. This capability has been overlooked in all significant protocol verification frameworks based on formal methods. We identify and classify new type-flaw attacks arising from this capability. Several examples of protocols that are vulnerable to this type of attack are given, including Lowe’s modification of KSL. The consequences for automatic verification tools are discussed. [less ▲]

Detailed reference viewed: 108 (0 UL)
Full Text
Peer Reviewed
See detailData anonymity in the FOO voting scheme
Mauw, Sjouke UL; Verschuren, J. H. S.; Vink, E. P. De

in Electronic Notes in Theoretical Computer Science (2007), 168

Detailed reference viewed: 125 (0 UL)
Full Text
Peer Reviewed
See detailCoordination and Organization: Definitions, Examples and Future Research Directions.
Boella, Guido UL; van der Torre, Leon UL

in Electronic Notes in Theoretical Computer Science (2006), 150(3), 320

Coordination languages and models like Linda and Reo have been developed in computer science to coordinate the interaction among components and objects, and are nowadays used to model and analyze ... [more ▼]

Coordination languages and models like Linda and Reo have been developed in computer science to coordinate the interaction among components and objects, and are nowadays used to model and analyze organizations too. Moreover, organizational concepts are used to enrich the existing coordination languages and models. We describe this research area of “organization and coordination” by presenting definitions, examples, and future research directions. We highlight two issues. First, we argue for a study of value-based rather than information-based coordination languages to model the coordination of autonomous agents and organizations. Second, we argue for a study of the balance between enforced control and trust-based anticipation to deal with security aspects in the coordination of organizations. [less ▲]

Detailed reference viewed: 64 (0 UL)
Peer Reviewed
See detailPreface
Boella, Guido; van der Torre, Leon UL

in Electronic Notes in Theoretical Computer Science (2006), 150(3), 12

Detailed reference viewed: 32 (0 UL)
Full Text
Peer Reviewed
See detailRoles as a Coordination Construct: Introducing powerJava
Baldoni, Matteo; Boella, Guido; van der Torre, Leon UL

in Electronic Notes in Theoretical Computer Science (2006), 150(1), 929

In this paper we apply the role metaphor to coordination. Roles are used in sociology as a way to structure organizations and to coordinate their behavior. In our model, the features of roles are their ... [more ▼]

In this paper we apply the role metaphor to coordination. Roles are used in sociology as a way to structure organizations and to coordinate their behavior. In our model, the features of roles are their dependence on an institution, and the powers they assign to players of roles. The institution represents an environment where the components interact with each other by using the powers attributed to them by the roles they play, even when they do not know each other. The interaction between a component playing a role and the role is performed via interfaces stating the requirements to play a role, and which powers are attributed by roles. Roles encapsulate their players' capabilities to interact with the institution and with the other roles, thus achieving separation of concerns between computation and coordination. The institution acts as a coordinator which manages the interactions among components by acting on the roles they play, thus achieving a form of exogenous coordination. As an example, we introduce the role construct in the Java programming language, providing a precompiler for it. In order to better explain the proposal, we show how to use the role construct as a coordination means by applying it to a dining philosophers problem extended with dynamic reconfiguration. [less ▲]

Detailed reference viewed: 96 (1 UL)