Sciweavers

297 search results - page 14 / 60
» ATS: A Language That Combines Programming with Theorem Provi...
Sort
View
ICALP
2003
Springer
15 years 4 months ago
A Direct Sum Theorem in Communication Complexity via Message Compression
We prove lower bounds for the direct sum problem for two-party bounded error randomised multipleround communication protocols. Our proofs use the notion of information cost of a p...
Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
IFM
2010
Springer
183views Formal Methods» more  IFM 2010»
14 years 9 months ago
Certified Absence of Dangling Pointers in a Language with Explicit Deallocation
Safe is a first-order eager functional language with facilities for programmer controlled destruction and copying of data structures. It provides also regions, i.e. disjoint parts...
Javier de Dios, Manuel Montenegro, Ricardo Pe&ntil...
SIGSOFT
2010
ACM
14 years 6 months ago
Language-based verification will change the world
We argue that lightweight, language-based verification is poised to enter mainstream industrial use, where it will have a major impact on software quality and reliability. We expl...
Tim Sheard, Aaron Stump, Stephanie Weirich
POPL
2004
ACM
15 years 12 months ago
Free theorems in the presence of seq
Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., v...
Janis Voigtländer, Patricia Johann
CP
2003
Springer
15 years 4 months ago
Propagation Redundancy in Redundant Modelling
Combining mutually redundant models with channelling constraints increases constraint propagation. However, the extra computation efforts of the additional variables and constraint...
Chiu Wo Choi, Jimmy Ho-Man Lee, Peter J. Stuckey