Sciweavers

41 search results - page 5 / 9
» A Language for Specifying Complete Timetabling Problems
Sort
View
CADE
2008
Springer
14 years 7 months ago
Automated Induction with Constrained Tree Automata
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...
Adel Bouhoula, Florent Jacquemard
DAC
2005
ACM
14 years 8 months ago
Towards scalable flow and context sensitive pointer analysis
Pointer analysis, a classic problem in software program analysis, has emerged as an important problem to solve in design automation, at a time when complex designs, specified in t...
Jianwen Zhu
CIKM
2008
Springer
13 years 9 months ago
A heuristic approach for checking containment of generalized tree-pattern queries
Query processing techniques for XML data have focused mainly on tree-pattern queries (TPQs). However, the need for querying XML data sources whose structure is very complex or not...
Pawel Placek, Dimitri Theodoratos, Stefanos Soulda...
COMPSAC
2010
IEEE
13 years 5 months ago
Synchronized Architecture Evolution in Software Product Line Using Bidirectional Transformation
In the long-term evolution of a Software Product Line (SPL), how to ensure the alignment between the reference and application architectures is a critical problem. Existing ad-hoc...
Liwei Shen, Xin Peng, Jiayi Zhu, Wenyun Zhao
CIKM
2006
Springer
13 years 11 months ago
Heuristic containment check of partial tree-pattern queries in the presence of index graphs
The wide adoption of XML has increased the interest of the database community on tree-structured data management techniques. Querying capabilities are provided through tree-patter...
Dimitri Theodoratos, Stefanos Souldatos, Theodore ...