Sciweavers

499 search results - page 45 / 100
» LTL satisfiability checking
Sort
View
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
WRLA
2010
14 years 10 months ago
The Linear Temporal Logic of Rewriting Maude Model Checker
Abstract. This paper presents the foundation, design, and implementation of the Linear Temporal Logic of Rewriting model checker as an extension of the Maude system. The Linear Tem...
Kyungmin Bae, José Meseguer
ICEIS
2006
IEEE
15 years 5 months ago
Filtering Unsatisfiable XPATH Queries
The satisfiability test checks, whether or not the evaluation of a query returns the empty set for any input document, and can be used in query optimization for avoiding the submis...
Jinghua Groppe, Sven Groppe
ENTCS
2008
110views more  ENTCS 2008»
14 years 12 months ago
A New Proposal Of Quasi-Solved Form For Equality Constraint Solving
Most well-known algorithms for equational solving are based on quantifier elimination. This technique iteratively eliminates the innermost block of existential/universal quantifie...
Javier Álvez, Paqui Lucio
ICALP
2009
Springer
16 years 4 days ago
On Regular Temporal Logics with Past,
The IEEE standardized Property Specification Language, PSL for short, extends the well-known linear-time temporal logic LTL with so-called semi-extended regular expressions. PSL an...
Christian Dax, Felix Klaedtke, Martin Lange