Sciweavers

1634 search results - page 315 / 327
» Reasoning about Knowledge Using Rough Sets
Sort
View
AI
2003
Springer
14 years 27 days ago
Negotiating Exchanges of Private Information for Web Service Eligibility
Private information about individuals that engage in e-commerce business transactions is of economic value to businesses for market analysis and for identifying possible future par...
Keping Jia, Bruce Spencer
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
ASPLOS
2011
ACM
12 years 11 months ago
Specifying and checking semantic atomicity for multithreaded programs
In practice, it is quite difficult to write correct multithreaded programs due to the potential for unintended and nondeterministic interference between parallel threads. A funda...
Jacob Burnim, George C. Necula, Koushik Sen
PLDI
2011
ACM
12 years 10 months ago
The tao of parallelism in algorithms
For more than thirty years, the parallel programming community has used the dependence graph as the main abstraction for reasoning about and exploiting parallelism in “regular...
Keshav Pingali, Donald Nguyen, Milind Kulkarni, Ma...
PLDI
2012
ACM
11 years 10 months ago
Dynamic synthesis for relaxed memory models
Modern architectures implement relaxed memory models which may reorder memory operations or execute them non-atomically. Special instructions called memory fences are provided, al...
Feng Liu, Nayden Nedev, Nedyalko Prisadnikov, Mart...