Sistemas de Tipos para Verificación de Programas Concurrentes. Type Systems for Concurrent Programs Verification.

La programación concurrente es una tarea difícil aún para los más experimentados programadores. Las investigaciones en concurrencia han dado como resultado una gran cantidad de mecanismos y herramientas para resolver problemas de condiciones de carrera de datos y deadlocks, problemas que surgen por el mal uso de los mecanismos de sincronización. La verificación de propiedades interesantes de programas concurrentes presenta dificultades extras a los programas secuenciales debido al no-determinismo de su ejecución, lo cual resulta en una explosión en el número de posibles estados de programa, haciendo casi imposible un tratamiento manual o aún con la ayuda de computadoras. Algunos enfoques se basan en la creación de lenguajes de programación con construcciones con un alto nivel de abstración para expresar concurrencia y sincronización. Otros enfoques tratan de desarrollar técnicas y métodos de razonamiento para demostrar propiedades, algunos usan demostradores de teoremas generales, model-checking o algortimos específicos sobre un determinado sistema de tipos. Los enfoques basados en análisis estático liviano utilizan técnicas como interpretación abstracta para detectar ciertos tipos de errores, de una manera conservativa. Estas técnicas generalmente escalan lo suficiente para aplicarse en grandes proyectos de software pero los tipos de errores que pueden detectar es limitada. Algunas propiedades interesantes están relacionadas a condiciones de carrera y deadlocks, mientras que otros están interesados en problemas relacionados con la seguridad de los sistemas, como confidencialidad e integridad de datos. Los principales objetivos de esta propuesta es identificar algunas propiedades de interés a verificar en sistemas concurrentes y desarrollar técnicas y herramientas para realizar la verificación en forma automática. Para lograr estos objetivos, se pondrá énfasis en el estudio y desarrollo de sistemas de tipos como tipos dependientes, sistema de tipos y efectos, y tipos de efectos sensibles al flujo de datos y control. Estos sistemas de tipos se aplicarán a algunos modelos de programación concurrente como por ejemplo, en Simple Concurrent Object-Oriented Programming (SCOOP) y Java. Además se abordarán propiedades de seguridad usando sistemas de tipos específicos. Concurrent programming has remained a dificult task even for very experienced programmers. Concurrency research has provided a rich set of tools and mechanisms for dealing with data races and deadlocks that arise of incorrect use of synchronization. Verification of most interesting properties of concurrent programs is a very dificult task due to intrinsic non-deterministic nature of concurrency, resulting in a state explosion which make it almost imposible to be manually treat and it is a serious challenge to do that even with help of computers. Some approaches attempts create programming languages with higher levels of abstraction for expressing concurrency and synchronization. Other approaches try to develop reasoning methods to prove properties, either using general theorem provers, model-checking or specific algorithms on some type systems. The light-weight static analysis approach apply techniques like abstract interpretation to find certain kind of bugs in a conservative way. This techniques scale well to be applied in large software projects but the kind of bugs they may find are limited. Some interesting properties are related to data races and deadlocks, while others are interested in some security problems like confidentiality and integrity of data. The main goals of this proposal is to identify some interesting properties to verify in concurrent systems and develop techniques and tools to do full automatic verification. The main approach will be the application of type systems, as dependent types, type and effect systems, and flow-efect types. Those type systems will be applied to some models for concurrent programming as Simple Concurrent Object-Oriented Programming (SCOOP) and Java. Other goals include the analysis of security properties also using specific type systems.

Dois teoremas sôbre a função gama

This paper proves the following theorems on the gamma function: Theorem I The integral ∫O∞ t u e-t dt = Γ ( u + 1 ) , where u, real or complex, is such that R (u) > -1, will not change its value if we substitute z = Q (cos φ + i sen φ) for the real variable t, being jconstant and such that - Π/2 < φ < Π/2 , Theorem II The integral ∫-∞∞ w2u + 1 e -w² dw = Γ ( u + 1 ) , where 2u + 1 is supposed to be a non negative even integer, will not change its value if we substitute z = w + fi, f being a real constant, for the real variable w. The proof of both theorems is obtained by means of the well known Cauchy theorem on contour integrals on the complex plane, as suggested by CRAMÉR (1, p. 126) and LEVY (3, p. 178).

