Sciweavers

1157 search results - page 33 / 232
» Descriptive Complexity and Model Checking
Sort
View
STACS
2010
Springer
14 years 2 months ago
Branching-time Model Checking of One-counter Processes
One-counter processes (OCPs) are pushdown processes which operate only on a unary stack alphabet. We study the computational complexity of model checking computation tree logic (CT...
Stefan Göller, Markus Lohrey
ACSD
2004
IEEE
95views Hardware» more  ACSD 2004»
13 years 11 months ago
Guided Model Checking with a Bayesian Meta-heuristic
Abstract. This paper presents a formal verification algorithm for finding errors in models of complex concurrent systems. The algorithm improves explicit guided model checking by a...
Kevin D. Seppi, Michael Jones, Peter Lamborn
FMSD
2002
107views more  FMSD 2002»
13 years 7 months ago
Verification of Out-Of-Order Processor Designs Using Model Checking and a Light-Weight Completion Function
We present a new technique for verification of complex hardware devices that allows both generality andahighdegreeofautomation.Thetechniqueisbasedonournewwayofconstructinga"li...
Sergey Berezin, Edmund M. Clarke, Armin Biere, Yun...
CSFW
2012
IEEE
11 years 10 months ago
Gran: Model Checking Grsecurity RBAC Policies
—Role-based Access Control (RBAC) is one of the most widespread security mechanisms in use today. Given the growing complexity of policy languages and access control systems, ver...
Michele Bugliesi, Stefano Calzavara, Riccardo Foca...
CORR
2008
Springer
141views Education» more  CORR 2008»
13 years 7 months ago
Model checking memoryful linear-time logics over one-counter automata
We study complexity of the model-checking problems for LTL with registers (also known as freeze LTL and written LTL ) and for first-order logic with data equality tests (written F...
Stéphane Demri, Ranko Lazic, Arnaud Sangnie...