Sciweavers

1941 search results - page 67 / 389
» Reasoning about Computations Using Two-Levels of Logic
Sort
View
JAR
2000
145views more  JAR 2000»
15 years 2 months ago
Logical Cryptanalysis as a SAT Problem
Cryptographic algorithms play a key role in computer security and the formal analysis of their robustness is of utmost importance. Yet, logic and automated reasoning tools are seld...
Fabio Massacci, Laura Marraro
125
Voted
CVPR
2008
IEEE
16 years 5 months ago
What can missing correspondences tell us about 3D structure and motion?
Practically all existing approaches to structure and motion computation use only positive image correspondences to verify the camera pose hypotheses. Incorrect epipolar geometries...
Christopher Zach, Arnold Irschara, Horst Bischof
IJCAI
1997
15 years 4 months ago
A Set-Theoretic Approach to Automated Deduction in Graded Modal Logics
In the paper, we consider the problem of supporting automated reasoning in a large class of knowledge representation formalisms, including terminological and epistemic logics, who...
Angelo Montanari, Alberto Policriti
POPL
2006
ACM
16 years 3 months ago
A logic for information flow in object-oriented programs
This paper specifies, via a Hoare-like logic, an interprocedural and flow sensitive (but termination insensitive) information flow analysis for object-oriented programs. Pointer a...
Torben Amtoft, Sruthi Bandhakavi, Anindya Banerjee
ALP
1997
Springer
15 years 7 months ago
Optimal Non-deterministic Functional Logic Computations
Abstract. We show that non-determinism simplifies coding certain problems into programs. We define a non-confluent, but well-behaved class of rewrite systems for supporting non-...
Sergio Antoy