The Zariski-Lefschetz principle for higher homotopy groups of nongeneric pencils

We prove a general Zariski-van Kampen-Lefschetz type theorem for higher homotopy groups of generic and nongeneric pencils on singular open complex spaces.

Corrigendum stable matchings and preferences of couples

We correct an omission in the definition of our domain of weakly responsive preferences introduced in Klaus and Klijn (2005) or KK05 for short. The proof of the existence of stable matchings (KK05, Theorem 3.3) and a maximal domain result (KK05, Theorem 3.5) are adjusted accordingly.

Approval voting ion dichotomous preferences

The aim of this paper is to find normative foundations of Approval Voting. In order to show that Approval Voting is the only social choice function that satisfies anonymity, neutrality, strategy-proofness and strict monotonicity we rely on an intermediate result which relates strategy-proofness of a social choice function to the properties of Independence of Irrelevant Alternatives and monotonicity of the corresponding social welfare function. Afterwards we characterize Approval Voting by means of strict symmetry, neutrality and strict monotonicity and relate this result to May's Theorem. Finally, we show that it is possible to substitute the property of strict monotonicity by the one efficiency of in the second characterization.

Fair and efficient student placement with couples

We study situations of allocating positions or jobs to students or workers based on priorities. An example is the assignment of medical students to hospital residencies on the basis of one or several entrance exams. For markets without couples, e.g., for ``undergraduate student placement,'' acyclicity is a necessary and sufficient condition for the existence of a fair and efficient placement mechanism (Ergin, 2002). We show that in the presence of couples, which introduces complementarities into the students' preferences, acyclicity is still necessary, but not sufficient (Theorem 4.1). A second necessary condition (Theorem 4.2) is ``priority-togetherness'' of couples. A priority structure that satisfies both necessary conditions is called pt-acyclic. For student placement problems where all quotas are equal to one we characterize pt-acyclicity (Lemma 5.1) and show that it is a sufficient condition for the existence of a fair and efficient placement mechanism (Theorem 5.1). If in addition to pt-acyclicity we require ``reallocation-'' and ``vacancy-fairness'' for couples, the so-called dictator-bidictator placement mechanism is the unique fair and efficient placement mechanism (Theorem 5.2). Finally, for general student placement problems, we show that pt-acyclicity may not be sufficient for the existence of a fair and efficient placement mechanism (Examples 5.4, 5.5, and 5.6). We identify a sufficient condition such that the so-called sequential placement mechanism produces a fair and efficient allocation (Theorem 5.3).

A foundation model for marxian theories of the breakdown of capitalism

Marx and the writers that followed him have produced a number of theories of the breakdown of capitalism. The majority of these theories were based on the historical tendencies: the rise in the composition of capital and the share of capital and the fall in the rate of profit. However these theories were never modeled with main stream rigour. This paper presents a constant wage model, with capital, labour and land as factors of production, which reproduces the historical tendencies and so can be used as a foundation for the various theories. The use of Chaplygins theorem in the proof of the main result also gives the paper a technical interest.

Reflected Backward Stochastic Differential Equation with Jumps and RCLL Obstacle

In this paper we study one-dimensional reflected backward stochastic differential equation when the noise is driven by a Brownian motion and an independent Poisson point process when the solution is forced to stay above a right continuous left-hand limited obstacle. We prove existence and uniqueness of the solution by using a penalization method combined with a monotonic limit theorem.

Algebraic extensions in free groups

