Sciweavers

37 search results - page 7 / 8
» Towards Structurally-Free Theorem Proving
Sort
View
AAAI
1993
13 years 7 months ago
On the Adequateness of the Connection Method
Roughly speaking, adequatness is the property of a theorem proving method to solve simpler problems faster than more difficult ones. Automated inferencing methods are often not ad...
Antje Beringer, Steffen Hölldobler
IPL
2008
102views more  IPL 2008»
13 years 6 months ago
The connection between two ways of reasoning about partial functions
Undefined terms involving the application of partial functions and operators are common in program specifications and in discharging proof obligations that arise in design. One wa...
John S. Fitzgerald, Cliff B. Jones
CCS
2007
ACM
14 years 9 days ago
A calculus of challenges and responses
er presents a novel approach for concisely abstracting authentication s and for subsequently analyzing those abstractions in a sound manner, i.e., deriving authentication guarante...
Michael Backes, Agostino Cortesi, Riccardo Focardi...
AMAI
2007
Springer
13 years 6 months ago
Decision procedures for extensions of the theory of arrays
The theory of arrays, introduced by McCarthy in his seminal paper “Toward a mathematical science of computation”, is central to Computer Science. Unfortunately, the theory alo...
Silvio Ghilardi, Enrica Nicolini, Silvio Ranise, D...
CCS
2010
ACM
13 years 4 months ago
Adjustable autonomy for cross-domain entitlement decisions
Cross-domain information exchange is a growing problem, as business and governmental organizations increasingly need to integrate their information systems with those of partially...
Jacob Beal, Jonathan Webb, Michael Atighetchi