10899 search results - page 350 / 2180 » The GP Programming System |
200
click to vote
ENTCS
2007
15 years 6 months ago
2007
In modern functional logic languages like Curry or Toy, programs are possibly non-confluent and nonterminating rewrite systems, defining possibly non-deterministic non-strict fu...
188
click to vote
TOCS
2002
15 years 6 months ago
2002
This paper presents secure program partitioning, a language-based technique for protecting confidential data during computation in distributed systems containing mutually untruste...
267
click to vote
RTA
2011
Springer
14 years 9 months ago
2011
Springer
In [5, 15] we presented an approach to prove termination of non-recursive Java Bytecode (JBC) programs automatically. Here, JBC programs are first transformed to finite terminat...
207
click to vote
CC
2012
Springer
14 years 2 months ago
2012
Springer
The computational cost and precision of a shape style heap analysis is highly dependent on the way method calls are handled. This paper introduces a new approach to analyzing metho...
310
click to vote
PLDI
2009
ACM
16 years 7 months ago
2009
ACM
Reasoning about string variables, in particular program inputs, is an important aspect of many program analyses and testing frameworks. Program inputs invariably arrive as strings...