Sciweavers

6167 search results - page 95 / 1234
» Can Refinement be Automated
Sort
View
VLDB
2001
ACM
153views Database» more  VLDB 2001»
15 years 8 months ago
A Fast Index for Semistructured Data
Queries navigate semistructured data via path expressions, and can be accelerated using an index. Our solution encodes paths as strings, and inserts those strings into a special i...
Brian F. Cooper, Neal Sample, Michael J. Franklin,...
AIIDE
2008
15 years 6 months ago
Hierarchical Petri Nets for Story Plots Featuring Virtual Humans
Petri Nets can be used for a retrospective analysis of a computer game story, for representing plots in serious games as well as for monitoring the course of the story, as recentl...
Daniel Balas, Cyril Brom, Adam Abonyi, Jakub Gemro...
EMSOFT
2008
Springer
15 years 5 months ago
Interface theories with component reuse
Interface theories have been proposed to support incremental design and independent implementability. Incremental design means that the compatibility checking of interfaces can pr...
Laurent Doyen, Thomas A. Henzinger, Barbara Jobstm...
CONCUR
2010
Springer
15 years 5 months ago
Buffered Communication Analysis in Distributed Multiparty Sessions
Many communication-centred systems today rely on asynchronous messaging among distributed peers to make efficient use of parallel execution and resource access. With such asynchron...
Pierre-Malo Deniélou, Nobuko Yoshida
TSE
2002
94views more  TSE 2002»
15 years 3 months ago
Behavior Protocols for Software Components
In this paper, we propose a means to enhance an architecture description language with a description of component behavior. A notation used for this purpose should be able to expr...
Frantisek Plasil, Stanislav Visnovsky