Sciweavers

215 search results - page 24 / 43
» On Abstract Finite-State Morphology
Sort
View
ICCAD
1994
IEEE
134views Hardware» more  ICCAD 1994»
14 years 1 months ago
Boolean constrained encoding: a new formulation and a case study
1 This paper provides a new, generalized approach to the problem of encoding information as vectors of binary digits. We furnish a formal definition for the Boolean constrained enc...
Ney Laert Vilar Calazans
GLVLSI
2007
IEEE
151views VLSI» more  GLVLSI 2007»
14 years 1 months ago
Hand-in-hand verification of high-level synthesis
This paper describes a formal verification methodology of highnthesis (HLS) process. The abstraction level of the input to HLS is so high compared to that of the output that the v...
Chandan Karfa, Dipankar Sarkar, Chittaranjan A. Ma...
FSTTCS
2006
Springer
14 years 1 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
ATAL
2008
Springer
13 years 12 months ago
Methods for complex single-mind architecture designs
The implementation of software systems with large numbers of heterogeneous components calls for a powerful design methodology. Although several such methodologies have been propos...
Kristinn R. Thórisson, Gudny Ragna Jonsdott...
ECAI
2008
Springer
13 years 11 months ago
Incremental Diagnosis of DES by Satisfiability
Abstract. We propose a SAT-based algorithm for incremental diagnosis of discrete-event systems. The monotonicity is ensured by a prediction window that uses the future observations...
Alban Grastien, Anbulagan