783 search results - page 84 / 157 » Compositional Reasoning in Model Checking |
124
Voted
CSL
1992
Springer
15 years 6 months ago
1992
Springer
We develop the rst steps of a theory of concurrency within the framework of evolving algebras of Gurevich, with the aim of investigating its suitability for the role of a general f...
102
Voted
LICS
2009
IEEE
15 years 9 months ago
2009
IEEE
—One-counter processes are pushdown systems over a singleton stack alphabet (plus a stack-bottom symbol). We study the complexity of two closely related verification problems ov...
106
Voted
KBSE
1997
IEEE
15 years 6 months ago
1997
IEEE
Deduction-based software component retrieval uses preand postconditions as indexes and search keys and an automated theorem prover (ATP) to check whether a component matches. This...
COORDINATION
2010
Springer
15 years 2 months ago
2010
Springer
In the context of service-oriented computing, behavioural contracts are descriptions of the message-passing behaviour of services. They can be used to check properties of service c...
125
click to vote
ICLP
2005
Springer
15 years 8 months ago
2005
Springer
We present a methodology for the modeling of complex program behavior in CLP. In the first part we present an informal description about how to represent a system in CLP. At its ...