Damásio, Carlos Viegas, João Leite, and José Júlio Alferes. "
Declarative Semantics for the Rule Interchange Format Production Rule Dialect."
The Semantic Web - ISWC 2010 - 9th International Semantic Web Conference. Springer, 2010. 798-813.
AbstractTheRuleInterchangeFormatProductionRuleDialect(RIF- PRD) is a W3C Recommendation to define production rules for the Semantic Web, whose semantics is defined operationally via labeled ter- minal transition systems.
In this paper, we introduce a declarative logical characterization of the full default semantics of RIF-PRD based on Answer Set Programming (ASP), including matching, conflict resolution and acting.
Our proposal to the semantics of RIF-PRD enjoys several features. Being based on ASP, it enables a straightforward integration with Logic Programming rule based technology, namely for reasoning and acting with ontologies. Then, its full declarative logical character facilitates the in- vestigation of formal properties of RIF-PRD itself. Furthermore, it turns out that our characterization based on ASP is flexible enough so that new conflict resolution semantics for RIF-PRD can easily be defined and encoded. Finally, it immediately serves as the declarative specification of an implementation, whose prototype we developed.
Teixeira, Bruno, João M. Lourenço, Eitan Farchi, Ricardo J. Dias, and Diogo Sousa. "
Detection of Transactional Memory Anomalies using Static Analysis."
Proceedings of the 8th Workshop on Parallel and Distributed Systems: Testing, Analysis, and Debugging (PADTAD'10). {PADTAD}'10. New York, NY, USA: ACM, 2010. 26-36.
AbstractTransactional Memory allows programmers to reduce the number of synchronization errors introduced in concurrent programs, but does not ensures its complete elimination. This paper proposes a pattern matching based approach to the static detection of atomicity violation, based on a path-sensitive symbolic execution method to model four anomalies that may affect Transactional Memory programs. The proposed technique may be used to to bring to programmer's attention pairs of transactions that the programmer has mis-specified, and should have been combined into a single transaction. The algorithm first traverses the AST tree, removing all the non-transactional blocks and generating a trace tree in the path sensitive manner for each thread. The trace tree is a Trie like data structure, where each path from root to a leaf is a list of transactions. For each pair of threads, erroneous patterns involving two consecutive transactions are then checked in the trace tree. Results allow to conclude that the proposed technique, although triggering a moderate number of false positives, can be successfully applied to Java programs, correctly identifying the vast majority of the relevant erroneous patterns.
Bernardo, M., M. Gonçalves, N. Lapa, and B. Mendes. "
Determination of alkylphenols in eluates from pyrolysis solid residues using dispersive liquid-liquid microextraction."
Chemosphere. 79.11 (2010): 1026-1032.
AbstractDispersive liquid–liquid microextraction (DLLME) coupled with gas chromatography–mass spectrometry (GC–MS) was applied for the determination of 11 alkylphenols in eluates of chars produced in the co-pyrolysis of different wastes.
The optimized DLLME procedure, 4 mL of sample solution, 15 μL of trichloroethylene as extraction solvent, 1 mL of acetone as dispersion solvent and addition of 15% (w/v) of NaCl, was validated. Under the optimum conditions, the enrichment factors were in the range of 82–180. Calibration curves were constructed for each analyte in pure water in the concentration range of 0.5–8 μg/L with correlation coefficients higher than 0.999. The limits of detection were between 0.07 and 0.17 μg/L. The repeatability of the method was evaluated using water samples fortified with the analyte mixture at two concentration levels: the relative standard deviation (RSD) values were between 3.7% and 8.0% for a concentration of 0.5 μg/L, and between 4.2% and 6.4% for a concentration of 3 μg/L. The recoveries of the analytes evaluated by fortification of real eluate samples were in the range of 67.9–97.9% for eluate 1 (obtained from a decontaminated char) and in the range of 61.9–101.4% for eluate 2 (obtained from the untreated char). o-Methylphenol presented low recoveries for both eluates showing a possible matrix effect. The results obtained show that this method is adequate for the determination of alkylphenols in environmental aqueous samples and presents itself as a fast and inexpensive technique, using minor amounts of organic solvents.
Almeida, G., H. Biscaia, C. Chastre, J. Fonseca, and F. Melício Displacement Estimation of a RC beam test based on TSS algorithm. CISTI'2010 - 5ª Conferencia Ibérica de Sistemas y Tecnologías de Información. Santiago de Compostela, 2010.
AbstractThe traditional methodology used in civil engineering measurements requires a lot of equipment and a very complex procedure especially if the number of target points increase. Since the beginning of the current century, several studies have been conducted in the area of photogrametry using digital image
correlation associated with block motion algorithms to estimate displacements in reinforced concrete (RC) beams during a load test. Using image processing techniques it is possible to measure the whole area of interest and not only a few points of the tests materials. In this paper, block-matching algorithms are used in order to compare the results from photogrametry techniques and the data obtained with linear voltage displacement transducer (LVDT) sensors during the load tests of RC beams, which are very common to find in civil engineering laboratories.
Gabriel, Pedro, Miguel Goulão, and Vasco Amaral. "
Do Software Languages Engineers Evaluate their Languages?"
XIII Congreso Iberoamericano en "Software Engineering" (CIbSE'2010), ISBN: 978-9978-325-10-0. Eds. Xavier Franch, Itana Maria Sousa de Gimenes, and Juan-Pablo Carvallo. Cuenca, Ecuador: Universidad del Azuay, 2010. 149-162.
AbstractDomain Specic Languages (DSLs) can contribute to increment productivity, while reducing the required maintenance and programming expertise. We hypothesize that Software Languages Engineering (SLE) developers consistently skip, or relax, Language Evaluation. Based on the experience of engineering other types of software products, we assume that this may potentially lead to the deployment of inadequate languages. The fact that the languages already deal with concepts from the problem domain, and not the solution domain, is not enough to validate several issues at stake, such as its expressiveness, usability,
effectiveness, maintainability, or even the domain expert's productivity while using them. We present a systematic review on articles published in top ranked venues, from 2001 to 2008, which report DSLs' construction, to characterize the common practice. This work conrms our initial hypothesis and lays the ground for the discussion on how to include a systematic approach to DSL evaluation in the SLE process.
Teixeira, Bruno, João Louren{\c c}o, Eitan Farchi, Ricardo Dias, and Diogo Sousa. "
Detection of Transactional Memory anomalies using static analysis."
Proceedings of the 8th Workshop on Parallel and Distributed Systems: Testing, Analysis, and Debugging. PADTAD ’10. New York, NY, USA: ACM, 2010. 26-36.
AbstractTransactional Memory allows programmers to reduce the number of synchronization errors introduced in concurrent programs, but does not ensures its complete elimination. This paper proposes a pattern matching based approach to the static detection of atomicity violation, based on a path-sensitive symbolic execution method to model four anomalies that may affect Transactional Memory programs. The proposed technique may be used to to bring to programmer’s attention pairs of transactions that the programmer has mis-specified, and should have been combined into a single transaction. The algorithm first traverses the AST tree, removing all the non-transactional blocks and generating a trace tree in the path sensitive manner for each thread. The trace tree is a Trie like data structure, where each path from root to a leaf is a list of transactions. For each pair of threads, erroneous patterns involving two consecutive transactions are then checked in the trace tree. Results allow to conclude that the proposed technique, although triggering a moderate number of false positives, can be successfully applied to Java programs, correctly identifying the vast majority of the relevant erroneous patterns.