10 search results - page 2 / 2 » sefm 2006 |
SEFM
2006
IEEE
13 years 11 months ago
2006
IEEE
tic analysis tools based on abstraction are sound but not complete. Several practical static analysis tools are heuristic in nature —they are neither sound nor complete, but have...
SEFM
2006
IEEE
13 years 11 months ago
2006
IEEE
The key to many approaches to reason about pointerbased data structures is the availability of a decision procedure to automatically discharge proof obligations in a theory encomp...
SEFM
2006
IEEE
13 years 11 months ago
2006
IEEE
We present an operational model for describing random reactive systems. Some models have already been proposed for this purpose, but they generally aim at performing global reason...
SEFM
2006
IEEE
13 years 11 months ago
2006
IEEE
An optimization can be specified as sequential compositions of predefined transformation primitives. For each primitive, we can define soundness conditions which guarantee that th...
SEFM
2006
IEEE
13 years 11 months ago
2006
IEEE
We define a model of labelled product systems of automata and explore its connections with process calculi and trace languages. Bisimilarity of labelled product systems is defin...