561 search results - page 87 / 113 » Slicing of Constraint Logic Programs |
ESOP
2004
Springer
15 years 3 months ago
2004
Springer
t) Peter W. O’Hearn Queen Mary, University of London In the 1960s Dijkstra suggested that, in order to limit the complexity of potential process interactions, concurrent programs...
ICFP
2010
ACM
14 years 10 months ago
2010
ACM
' abstraction theorem shows how a typing judgement in System F can be translated into a relational statement (in second order predicate logic) about inhabitants of the type. ...
78
Voted
ISMIS
2003
Springer
15 years 2 months ago
2003
Springer
As broadband access to the Internet becomes pervasive, the need for a 24 hours a day, seven days a week (24x7) interface within the client devices, requires a level of sophisticati...
PLDI
2003
ACM
15 years 2 months ago
2003
ACM
In prior work [15] we studied a language construct restrict that allows programmers to specify that certain pointers are not aliased to other pointers used within a lexical scope....
111
click to vote
PPDP
2010
Springer
14 years 8 months ago
2010
Springer
This paperdescribes the use of a powerful graph query language for querying programs, and a novel combination of transformations for generating efficient implementations of the q...