Sciweavers

634 search results - page 112 / 127
» Completion Procedures as Semidecision Procedures
Sort
View
CAV
2009
Springer
215views Hardware» more  CAV 2009»
14 years 9 months ago
Homer: A Higher-Order Observational Equivalence Model checkER
We present HOMER, an observational-equivalence model checker for the 3rd-order fragment of Idealized Algol (IA) augmented with iteration. It works by first translating terms of the...
David Hopkins, C.-H. Luke Ong
POPL
2005
ACM
14 years 8 months ago
Precise interprocedural analysis using random interpretation
We describe a unified framework for random interpretation that generalizes previous randomized intraprocedural analyses, and also extends naturally to efficient interprocedural an...
Sumit Gulwani, George C. Necula
STOC
2005
ACM
112views Algorithms» more  STOC 2005»
14 years 8 months ago
The complexity of agreement
A celebrated 1976 theorem of Aumann asserts that honest, rational Bayesian agents with common priors will never "agree to disagree": if their opinions about any topic ar...
Scott Aaronson
SIGMOD
2008
ACM
139views Database» more  SIGMOD 2008»
14 years 8 months ago
Paths to stardom: calibrating the potential of a peer-based data management system
As peer-to-peer (P2P) networks become more familiar to the database community, intense interest has built up in using their scalability and resilience properties to scale database...
Mihai Lupu, Beng Chin Ooi, Y. C. Tay
ICSE
2007
IEEE-ACM
14 years 8 months ago
Modeling in Software Engineering
A data model is a plan for building a database and is comparable to an architect's building plans. There are two major methodologies used to create a data model: the EntityRe...
Joanne M. Atlee, Robert B. France, Geri Georg, Ana...