535 search results - page 18 / 107 » Checking Computations in Polylogarithmic Time |
ACSC
2007
IEEE
15 years 4 months ago
2007
IEEE
The design guideline avoid dependency cycles among modules was ļ¬rst alluded to by Parnas in 1978. Many tools have since been built to detect cyclic dependencies among a programā...
110
click to vote
DDECS
2006
IEEE
15 years 1 months ago
2006
IEEE
Abstract-- Hard real-time systems need methods to determine upper bounds for their execution times, usually called worst-case execution times. Timing anomalies are counterintuitive...
FSTTCS
2009
Springer
15 years 4 months ago
2009
Springer
We address the problem of alternating simulation reļ¬nement for concurrent timed games (TG). We show that checking timed alternating simulation between TG is EXPTIME-complete, and...
113
click to vote
SPIN
2001
Springer
15 years 2 months ago
2001
Springer
p2b is a research tool that translates Promela programs to boolean representations of the automata associated with them. These representations conform to the input syntax of the wi...
LICS
2005
IEEE
15 years 3 months ago
2005
IEEE
Hierarchical graph deļ¬nitions allow a modular description of graphs using modules for the speciļ¬cation of repeated substructures. Beside this modularity, hierarchical graph de...