1001 search results - page 52 / 201 » Testing Formal Dialectic |
CL
2000
Springer
14 years 27 days ago
2000
Springer
We use Kleene algebra with tests to verify a wide assortment of common compiler optimizations, including dead code elimination, common subexpression elimination, copy propagation,...
PTS
2008
13 years 10 months ago
2008
Firewalls are a cornerstone of todays security infrastructure for networks. Their configuration, implementing a firewall policy, is inherently complex, hard to understand, and diff...
CAISE
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. This paper uses a framework drawn from work in the philosophy of science to characterize the concepts of program correctness that have been used in software engineering, ...
TLCA
1993
Springer
14 years 1 months ago
1993
Springer
This paper describes formalizations of Tait’s normalization proof for the simply typed λ-calculus in the proof assistants Minlog, Coq and Isabelle/HOL. From the formal proofs p...
PLDI
1996
ACM
14 years 1 months ago
1996
ACM
Building compilers that generate correct code is difficult. In this paper we present a compiler testing technique that closes the gap between actual compiler implementations and c...