4573 search results - page 724 / 915 » Automated Reasoning |
120
click to vote
CADE
2008
Springer
16 years 3 months ago
2008
Springer
Tree automata completion is a technique for the verification of infinite state systems. It has already been used for the verification of cryptographic protocols and the prototyping...
114
click to vote
CADE
2008
Springer
16 years 3 months ago
2008
Springer
Confidentiality is maybe the most popular security property to be formally or informally verified. Noninterference is a baseline security policy to formalize confidentiality of sec...
100
Voted
CADE
2008
Springer
16 years 3 months ago
2008
Springer
Abstract. Operating-system verification gains increasing research interest. The complexity of such systems is, however, challenging and many endeavors are limited in some respect: ...
110
Voted
CADE
2007
Springer
16 years 3 months ago
2007
Springer
We add labels to first-order clauses to simultaneously apply superpositions to several proof obligations inside one clause set. From a theoretical perspective, the approach unifies...
151
click to vote
CADE
2007
Springer
16 years 3 months ago
2007
Springer
Abstract. A method based on dependency pairs for showing termination of functional programs on data structures generated by constructors with relations is proposed. A functional pr...