Sciweavers

97 search results - page 9 / 20
» Making Nondeterminism Unambiguous
Sort
View
156
Voted
ISSRE
2002
IEEE
15 years 8 months ago
Toward A Quantifiable Definition of Software Faults
An important aspect of developing models relating the number and type of faults in a software system to a set of structural measurement is defining what constitutes a fault. By de...
John C. Munson, Allen P. Nikora
OOPSLA
2009
Springer
15 years 10 months ago
The design of a task parallel library
The Task Parallel Library (TPL) is a library for .NET that makes it easy to take advantage of potential parallelism in a program. The library relies heavily on generics and delega...
Daan Leijen, Wolfram Schulte, Sebastian Burckhardt
SAT
2009
Springer
113views Hardware» more  SAT 2009»
15 years 10 months ago
Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
Abstract. We offer a new understanding of some aspects of practical SAT-solvers that are based on DPLL with unit-clause propagation, clause-learning, and restarts. On the theoreti...
Albert Atserias, Johannes Klaus Fichte, Marc Thurl...
IPPS
2006
IEEE
15 years 10 months ago
Aligning traces for performance evaluation
For many performance analysis problems, the ability to reason across traces is invaluable. However, due to non-determinism in the OS and virtual machines, even two identical runs ...
Todd Mytkowicz, Amer Diwan, Matthias Hauswirth, Pe...
ATVA
2005
Springer
111views Hardware» more  ATVA 2005»
15 years 9 months ago
Model Checking Prioritized Timed Automata
Abstract. Priorities are often used to resolve conflicts in timed systems. However, priorities are not directly supported by state-of-art model checkers. Often, a designer has to ...
Shang-Wei Lin, Pao-Ann Hsiung, Chun-Hsian Huang, Y...