Sciweavers

96 search results - page 15 / 20
» A Short Survey of Automated Reasoning
Sort
View
ICFP
2005
ACM
15 years 9 months ago
A computational approach to reflective meta-reasoning about languages with bindings
We present a foundation for a computational meta-theory of languages with bindings implemented in a computer-aided formal reasoning environment. Our theory provides the ability to...
Aleksey Nogin, Alexei Kopylov, Xin Yu, Jason Hicke...
CSFW
2010
IEEE
15 years 1 months ago
Approximation and Randomization for Quantitative Information-Flow Analysis
—Quantitative information-flow analysis (QIF) is an emerging technique for establishing information-theoretic confidentiality properties. Automation of QIF is an important step...
Boris Köpf, Andrey Rybalchenko
CSL
2009
Springer
15 years 1 months ago
Fixed-Point Definability and Polynomial Time
My talk will be a survey of recent results about the quest for a logic capturing polynomial time. In a fundamental study of database query languages, Chandra and Harel [4] first ra...
Martin Grohe
GIS
2010
ACM
14 years 8 months ago
Spatial data infrastructures as complex adaptive systems
Many researchers throughout the world have been struggling to better understand and describe Spatial Data Infrastructures (SDIs). Our knowledge of the real forces and mechanisms b...
L. Grus, Joep Crompvoets, A. K. Bregt
71
Voted
POPL
2010
ACM
15 years 7 months ago
Structuring the verification of heap-manipulating programs
Most systems based on separation logic consider only restricted forms of implication or non-separating conjunction, as full support for these connectives requires a non-trivial no...
Aleksandar Nanevski, Josh Berdine, Viktor Vafeiadi...