Results 21 to 30 of about 169,161 (262)
, 2004 Formalized mathematics currently does not look much like informal mathematics. Also, formalizing mathematics currently seems far too much work to be worth the time of the working mathematician. To address both of these problems we introduce the notion of a formal proof sketch.
openaire +2 more sources
Formal Proofs for the Security of Signcryption [PDF]
Journal of Cryptology, 2002 Signcryption is an asymmetric cryptographic method that provides simultaneously both message confidentiality and unforgeability at a low computational and communication overhead. In this paper we propose realistic security models for signcryption, which give the attacker power to choose both messages/signcryptexts as well as recipient/sender public ...
Joonsang Baek +2 more
openaire +1 more source
Key Management in Wireless Sensor Networks
Journal of Sensor and Actuator Networks, 2015 Wireless sensor networks are a challenging field of research when it comes to security issues. Using low cost sensor nodes with limited resources makes it difficult for cryptographic algorithms to function without impacting energy consumption and latency.
Ismail Mansour +2 more
doaj +1 more source
Formal verification of a proof procedure for the description logic ALC [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 Description Logics (DLs) are a family of languages used for the representation and reasoning on the knowledge of an application domain, in a structured and formal manner. In order to achieve this objective, several provers, such as RACER and FaCT++, have
Martin Strecker +2 more
doaj +1 more source
Autarkic Computations in Formal Proofs
Journal of Automated Reasoning, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Barendregt, H.P., Barendsen, E.
openaire +2 more sources
Formal Proofs for Nonlinear Optimization
CoRR, 2014 We present a formally verified global optimization framework. Given a semialgebraic or transcendental function $f$ and a compact semialgebraic domain $K$, we use the nonlinear maxplus template approximation algorithm to provide a certified lower bound of $f$ over $K$.
Magron, Victor +3 more
openaire +6 more sources
Exact computation for existence of a knot counterexample
Applied General Topology, 2019 Previously, numerical evidence was presented of a self-intersecting Bezier curve having the unknot for its control polygon. This numerical demonstration resolved open questions in scientic visualization, but did not provide a formal proof of self ...
K. Marinelli, T. J. Peters
doaj +1 more source
The Sequent Calculus Trainer with Automated Reasoning - Helping Students to Find Proofs [PDF]
Electronic Proceedings in Theoretical Computer Science, 2018 The sequent calculus is a formalism for proving validity of statements formulated in First-Order Logic. It is routinely used in computer science modules on mathematical logic.
Arno Ehle +2 more
doaj +1 more source
Proof Patterns for Formal Methods [PDF]
, 2014 Design patterns represent a highly successful technique in software engineering, giving a reusable 'best practice' solution to commonly occurring problems in software design. Taking inspiration from this approach, this paper introduces proof patterns, which aim to provide a common vocabulary for solving formal methods proof obligations by capturing and
Leo Freitas, Iain Whiteside
openaire +1 more source