Sciweavers

24 search results - page 4 / 5
» Symmetry Reduction for SAT Representations of Transition Sys...
Sort
View
TACAS
2010
Springer
191views Algorithms» more  TACAS 2010»
14 years 6 days ago
Blocked Clause Elimination
Boolean satisfiability (SAT) and its extensions are becoming a core technology for the analysis of systems. The SAT-based approach divides into three steps: encoding, preprocessin...
Matti Järvisalo, Armin Biere, Marijn Heule
ASPDAC
2001
ACM
126views Hardware» more  ASPDAC 2001»
13 years 9 months ago
A new partitioning scheme for improvement of image computation
Abstract-- Image computation is the core operation for optimization and formal verification of sequential systems like controllers or protocols. State exploration techniques based ...
Christoph Meinel, Christian Stangier
PPDP
2004
Springer
13 years 10 months ago
Characterizing strong normalization in a language with control operators
We investigate some fundamental properties of the reduction relation in the untyped term calculus derived from Curien and Herbelin’s λµµ. The original λµµ has a system of ...
Daniel J. Dougherty, Silvia Ghilezan, Pierre Lesca...
FSTTCS
1998
Springer
13 years 9 months ago
Partial Order Reductions for Bisimulation Checking
Partial order methods have been introduced to avoid the state explosion problem in veri cation resulting from the representation of multiple interleavings of concurrent transitions...
Michaela Huhn, Peter Niebert, Heike Wehrheim
CALCO
2005
Springer
114views Mathematics» more  CALCO 2005»
13 years 10 months ago
Towards a Coalgebraic Semantics of the Ambient Calculus
Recently, various process calculi have been introduced which are suited for the modelling of mobile computation and in particular the mobility of program code; a prominent example ...
Daniel Hausmann, Till Mossakowski, Lutz Schrö...