Sciweavers

272 search results - page 16 / 55
» Programming languages capturing complexity classes
Sort
View
PLDI
2010
ACM
15 years 9 months ago
Jinn: synthesizing dynamic bug detectors for foreign language interfaces
Programming language specifications mandate static and dynamic analyses to preclude syntactic and semantic errors. Although individual languages are usually well-specified, comp...
Byeongcheol Lee, Ben Wiedermann, Martin Hirzel, Ro...
AI
2005
Springer
15 years 4 months ago
: Compiling problem specifications into SAT
We present a compiler that translates a problem specification into a propositional satisfiability test (SAT). Problems are specified in a logic-based language, called NP-SPEC, whi...
Marco Cadoli, Andrea Schaerf
TGC
2005
Springer
15 years 10 months ago
A Distributed Object-Oriented Language with Session Types
Abstract. In the age of the world-wide web and mobile computing, programming communication-centric software is essential. Thus, programmers and program designers are exposed to new...
Mariangiola Dezani-Ciancaglini, Nobuko Yoshida, Al...
ICFP
2009
ACM
16 years 5 months ago
Causal commutative arrows and their optimization
re a popular form of abstract computation. Being more general than monads, they are more broadly applicable, and in parare a good abstraction for signal processing and dataflow co...
Hai Liu, Eric Cheng, Paul Hudak
ICALP
2005
Springer
15 years 10 months ago
Hadamard Tensors and Lower Bounds on Multiparty Communication Complexity
We develop a new method for estimating the discrepancy of tensors associated with multiparty communication problems in the “Number on the Forehead” model of Chandra, Furst and...
Jeff Ford, Anna Gál