Search results for "Programming Languages"
showing 10 items of 138 documents
Optimization under Uncertainty and Linear Semi-Infinite Programming: A Survey
2001
This paper deals with the relationship between semi-infinite linear programming and decision making under uncertainty in imprecise environments. Actually, we have reviewed several set-inclusive constrained models and some fuzzy programming problems in order to see if they can be solved by means of a linear semi-infinite program. Finally, we present some numerical examples obtained by using a primal semi-infinite programming method.
Feasibility of finite and infinite paths in data dependent programs
2005
This paper considers the feasibility of finite and infinite paths in programs in two simple programming languages. The language LBASE allows to express the dependencies of real time systems on integer data, the language LTIM can model quantitative timing constraints in r.t.s. specifications. It is proven that the problem of whether a given LBASE or LTIM program has an infinite feasible path (i.e. whether it can exhibit an infinite behaviour) is decidable. The possibilities to characterise the sets of all feasible finite and infinite paths in LBASE and LTIM programs are also discussed. The infinite feasible path existence problem is proven decidable also for the language LTIBA which has both…
Star-free trace languages
1992
Abstract Generalizing a classical result of Schutzenberger to free partially commutative monoids, we prove that the family of star-free trace languages coincides with the family of aperiodic trace languages.
A description based on languages of the final non-deterministic automaton
2014
The study of the behaviour of non-deterministic automata has traditionally focused on the languages which can be associated to the different states. Under this interpretation, the different branches that can be taken at every step are ignored. However, we can also take into account the different decisions which can be made at every state, that is, the branches that can be taken, and these decisions might change the possible future behaviour. In this case, the behaviour of the automata can be described with the help of the concept of bisimilarity. This is the kind of description that is usually obtained when the automata are regarded as labelled transition systems or coalgebras. Contrarily t…
Complexity of operations on cofinite languages
2010
International audience; We study the worst case complexity of regular operation on cofinite languages (i.e., languages whose complement is finite) and provide algorithms to compute efficiently the resulting minimal automata.
ICOOLPS 2010 and MASPEGHI 2010.
2012
International audience; At ECOOP 2010 in Maribor, Slovenia, the two workshops MASPEGHI (MechAnisms for SPEcialization, Generalization and inHerItance) and ICOOOLPS (Implementation, Compilation, Optimization of Object-Oriented Languages, Programs and Systems) were combined because both were rather small and shared common concerns, their topic areas being strongly related. Six papers had been accepted to MASPEGHI, but only five were presented because the authors of one paper could not attend the conference and workshop. Three papers had been accepted to ICOOOLPS, and all were also presented. The workshop authors were later asked to submit extended versions of their papers for possible publica…
Parallel and scalable short-read alignment on multi-core clusters using UPC++
2016
[Abstract]: The growth of next-generation sequencing (NGS) datasets poses a challenge to the alignment of reads to reference genomes in terms of alignment quality and execution speed. Some available aligners have been shown to obtain high quality mappings at the expense of long execution times. Finding fast yet accurate software solutions is of high importance to research, since availability and size of NGS datasets continue to increase. In this work we present an efficient parallelization approach for NGS short-read alignment on multi-core clusters. Our approach takes advantage of a distributed shared memory programming model based on the new UPC++ language. Experimental results using the …
Space-Time, Phenomenology, and the Picture Theory of Language
2010
To estimate Minkowski’s introduction of space-time in relativity, the case is made for the view that abstract language and mathematics carries meaning not only by its connections with observation but as pictures of facts. This view is contrasted to the more traditional intuitionism of Hume, Mach, and Husserl. Einstein’s attempt at a conceptual reconstruction of space and time as well as Husserl’s analysis of the loss of meaning in science through increasing abstraction is analysed. Wittgenstein’s picture theory of language is used to explain how meaning is conveyed by abstract expressions, with the Minkowski space as a case.
Bounds on mixed state entanglement
2020
In the general framework of d 1 ×
Engineering Ising-XY spin models in a triangular lattice via tunable artificial gauge fields,
2013
Emulation of gauge fields for ultracold atoms provides access to a class of exotic states arising in strong magnetic fields. Here we report on the experimental realisation of tunable staggered gauge fields in a periodically driven triangular lattice. For maximal staggered magnetic fluxes, the doubly degenerate superfluid ground state breaks both a discrete Z2 (Ising) symmetry and a continuous U(1) symmetry. By measuring an Ising order parameter, we observe a thermally driven phase transition from an ordered antiferromagnetic to an unordered paramagnetic state and textbook-like magnetisation curves. Both the experimental and theoretical analysis of the coherence properties of the ultracold g…