528 search results - page 83 / 106 » Transition Logic Revisited |
124
click to vote
DAC
1994
ACM
15 years 5 months ago
1994
ACM
In this paper, we revisit the classical problem of functional decomposition [1, 2] that arises so often in logic synthesis. One basic problem that has remained largely unaddressed...
145
Voted
PASTE
2010
ACM
15 years 3 months ago
2010
ACM
Many analysis techniques have been proposed to determine when a potentially null value may be dereferenced. But we have observed in practice that not every potential null derefere...
132
click to vote
SIGCOMM
2010
ACM
15 years 2 months ago
2010
ACM
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...
115
Voted
ICFP
2010
ACM
15 years 3 months ago
2010
ACM
Reasoning about program equivalence is one of the oldest problems in semantics. In recent years, useful techniques have been developed, based on bisimulations and logical relation...
152
Voted
POPL
2011
ACM
14 years 4 months ago
2011
ACM
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...