797 search results - page 17 / 160 » Eliminating Proofs from Programs |
170
click to vote
WIA
2005
Springer
15 years 11 months ago
2005
Springer
We consider the use of state elimination to construct shorter regular expressions from finite-state automata. Although state elimination is an intuitive method for computing regul...
154
click to vote
ICALP
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We investigate a general paradigm for constructing arbitraryinput-length (AIL) MACs from fixed-input-length (FIL) MACs, define the waste as the relevant efficiency para...
161
click to vote
ICALP
2007
Springer
16 years 23 hour ago
2007
Springer
Abstract. We study – within the framework of propositional proof complexity – the problem of certifying unsatisfiability of CNF formulas under the promise that any satisfiabl...
141
click to vote
AADEBUG
1993
Springer
15 years 10 months ago
1993
Springer
Program slicing is a program transformation that is useful in program debugging, program maintenance, and other applications that involve understanding program behavior. Given a p...
165
click to vote
TPHOL
2007
IEEE
16 years 4 days ago
2007
IEEE
Techniques based on sums of squares appear promising as a general approach to the universal theory of reals with addition and multiplication, i.e. verifying Boolean combinations of...