Sciweavers

1776 search results - page 136 / 356
» Using a Logic Programming Language with Persistence and Cont...
Sort
View
AOSD
2009
ACM
15 years 10 months ago
The art of the meta-aspect protocol
ive semantics for aspect-oriented abstractions can be defined by language designers using extensible aspect compiler frameworks. However, application developers are prevented fro...
Tom Dinkelaker, Mira Mezini, Christoph Bockisch
IFIP
2009
Springer
15 years 7 months ago
Secure Information Flow for Distributed Systems
We present an abstract language for distributed systems of processes with local memory and private communication channels. Communication between processes is done via messaging. Th...
Rafael Alpízar, Geoffrey Smith
ICFP
2003
ACM
16 years 3 months ago
Representing reductions of NP-complete problems in logical frameworks: a case study
Under the widely believed conjecture P=NP, NP-complete problems cannot be solved exactly using efficient polynomial time algorithms. Furthermore, any instance of a NP-complete pro...
Carsten Schürmann, Jatin Shah
WCRE
1997
IEEE
15 years 7 months ago
Generation of Components for Software Renovation Factories from Context-Free Grammars
We present an approach for the generation of components for a software renovation factory. These components are generated from a context-free grammar definition that recognizes t...
Mark van den Brand, M. P. A. Sellink, Chris Verhoe...
IPL
2007
78views more  IPL 2007»
15 years 3 months ago
Ensuring the quasi-termination of needed narrowing computations
We present a characterization of first-order functional programs which are quasiterminating w.r.t. the symbolic execution mechanism of needed narrowing, i.e., computations in the...
J. Guadalupe Ramos, Josep Silva, Germán Vid...