Sciweavers

1023 search results - page 160 / 205
» A Formal Method for Program Slicing
Sort
View
WWW
2009
ACM
16 years 2 months ago
Discovering the staring people from social networks
In this paper, we study a novel problem of staring people discovery from social networks, which is concerned with finding people who are not only authoritative but also sociable i...
Dewei Chen, Jie Tang, Juanzi Li, Lizhu Zhou
CAV
2007
Springer
126views Hardware» more  CAV 2007»
15 years 7 months ago
Shape Analysis for Composite Data Structures
We propose a shape analysis that adapts to some of the complex composite data structures found in industrial systems-level programs. Examples of such data structures include “cyc...
Josh Berdine, Cristiano Calcagno, Byron Cook, Dino...
JMLR
2012
13 years 3 months ago
Joint Learning of Words and Meaning Representations for Open-Text Semantic Parsing
Open-text semantic parsers are designed to interpret any statement in natural language by inferring a corresponding meaning representation (MR – a formal representation of its s...
Antoine Bordes, Xavier Glorot, Jason Weston, Yoshu...
ECOOP
2005
Springer
15 years 7 months ago
Prototypes with Multiple Dispatch: An Expressive and Dynamic Object Model
Two object-oriented programming language paradigms— dynamic, prototype-based languages and multi-method languages— provide orthogonal benefits to software engineers. These two...
Lee Salzman, Jonathan Aldrich
FM
2009
Springer
104views Formal Methods» more  FM 2009»
15 years 8 months ago
A Smooth Combination of Linear and Herbrand Equalities for Polynomial Time Must-Alias Analysis
Abstract. We present a new domain for analyzing must-equalities between address expressions. The domain is a smooth combination of Herbrand and affine equalities which enables us t...
Helmut Seidl, Vesal Vojdani, Varmo Vene