Sciweavers

2585 search results - page 330 / 517
» Automating Coherent Logic
Sort
View
MPC
2010
Springer
246views Mathematics» more  MPC 2010»
15 years 8 months ago
Abstraction of Object Graphs in Program Verification
ion of Object Graphs in Program Verification Yifeng Chen1 and J.W. Sanders2 1 HCST Key Lab at School of EECS, Peking University, China. 2 UNU-IIST, Macao. A set-theoretic formalism...
Yifeng Chen, Jeff W. Sanders
CSL
2007
Springer
16 years 22 days ago
Incorporating Tables into Proofs
We consider the problem of automating and checking the use of previously proved lemmas in the proof of some main theorem. In particular, we call the collection of such previously p...
Dale Miller, Vivek Nigam
CADE
2002
Springer
16 years 6 months ago
Lazy Theorem Proving for Bounded Model Checking over Infinite Domains
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
Harald Rueß, Leonardo Mendonça de Mou...
ISORC
2005
IEEE
16 years 4 days ago
Adaptable Situation-Aware Secure Service-Based (AS3) Systems
Service-based systems have many applications, including collaborative research and development, e-business, health care, environmental control, military applications, and homeland...
Stephen S. Yau, Hasan Davulcu, Supratik Mukhopadhy...
KR
2010
Springer
15 years 11 months ago
Status QIO: Conjunctive Query Entailment Is Decidable
Description Logics (DLs) are knowledge representation formalisms that provide, for example, the logical underpinning of the W3C OWL standards. Conjunctive queries (CQs), the stand...
Birte Glimm, Sebastian Rudolph