Sciweavers

3738 search results - page 242 / 748
» Parametrized Logic Programming
Sort
View
LFCS
2007
Springer
15 years 10 months ago
Reasoning About Sequences of Memory States
Abstract. In order to verify programs with pointer variables, we introduce a temporal logic LTLmem whose underlying assertion language is the quantifier-free fragment of separatio...
Rémi Brochenin, Stéphane Demri, &Eac...
GCC
2003
Springer
15 years 9 months ago
Toward the Composition of Semantic Web Services
This paper introduces a method for automatic composition of semantic web services using linear logic theorem proving. The method uses semantic web service language (DAML-S) for ext...
Jinghai Rao, Xiaomeng Su
ACSC
2009
IEEE
15 years 11 months ago
ParaAJ: toward Reusable and Maintainable Aspect Oriented Programs
Aspect Oriented Programming (AOP) aims to ease maintenance and promote reuse of software components by separating core concerns from crosscutting concerns: aspects of a program th...
Khalid Al-Jasser, Peter Schachte
MP
2006
87views more  MP 2006»
15 years 4 months ago
Convexity and decomposition of mean-risk stochastic programs
Abstract. Traditional stochastic programming is risk neutral in the sense that it is concerned with the optimization of an expectation criterion. A common approach to addressing ri...
Shabbir Ahmed
ICFP
2006
ACM
16 years 4 months ago
An object-oriented approach to datatype-generic programming
Datatype-generic programming (DGP) is the next step beyond abstracting over types using parametric polymorphism, which is often called "genericity" in object-oriented la...
Adriaan Moors, Frank Piessens, Wouter Joosen