Sciweavers

3342 search results - page 444 / 669
» Automating Abstract Interpretation
Sort
View
100
Voted
FSTTCS
2006
Springer
15 years 4 months ago
Validity Checking for Finite Automata over Linear Arithmetic Constraints
Abstract Decision procedures underlie many program analysis problems. Traditional program analysis algorithms attempt to prove some property about a single, statically-defined prog...
Gary Wassermann, Zhendong Su
ACSD
2003
IEEE
105views Hardware» more  ACSD 2003»
15 years 4 months ago
Detecting State Coding Conflicts in STG Unfoldings Using SAT
Abstract. The behaviour of asynchronous circuits is often described by Signal Transition Graphs (STGs), which are Petri nets whose transitions are interpreted as rising and falling...
Victor Khomenko, Maciej Koutny, Alexandre Yakovlev
84
Voted
ASPDAC
2001
ACM
75views Hardware» more  ASPDAC 2001»
15 years 4 months ago
Correlation method of circuit-performance and technology fluctuations for improved design reliability
Abstract-- We propose a method of correlating circuit performance with technology fluctuations during the circuit-design phase. The method employs test circuits sensitive for techn...
D. Miyawaki, Shizunori Matsumoto, Hans Jürgen...
104
Voted
ER
2000
Springer
101views Database» more  ER 2000»
15 years 4 months ago
Towards Ontology-Based Harmonization of Web Content Standards
Abstract. The popularity and press surrounding the release of XML has created widespread interest in standards within particular communities that focus on representing content. The...
Nicola Guarino, Christopher A. Welty, Christopher ...
ESOP
2000
Springer
15 years 4 months ago
Type Classes with Functional Dependencies
Abstract. Type classes in Haskell allow programmers to define functions that can be used on a set of different types, with a potentially different implementation in each case. For ...
Mark P. Jones