Sciweavers

1702 search results - page 13 / 341
» Doomed program points
Sort
View
ICLP
2001
Springer
15 years 7 months ago
Alternating Fixed Points in Boolean Equation Systems as Preferred Stable Models
We formally characterize alternating fixed points of boolean equation systems as models of (propositional) normal logic programs. To this end, we introduce the notion of a preferr...
K. Narayan Kumar, C. R. Ramakrishnan, Scott A. Smo...
105
Voted
EACL
1993
ACL Anthology
15 years 3 months ago
Tuples, Discontinuity, and Gapping in Categorial Grammar
This paper solves some puzzles in the formalisation of logic for discontinuity in categorial grammar. A ‘tuple’ operation introduced in [Solias, 1992] is defined as a mode of...
Glyn Morrill, Teresa Solias
144
Voted
AOSD
2008
ACM
15 years 4 months ago
Test-based pointcuts for robust and fine-grained join point specification
We propose test-based pointcuts, a novel pointcut mechanism for AspectJ-like aspect-oriented programming languages. The idea behind the test-based pointcuts is to specify join poi...
Kouhei Sakurai, Hidehiko Masuhara
107
Voted
ISPASS
2007
IEEE
15 years 8 months ago
Cross Binary Simulation Points
Architectures are usually compared by running the same workload on each architecture and comparing performance. When a single compiled binary of a program is executed on many diff...
Erez Perelman, Jeremy Lau, Harish Patil, Aamer Jal...
ECOOP
2004
Springer
15 years 8 months ago
An AOP Implementation Framework for Extending Join Point Models
Mechanisms in AOP (aspect-oriented programming) can be characterized by a JPM (join point model). AOP is effective in unanticipated software evolution because crosscutting concer...
Naoyasu Ubayashi, Hidehiko Masuhara, Tetsuo Tamai