Martin A. Musicante | Universidade Federal do Rio Grande do Norte (original) (raw)

Uploads

Papers by Martin A. Musicante

Journal of Universal Computer Science, 2003

We present Maude Object-Oriented Action Tool, an executable environment that incorporates element... more We present Maude Object-Oriented Action Tool, an executable environment that incorporates elements from for Object-Oriented and Constructive Action Semantics. Our tool is implemented as a conservative extension of Full Maude and Maude MSOS Tool. The syntax used by our tool is fairly similar to the one used by the original Action Semantics formalism. Furthermore, we present an Object-Oriented Action Semantics library of classes, capable of supporting constructive (object-oriented) action semantics.

Electronic Notes in Theoretical Computer Science, 2008

... [13] Mart????-Oliet, N. and J. Meseguer, Rewriting logic as a logical and semantic framework,... more ... [13] Mart????-Oliet, N. and J. Meseguer, Rewriting logic as a logical and semantic framework, Technical report, SRI International (1993). [14] Meseguer, J. and C. Braga, Modular rewriting semantics of programming languages, in: C. Rattray, S. Maharaj and C. Shankland, editors, In ...

Page 1. LFL: A Library of Generic Classes for Object-Oriented Action Semantics Marcelo Araújo Fed... more Page 1. LFL: A Library of Generic Classes for Object-Oriented Action Semantics Marcelo Araújo Federal University of Paraná, Computer Science Department POBox 19081 - Curitiba - PR -Brazil Email: araujo@inf.ufpr.br Martin ...

Journal of Universal Computer Science, 2007

Science of Computer Programming, 2010

Electronic Notes in Theoretical Computer Science, 2009

Informatica (slovenia), 2007

PEWS (Predicate Path Expression for Web Services) is a programming language for the definition of... more PEWS (Predicate Path Expression for Web Services) is a programming language for the definition of web service behavioral interfaces. PEWS programs can be used for the description of both simple and composite web services. Simple web services can be built from scratch, by the combination of operations defined in a WSDL description file. Composite web services are constructed from the combination of existing web services, accessed by using their WSDL descriptions. PEWS operators help to define the order in which web services and operations will be performed. This paper presents a PEWS programs edition environment. This environment is in the form of a web interface that enables programmers to edit, test and run composition specifications. The front-end of the environment, i.e. the web interface, interacts with the back-end, a server-side application, for the specification analysis. Our platform offers the possibility of an automatic translation of a PEWS specification into a Java program skeleton, directly executable, to call the web service operations and perform them in the order defined by the PEWS specification. Thus, the use of this platform can help reducing the time for development of the compositions

ABSTRACT Algorithms for validation play a crucial role in the use of XML. Our main contribution i... more ABSTRACT Algorithms for validation play a crucial role in the use of XML. Our main contribution is the implementation of a general and linear time validation method for XML documents capable of verifying schema constraints imposed by any schema language such as DTD, XML- Schema and specialized DTD. This method is based on the execution of an unranked bottom-up tree automaton. The implementation is done in ASF+SDF, a meta-environment for language design.

We introduce a method for building an XML constraint validator from a given set of schema, key an... more We introduce a method for building an XML constraint validator from a given set of schema, key and foreign key constraints. The XML constraint validator obtained by our method is a bottom-up tree transducer that is used not only for checking, in only one pass, the correctness of an XML document but also for incrementally validating updates over this document. In this way, both the verification from scratch and the update verification are based on regular (finite and tree) automata, making the whole process efficient.

Given a regular expression E and a word w belonging to the language associated to E (i.e. w ∈ L(E... more Given a regular expression E and a word w belonging to the language associated to E (i.e. w ∈ L(E)), we consider the following problem: Let the word w' be obtained from w by adding or removing one symbol. In this case, we are interested in building new regular expressions E' such are similar to E and such that L(E) ∪ {w'} ⊆ L(E'). The new regular expressions are computed by an algorithm called GREC that performs changes on a finite state automaton accepting L(E), in order to derive the new regular expressions E'. Our method consists in proposing different choices, permitting the evolution of the data belonging to an application. As the final choice depends on the intended semantics for the data, it is left to an advised user.

Page 42. Tree Automata to Verify XML Key Constraints Béatrice Bouchou Université de Tours LI/Ante... more Page 42. Tree Automata to Verify XML Key Constraints Béatrice Bouchou Université de Tours LI/Antenne Univ. de Blois 3 place Jean Jaures 41000 Blois, France bouchou@ univ-tours. fr Mırian Halfeld Ferrari Université de Tours LI/Antenne Univ. ...

Journal of Universal Computer Science, 2005

Journal of Universal Computer Science, 2006

... Edinardo Potrich Post-Graduate Program on Informatics Potifical Catholic University of Parana... more ... Edinardo Potrich Post-Graduate Program on Informatics Potifical Catholic University of Parana Curitiba, PR, Brazil edinardo@ppgia.pucpr.br Marcos Aurelio Carrero Dep. ... [16] NC Schaller, GH Hilderink, and PH Welch. Using java for parallel computing - jcsp versus ctj. ...