Sciweavers

138 search results - page 19 / 28
» Linear Encodings of Bounded LTL Model Checking
Sort
View
CAV
2003
Springer
145views Hardware» more  CAV 2003»
15 years 5 months ago
Monitoring Temporal Rules Combined with Time Series
Run-time monitoring of temporal properties and assertions is used for testing and as a component of execution-based model checking techniques. Traditional run-time monitoring howev...
Doron Drusinsky
IJFCS
2006
110views more  IJFCS 2006»
14 years 11 months ago
Sat-based Model Checking for Region Automata
For successful software verification, model checkers must be capable of handling a large number of program variables. Traditional, BDD-based model checking is deficient in this re...
Fang Yu, Bow-Yaw Wang
LMCS
2007
132views more  LMCS 2007»
14 years 11 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
JSW
2007
156views more  JSW 2007»
14 years 11 months ago
An Automatic Test Case Generation Framework for Web Services
— BPEL (Business Process Execution Language) as a de-facto standard for web service orchestration has drawn particularly attention from researchers and industries. BPEL is a semi...
Yongyan Zheng, Jiong Zhou, Paul Krause
CORR
2010
Springer
149views Education» more  CORR 2010»
14 years 12 months ago
Lower Bounds for the Complexity of Monadic Second-Order Logic
Courcelle's famous theorem from 1990 states that any property of graphs definable in monadic second-order logic (MSO2) can be decided in linear time on any class of graphs of ...
Stephan Kreutzer, Siamak Tazari