Sciweavers

361 search results - page 26 / 73
» Parallel Model Checking for Temporal Epistemic Logic
Sort
View
VSTTE
2005
Springer
14 years 29 days ago
Model Checking: Back and Forth between Hardware and Software
The interplay back and forth between software model checking and hardware model checking has been fruitful for both. Originally intended for the analysis of concurrent software, mo...
Edmund M. Clarke, Anubhav Gupta, Himanshu Jain, He...
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...
LMCS
2007
132views more  LMCS 2007»
13 years 7 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
ENTCS
2007
134views more  ENTCS 2007»
13 years 7 months ago
A Compact Linear Translation for Bounded Model Checking
We present a syntactic scheme for translating future-time LTL bounded model checking problems into propositional satisfiability problems. The scheme is similar in principle to th...
Paul B. Jackson, Daniel Sheridan
SPIN
2001
Springer
13 years 12 months ago
p2b: A Translation Utility for Linking Promela and Symbolic Model Checking (Tool Paper)
p2b is a research tool that translates Promela programs to boolean representations of the automata associated with them. These representations conform to the input syntax of the wi...
Michael Baldamus, Jochen Schröder-Babo