Sciweavers

114 search results - page 22 / 23
» Specialized Aspect Languages Preserving Classes of Propertie...
Sort
View
JACM
2000
81views more  JACM 2000»
13 years 5 months ago
Relational queries over interpreted structures
We rework parts of the classical relational theory when the underlying domain is a structure with some interpreted operations that can be used in queries. We identify parts of the...
Michael Benedikt, Leonid Libkin
SIGSOFT
2008
ACM
14 years 6 months ago
Randomized active atomicity violation detection in concurrent programs
Atomicity is an important specification that enables programmers to understand atomic blocks of code in a multi-threaded program as if they are sequential. This significantly simp...
Chang-Seo Park, Koushik Sen
POPL
2007
ACM
14 years 5 months ago
Program verification as probabilistic inference
In this paper, we propose a new algorithm for proving the validity or invalidity of a pre/postcondition pair for a program. The algorithm is motivated by the success of the algori...
Sumit Gulwani, Nebojsa Jojic
POPL
2011
ACM
12 years 8 months ago
Decidable logics combining heap structures and data
We define a new logic, STRAND, that allows reasoning with heapmanipulating programs using deductive verification and SMT solvers. STRAND logic (“STRucture ANd Data” logic) f...
P. Madhusudan, Gennaro Parlato, Xiaokang Qiu
SIGECOM
2003
ACM
122views ECommerce» more  SIGECOM 2003»
13 years 10 months ago
On polynomial-time preference elicitation with value queries
Preference elicitation — the process of asking queries to determine parties’ preferences — is a key part of many problems in electronic commerce. For example, a shopping age...
Martin Zinkevich, Avrim Blum, Tuomas Sandholm