Sciweavers

1689 search results - page 49 / 338
» Refining abstract interpretations
Sort
View
ATVA
2007
Springer
150views Hardware» more  ATVA 2007»
15 years 6 months ago
3-Valued Circuit SAT for STE with Automatic Refinement
Abstract. Symbolic Trajectory Evaluation (STE) is a powerful technique for hardware model checking. It is based on a 3-valued symbolic simulation, using 0,1 and X n"), where t...
Orna Grumberg, Assaf Schuster, Avi Yadgar
DM
2002
84views more  DM 2002»
15 years 1 months ago
On the refined lecture hall theorem
Abstract. A lecture hall partition of length n is a sequence (1, 2, . . . , n) of nonnegative integers satisfying 0 1/1
Ae Ja Yee
FM
2009
Springer
98views Formal Methods» more  FM 2009»
15 years 8 months ago
Recursive Abstractions for Parameterized Systems
e Abstractions for Parameterized Systems JOXAN JAFFAR and ANDREW E. SANTOSA Department of Computer Science, National University of Singapore Singapore 117590 {joxan,andrews}comp.nu...
Joxan Jaffar, Andrew E. Santosa
AGP
1993
IEEE
15 years 6 months ago
Static Analysis of Prolog with Cut
Abstract. This paper presents a general approach to the Abstract Interpretation of Prolog programs with cut. In most of previous approaches the cut primitive is merely ignored. Our...
Gilberto Filé, Sabina Rossi
TVCG
2012
203views Hardware» more  TVCG 2012»
13 years 4 months ago
Morse Set Classification and Hierarchical Refinement Using Conley Index
—Morse decomposition provides a numerically stable topological representation of vector fields that is crucial for their rigorous interpretation. However, Morse decomposition is ...
Guoning Chen, Qingqing Deng, Andrzej Szymczak, Rob...