Sciweavers

644 search results - page 106 / 129
» Precedence Automata and Languages
Sort
View
PODS
2004
ACM
86views Database» more  PODS 2004»
14 years 8 months ago
Frontiers of Tractability for Typechecking Simple XML Transformations
Typechecking consists of statically verifying whether the output of an XML transformation is always conform to an output type for documents satisfying a given input type. We focus...
Wim Martens, Frank Neven
CSL
2009
Springer
14 years 3 months ago
Algorithmic Analysis of Array-Accessing Programs
For programs whose data variables range over boolean or finite domains, program verification is decidable, and this forms the basis of recent tools for software model checking. I...
Rajeev Alur, Pavol Cerný, Scott Weinstein
ICIW
2007
IEEE
14 years 2 months ago
Web Service Composition Approaches: From Industrial Standards to Formal Methods
Abstract— Composition of web services is much studied to support business-to-business and enterprise application integration in e-Commerce. Current web service composition approa...
Maurice H. ter Beek, Antonio Bucchiarone, Stefania...
ICALP
2007
Springer
14 years 2 months ago
Minimum-Time Reachability in Timed Games
Abstract. We consider the minimum-time reachability problem in concurrent two-player timed automaton game structures. We show how to compute the minimum time needed by a player to ...
Thomas Brihaye, Thomas A. Henzinger, Vinayak S. Pr...
CP
2004
Springer
14 years 1 months ago
Deriving Filtering Algorithms from Constraint Checkers
Abstract. This article deals with global constraints for which the set of solutions can be recognized by an extended finite automaton whose size is bounded by a polynomial in n, w...
Nicolas Beldiceanu, Mats Carlsson, Thierry Petit