27 search results - page 1 / 6 » Handling Polymorphism in Automated Deduction |
CADE
2007
Springer
14 years 4 months ago
2007
Springer
SNPD
2007
13 years 6 months ago
2007
As malicious code has become more sophisticated and pervasive, faster and more effective system for forensics and prevention is important. Particularly, quick analysis of polymorp...
ISMIS
1994
Springer
13 years 8 months ago
1994
Springer
BDDs (binary decision diagrams) are a very succesful tool for handling boolean functions, but one which has not yet attracted the attention of many automated deduction specialists....
IANDC
2006
13 years 4 months ago
2006
Interactive theorem provers require too much effort from their users. We have been developing a system in which Isabelle users obtain automatic support from automatic theorem prov...
CADE
2007
Springer
14 years 4 months ago
2007
Springer
We show how theorem proving and methods for handling real algebraic constraints can be combined for hybrid system verification. In particular, we highlight the interaction of deduc...