229 search results - page 29 / 46 » Bilateral Algorithms for Symbolic Abstraction |
140
click to vote
CAV
2006
Springer
15 years 9 months ago
2006
Springer
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...
153
click to vote
JSS
2006
15 years 5 months ago
2006
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...
149
click to vote
ATVA
2005
Springer
15 years 11 months ago
2005
Springer
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 ...
149
click to vote
TIT
2008
15 years 5 months ago
2008
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...
155
click to vote
CCS
2010
ACM
15 years 4 months ago
2010
ACM
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...