144 search results - page 14 / 29 » How Expressions Can Code for Automata |
180
click to vote
CAV
2010
Springer
15 years 10 months ago
2010
Springer
Often one has a preference order among the different systems that satisfy a given specification. Under a probabilistic assumption about the possible inputs, such a preference order...
209
click to vote
ECRTS
2002
IEEE
15 years 11 months ago
2002
IEEE
Most WCET analysis techniques only provide an upper bound on the worst case execution time as a constant value. However, it often appears that the execution time of a piece of cod...
224
click to vote
ENTCS
2007
15 years 6 months ago
2007
In this paper, we present a term rewriting based library for manipulating Java bytecode. We define a mapping from bytecode programs to algebraic terms, and we use Tom, an extensi...
206
click to vote
TPHOL
2007
IEEE
16 years 29 days ago
2007
IEEE
Formal, modular, and mechanized verification of realistic systems code is desirable but challenging. Verification of machine context management (a basis of multi-tasking) is one ...
191
click to vote
CONCUR
1992
Springer
15 years 10 months ago
1992
Springer
The states of a computing system bear information and change time, while its events bear time and change information. We develop a primitive algebraic model of this duality of tim...