Sciweavers

54 search results - page 6 / 11
» Formal Language Constrained Path Problems
Sort
View
DOCENG
2006
ACM
14 years 1 months ago
Comparing XML path expressions
XPath is the standard declarative language for navigating XML data and returning a set of matching nodes. In the context of XSLT/XQuery analysis, query optimization, and XML type ...
Pierre Genevès, Nabil Layaïda
RECOMB
2005
Springer
14 years 7 months ago
Lower Bounds for Maximum Parsimony with Gene Order Data
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
Abraham Bachrach, Kevin Chen, Chris Harrelson, Rad...
GI
2001
Springer
13 years 12 months ago
Specifying Component Invariants with OCL
The “Object Constraint Language” (OCL) offers a formal notation for constraining model elements in UML diagrams. OCL consists of a navigational expression language which, for ...
Rolf Hennicker, Hubert Baumeister, Alexander Knapp...
COMPSAC
2002
IEEE
14 years 13 days ago
A Simple Mathematically Based Framework for Rule Extraction from an Arbitrary Programming Language
Programs use rules to dictate or constrain specific decisions or actions. These rules have typically been tested, revised, and updated continuously; therefore, they represent a su...
Frederick V. Ramsey, James J. Alpigini
FMCAD
2008
Springer
13 years 9 months ago
Augmenting a Regular Expression-Based Temporal Logic with Local Variables
The semantics of temporal logic is usually defined with respect to a word representing a computation path over a set of atomic propositions. A temporal logic formula does not contr...
Cindy Eisner, Dana Fisman