Sciweavers

509 search results - page 17 / 102
» On the completeness of compositional reasoning methods
Sort
View
ENTCS
2007
98views more  ENTCS 2007»
13 years 8 months ago
A Completeness Proof for Bisimulation in the pi-calculus Using Isabelle
We use the interactive theorem prover Isabelle to prove that the algebraic axiomatization of bisimulation equivalence in the pi-calculus is sound and complete. This is the first ...
Jesper Bengtson, Joachim Parrow
BILDMED
2007
148views Algorithms» more  BILDMED 2007»
13 years 10 months ago
Complete Digital Iconic and Textual Annotation for Mammography
This work aims to propose an interactive method for a iconic and textual annotation of digital mammograms. The suggested annotation tool consists of a semantic network to represent...
Thomas Wittenberg, Matthias Elter, Rüdiger Sc...
FORTE
2009
13 years 6 months ago
Using First-Order Logic to Reason about Submodule Construction
We consider the following problem: For a system consisting of two components, the behavior of one component is known as well as the desired global behavior. What should be the beha...
Gregor von Bochmann
MODELS
2009
Springer
14 years 3 months ago
A Modeling Language for Activity-Oriented Composition of Service-Oriented Software Systems
The proliferation of smart spaces and emergence of new standards, such as Web Services, have paved the way for a new breed of software systems. Often the complete functional and Qo...
Naeem Esfahani, Sam Malek, João Pedro Sousa...
SIGLEX
1991
14 years 8 days ago
Presuppositions and Default Reasoning: A Study in Lexical Pragmatics
Explaining how the meaning of words relate to the meaning of the utterance in which they are used is of utmost importance. The most common approaches view the meaning of an uttera...
Robert E. Mercer