4126 search results - page 386 / 826 » Set based logic programming |
127
click to vote
SIGADA
2004
Springer
15 years 10 months ago
2004
Springer
Refactoring is a technique for restructuring code to improve its design. A tool for automatically applying refactoring transformations to Ada 95 programs is described. The tool is...
170
click to vote
SIGSOFT
2007
ACM
16 years 5 months ago
2007
ACM
We present an approach for checking code against rich specifications, based on existing work that consists of encoding the program in a relational logic and using a constraint sol...
155
click to vote
IPPS
2002
IEEE
15 years 9 months ago
2002
IEEE
The increasing gap between processor and memory performance has led to new architectural models for memory-intensive applications. In this paper, we use a set of memory-intensive ...
193
click to vote
ESWS
2009
Springer
15 years 2 months ago
2009
Springer
Abstract. In this paper we investigate the transformation of OWL-S process models to ISPL - the system description language for MCMAS, a symbolic model checker for multi agent syst...
118
click to vote
ICFP
2003
ACM
16 years 4 months ago
2003
ACM
The shift and reset operators, proposed by Danvy and Filinski, are powerful control primitives for capturing delimited continuations. Delimited continuation is a similar concept a...