The coefficient c_A required for O(a) improvement of the axial current in lattice QCD with N_f=3 flavors of Wilson fermions and the tree-level Symanzik-improved gauge action is determined non-perturbatively. The standard improvement condition using S
chroedinger functional boundary conditions is employed at constant physics for a range of couplings relevant for simulations at lattice spacings of ~ 0.09 fm and below. We define the improvement condition projected onto the zero topological charge sector of the theory, in order to avoid the problem of possibly insufficient tunneling between topological sectors in our simulations at the smallest bare coupling. An interpolation formula for c_A(g_0^2) is provided together with our final results.
It is well-known that constructing models of higher-order probabilistic programming languages is challenging. We show how to construct step-indexed logical relations for a probabilistic extension of a higher-order programming language with impredicat
ive polymorphism and recursive types. We show that the resulting logical relation is sound and complete with respect to the contextual preorder and, moreover, that it is convenient for reasoning about concrete program equivalences. Finally, we extend the language with dynamically allocated first-order references and show how to extend the logical relation to this language. We show that the resulting relation remains useful for reasoning about examples involving both state and probabilistic choice.
The masses of the low lying baryons are evaluated using a total of ten ensembles of dynamical twisted mass fermion gauge configurations. The simulations are performed using two degenerate flavors of light quarks, and a strange and a charm quark fixed
to approximately their physical values. The light sea quarks correspond to pseudo scalar masses in the range of about 210~MeV to 430~MeV. We use the Iwasaki improved gluonic action at three values of the coupling constant corresponding to lattice spacing $a=0.094$~fm, 0.082~fm and 0.065~fm determined from the nucleon mass. We check for both finite volume and cut-off effects on the baryon masses. We examine the issue of isospin symmetry breaking for the octet and decuplet baryons and its dependence on the lattice spacing. We show that in the continuum limit isospin breaking is consistent with zero, as expected. We performed a chiral extrapolation of the forty baryon masses using SU(2) $chi$PT. After taking the continuum limit and extrapolating to the physical pion mass our results are in good agreement with experiment. We provide predictions for the mass of the doubly charmed $Xi_{cc}^*$, as well as of the doubly and triply charmed $Omega$s that have not yet been determined experimentally.
This volume contains the proceedings of ICE 2013, the 6th Interaction and Concurrency Experience workshop, which was held in Florence, Italy on the 6th of June 2013 as a satellite event of DisCoTec 2013. The ICE procedure for paper selection allows P
C members to interact, anonymously, with authors. During the review phase, each submitted paper is published on a Wiki and associated with a discussion forum whose access is restricted to the authors and to all the PC members not declaring a conflict of interests. The PC members post comments and questions that the authors reply to. Each paper was reviewed by three PC members, and altogether 6 papers were accepted for publication. We were proud to host two invited talks, Davide Sangiorgi and Filippo Bonchi, whose abstracts are included in this volume together with the regular papers. The workshop also featured a brief announcement of an already published paper.
Programming languages with countable nondeterministic choice are computationally interesting since countable nondeterminism arises when modeling fairness for concurrent systems. Because countable choice introduces non-continuous behaviour, it is well
-known that developing semantic models for programming languages with countable nondeterminism is challenging. We present a step-indexed logical relations model of a higher-order functional programming language with countable nondeterminism and demonstrate how it can be used to reason about contextually defined may- and must-equivalence. In earlier step-indexed models, the indices have been drawn from {omega}. Here the step-indexed relations for must-equivalence are indexed over an ordinal greater than {omega}.
This paper offers a survey of uppaalsmc, a major extension of the real-time verification tool uppaal. uppaalsmc allows for the efficient analysis of performance properties of networks of priced timed automata under a natural stochastic semantics. In
particular, uppaalsmc relies on a series of extensions of the statistical model checking approach generalized to handle real-time systems and estimate undecidable problems. uppaalsmc comes together with a friendly user interface that allows a user to specify complex problems in an efficient manner as well as to get feedback in the form of probability distributions and compare probabilities to analyze performance aspects of systems. The focus of the survey is on the evolution of the tool - including modeling and specification formalisms as well as techniques applied - together with applications of the tool to case studies.
