Sciweavers

3552 search results - page 448 / 711
» Proof theory in the abstract
Sort
View
APLAS
2011
ACM
14 years 6 months ago
Solving Recursion-Free Horn Clauses over LI+UIF
Verification of programs with procedures, multi-threaded programs, and higher-order functional programs can be effectively auusing abstraction and refinement schemes that rely o...
Ashutosh Gupta, Corneliu Popeea, Andrey Rybalchenk...
CSL
2009
Springer
16 years 1 months ago
Decidable Relationships between Consistency Notions for Constraint Satisfaction Problems
Abstract. We define an abstract pebble game that provides game interpretations for essentially all known consistency algorithms for constraint satisfaction problems including arc-...
Albert Atserias, Mark Weyer
IPPS
2006
IEEE
16 years 21 days ago
Effecting parallel graph eigensolvers through library composition
— Many interesting problems in graph theory can be reduced to solving an eigenproblem of the adjacency matrix or Laplacian of a graph. Given the availability of high-quality line...
A. Breuer, Peter Gottschling, Douglas Gregor, Andr...
POPL
2007
ACM
16 years 7 months ago
Generative unbinding of names
This paper is concerned with a programming language construct for typed name binding that enforces -equivalence. It proves a new result about what operations on names can co-exist...
Andrew M. Pitts, Mark R. Shinwell
NECO
2007
110views more  NECO 2007»
15 years 6 months ago
Exact Simulation of Integrate-and-Fire Models with Exponential Currents
ll Text][Abstract] , October 1, 2007; 19 (10): 2604-2609.Neural Comput. R. Brette Exact Simulation of Integrate-and-Fire Models with Exponential Currents ll Text][Abstract] , Novem...
Romain Brette