276 search results - page 18 / 56 » Abstraction and Refinement for Local Reasoning |
ENTCS
2008
13 years 7 months ago
2008
The Event-B method is a formal approach to modelling systems, using refinement. Initial specification is a high level of abstraction; detail is added in refinement steps as the de...
EWCBR
2008
Springer
13 years 9 months ago
2008
Springer
Conventional approaches to similarity search and case-based retrieval, such as nearest neighbor search, require the specification of a global similarity measure which is typically ...
SAC
2003
ACM
14 years 26 days ago
2003
ACM
Researchers building multi-agent algorithms typically work with abstracted away from real applications. The abstracted problem instances allow systematic and detailed investigatio...
FLOPS
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. This paper describes how high level implementations of (needed) narrowing into Prolog can be improved by analysing definitional trees. First, we introduce a refined repre...
IANDC
2006
13 years 7 months ago
2006
Abstract Bigraphs are graphs whose nodes may be nested, representing locality, independently of the edges connecting them. They may be equipped with reaction rules, forming a bigra...