329 search results - page 61 / 66 » Automatic Proofs for Scalecharts |
113
click to vote
LICS
2007
IEEE
15 years 10 months ago
2007
IEEE
FreshML extends ML with constructs for declaring and ting abstract syntax trees that involve names and statically scoped binders. It is impure: name generation is an observable si...
156
click to vote
RTA
2007
Springer
15 years 10 months ago
2007
Springer
This paper shows how to construct static analyzers using tree automata and rewriting techniques. Starting from a term rewriting system representing the operational semantics of the...
140
click to vote
ICNP
2006
IEEE
15 years 10 months ago
2006
IEEE
— This paper reports on an experiment in network protocol design: we use novel rigorous techniques in the design process of a new protocol, in a close collaboration between syste...
144
click to vote
SEFM
2006
IEEE
15 years 10 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...
153
click to vote
RTA
2005
Springer
15 years 9 months ago
2005
Springer
We present a new method for proving termination of term rewriting systems automatically. It is a generalization of the match bound method for string rewriting. To prove that a term...