Sciweavers

322 search results - page 10 / 65
» Satisfiability Coding Lemma
Sort
View
CODES
2001
IEEE
13 years 11 months ago
Formal synthesis and code generation of embedded real-time software
Due to rapidly increasing system complexity, shortening time-tomarket, and growing demand for hard real-time systems, formal methods are becoming indispensable in the synthesis of...
Pao-Ann Hsiung
AAECC
2007
Springer
85views Algorithms» more  AAECC 2007»
14 years 1 months ago
Extended Norm-Trace Codes with Optimized Correction Capability
We consider a generalization of the codes defined by norm and trace functions on finite fields introduced by Olav Geil. The codes in the new family still satisfy Geil’s dualit...
Maria Bras-Amorós, Michael E. O'Sullivan
ICFP
2012
ACM
11 years 10 months ago
Shake before building: replacing make with haskell
Most complex software projects are compiled using a build tool (e.g. make), which runs commands in an order satisfying userdefined dependencies. Unfortunately, most build tools r...
Neil Mitchell
APAQS
2001
IEEE
13 years 11 months ago
Using a Coding Standard to Improve Program Quality
Program quality represents the most significant part of software quality control that assures all characteristics of software products to satisfy the user's explicit and impl...
X. Fang
TIT
2008
107views more  TIT 2008»
13 years 7 months ago
Computing Binary Combinatorial Gray Codes Via Exhaustive Search With SAT Solvers
The term binary combinatorial Gray code refers to a list of binary words such that the Hamming distance between two neighboring words is one and the list satisfies some additional ...
Igor Zinovik, Daniel Kroening, Yury Chebiryak