233 search results - page 17 / 47 » Specifying, Programming and Verifying with Equational Logic |
KBSE
2007
IEEE
15 years 5 months ago
2007
IEEE
A number of researchers have proposed the use of Boolean satisfiability solvers for verifying C programs. They encode correctness checks as Boolean formulas using finitization: ...
194
click to vote
POPL
2004
ACM
15 years 11 months ago
2004
ACM
We show how some classical static analyses for imperative programs, and the optimizing transformations which they enable, may be expressed and proved correct using elementary logi...
ESOP
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. Embedded information assurance applications that are critical to national and international infrastructures, must often adhere to certification regimes that require infor...
107
click to vote
ICALP
2007
Springer
15 years 5 months ago
2007
Springer
The ability to detect ambiguities in context-free grammars is vital for their use in several fields, but the problem is undecidable in the general case. We present a safe, conser...
LATA
2009
Springer
15 years 5 months ago
2009
Springer
Introducing priorities on rules in rewriting increases their expressive power and helps to limit computations. Priority rewriting is used in rule-based programming as well as in f...