Safe Compositional Specification of Network Systems With Polymorphic, Constrained Types

In the framework of iBench research project, our previous work created a domain specific language TRAFFIC [6] that facilitates specification, programming, and maintenance of distributed applications over a network. It allows safety property to be formalized in terms of types and subtyping relations. Extending upon our previous work, we add Hindley-Milner style polymorphism [8] with constraints [9] to the type system of TRAFFIC. This allows a programmer to use for-all quantifier to describe types of network components, escalating power and expressiveness of types to a new level that was not possible before with propositional subtyping relations. Furthermore, we design our type system with a pluggable constraint system, so it can adapt to different application needs while maintaining soundness. In this paper, we show the soundness of the type system, which is not syntax-directed but is easier to do typing derivation. We show that there is an equivalent syntax-directed type system, which is what a type checker program would implement to verify the safety of a network flow. This is followed by discussion on several constraint systems: polymorphism with subtyping constraints, Linear Programming, and Constraint Handling Rules (CHR) [3]. Finally, we provide some examples to illustrate workings of these constraint systems.

A systematic approach to institutional analysis: Applying Crawford and Ostrom's grammar

In 1995, Crawford and Ostrom proposed a grammatical syntax for examining institutional statements (i.e., rules, norms, and strategies) as part of the institutional analysis and development framework. This article constitutes the first attempt at applying the grammatical syntax to code institutional statements using two pieces of U.S. legislation. The authors illustrate how the grammatical syntax can serve as a basis for collecting, presenting, and analyzing data in a way that is reliable and conveys valid and substantive meaning for the researcher. The article concludes by describing some implementation challenges and ideas for future theoretical and field research. © 2010 University of Utah.

Phenex: ontological annotation of phenotypic diversity.

BACKGROUND: Phenotypic differences among species have long been systematically itemized and described by biologists in the process of investigating phylogenetic relationships and trait evolution. Traditionally, these descriptions have been expressed in natural language within the context of individual journal publications or monographs. As such, this rich store of phenotype data has been largely unavailable for statistical and computational comparisons across studies or integration with other biological knowledge. METHODOLOGY/PRINCIPAL FINDINGS: Here we describe Phenex, a platform-independent desktop application designed to facilitate efficient and consistent annotation of phenotypic similarities and differences using Entity-Quality syntax, drawing on terms from community ontologies for anatomical entities, phenotypic qualities, and taxonomic names. Phenex can be configured to load only those ontologies pertinent to a taxonomic group of interest. The graphical user interface was optimized for evolutionary biologists accustomed to working with lists of taxa, characters, character states, and character-by-taxon matrices. CONCLUSIONS/SIGNIFICANCE: Annotation of phenotypic data using ontologies and globally unique taxonomic identifiers will allow biologists to integrate phenotypic data from different organisms and studies, leveraging decades of work in systematics and comparative morphology.

A reified temporal logic

This paper presents a reified temporal logic for representing and reasoning about temporal and non-temporal relationships between non-temporal assertions. A clear syntax and semantics for the logic is formally provided. Three types of predicates, temporal predicates, non-temporal predicates and meta-predicates, are introduced. Terms of the proposed language are partitioned into three types, temporal terms, non-temporal terms and propositional terms. Reified propositions consist of formulae with each predicate being either a temporal predicate or a meta-predicate. Meta-predicates may take both temporal terms and propositional terms together as arguments or take propositional terms alone. A standard formula of the classical first-order language with each predicate being a non-temporal predicate taking only non-temporal terms as arguments is reified as just a propositional term. A general time ontology has been provided which can be specialized to a variety of existing temporal systems. The new logic allows one to predicate and quantify over propositional terms while according a special status of time; for example, assertions such as ‘effects cannot precede their causes’ is ensured in the logic, and some problematic temporal aspects including the delay time between events and their effects can be conveniently expressed. Applications of the logic are presented including the characterization of the negation of properties and their contextual sentences, and the expression of temporal relations between actions and effects.

A policy-definition language and prototype implementation library for policy-based autonomic systems

This paper presents work towards generic policy toolkit support for autonomic computing systems in which the policies themselves can be adapted dynamically and automatically. The work is motivated by three needs: the need for longer-term policy-based adaptation where the policy itself is dynamically adapted to continually maintain or improve its effectiveness despite changing environmental conditions; the need to enable non autonomics-expert practitioners to embed self-managing behaviours with low cost and risk; and the need for adaptive policy mechanisms that are easy to deploy into legacy code. A policy definition language is presented; designed to permit powerful expression of self-managing behaviours. The language is very flexible through the use of simple yet expressive syntax and semantics, and facilitates a very diverse policy behaviour space through both hierarchical and recursive uses of language elements. A prototype library implementation of the policy support mechanisms is described. The library reads and writes policies in well-formed XML script. The implementation extends the state of the art in policy-based autonomics through innovations which include support for multiple policy versions of a given policy type, multiple configuration templates, and meta-policies to dynamically select between policy instances and templates. Most significantly, the scheme supports hot-swapping between policy instances. To illustrate the feasibility and generalised applicability of these tools, two dissimilar example deployment scenarios are examined. The first is taken from an exploratory implementation of self-managing parallel processing, and is used to demonstrate the simple and efficient use of the tools. The second example demonstrates more-advanced functionality, in the context of an envisioned multi-policy stock trading scheme which is sensitive to environmental volatility

