Sciweavers

518 search results - page 75 / 104
» Automating Proofs in Category Theory
Sort
View
DRM
2007
Springer
15 years 6 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...
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
16 years 2 days ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Jochen Könemann, R. Ravi
ATAL
2008
Springer
15 years 1 months ago
Modelling coalitions: ATL + argumentation
In the last few years, argumentation frameworks have been successfully applied to multi agent systems. Recently, argumentation has been used to provide a framework for reasoning a...
Nils Bulling, Jürgen Dix, Carlos Iván ...
POPL
2012
ACM
13 years 7 months ago
Run your research: on the effectiveness of lightweight mechanization
Formal models serve in many roles in the programming language community. In its primary role, a model communicates the idea of a language design; the architecture of a language to...
Casey Klein, John Clements, Christos Dimoulas, Car...
POPL
2006
ACM
16 years 3 days ago
Engineering with logic: HOL specification and symbolic-evaluation testing for TCP implementations
The TCP/IP protocols and Sockets API underlie much of modern computation, but their semantics have historically been very complex and ill-defined. The real standard is the de fact...
Steve Bishop, Matthew Fairbairn, Michael Norrish, ...