Sciweavers

3255 search results - page 3 / 651
» Combination of Abstractions in the ASTR
Sort
View
FOSSACS
2009
Springer
14 years 2 months ago
Full Abstraction for Reduced ML
traction for Reduced ML Andrzej S. Murawski and Nikos Tzevelekos Oxford University Computing Laboratory Wolfson Building, Parks Road, Oxford OX1 3QD, UK We present the first effe...
Andrzej S. Murawski, Nikos Tzevelekos
ICCAD
1999
IEEE
66views Hardware» more  ICCAD 1999»
13 years 11 months ago
Timing-safe false path removal for combinational modules
A delay abstraction of a combinational module is a compact representation of the delay information of the module, which carries effective pin-to-pin delay for each primary-input/pr...
Yuji Kukimoto, Robert K. Brayton
TPHOL
2005
IEEE
14 years 1 months ago
Proof Pearl: Using Combinators to Manipulate let-Expressions in Proof
We discuss methods for dealing effectively with let-bindings in proofs. Our contribution is a small set of unconditional rewrite rules, found by the bracket abstraction translatio...
Michael Norrish, Konrad Slind
FORMATS
2010
Springer
13 years 5 months ago
Combining Symbolic Representations for Solving Timed Games
We present a general approach to combine symbolic state space representations for the discrete and continuous parts in the synthesis of winning strategies for timed reachability ga...
Rüdiger Ehlers, Robert Mattmüller, Hans-...