The AGILE policy expression language for autonomic systems

This paper presents the AGILE policy expression language. The language enables powerful expression of self-managing behaviours and facilitates policy-based autonomic computing in which the policies themselves can be adapted dynamically and automatically. The language is generic so as to be deployable across a wide spectrum of application domains, and is very flexible through the use of simple yet expressive syntax and semantics. The development of AGILE is motivated by the need for adaptive policy mechanisms that are easy to deploy into legacy code and can be used by non autonomics-expert practitioners to embed self-managing behaviours with low cost and risk. A library implementation of the policy language is described. The implementation extends the state of the art in policy-based autonomics through innovations which include support for multiple policy versions of a given policy type, multiple configuration templates, and higher-level ‘meta-policies’ to dynamically select between differently configured business-logic policy instances and templates. Two dissimilar example deployment scenarios are examined.

A sound and complete reified temporal logic

There are mainly two known approaches to the representation of temporal information in Computer Science: modal logic approaches (including tense logics and hybrid temporal logics) and predicate logic approaches (including temporal argument methods and reified temporal logics). On one hand, while tense logics, hybrid temporal logics and temporal argument methods enjoy formal theoretical foundations, their expressiveness has been criticised as not power enough for representing general temporal knowledge; on the other hand, although current reified temporal logics provide greater expressive power, most of them lack of complete and sound axiomatic theories. In this paper, we propose a new reified temporal logic with a clear syntax and semantics in terms of a sound and complete axiomatic formalism which retains all the expressive power of the approach of temporal reification.

The completeness and soundness of temporal theories

Generally speaking, the term temporal logic refers to any system of rules and symbolism for representing and reasoning about propositions qualified in terms of time. In computer science, particularly in the domain of Artificial Intelligence, there are mainly two known approaches to the representation of temporal information: modal logic approaches including tense logic and hybrid temporal logic, and predicate logic approaches including temporal arguement method and reified temporal logic. On one hand, while tense logic, hybrid temporal logic and temporal argument method enjoy formal theoretical foundations, their expressiveness has been criticised as not power enough for representing general temporal knowledge; on the other hand, although reified temporal logic provides greater expressive power, most of the current systems following the temporal reification lack of complete and sound axiomatic theories. With there observations in mind, a new reified temporal logic with clear syntax and semantics in terms of a sound and complete axiomatic formalism is introduced in this paper, which retains all the expressive power of temporal reification.

Nomenclature and syntaxonomic notes on some high-rank syntaxa of the European grassland vegetation