The aim of this paper is to unify the points of view of three recent and independent papers (Ventura 1997, Margolis, Sapir and Weil 2001 and Kapovich and Miasnikov 2002), where similar modern versions of a 1951 theorem of Takahasi were given. We develop a theory of algebraic extensions for free groups, highlighting the analogies and differences with respect to the corresponding classical fieldt heoretic notions, and we discuss in detail the notion of algebraic closure. We apply that theory to the study and the computation of certain algebraic properties of subgroups (e.g. being malnormal, pure, inert or compressed, being closed in certain profinite topologies) and the corresponding closure operators. We also analyze the closure of a subgroup under the addition of solutions of certain sets of equations.

Repeated games played in a network

Delayed perfect monitoring in an infinitely repeated discounted game is modelled by letting the players form a connected and undirected network. Players observe their immediate neighbors' behavior only, but communicate over time the repeated game's history truthfully throughout the network. The Folk Theorem extends to this setup, although for a range of discount factors strictly below 1, the set of sequential equilibria and the corresponding payoff set may be reduced. A general class of games is analyzed without imposing restrictions on the dimensionality of the payoff space. This and the bilateral communication structure allow for limited results under strategic communication only. As a by-product this model produces a network result; namely, the level of cooperation in this setup depends on the network's diameter, and not on its clustering coefficient as in other models.

The bogomolov conjecture for totally degenerate Abelian varieties

We prove the Bogomolov conjecture for a totally degenerate abelian variety A over a function field. We adapt Zhang's proof of the number field case replacing the complex analytic tools by tropical analytic geometry. A key step is the tropical equidistribution theorem for A at the totally degenerate place.

Semipurity of tempered Deligne cohomology

In this paper we define the formal and tempered Deligne cohomology groups, that are obtained by applying the Deligne complex functor to the complexes of formal differential forms and tempered currents respectively. We then prove the existence of a duality between them, a vanishing theorem for the former and a semipurity property for the latter. The motivation of this results comes from the study of covariant arithmetic Chow groups. The semi-purity property of tempered Deligne cohomology implies, in particular, that several definitions of covariant arithmetic Chow groups agree for projective arithmetic varieties.

Smith and Rawls share a room

We consider one-to-one matching (roommate) problems in which agents (students) can either be matched as pairs or remain single. The aim of this paper is twofold. First, we review a key result for roommate problems (the ``lonely wolf'' theorem) for which we provide a concise and elementary proof. Second, and related to the title of this paper, we show how the often incompatible concepts of stability (represented by the political economist Adam Smith) and fairness (represented by the political philosopher John Rawls) can be reconciled for roommate problems.

Corrigendum: stable matchings and preferences of couples

We correct an omission in the definition of the domain of weakly responsive preferences introduced in Klaus and Klijn (2005) or KK05 for short. The proof of the existence of stable matchings (KK05, Theorem 3.3) and a maximal domain result (KK05, Theorem 3.5) are adjusted accordingly.

Oligocene CO2 decline promoted C4 photosynthesis in grasses.

C4 photosynthesis is an adaptation derived from the more common C3 photosynthetic pathway that confers a higher productivity under warm temperature and low atmospheric CO2 concentration [1, 2]. C4 evolution has been seen as a consequence of past atmospheric CO2 decline, such as the abrupt CO2 fall 32-25 million years ago (Mya) [3-6]. This relationship has never been tested rigorously, mainly because of a lack of accurate estimates of divergence times for the different C4 lineages [3]. In this study, we inferred a large phylogenetic tree for the grass family and estimated, through Bayesian molecular dating, the ages of the 17 to 18 independent grass C4 lineages. The first transition from C3 to C4 photosynthesis occurred in the Chloridoideae subfamily, 32.0-25.0 Mya. The link between CO2 decrease and transition to C4 photosynthesis was tested by a novel maximum likelihood approach. We showed that the model incorporating the atmospheric CO2 levels was significantly better than the null model, supporting the importance of CO2 decline on C4 photosynthesis evolvability. This finding is relevant for understanding the origin of C4 photosynthesis in grasses, which is one of the most successful ecological and evolutionary innovations in plant history.