Sciweavers

1167 search results - page 207 / 234
» A Really Temporal Logic
Sort
View
SIGSOFT
2003
ACM
14 years 1 months ago
Evaluating and improving the automatic analysis of implicit invocation systems
Model checking and other finite-state analysis techniques have been very successful when used with hardware systems and less successful with software systems. It is especially di...
Jeremy S. Bradbury, Jürgen Dingel
EUROCAST
2003
Springer
130views Hardware» more  EUROCAST 2003»
14 years 1 months ago
A Model of Neural Inspiration for Local Accumulative Computation
This paper explores the computational capacity of a novel local computational model that expands the conventional analogical and logical dynamic neural models, based on the charge ...
José Mira, Miguel Angel Fernández, M...
FORMATS
2003
Springer
14 years 1 months ago
Performance Analysis of Probabilistic Timed Automata Using Digital Clocks
Probabilistic timed automata, a variant of timed automata extended with discrete probability distributions, is a specification formalism suitable for describing both nondeterminis...
Marta Z. Kwiatkowska, Gethin Norman, David Parker,...
PLDI
2009
ACM
14 years 1 months ago
Progress guarantee for parallel programs via bounded lock-freedom
Parallel platforms are becoming ubiquitous with modern computing systems. Many parallel applications attempt to avoid locks in order to achieve high responsiveness, aid scalabilit...
Erez Petrank, Madanlal Musuvathi, Bjarne Steensgaa...
ATAL
2009
Springer
14 years 1 months ago
GDT4MAS: an extension of the GDT model to specify and to verify MultiAgent systems
The Goal Decomposition Tree model has been introduced in 2005 by Mermet et al. [9] to specify and verify the behaviour of an agent evolving in a dynamic environment. This model pr...
Bruno Mermet, Gaële Simon