590 search results - page 91 / 118 » Non-Failure Analysis for Logic Programs |
CTCS
1989
Springer
14 years 25 days ago
1989
Springer
We introduce the notion of a candidate for “multiple valued universal constructions” and define stable functors (which generalise functors with left adjoints) in terms of fac...
PEPM
1993
ACM
14 years 25 days ago
1993
ACM
For a functional programming language with a lazy standard semantics, we define a strictness analysis by means of abstract interpretation. Using the information from the strictne...
PPOPP
2011
ACM
12 years 11 months 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...
PAM
2012
Springer
12 years 4 months ago
2012
Springer
Network administrators are faced with the increasingly challenging task of monitoring their network’s health in real time, drawing upon diverse and voluminous measurement data fe...
TPHOL
2007
IEEE
14 years 3 months ago
2007
IEEE
We formalise the data race free (DRF) guarantee provided by Java, as captured by the semi-formal Java Memory Model (JMM) [1] and published in the Java Language Specification [2]. ...