Sciweavers

793 search results - page 57 / 159
» Argumentation and standards of proof
Sort
View
105
Voted
DAC
1994
ACM
15 years 4 months ago
BDD Variable Ordering for Interacting Finite State Machines
We address the problem of obtaining good variable orderings for the BDD representation of a system of interacting finite state machines (FSMs). Orderings are derived from the comm...
Adnan Aziz, Serdar Tasiran, Robert K. Brayton
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
16 years 1 months ago
Intrinsic robustness of the price of anarchy
The price of anarchy (POA) is a worst-case measure of the inefficiency of selfish behavior, defined as the ratio of the objective function value of a worst Nash equilibrium of a g...
Tim Roughgarden
95
Voted
DATE
2002
IEEE
83views Hardware» more  DATE 2002»
15 years 5 months ago
Reconfigurable SoC - What Will it Look Like?
The argument against ASIC SoCs is that they have always taken too long and cost too much to design. As new process technologies come on line, the issue of inflexible, unyielding d...
J. Bryan Lewis, Ivo Bolsens, Rudy Lauwereins, Chri...
99
Voted
IJCCBS
2010
105views more  IJCCBS 2010»
14 years 11 months ago
Software safety: relating software assurance and software integrity
: The overall safety integrity of a safety critical system, comprising both software and hardware, is typically specified quantitatively, e.g., in terms of failure rates. However, ...
Ibrahim Habli, Richard Hawkins, Tim Kelly
97
Voted
TPHOL
2008
IEEE
15 years 7 months ago
Nominal Inversion Principles
When reasoning about inductively defined predicates, such as typing judgements or reduction relations, proofs are often done by inversion, that is by a case analysis on the last r...
Stefan Berghofer, Christian Urban