Martins, R., L. Pereira, P. Barquinha, N. Correia, G. Gonçalves, I. Ferreira, C. Dias, and E. Fortunato. "
{Floating gate memory paper transistor}." Eds. Ferechteh H. Teherani, David C. Look, Cole W. Litton, and David J. Rogers. Vol. 7603. 2010. 760314–11.
Abstractn/a
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.
Duro, Nuno, Rui Santos, João M. Lourenço, Hervé Paulino, and João André Martins. "
Open virtualization framework for testing Ground Systems."
Proceedings of the International Workshop on Parallel and Distributed Systems: Testing, Analysis, and Debugging. Ed. Shmuel Ur João Lourenço, Eitan Farchi. ACM Electronic Library, 2010. 67-73.
Abstractn/a
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.