We present descriptions of a new order (Ranunculo cortusifolii-Geranietalia reuteri and of a new alliance (Stachyo lusitanicae-Cheirolophion sempervirentis) for the herbaceous fringe communities of Macaronesia and of the southwestern Iberian Peninsula, respectively. A new alliance, the Polygalo mediterraneae-Bromion erecti (mesophilous post-cultural grasslands), was introduced for the Peninsular Italy. We further validate and typify the Armerietalia rumelicae (perennial grasslands supported by nutrient-poor on siliceous bedrocks at altitudes characterized by the submediterranean climate of central-southern Balkan Peninsula), the Securigero-Dasypyrion villosae (lawn and fallow-land tall-grass annual vegetation of Italy), and the Cirsio vallis-demoni-Nardion (acidophilous grasslands on siliceous substrates of the Southern Italy). Nomenclatural issues (validity, legitimacy, synonymy, formal corrections) have been discussed and clarified for the following names: Brachypodio-Brometalia, Bromo pannonici-Festucion csikhegyensis, Corynephoro-Plantaginion radicatae, Heleochloion, Hieracio-Plantaginion radicatae, Nardetea strictae, Nardetalia strictae, Nardo-Callunetea, Nardo-Galion saxatilis, Oligo-Bromion, Paspalo-Heleochloetalia, Plantagini-Corynephorion and Scorzoneret alia villosae. 

A split-combination approach to merging knowledge bases in possibilistic logic

In this paper, we propose an adaptive approach to merging possibilistic knowledge bases that deploys multiple operators instead of a single operator in the merging process. The merging approach consists of two steps: one is called the splitting step and the other is called the combination step. The splitting step splits each knowledge base into two subbases and then in the second step, different classes of subbases are combined using different operators. Our approach is applied to knowledge bases which are self-consistent and the result of merging is also a consistent knowledge base. Two operators are proposed based on two different splitting methods. Both operators result in a possibilistic knowledge base which contains more information than that obtained by the t-conorm (such as the maximum) based merging methods. In the flat case, one of the operators provides a good alternative to syntax-based merging operators in classical logic.

Del Fichero supremo a la Biblioteca de Babel: Salaverría, precursor de Borges

A juzgar por alguna declaración más bien negativa de Borges sobre la literatura española, se podría creer que esta no influyó demasiado en él. Sin embargo, existen indicios de que pudo haberse inspirado también en determinados escritores españoles coetáneos hoy casi olvidados. Uno de ellos pudo ser José María Salaverría, entre cuyos relatos destaca “El fichero supremo” (1926), del que se ha dicho que “anticipa algunas de las preocupaciones características de un tipo de relato que Jorge Luis Borges elevará años después a la máxima categoría estética”. De hecho, recuerda a “La biblioteca de Babel” (1941) borgiana por su planteamiento hasta el punto de que podría pensarse que el maestro argentino pudo tener presente, a la hora de escribir esa obra maestra, ese cuento de Salaverría, el cual se publicó por primera vez en Caras y Caretas, una revista porteña que Borges reconoció “devorar” en su juventud. Sin embargo, el interés mayor de la comparación entre “El fichero supremo” y “La biblioteca de Babel” no radica tanto en el carácter de posible fuente del primero como en el contraste entre sus formas de presentación narrativa: desde fuera y en tercera persona en Salaverría, en un marco realista; y desde dentro y en primera persona, prácticamente sin marco, en Borges. Este parece desarrollar, en el registro propio de la “imaginación razonada” descrito por él mismo, una virtualidad presente en el relato de Salaverría, cuya comparación con “La biblioteca de Babel” puede suscitar también alguna reflexión sobre el enigma de la identidad y el carácter de la voz enunciadora de la biblioteca universal de Babel. Al menos, esta parece haber hecho realidad en cierto modo, de forma sublime, el patético sueño divino del archivero imaginado por Salaverría.

Deriving the Edge: What's in a phase?

This article offers a critical conceptual discussion and refinement of Chomsky’s (2000, 2001, 2007, 2008) phase system, addressing many of the problematic aspects highlighted in the critique of Boeckx & Grohmann (2007) and seeking to resolve these issues, in particular the stipulative and arbitrary properties of phases and phase edges encoded in the (various versions of the) Phase Impenetrability Condition (PIC). Chomsky’s (2000) original conception of phases as lexical subarrays is demonstrated to derive these properties straightforwardly once a single assumption about the pairwise composition of phases is made, and the PIC is reduced to its necessary core under the Strong Minimalist Thesis (SMT)—namely, the provision of an edge. Finally, a comparison is undertaken of the lexical-subarray conception of phases with the feature-inheritance system of Chomsky 2007, 2008, in which phases are simply the locus of uninterpretable features (probes). Both conceptions are argued to conform to the SMT, and both converge on a pairwise composition of phases. However, the two conceptions of phases are argued to be mutually incompatible in numerous fundamental ways, with no current prospect of unification. The lexical-subarray conception of phases is then to be preferred on grounds of greater empirical adequacy.

How Does Justice Sound? Enunciative Modalities, Law’s Logos and Woman’s Voice

In the throes of her mimetic exposure of the lie of phallocratic discursive unity in 'Speculum of the Other Woman', Irigaray paused on the impossibility of woman’s voice and remarked that ‘it [was] still better to speak only in riddles, allusions, hints, parables.’ Even if asked to clarify a few points. Even if people plead that they just don’t understand. After all, she said, ‘they never have understood.’ (Irigaray 1985, 143).

That the law has never understood a uniquely feminine narrative is hardly controversial, but that this erasure continues to have real and substantive consequences for justice is a reality that feminists have been compelled to remain vigilant in exposing. How does the authority of the word compound law’s exclusionary matrix? How does law remain impervious to woman’s voice and how might it hear woman’s voice? Is there capacity for a dialogic engagement between woman, parler femme, and law?

This paper will explore these questions with particular reference to the experience of women testifying to trauma during the rape trial. It will argue that a logically linked historical genealogy can be traced through which law has come to posit itself as an originary discourse by which thinking is very much conflated with being, or in other terms, law is conflated with justice. This has consequences both for women’s capacity to speak or represent the harm of rape to law, but also for law’s ability to ‘hear’ woman’s voice and objectively adjudicate in cases of rape. It will suggest that justice requires law acknowledge the presence of two distinct and different subjects and that this must be done not only at the symbolic level but also at the level of the parole, syntax and discourse.

Towards more flexible Architecture Description Languages for industrial applications

Architecture Description Languages (ADLs) have emerged in recent years as a tool for providing high-level descriptions of software systems in terms of their architectural elements and the relationships among them. Most of the current ADLs exhibit limitations which prevent their widespread use in industrial applications. In this paper, we discuss these limitations and introduce ALI, an ADL that has been developed to address such limitations. The ALI language provides a rich and flexible syntax for describing component interfaces, architectural patterns, and meta-information. Multiple graphical architectural views can then be derived from ALI's textual notation.