4266 search results - page 746 / 854 » A Framework for Defining Logics |
DAC
2005
ACM
15 years 11 months ago
2005
ACM
Partitioned BDD-based algorithms have been proposed in the literature to solve the memory explosion problem in BDD-based verification. Such algorithms can be at times ineffective ...
CADE
2006
Springer
15 years 10 months ago
2006
Springer
Linear arithmetic decision procedures form an important part of theorem provers for program verification. In most verification benchmarks, the linear arithmetic constraints are dom...
107
click to vote
CADE
2002
Springer
15 years 10 months ago
2002
Springer
Abstract. Proof-carrying code (PCC) allows a code producer to associate to a program a machine-checkable proof of its safety. In the original approach to PCC, the safety policy inc...
CADE
2002
Springer
15 years 10 months ago
2002
Springer
The classical NP-complete problem of Boolean Satisfiability (SAT) has seen much interest in not just the theoretical computer science community, but also in areas where practical s...
166
Voted
VLDB
2007
ACM
15 years 10 months ago
2007
ACM
The database community is on a constant quest for better integration of data management and knowledge management. Recently, with the increasing use of ontology in various applicat...