Sciweavers

811 search results - page 25 / 163
» Refactoring Using Type Constraints
Sort
View
PLANX
2008
13 years 10 months ago
Linear Time Membership for a Class of XML Types with Interleaving and Counting
Regular Expressions (REs) form the basis of most XML type languages, such as DTDs, XML Schema types, and XDuce types (Thompson et al. 2004; Hosoya and Pierce 2003). In this contex...
Giorgio Ghelli, Dario Colazzo, Carlo Sartiani
TACAS
2007
Springer
125views Algorithms» more  TACAS 2007»
14 years 2 months ago
Type-Dependence Analysis and Program Transformation for Symbolic Execution
Symbolic execution can be problematic when applied to real applications. This paper addresses two of these problems: (1) the constraints generated during symbolic execution may be ...
Saswat Anand, Alessandro Orso, Mary Jean Harrold
WWW
2001
ACM
14 years 9 months ago
A unified constraint model for XML
Integrity constraints are an essential part of a modern schema definition language. They are useful for semantic specification, update consistency control, query optimization, inf...
Gabriel M. Kuper, Jérôme Siméo...
PLDI
2003
ACM
14 years 1 months ago
Ownership types for safe region-based memory management in real-time Java
The Real-Time Specification for Java (RTSJ) allows a program to create real-time threads with hard real-time constraints. Real-time threads use region-based memory management to ...
Chandrasekhar Boyapati, Alexandru Salcianu, Willia...
AAAI
1998
13 years 10 months ago
On the Computation of Local Interchangeability in Discrete Constraint Satisfaction Problems
In [4], Freuderdefines several types of interchangeability to capture the equivalenceamongthe valuesof a variable in a discrete constraint satisfaction problem(CSP), and provides ...
Berthe Y. Choueiry, Guevara Noubir