6167 search results - page 3 / 1234 » Can Refinement be Automated |
FM
2009
Springer
13 years 3 months ago
2009
Springer
Abstract. This paper presents an iterative technique to accurately reverseengineer models of the behaviour of software systems. A key novelty of the approach is the fact that it us...
CSFW
2010
IEEE
13 years 8 months ago
2010
IEEE
We consider the problem of automating open bisimulation checking for the spi-calculus, an extension of the pi-calculus with cryptographic primitives. The notion of open bisimulatio...
CADE
2004
Springer
14 years 5 months ago
2004
Springer
We show how well-known refinements of ordered resolution, in particular redundancy elimination and ordering constraints in combination with a selection function, can be used to obt...
KR
1994
Springer
13 years 9 months ago
1994
Springer
Despite the long history of classical planning, there has been very little comparative analysis of the performance tradeoffs offered by the multitude of existing planning algorith...
ICCBR
2009
Springer
13 years 3 months ago
2009
Springer
Abstract. Retrieval of structured cases using similarity has been studied in CBR but there has been less activity on defining similarity on description logics (DL). In this paper w...