A new genus and new species of fan worms (Polychaeta: Sabellidae) from Atlantic and Pacific Oceans-the formal treatment of taxon names as explanatory hypotheses

Members of Parasabella minuta Treadwell, 1941, subsequently moved to Perkinsiana, were collected during a survey of rocky intertidal polychaetes along the state of Sao Paulo, Brazil. Additional specimens, which are referred to two new species, were also found in similar habitats from the Bocas del Toro Archipelago, Caribbean Panama, and Oahu Island, Hawaii. A phylogenetic analysis of Sabellinae, including members of P. minuta and the two new species, provided justification for establishing a new generic hypothesis, Sabellomma gen. nov., for these individuals. Formal definitions are also provided for Sabellomma minuta gen. nov., comb. nov., S. collinae gen. nov., spec. nov., and S. harrisae gen. nov., spec. nov., along with descriptions of individuals to which these hypotheses apply. The generic name Aracia nom. nov., is provided to replace Kirkia Nogueira, Lopez and Rossi, 2004, pre-occupied by a mollusk.

Formal validation of automated policy refinement in the management of network security systems

Policy hierarchies and automated policy refinement are powerful approaches to simplify administration of security services in complex network environments. A crucial issue for the practical use of these approaches is to ensure the validity of the policy hierarchy, i.e. since the policy sets for the lower levels are automatically derived from the abstract policies (defined by the modeller), we must be sure that the derived policies uphold the high-level ones. This paper builds upon previous work on Model-based Management, particularly on the Diagram of Abstract Subsystems approach, and goes further to propose a formal validation approach for the policy hierarchies yielded by the automated policy refinement process. We establish general validation conditions for a multi-layered policy model, i.e. necessary and sufficient conditions that a policy hierarchy must satisfy so that the lower-level policy sets are valid refinements of the higher-level policies according to the criteria of consistency and completeness. Relying upon the validation conditions and upon axioms about the model representativeness, two theorems are proved to ensure compliance between the resulting system behaviour and the abstract policies that are modelled.

A transformational language for mutant description

Mutation testing has been used to assess the quality of test case suites by analyzing the ability in distinguishing the artifact under testing from a set of alternative artifacts, the so-called mutants. The mutants are generated from the artifact under testing by applying a set of mutant operators, which produce artifacts with simple syntactical differences. The mutant operators are usually based on typical errors that occur during the software development and can be related to a fault model. In this paper, we propose a language-named MuDeL (MUtant DEfinition Language)-for the definition of mutant operators, aiming not only at automating the mutant generation, but also at providing precision and formality to the operator definition. The proposed language is based on concepts from transformational and logical programming paradigms, as well as from context-free grammar theory. Denotational semantics formal framework is employed to define the semantics of the MuDeL language. We also describe a system-named mudelgen-developed to support the use of this language. An executable representation of the denotational semantics of the language is used to check the correctness of the implementation of mudelgen. At the very end, a mutant generator module is produced, which can be incorporated into a specific mutant tool/environment. (C) 2008 Elsevier Ltd. All rights reserved.