Sciweavers

4940 search results - page 25 / 988
» On the Complexity of Universal Programs
Sort
View
ECOOP
2011
Springer
14 years 1 months ago
Tunable Static Inference for Generic Universe Types
Object ownership is useful for many applications, including program verification, thread synchronization, and memory management. However, the annotation overhead of ownership type...
Werner Dietl, Michael D. Ernst, Peter Müller
WCRE
2000
IEEE
15 years 5 months ago
Reverse Engineering from Assembler to Formal Specifications via Program Transformations
The FermaT transformation system, based on research carried out over the last sixteen years at Durham University, De Montfort University and Software Migrations Ltd., is an indust...
Martin P. Ward
LPAR
2005
Springer
15 years 7 months ago
Model Checking Abstract State Machines with Answer Set Programming
ECKING ABSTRACT STATE MACHINES WITH ANSWER SET PROGRAMMING by Calvin Kai Fan Tang B.Sc., Simon Fraser University, 2003 a thesis submitted in partial fulfillment of the requirements...
Calvin Kai Fan Tang, Eugenia Ternovska
111
Voted
LATINCRYPT
2010
15 years 9 days ago
On the Round Complexity of Zero-Knowledge Proofs Based on One-Way Permutations
We consider the following problem: can we construct constant-round zero-knowledge proofs (with negligible soundness) for NP assuming only the existence of one-way permutations? We...
S. Dov Gordon, Hoeteck Wee, David Xiao, Arkady Yer...
129
Voted
APLAS
2004
ACM
15 years 7 months ago
Build, Augment and Destroy, Universally
Abstract. We give a semantic footing to the fold/build syntax of programming with inductive types, covering shortcut deforestation, based on a universal property. Specifically, we...
Neil Ghani, Tarmo Uustalu, Varmo Vene