Sciweavers

119 search results - page 11 / 24
» Reasoning about Lists via List Interleaving
Sort
View
PLDI
2011
ACM
14 years 1 months ago
Separation logic + superposition calculus = heap theorem prover
Program analysis and verification tools crucially depend on the ability to symbolically describe and reason about sets of program behaviors. Separation logic provides a promising...
Juan Antonio Navarro Pérez, Andrey Rybalche...
SAS
1993
Springer
104views Formal Methods» more  SAS 1993»
15 years 2 months ago
Strictness Properties of Lazy Algebraic Datatypes
A new construction of a finite set of strictness properties for any lazy algebraic datatype is presented. The construction is based on the categorical view of the solutions to the...
P. N. Benton
LICS
2008
IEEE
15 years 4 months ago
The Quest for a Logic Capturing PTIME
The question of whether there is a logic that captures polynomial time is the central open problem in descriptive complexity theory. In my talk, I will review the question and the...
Martin Grohe
CHI
2009
ACM
15 years 3 months ago
A design evaluation of a user interface for tending long-term tasks
Organizational processes often take place over long periods of time and require intermittent attention. Remembering and reasoning about upcoming process tasks is important, but no...
Robert Farrell, Hina Shah, Thomas Erickson, Wendy ...
AIRS
2005
Springer
15 years 11 days ago
On Effectiveness Measures and Relevance Functions in Ranking INEX Systems
Abstract. This paper investigates the effect of performance measures and relevance functions in comparing retrieval systems in INEX, an evaluation forum dedicated to XML retrieval....
Huyen-Trang Vu, Patrick Gallinari