Sciweavers

2661 search results - page 91 / 533
» A Semantics for Abstraction
Sort
View
LFP
1992
78views more  LFP 1992»
15 years 7 months ago
A Syntactic Approach to Fixed Point Computation on Finite Domains
We propose a syntactic approach to performing fixed point computation on finite domains. Finding fixed points in finite domains for monotonic functions is an essential task when c...
Tyng-Ruey Chuang, Benjamin Goldberg
CLA
2004
15 years 7 months ago
Concept Lattice Generation by Singular Value Decomposition
Abstract. Latent semantic indexing (LSI) is an application of numerical method called singular value decomposition (SVD), which discovers latent semantic in documents by creating c...
Petr Gajdos, Pavel Moravec, Václav Sn&aacut...
OOPSLA
2007
Springer
16 years 16 days ago
Dependent classes
Dependent Classes Vaidas Gasiunas and Mira Mezini Technische Universit¨at Darmstadt, Germany Abstract. Dependent classes are parameterized classes, the interface and implementatio...
Vaidas Gasiunas, Mira Mezini, Klaus Ostermann
IAT
2009
IEEE
15 years 9 months ago
On the Acceptability of Meta-arguments
In this paper we introduce a theory of meta-argumentation, by using Dung’s theory of abstract argumentation to reason about itself. Metaarguments are generated from atomic argum...
Guido Boella, Leendert van der Torre, Serena Villa...
ICSE
2011
IEEE-ACM
14 years 10 months ago
MeCC: memory comparison-based clone detector
In this paper, we propose a new semantic clone detection e by comparing programs’ abstract memory states, which are computed by a semantic-based static analyzer. Our experimenta...
Heejung Kim, Yungbum Jung, Sunghun Kim, Kwangkeun ...