Sciweavers

505 search results - page 2 / 101
» Global Model Checking of Ordered Multi-Pushdown Systems
Sort
View
FSTTCS
2010
Springer
13 years 8 months ago
The Complexity of Model Checking (Collapsible) Higher-Order Pushdown Systems
We study (collapsible) higher-order pushdown systems -- theoretically robust and well-studied models of higher-order programs -- along with their natural subclass called (collapsi...
Matthew Hague, Anthony Widjaja To
TACAS
2010
Springer
342views Algorithms» more  TACAS 2010»
14 years 5 months ago
SAT Based Bounded Model Checking with Partial Order Semantics for Timed Automata
We study the model checking problem of timed automata based on SAT solving. Our work investigates alternative possibilities for coding the SAT reductions that are based on parallel...
Janusz Malinowski, Peter Niebert
FMCAD
1998
Springer
14 years 3 months ago
Combining Symbolic Model Checking with Uninterpreted Functions for Out-of-Order Processor Verification
We present a new approach to the verification of hardware systems with data dependencies using temporal logic symbolic model checking. As a benchmark we take Tomasulo's algori...
Sergey Berezin, Armin Biere, Edmund M. Clarke, Yun...
FIW
2007
133views Communications» more  FIW 2007»
14 years 6 days ago
Conflict Detection in Call Control Using First-Order Logic Model Checking
Feature interaction detection methods, whether online or offline, depend on previous knowledge of conflicts between the actions executed by the features. This knowledge is usually ...
Ahmed F. Layouni, Luigi Logrippo, Kenneth J. Turne...
LMCS
2007
132views more  LMCS 2007»
13 years 10 months ago
The Complexity of Model Checking Higher-Order Fixpoint Logic
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...
Roland Axelsson, Martin Lange, Rafal Somla