Sciweavers

1322 search results - page 93 / 265
» Unsound Theorem Proving
Sort
View
ICFP
1999
ACM
14 years 1 days ago
A Simple Proof Technique for Certain Parametricity Results
Many properties of parametric, polymorphic functions can be determined simply by inspection of their types. Such results are usually proven using Reynolds's parametricity the...
Karl Crary
CSFW
2000
IEEE
13 years 11 months ago
Towards Automatic Verification of Authentication Protocols on an Unbounded Network
Schneider's work on rank functions [14] provides a formal approach to verification of certain properties of a security protocol. However, he illustrates the approach only wit...
James Heather, Steve Schneider
CADE
2010
Springer
13 years 8 months ago
Analytic Tableaux for Higher-Order Logic with Choice
Abstract. While many higher-order interactive theorem provers include a choice operator, higher-order automated theorem provers currently do not. As a step towards supporting autom...
Julian Backes, Chad E. Brown
GECCO
2008
Springer
127views Optimization» more  GECCO 2008»
13 years 8 months ago
On the possibility to create a compatible--complete unary comparison method for evolutionary multiobjective algorithms
There are several studies on the desirable properties that a performance measure for evolutionary multiobjective algorithms must have. One of these properties is called “compati...
Giovanni Lizárraga Lizárraga, Arturo...
CORR
2008
Springer
151views Education» more  CORR 2008»
13 years 7 months ago
Checking the Quality of Clinical Guidelines using Automated Reasoning Tools
Requirements about the quality of clinical guidelines can be represented by schemata borrowed from the theory of abductive diagnosis, using temporal logic to model the time-orient...
Arjen Hommersom, Peter J. F. Lucas, Patrick van Bo...