Sciweavers

229 search results - page 29 / 46
» Bilateral Algorithms for Symbolic Abstraction
Sort
View
CAV
2006
Springer
122views Hardware» more  CAV 2006»
13 years 11 months ago
Repair of Boolean Programs with an Application to C
We show how to find and fix faults in Boolean programs by extending the program to a game. In the game, the protagonist can select an alternative implementation for an incorrect st...
Andreas Griesmayer, Roderick Bloem, Byron Cook
JSS
2006
88views more  JSS 2006»
13 years 7 months ago
A formal representation of functional size measurement methods
Estimating software size is a difficult task that requires a methodological approach. Many different methods that exist today use distinct abstractions to depict a software system...
Marjan Hericko, Ivan Rozman, Ales Zivkovic
ATVA
2005
Springer
132views Hardware» more  ATVA 2005»
14 years 1 months ago
Flat Counter Automata Almost Everywhere!
Abstract. This paper argues that flatness appears as a central notion in the verification of counter automata. A counter automaton is called flat when its control graph can be ...
Jérôme Leroux, Grégoire Sutre
TIT
2008
102views more  TIT 2008»
13 years 7 months ago
On Low-Complexity Maximum-Likelihood Decoding of Convolutional Codes
Abstract--This letter considers the average complexity of maximum-likelihood (ML) decoding of convolutional codes. ML decoding can be modeled as finding the most probable path take...
Jie Luo
CCS
2010
ACM
13 years 6 months ago
TAPS: automatically preparing safe SQL queries
We present the first sound program transformation approach for automatically transforming the code of a legacy web application to employ PREPARE statements in place of unsafe SQL...
Prithvi Bisht, A. Prasad Sistla, V. N. Venkatakris...