3552 search results - page 123 / 711 » Proof theory in the abstract |
155
click to vote
ASPDAC
2008
ACM
15 years 7 months ago
2008
ACM
—In this paper we describe a practical methodology to formally verify highly optimized, industrial multipliers. We a multiplier description language which abstracts from low-leve...
164
click to vote
CG
2002
Springer
15 years 6 months ago
2002
Springer
Abstract. The paper introduces a new proof-number (PN) search algorithm, called PDS-PN. It is a two-level search, which performs at the first level a depth-first Proof-number and D...
158
click to vote
LICS
2008
IEEE
16 years 23 days ago
2008
IEEE
LF is a dependent type theory in which many other formal systems can be conveniently embedded. However, correct use of LF relies on nontrivial metatheoretic developments such as p...
162
click to vote
VMCAI
2007
Springer
16 years 14 days ago
2007
Springer
Interpolation is an important component of recent methods for program verification. It provides a natural and effective means for computing separation between the sets of ‘good...
163
click to vote
CONCUR
1995
Springer
15 years 10 months ago
1995
Springer
We develop a theory of bisimulation equivalence for the broadcast calculus CBS. Both the strong and weak versions of bisimulation congruence we study are justi ed in terms of a cha...