275 search results - page 41 / 55 » Non-Termination Inference of Logic Programs |
101
click to vote
PPOPP
2011
ACM
14 years 16 days ago
2011
ACM
We propose a cooperative methodology for multithreaded software, where threads use traditional synchronization idioms such as locks, but additionally document each point of potent...
260
click to vote
DAC
2012
ACM
13 years 3 days ago
2012
ACM
In this paper we introduce Chisel, a new hardware construction language that supports advanced hardware design using highly parameterized generators and layered domain-specific h...
185
click to vote
POPL
2007
ACM
15 years 10 months ago
2007
ACM
ML modules and Haskell type classes have proven to be highly effective tools for program structuring. Modules emphasize explicit configuration of program components and the use of...
170
click to vote
POPL
2009
ACM
15 years 10 months ago
2009
ACM
This paper describes a compositional shape analysis, where each procedure is analyzed independently of its callers. The analysis uses an abstract domain based on a restricted frag...
ENTCS
2000
14 years 9 months ago
2000
Substitution plays an important role in Hoare Logic, as it is used in interpreting assignments. When writing a computer-based realization of Hoare Logic, it is therefore important...