4719 search results - page 636 / 944 » Newtonian program analysis |
187
click to vote
TCAD
2008
15 years 6 months ago
2008
The quality and the correctness of software is often the greatest concern in electronic systems. Formal verification tools can provide a guarantee that a design is free of specific...
180
click to vote
JLP
2007
15 years 6 months ago
2007
Secret or private information may be leaked to an external attacker through the timing behaviour of the system running the untrusted code. After introducing a formalisation of thi...
174
Voted
AAECC
1999
Springer
15 years 6 months ago
1999
Springer
Effective quantifier elimination procedures for the reals allow to solve problems that can be encoded into corresponding first-order formulas including ordering constraints. In con...
138
click to vote
JAR
1998
15 years 6 months ago
1998
It is shown how self-resolving clauses like symmetry or transitivity, or even clauses like condensed detachment, can faithfully be deleted from the clause set thus eliminating or ...
153
click to vote
JLP
1998
15 years 6 months ago
1998
Using constraint logic techniques, it is made possible to use a wellknown metainterpreter backwards as a device for generating programs. A metainterpreter is developed, which prov...