Sciweavers

159 search results - page 23 / 32
» Verifying the Equivalence of Logic Programs in the Disjuncti...
Sort
View
BIRTHDAY
2003
Springer
14 years 19 days ago
Bounded Fairness
Abstract. Bounded fairness is a stronger notion than ordinary eventuality-based fairness, one that guarantees occurrence of an event within a fixed number of occurrences of anothe...
Nachum Dershowitz, D. N. Jayasimha, Seungjoon Park
ARTMED
2010
119views more  ARTMED 2010»
13 years 7 months ago
Fuzzy Arden Syntax: A fuzzy programming language for medicine
Objective: The programming language Arden Syntax has been optimised for use in clinical decision support systems. We describe an extension of this language named Fuzzy Arden Synta...
Thomas Vetterlein, Harald Mandl, Klaus-Peter Adlas...
AGP
1999
IEEE
13 years 11 months ago
Widening Sharing
We study the problem of an efficient and precise sharing analysis of (constraint) logic programs. After recognizing that neither aring nor its non-redundant (but equivalent) abstra...
Enea Zaffanella, Roberto Bagnara, Patricia M. Hill
SIGCOMM
2010
ACM
13 years 7 months ago
The case for active device drivers
We revisit the device-driver architecture supported by the majority of operating systems, where a driver is a passive object that does not have its own thread of control and is on...
Leonid Ryzhyk, Yanjin Zhu, Gernot Heiser
ICSE
2010
IEEE-ACM
13 years 9 months ago
DETERMIN: inferring likely deterministic specifications of multithreaded programs
The trend towards multicore processors and graphic processing units is increasing the need for software that can take advantage of parallelism. Writing correct parallel programs u...
Jacob Burnim, Koushik Sen