Sciweavers

154 search results - page 23 / 31
» Cryptographically Sound Theorem Proving
Sort
View
IPL
2008
102views more  IPL 2008»
13 years 7 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
TAP
2010
Springer
134views Hardware» more  TAP 2010»
13 years 5 months ago
Testing First-Order Logic Axioms in Program Verification
Program verification systems based on automated theorem provers rely on user-provided axioms in order to verify domain-specific properties of code. However, formulating axioms corr...
Ki Yung Ahn, Ewen Denney
VSTTE
2012
Springer
12 years 3 months ago
Infeasible Code Detection
A piece of code in a computer program is infeasible if it cannot be part of any normally-terminating execution of the program. We develop an algorithm for the automatic detection o...
Cristiano Bertolini, Martin Schäf, Pascal Sch...
LICS
2012
IEEE
11 years 10 months ago
Logics of Dynamical Systems
—We study the logic of dynamical systems, that is, logics and proof principles for properties of dynamical systems. Dynamical systems are mathematical models describing how the s...
André Platzer
ESORICS
2010
Springer
13 years 8 months ago
Enforcing Secure Object Initialization in Java
Sun and the CERT recommend for secure Java development to not allow partially initialized objects to be accessed. The CERT considers the severity of the risks taken by not followin...
Laurent Hubert, Thomas P. Jensen, Vincent Monfort,...