Sciweavers

783 search results - page 85 / 157
» Compositional Reasoning in Model Checking
Sort
View
203
Voted
GIS
2006
ACM
16 years 3 months ago
Preserving local topological relationships
Topological relationships between objects in space are of great importance in many disciplines. Recently, topological relationships have been defined for complex spatial objects. ...
Mark McKenney, Alejandro Pauly, Reasey Praing, Mar...
KBSE
2007
IEEE
15 years 8 months ago
Sequential circuits for program analysis
A number of researchers have proposed the use of Boolean satisfiability solvers for verifying C programs. They encode correctness checks as Boolean formulas using finitization: ...
Fadi A. Zaraket, Adnan Aziz, Sarfraz Khurshid
BPM
2005
Springer
101views Business» more  BPM 2005»
15 years 8 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 ...
118
Voted
ICWS
2008
IEEE
15 years 3 months 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...
CAV
1998
Springer
103views Hardware» more  CAV 1998»
15 years 6 months ago
You Assume, We Guarantee: Methodology and Case Studies
Assume-guarantee reasoning has long been advertised as an important method for decomposing proof obligations in system veri cation. Re nement mappings (homomorphisms) have long bee...
Thomas A. Henzinger, Shaz Qadeer, Sriram K. Rajama...