A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
Filters
La Democracia Cristiana frente al régi men de Onganía . Un aborda je desde el caso tucumano
2012
Estudios Sociales
Preserved Fulltext
Registro bibliográficoaZcoaGa, GERMÁN «La Democracia Cristiana frente al régimen de Onganía. ...
doi:10.14409/es.v42i1.2693
fatcat:ukgz6veo2jam7njdz4zq5kcckm
[SPA] "EFFIGIES REGIS ARAGONUM. LA IMAGEN FIGURATIVA DEL REY DE ARAGÓN EN LA EDAD MEDIA"
2016
Los Libros de la Corte.es
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
FLACK: Counterexample-Guided Fault Localization for Alloy Models
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Fault localization is a practical research topic that helps developers identify code locations that might cause bugs in a program. Most existing fault localization techniques are designed for imperative programs (e.g., C and Java) and rely on analyzing correct and incorrect executions of the program to identify suspicious statements. In this work, we introduce a fault localization approach for models written in a declarative language, where the models are not "executed," but rather converted
arXiv:2102.10152v1
fatcat:3wdloyliojaczdb6gftw5hhvgu
more »
... o a logical formula and solved using backend constraint solvers. We present FLACK, a tool that takes as input an Alloy model consisting of some violated assertion and returns a ranked list of suspicious expressions contributing to the assertion violation. The key idea is to analyze the differences between counterexamples, i.e., instances of the model that do not satisfy the assertion, and instances that do satisfy the assertion to find suspicious expressions in the input model. The experimental results show that FLACK is efficient (can handle complex, real-world Alloy models with thousand lines of code within 5 seconds), accurate (can consistently rank buggy expressions in the top 1.9\% of the suspicious list), and useful (can often narrow down the error to the exact location within the suspicious expressions).
19th French-German-Swiss conference on Optimization September 2019, Nice
2021
ESAIM Proceedings and Surveys
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
19th French-German-Swiss conference on Optimization
September 2019, Nice From September 17 to 20, 2019, the 19th edition of the bi-annual applied math conference that gathers the German and French communities ...
doi:10.1051/proc/202171100
fatcat:pknnwakrmvdyvec2r6jl6vuxxa
Towards Abstraction for DynAlloy Specifications
[chapter]
2008
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
DynAlloy is an extension of the Alloy language to better describe state change via actions and programs, in the style of dynamic logic. In this paper, we report on our experience in trying to provide abstraction based mechanisms for improving DynAlloy specifications with respect to SAT based analysis. The technique we employ is based on predicate abstraction, but due to the context in which we make use of it, is subject to the following more specific improvements: (i) since DynAlloy's analysis
doi:10.1007/978-3-540-88194-0_14
fatcat:pwm2qozikzfh7oz6owa5z5nadm
more »
... onsists of checking partial correctness assertions against programs, we are only interested in the initial and final states of a computation, and therefore we can safely abstract away some intermediate states in the computation (generally, this kind of abstraction cannot be safely applied in model checking), (ii) since DynAlloy's analysis is inherently bounded, we can safely rely on the sole use of a SAT solver for producing the abstractions, and (iii) since DynAlloy's basic operational unit is the atomic action, which can be used in different parts within a program, we can reuse the abstraction of an action in different parts of a program, which can accelerate the convergence in checking valid properties. We present the technique via a case study based on a translation of a JML annotated Java program into DynAlloy, accompanied by some preliminary experimental results showing some of the benefits of the technique.
Training Binary Classifiers as Data Structure Invariants
2019
2019 IEEE/ACM 41st International Conference on Software Engineering (ICSE)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We present a technique that enables us to distinguish valid from invalid data structure objects. The technique is based on building an artificial neural network, more precisely a binary classifier, and training it to identify valid and invalid instances of a data structure. The obtained classifier can then be used in place of the data structure's invariant, in order to attempt to identify (in)correct behaviors in programs manipulating the structure. In order to produce the valid objects to
doi:10.1109/icse.2019.00084
dblp:conf/icse/MolinaDPRAF19
fatcat:aznovd4qlbadla7vbbvdax7ske
more »
... the network, an assumed-correct set of object building routines is randomly executed. Invalid instances are produced by generating values for object fields that "break" the collected valid values, i.e., that assign values to object fields that have not been observed as feasible in the assumed-correct program executions that led to the collected valid instances. We experimentally assess this approach, over a benchmark of data structures. We show that this learning technique produces classifiers that achieve significantly better accuracy in classifying valid/invalid objects compared to a technique for dynamic invariant detection, and leads to improved bug finding.
Specifying Event-Based Systems with a Counting Fluent Temporal Logic
2015
2015 IEEE/ACM 37th IEEE International Conference on Software Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Fluent linear temporal logic is a formalism for specifying properties of event-based systems, based on propositions called fluents, defined in terms of activating and deactivating events. In this paper, we propose complementing the notion of fluent by the related concept of counting fluent. As opposed to the boolean nature of fluents, counting fluents are numerical values, that enumerate event occurrences, and allow us to specify naturally some properties of reactive systems. Although by
doi:10.1109/icse.2015.86
dblp:conf/icse/RegisDDA15
fatcat:odjkjsdwengr5n3giicipb4byy
more »
... ng fluent linear temporal logic with counting fluents we obtain an undecidable, strictly more expressive formalism, we develop a sound (but incomplete) model checking approach for the logic, that reduces to traditional temporal logic model checking, and allows us to automatically analyse properties involving counting fluents, on finite event-based systems. Our experiments, based on relevant models taken from the literature, show that: (i) counting fluent temporal logic is better suited than traditional temporal logic for expressing properties in which the number of occurrences of certain events is relevant, and (ii) our model checking approach on counting fluent specifications is more efficient and scales better than model checking equivalent fluent temporal logic specifications.
Perioperative results following lumbar discectomy: comparison of minimally invasive discectomy and standard microdiscectomy
2008
Neurosurgical Focus
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
CLTSA: labelled transition system analyser with counting fluent support
2017
Proceedings of the 2017 11th Joint Meeting on Foundations of Software Engineering - ESEC/FSE 2017
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In this paper we present CLTSA (Counting Fluents Labelled Transition System Analyser), an extension of LTSA (Labelled Transition System Analyser) that incorporates counting fluents, a useful mechanism to capture properties related to counting events. Counting fluent temporal logic is a formalism for specifying properties of event-based systems, which complements the notion of fluent by the related concept of counting fluent. While fluents allow us to capture boolean properties of the behaviour
doi:10.1145/3106237.3122828
dblp:conf/sigsoft/RegisDDA17
fatcat:o5apazp3bzbprotg6lbalxwut4
more »
... f a reactive system, counting fluents are numerical values, that enumerate event occurrences. The tool supports a superset of FSP (Finite State Processes), that allows one to define LTL properties involving counting fluents, which can be model checked on FSP processes. Detailed information can be found at http://dc.exa.unrc.edu.ar/tools/cltsa. CCS CONCEPTS • Theory of computation → Modal and temporal logics; Verification by model checking; • Software and its engineering → Specification languages;
Automated workarounds from Java program specifications based on SAT solving
2018
International Journal on Software Tools for Technology Transfer (STTT)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The failures that bugs in software lead to can sometimes be bypassed by the so called workarounds: when a (faulty) routine fails, alternative routines that the system offers can be used in place of the failing one, to circumvent the failure. Previous works have exploited this workarounds notion to automatically recover from runtime failures in some application domains. However, existing approaches that compute workarounds automatically either require the user to manually build an abstract model
doi:10.1007/s10009-018-0503-8
fatcat:b6dkkffohvay3i4xlanwlkzif4
more »
... of the software under consideration, or to provide equivalent sequences of operations from which workarounds are computed, diminishing the automation of workaround-based system recovery. In this paper, we present two techniques that automatically compute workarounds from Java code equipped with formal specifications, avoiding abstract software models and user provided equivalences. These techniques employ SAT solving to compute workarounds on concrete program state characterizations. The first employs SAT solving to compute traditional workarounds, while the second directly exploits SAT solving to circumvent a failing method, building a state that mimics the (correct) behaviour of this failing routine. Our experiments, based on case studies involving implementations of collections and a library for date arithmetic, enable us to show that the techniques can effectively compute workarounds from complex contracts in an important number of cases, in time that makes them feasible to be used for run time repairs.
Cold ablation driven by localized forces in alkali halides
2014
Nature Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Laser ablation has been widely used for a variety of applications. Since the mechanisms for ablation are strongly dependent on the photoexcitation level, so called cold material processing has relied on the use of high-peak-power laser fluences for which nonthermal processes become dominant; often reaching the universal threshold for plasma formation of B1 J cm À 2 in most solids. Here we show single-shot time-resolved femtosecond electron diffraction, femtosecond optical reflectivity and ion
doi:10.1038/ncomms4863
pmid:24835317
fatcat:dqnbagky6fczrgp5nzy77snbj4
more »
... tection experiments to study the evolution of the ablation process that follows femtosecond 400 nm laser excitation in crystalline sodium chloride, caesium iodide and potassium iodide. The phenomenon in this class of materials occurs well below the threshold for plasma formation and even below the melting point. The results reveal fast electronic and localized structural changes that lead to the ejection of particulates and the formation of micron-deep craters, reflecting the very nature of the strong repulsive forces at play.
Fluent Logic Workflow Analyser: A Tool for The Verification of Workflow Properties
2014
Electronic Proceedings in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
Other Versions
In this paper we present the design and implementation, as well as a use case, of a tool for workflow analysis. The tool provides an assistant for the specification of properties of a workflow model. The specification language for property description is Fluent Linear Time Temporal Logic. Fluents provide an adequate flexibility for capturing properties of workflows. Both the model and the properties are encoded, in an automated way, as Labelled Transition Systems, and the analysis is reduced to model checking.
doi:10.4204/eptcs.139.4
fatcat:mpf5dzrffvg5pe3vjxdlqzyhhe
Stump regrowth and estimation of reconstituting Caatinga shrub-tree biomass under forest management
2018
Scientia Forestalis/Forest Sciences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Resumo Objetivou-se avaliar a rebrota e reconstituir a biomassa arbustiva-arbórea a partir das cepas em uma área de Caatinga sob manejo florestal em Floresta-PE, Brasil. Dois anos após intervenção em 18 parcelas foram medidas as circunferências e alturas das cepas e dos perfilhos. Foi avaliada a influência do diâmetro e da altura da cepa na brotação das espécies. Em uma área próxima e sem intervenção, foram tomados dados de diâmetro a altura da base e do peito para reconstituição da biomassa
doi:10.18671/scifor.v46n119.12
fatcat:qo2qvx7tejbd7az63lmassbq7q
more »
... lorada. Verificou-se que Poincianella bracteosa e Aspidosperma pyrifolium emitiram maior número de perfilhos nas cepas com circunferência maior que 30 cm, mas sem influência da altura da cepa. A biomassa média estimada (17186,16 kg ha -1 ) foi similar a áreas submetidas à intervenção antrópica e a sua reconstituição pode ser uma ferramenta auxiliar na para órgãos ambientais na fiscalização de desmatamento ilegal. Palavras-chave: corte raso, regeneração natural, semiárido Abstract This study aimed to evaluate stump regrowth and estimate the reconstitution of shrub-tree biomass from the stumps in an area of Caatinga under forest management in Floresta-PE, Brazil. The circumferences and heights of the stump and sprouts were measured two years after an intervention on 18 plots. The influence of the stump diameter and its height on the sprouting ability of the species was evaluated. Data was taken in the next area without intervention in order to estimate the diameter at breast height for reconstitution of the exploited biomass. We found that the tillering for Poincianella bracteosa and Aspidosperma pyrifolium was influenced by the size of the circumference, but not by the stump height. The average estimated biomass (17186.16 kg ha -1 ) was similar to other areas also subject to human intervention, and its reconstitution can be an auxiliary tool for monitoring illegal deforestation by environmental agencies.
DynAlloy analyzer: a tool for the specification and analysis of alloy models with dynamic behaviour
2017
Proceedings of the 2017 11th Joint Meeting on Foundations of Software Engineering - ESEC/FSE 2017
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We describe DynAlloy Analyzer, a tool that extends Alloy Analyzer with support for dynamic elements in Alloy models. The tool builds upon Alloy Analyzer in a way that makes it fully compatible with Alloy models, and extends their syntax with a particular idiom, inspired in dynamic logic, for the description of dynamic behaviours, understood as sequences of states over standard Alloy models, in terms of programs. The syntax is broad enough to accommodate abstract dynamic behaviours, e.g., using
doi:10.1145/3106237.3122826
dblp:conf/sigsoft/RegisCBPRPAGF17
fatcat:aa4exsdgpfh2fnv7z3kvddqg2q
more »
... ondeterministic choice and finite unbounded iteration, as well as more concrete ones, using standard sequential programming constructions. The analysis of DynAlloy models resorts to the analysis of Alloy models, through an optimized translation that often makes the analysis more efficient than that of typical ad-hoc constructions to capture dynamism in Alloy. Tool screencast, binaries and further details available in: http://dc.exa.unrc.edu.ar/tools/dynalloy
Page 411 of MLN Vol. 35, Issue 7
[page]
1920
MLN
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
(ib.). item pro $ libra serici nigri ad complendos francos iaccarum dnorum Regis et Witoldi III marc. (p. 219). ...
The earliest recorded instance of the German word seems to be in a Latin glossary of the year 1417. ...
« Previous
Showing results 1 — 15 out of 33,773 results