91,734 research outputs found
Termination and Cost Analysis with COSTA and its User Interfaces
COSTA is a static analyzer for Java bytecode which is able to infer cost and termination information for large classes of programs. The analyzer takes as input a program and a resource of interest, in the form of a cost model, and aims at obtaining an upper bound on the execution cost with respect to the resource and at proving program termination. The costa system has reached a considerable degree of maturity in that (1) it includes state-of-the-art techniques for statically estimating the resource consumption and the termination behavior of programs, plus a number of specialized techniques which are required for achieving accurate results in the context of object-oriented programs, such as handling numeric fields in value analysis; (2) it provides several nontrivial notions of cost (resource consumption) including, in addition to the number of execution steps, the amount of memory allocated in the heap or the number of calls to some user-specified method; (3) it provides several user interfaces: a classical command line, a Web interface which allows experimenting remotely with the system without the need of installing it locally, and a recently developed Eclipse plugin which facilitates the usage of the analyzer, even during the development phase; (4) it can deal with both the Standard and Micro editions of Java. In the tool demonstration, we will show that costa is able to produce meaningful results for non-trivial programs, possibly using Java libraries. Such results can then be used in many applications, including program development, resource usage certification, program optimization, etc
On the tailoring of CAST-32A certification guidance to real COTS multicore architectures
The use of Commercial Off-The-Shelf (COTS) multicores in real-time industry is on the rise due to multicores' potential performance increase and energy reduction. Yet, the unpredictable impact on timing of contention in shared hardware resources challenges certification. Furthermore, most safety certification standards target single-core architectures and do not provide explicit guidance for multicore processors. Recently, however, CAST-32A has been presented providing guidance for software planning, development and verification in multicores. In this paper, from a theoretical level, we provide a detailed review of CAST-32A objectives and the difficulty of reaching them under current COTS multicore design trends; at experimental level, we assess the difficulties of the application of CAST-32A to a real multicore processor, the NXP P4080.This work has been partially supported by the Spanish Ministry of Economy and Competitiveness (MINECO) under grant
TIN2015-65316-P and the HiPEAC Network of Excellence.
Jaume Abella has been partially supported by the MINECO under Ramon y Cajal grant RYC-2013-14717.Peer ReviewedPostprint (author's final draft
Unbounded randomness certification using sequences of measurements
Unpredictability, or randomness, of the outcomes of measurements made on an
entangled state can be certified provided that the statistics violate a Bell
inequality. In the standard Bell scenario where each party performs a single
measurement on its share of the system, only a finite amount of randomness, of
at most bits, can be certified from a pair of entangled particles
of dimension . Our work shows that this fundamental limitation can be
overcome using sequences of (nonprojective) measurements on the same system.
More precisely, we prove that one can certify any amount of random bits from a
pair of qubits in a pure state as the resource, even if it is arbitrarily
weakly entangled. In addition, this certification is achieved by near-maximal
violation of a particular Bell inequality for each measurement in the sequence.Comment: 4 + 5 pages (1 + 3 images), published versio
Introduction: food relocalisation and knowledge dynamics for sustainability in rural areas
The chapter presents the literature on local food and local knowledge and introduces the case studies analysed in the volum
Reliable quantum certification for photonic quantum technologies
A major roadblock for large-scale photonic quantum technologies is the lack
of practical reliable certification tools. We introduce an experimentally
friendly - yet mathematically rigorous - certification test for experimental
preparations of arbitrary m-mode pure Gaussian states, pure non-Gaussian states
generated by linear-optical circuits with n-boson Fock-basis states as inputs,
and states of these two classes subsequently post-selected with local
measurements on ancillary modes. The protocol is efficient in m and the inverse
post-selection success probability for all Gaussian states and all mentioned
non-Gaussian states with constant n. We follow the mindset of an untrusted
prover, who prepares the state, and a skeptic certifier, with classical
computing and single-mode homodyne-detection capabilities only. No assumptions
are made on the type of noise or capabilities of the prover. Our technique
exploits an extremality-based fidelity bound whose estimation relies on
non-Gaussian state nullifiers, which we introduce on the way as a byproduct
result. The certification of many-mode photonic networks, as those used for
photonic quantum simulations, boson samplers, and quantum metrology, is now
within reach.Comment: 8 pages + 20 pages appendix, 2 figures, results generalized to
scenarios with post-selection, presentation improve
Measurement-device-independent quantification of entanglement for given Hilbert space dimension
We address the question of how much entanglement can be certified from the
observed correlations and the knowledge of the Hilbert space dimension of the
measured systems. We focus on the case in which both systems are known to be
qubits. For several correlations (though not for all), one can certify the same
amount of entanglement as with state tomography, but with fewer assumptions,
since nothing is assumed about the measurements. We also present security
proofs of quantum key distribution without any assumption on the measurements.
We discuss how both the amount of entanglement and the security of quantum key
distribution (QKD) are affected by the inefficiency of detectors in this
scenario.Comment: 19 pages, 6 figure
- …