Sciweavers

797 search results - page 88 / 160
» Eliminating Proofs from Programs
Sort
View
MPC
1995
Springer
116views Mathematics» more  MPC 1995»
14 years 1 months ago
Computer-Aided Computing
PVS is a highly automated framework for speci cation and veri cation. We show how the language and deduction features of PVS can be used to formalize, mechanize, and apply some us...
Natarajan Shankar
CONSTRAINTS
2010
193views more  CONSTRAINTS 2010»
13 years 7 months ago
Constraint propagation on quadratic constraints
This paper considers constraint propagation methods for continuous constraint satisfaction problems consisting of linear and quadratic constraints. All methods can be applied after...
Ferenc Domes, Arnold Neumaier
DRM
2007
Springer
14 years 4 months ago
Slicing obfuscations: design, correctness, and evaluation
The goal of obfuscation is to transform a program, without affecting its functionality, such that some secret information within the program can be hidden for as long as possible...
Anirban Majumdar, Stephen Drape, Clark D. Thombors...
VMCAI
2004
Springer
14 years 3 months ago
Construction of a Semantic Model for a Typed Assembly Language
Typed Assembly Languages (TALs) can be used to validate the safety of assembly-language programs. However, typing rules are usually trusted as axioms. In this paper, we show how to...
Gang Tan, Andrew W. Appel, Kedar N. Swadi, Dinghao...
ESORICS
2002
Springer
14 years 9 months ago
TINMAN: A Resource Bound Security Checking System for Mobile Code
Resource security pertains to the prevention of unauthorized usage of system resources that may not directly cause corruption or leakage of information. A common breach of resource...
Aloysius K. Mok, Weijiang Yu