Sciweavers

3742 search results - page 482 / 749
» On the Use of Formal Techniques for Validation
Sort
View
ANSS
1991
IEEE
15 years 10 months ago
A provably correct, non-deadlocking parallel event simulation algorithm
This paper first summerizes and then presents a formal proof to a new conservative deadlock-free algorithm, YADDES [l], for asynchronous discrete event simulation. The proof not o...
Meng-Lin Yu, Sumit Ghosh, Erik DeBenedictis
ASPDAC
2005
ACM
99views Hardware» more  ASPDAC 2005»
15 years 8 months ago
Implication of assertion graphs in GSTE
- We address the problem of implication of assertion graphs that occur in generalized symbolic trajectory evaluation (GSTE). GSTE has demonstrated its powerful capacity in formal v...
Guowu Yang, Jin Yang, William N. N. Hung, Xiaoyu S...
EPEW
2008
Springer
15 years 8 months ago
Natural Language Specification of Performance Trees
The accessible specification of performance queries is a key challenge in performance analysis. To this end, we seek to combine the intuitive aspects of natural language query spec...
Lei Wang 0002, Nicholas J. Dingle, William J. Knot...
IWEC
2010
15 years 8 months ago
Analyzing Computer Game Narratives
In many computer games narrative is a core component with the game centering on an unfolding, interactive storyline which both motivates and is driven by the game-play. Analyzing n...
Clark Verbrugge, Peng Zhang
CSREAESA
2004
15 years 8 months ago
Identifying and Evaluating a Generic Set of Superinstructions for Embedded Java Programs
In this paper we present an approach to the optimisation of interpreted Java programs using superinstructions. Unlike existing techniques, we examine the feasibility of identifying...
Diarmuid O'Donoghue, James F. Power