407 search results - page 58 / 82 » Automatic Correctness Proofs for Logic Program Transformatio... |
POPL
2010
ACM
14 years 5 months ago
2010
ACM
We present an analysis to automatically determine if a program represents a continuous function, or equivalently, if infinitesimal changes to its inputs can only cause infinitesim...
MIDDLEWARE
2009
Springer
14 years 2 months ago
2009
Springer
The emergence of networked devices in the home has made it possible to develop applications that control a variety of household functions. However, current devices communicate via ...
GECCO
2009
Springer
14 years 2 months ago
2009
Springer
We describe a methodology for evolving Java bytecode, enabling the evolution of extant, unrestricted Java programs, or programs in other languages that compile to Java bytecode. B...
FPGA
2005
ACM
14 years 1 months ago
2005
ACM
We present an automatic logic synthesis method targeted for highperformance asynchronous FPGA (AFPGA) architectures. Our method transforms sequential programs as well as high-leve...
TCC
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We present a general method to prove security properties of cryptographic protocols against active adversaries, when the messages exchanged by the honest parties are arbi...