Sciweavers

161 search results - page 20 / 33
» Automated atomicity-violation fixing
Sort
View
CSL
2010
Springer
13 years 8 months ago
Energy and Mean-Payoff Games with Imperfect Information
We consider two-player games with imperfect information and quantitative objective. The game is played on a weighted graph with a state space partitioned into classes of indistingu...
Aldric Degorre, Laurent Doyen, Raffaella Gentilini...
DLOG
2010
13 years 5 months ago
Automata-Based Abduction for Tractable Diagnosis
Abstract. Abductive reasoning has been recognized as a valuable complement to deductive inference for tasks such as diagnosis and integration of incomplete information despite its ...
Thomas Hubauer, Steffen Lamparter, Michael Pirker
LICS
1994
IEEE
13 years 11 months ago
On the Parallel Complexity of Model Checking in the Modal Mu-Calculus
The modal mu-calculus is an expressive logic that can be used to specify safety and liveness properties of concurrent systems represented as labeled transition systems (LTSs). We ...
Shipei Zhang, Oleg Sokolsky, Scott A. Smolka
CSL
2009
Springer
13 years 11 months ago
Tree-Width for First Order Formulae
We introduce tree-width for first order formulae , fotw(). We show that computing fotw is fixed-parameter tractable with parameter fotw. Moreover, we show that on classes of formul...
Isolde Adler, Mark Weyer
DAC
2008
ACM
14 years 8 months ago
DeFer: deferred decision making enabled fixed-outline floorplanner
In this paper, we present DeFer -- a fast, high-quality and nonstochastic fixed-outline floorplanning algorithm. DeFer generates a non-slicing floorplan by compacting a slicing fl...
Jackey Z. Yan, Chris Chu