Sciweavers

1796 search results - page 147 / 360
» An Approach to Compositional Model Checking
Sort
View
BPM
2005
Springer
101views Business» more  BPM 2005»
14 years 4 months ago
Service Retrieval Based on Behavioral Specifications and Quality Requirements
: The capability to easily find useful services becomes increasingly critical in several fields. In this paper we argue that, in many situations, the service discovery process shou...
Daniela Grigori, Verónika Peralta, Mokrane ...
SPIN
2007
Springer
14 years 4 months ago
SAT-Based Summarization for Boolean Programs
Boolean programs are frequently used to model abstractions of software programs. They have the advantage that reachability properties are decidable, despite the fact that their sta...
Gérard Basler, Daniel Kroening, Georg Weiss...
ICWS
2008
IEEE
14 years 6 days ago
A Framework for Verifying SLA Compliance in Composed Services
Service level agreements (SLAs) impose many nonfunctional requirements on services. Business analysts specify and check these requirements in business process models using tools s...
Hua Xiao, Brian Chan, Ying Zou, Jay W. Benayon, Bi...
ENTCS
2006
168views more  ENTCS 2006»
13 years 10 months ago
A Functional Programming Framework for Latency Insensitive Protocol Validation
Latency insensitive protocols (LIPs) have been proposed as a viable means to connect synchronous IP blocks via long interconnects in a system-on-chip. The reason why one needs to ...
Syed Suhaib, Deepak Mathaikutty, Sandeep K. Shukla...
CONCUR
2004
Springer
14 years 4 months ago
Verifying Finite-State Graph Grammars: An Unfolding-Based Approach
We propose a framework where behavioural properties of finite-state systems modelled as graph transformation systems can be expressed and verified. The technique is based on the ...
Paolo Baldan, Andrea Corradini, Barbara König