5378 search results - page 915 / 1076 » Base Logics in Argumentation |
CADE
2006
Springer
14 years 10 months ago
2006
Springer
Abstract. Verification by network invariants is a heuristic to solve uniform verification of parameterized systems. Given a system P, a network invariant for P is that abstracts th...
CADE
2006
Springer
14 years 10 months ago
2006
Springer
Abstract. We extend our previous study of the automatic construction of isomorphic classification theorems for algebraic domains by considering the isotopy equivalence relation. Is...
CADE
2002
Springer
14 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
14 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...
VLDB
2004
ACM
14 years 10 months ago
2004
ACM
With the recent and continuing advances in areas such as wireless communications and positioning technologies, mobile, locationbased services are becoming possible. Such services ...