Sciweavers

367 search results - page 73 / 74
» A Rewriting Logic Sampler
Sort
View
PASTE
2010
ACM
13 years 9 months ago
Packrat parsers can handle practical grammars in mostly constant space
Packrat parsing is a powerful parsing algorithm presented by Ford in 2002. Packrat parsers can handle complicated grammars and recursive structures in lexical elements more easily...
Kota Mizushima, Atusi Maeda, Yoshinori Yamaguchi
CSCLP
2008
Springer
13 years 9 months ago
An Efficient Decision Procedure for Functional Decomposable Theories Based on Dual Constraints
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
Khalil Djelloul
DEBU
2008
136views more  DEBU 2008»
13 years 8 months ago
Towards a Unified Declarative and Imperative XQuery Processor
Since the birth of XML, the processing of XML query languages like XQuery/XQueryP has been widely researched in the academic and industrial communities. Most of the approaches con...
Zhen Hua Liu, Anguel Novoselsky, Vikas Arora
CSI
2007
89views more  CSI 2007»
13 years 7 months ago
Writing and executing ODP computational viewpoint specifications using Maude
The Reference Model of Open Distributed Processing (RM-ODP) is a joint standardization effort by ITU-T and ISO/IEC for the specification of large open distributed systems. RM-ODP ...
José Raúl Romero, Antonio Vallecillo...
ENTCS
2007
178views more  ENTCS 2007»
13 years 7 months ago
Recent Advances in Real-Time Maude
This paper gives an overview of recent advances in Real-Time Maude. Real-Time Maude extends the Maude rewriting logic tool to support formal specification and analysis of object-...
Peter Csaba Ölveczky, José Meseguer