Sciweavers

42 search results - page 4 / 9
» Automated refinement checking of concurrent systems
Sort
View
90
Voted
FLOPS
2008
Springer
14 years 11 months ago
On-Demand Refinement of Dependent Types
Dependent types are useful for statically checking detailed specifications of programs and detecting pattern match or array bounds errors. We propose a novel approach to applicatio...
Hiroshi Unno, Naoki Kobayashi
IJAOSE
2010
126views more  IJAOSE 2010»
14 years 6 months ago
Automated analysis of compositional multi-agent systems
An approach for handling the complex dynamics of a multi-agent system is based on distinguishing aggregation levels. The behaviour at a given aggregation level is specified by a se...
Alexei Sharpanskykh, Jan Treur
MSS
1999
IEEE
150views Hardware» more  MSS 1999»
15 years 1 months ago
Performance Benchmark Results for Automated Tape Library High Retrieval Rate Applications - Digital Check Image Retrievals
Benchmark tests have been designed and conducted for the purpose of evaluating the use of automated tape libraries in on-line digital check image retrieval applications. This type...
John Gniewek, George Davidson, Bowen Caldwell
ENTCS
2008
140views more  ENTCS 2008»
14 years 9 months ago
Linking Event-B and Concurrent Object-Oriented Programs
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...
Andrew Edmunds, Michael Butler
ASP
2001
Springer
15 years 2 months ago
Answer Set Programming and Bounded Model Checking
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. This is an extension of earlier w...
Keijo Heljanko, Ilkka Niemelä