Sciweavers

918 search results - page 39 / 184
» e-Procurement Using Goal Programming
Sort
View
TLCA
2009
Springer
14 years 3 months ago
Relating Classical Realizability and Negative Translation for Existential Witness Extraction
Friedman showed how to turn a classical proof of a Σ0 1 formula into an intuitionistic proof of the same formula, thus giving an effective method to extract witnesses from classi...
Alexandre Miquel
ISCAPDCS
2004
13 years 10 months ago
Semantic Encryption Transformation Scheme
We present a scheme to protect mobile code from malicious hosts. We propose a transformation scheme that changes the semantics of a program using pseudorandom I/O scrambling, cond...
Willard Thompson, Alec Yasinsac, J. Todd McDonald
JLP
2007
114views more  JLP 2007»
13 years 8 months ago
Deaccumulation techniques for improving provability
Several induction theorem provers were developed to verify functional programs mechanically. Unfortunately, automatic verification often fails for functions with accumulating arg...
Jürgen Giesl, Armin Kühnemann, Janis Voi...
ICS
1998
Tsinghua U.
14 years 26 days ago
High-level Management of Communication Schedules in HPF-like Languages
The goal of High Performance Fortran (HPF) is to "address the problems of writing data parallel programs where the distribution of data affects performance", providing t...
Siegfried Benkner, Piyush Mehrotra, John Van Rosen...
ENTCS
2008
97views more  ENTCS 2008»
13 years 8 months ago
Meta-programming With Built-in Type Equality
We report our experience with exploring a new point in the design space for formal reasoning systems: the development of the programming language mega. mega is intended as both a ...
Tim Sheard, Emir Pasalic