783 search results - page 95 / 157 » Compositional Reasoning in Model Checking |
138
click to vote
ICFP
2005
ACM
16 years 2 months ago
2005
ACM
We present a parametric Hoare-like logic for computer-aided reasoning about typeable properties of functional programs. The logic is based on the concept of a specialised assertio...
148
click to vote
LPNMR
1997
Springer
15 years 6 months ago
1997
Springer
Turi [20] introduced the important notion of a constrained atom: an atom with associated equality and disequality constraints on its arguments. A set of constrained atoms is a cons...
LPAR
2010
Springer
15 years 27 days ago
2010
Springer
Abstract. We study the complexity of model expansion (MX), which is the problem of expanding a given finite structure with additional relations to produce a finite model of a giv...
107
Voted
ESWS
2007
Springer
15 years 8 months ago
2007
Springer
Abstract The Web Service Business Process Execution Language (WSBPEL) is the de facto standard for describing workflow-like compositions of Web services, so-called Web service orc...
128
click to vote
PPSWR
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. In this paper we define the basic concepts for a general language for evolution and reactivity in the Semantic Web. We do this by exposing an UML model that specifies a...