Sciweavers

18 search results - page 3 / 4
» Solving string constraints lazily
Sort
View
ESOP
2006
Springer
15 years 3 months ago
Polymorphic Type Inference for the JNI
We present a multi-lingual type inference system for checking type safety of programs that use the Java Native Interface (JNI). The JNI uses specially-formatted strings to represe...
Michael Furr, Jeffrey S. Foster
ICALP
2010
Springer
15 years 4 months ago
Pumping and Counting on the Regular Post Embedding Problem
Abstract. The Regular Post Embedding Problem is a variant of Post’s Correspondence Problem where one compares strings with the subword relation and imposes additional regular con...
Pierre Chambart, Philippe Schnoebelen
ICDAR
2003
IEEE
15 years 5 months ago
Form Reading based on Form-type Identification and Form-data Recognition
Form reading technology based on form-type identification and form-data recognition is proposed. This technology can solve difficulties in variety for reading different items on f...
Hiroshi Sako, Minenobu Seki, Naohiro Furukawa, His...
COCOON
2006
Springer
15 years 3 months ago
A Detachment Algorithm for Inferring a Graph from Path Frequency
: Inferring graphs from path frequency has been studied as an important problem which has a potential application to drug design and elucidation of chemical structures. Given a mul...
Hiroshi Nagamochi
TC
1998
14 years 11 months ago
Algorithms for Variable Length Subnet Address Assignment
In a computer network that consists of M subnetworks, the L-bit address of a machine consists of two parts: A pre x si that contains the address of the subnetwork to which the mac...
Mikhail J. Atallah, Douglas Comer