Sciweavers

850 search results - page 13 / 170
» A Logic Programming Language Based on Binding Algebras
Sort
View
LOBJET
2006
127views more  LOBJET 2006»
13 years 7 months ago
A Definition, Overview and Taxonomy of Generic Aspect Languages
ABSTRACT. Aspect-orientation promises better modularity than pure object-oriented decomposition. A typical benefit of increased modularity is ease of maintenance, evolution and reu...
Günter Kniesel, Tobias Rho
APIN
1998
98views more  APIN 1998»
13 years 7 months ago
The Evolution of Concurrent Programs
Process algebra are formal languages used for the rigorous specification and analysis of concurrent systems. By using a process algebra as the target language of a genetic program...
Brian J. Ross
PEPM
1993
ACM
13 years 11 months ago
Binding-Time Analysis and the Taming of C Pointers
The aim of binding-time analysis is to determine when variables, expressions, statements, etc. in a program can be evaluated by classifying these into static (compile-time) and dy...
Lars Ole Andersen
AC
1992
Springer
13 years 11 months ago
Logic and Databases
Logic and databases have gone a long way together since the advent of relational databases. Already the rst basic query languages for relational databases beside relational algebra...
Johann Eder
IJSSE
2011
127views more  IJSSE 2011»
13 years 2 months ago
A Formal Language for XML Authorisations Based on Answer Set Programming and Temporal Interval Logic Constraints
The Extensible Markup Language is susceptible to security breaches because it does not incorporate methods to protect the information it encodes. Our work presented in this paper f...
Sean Policarpio, Yan Zhang