Sciweavers

509 search results - page 13 / 102
» On the completeness of compositional reasoning methods
Sort
View
TACAS
2012
Springer
316views Algorithms» more  TACAS 2012»
12 years 3 months ago
Compositional Termination Proofs for Multi-threaded Programs
Abstract. Automated verification of multi-threaded programs is difficult. Direct treatment of all possible thread interleavings by reasoning about the program globally is a prohib...
Corneliu Popeea, Andrey Rybalchenko
GCC
2003
Springer
14 years 23 days ago
Toward the Composition of Semantic Web Services
This paper introduces a method for automatic composition of semantic web services using linear logic theorem proving. The method uses semantic web service language (DAML-S) for ext...
Jinghai Rao, Xiaomeng Su
BIRTHDAY
2003
Springer
14 years 24 days ago
A Hierarchical Completeness Proof for Propositional Temporal Logic
Abstract. We present a new proof of axiomatic completeness for Proposition Temporal Logic (PTL) for discrete, linear time for both finite and infinite time (without past-time). T...
Ben C. Moszkowski
ICTAI
1996
IEEE
13 years 11 months ago
Order in Space: A General Formalism for Spatial Reasoning
In this paper we propose a general approach for reasoning in space. The approach is composed of a set of two general constraints to govern the spatial relationships between object...
Baher A. El-Geresy, Alia I. Abdelmoty
ECAI
2000
Springer
13 years 11 months ago
Qualitative Spatial Reasoning about Line Segments
Abstract. Representing and reasoning about orientation information is an important aspect of qualitative spatial reasoning. We present a novel approach for dealing with intrinsic o...
Reinhard Moratz, Jochen Renz, Diedrich Wolter