Sciweavers

3552 search results - page 390 / 711
» Proof theory in the abstract
Sort
View
CL
2012
Springer
13 years 9 months ago
Maintaining distributed logic programs incrementally
Distributed logic programming languages, that allow both facts and programs to be distributed among different nodes in a network, have been recently proposed and used to declarati...
Vivek Nigam, Limin Jia, Boon Thau Loo, Andre Scedr...
ICFP
2012
ACM
13 years 9 months ago
Propositions as sessions
Continuing a line of work by Abramsky (1994), by Bellin and Scott (1994), and by Caires and Pfenning (2010), among others, this paper presents CP, a calculus in which propositions...
Philip Wadler
POPL
2006
ACM
16 years 7 months 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, ...
ICFP
2007
ACM
16 years 6 months ago
Relating complexity and precision in control flow analysis
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
David Van Horn, Harry G. Mairson
SODA
2010
ACM
216views Algorithms» more  SODA 2010»
16 years 4 months ago
On linear and semidefinite programming relaxations for hypergraph matching
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
Yuk Hei Chan, Lap Chi Lau