Sciweavers

1330 search results - page 251 / 266
» No Classic Boundary Conditions
Sort
View
POPL
2008
ACM
15 years 9 months ago
Cyclic proofs of program termination in separation logic
We propose a novel approach to proving the termination of heapmanipulating programs, which combines separation logic with cyclic proof within a Hoare-style proof system. Judgement...
James Brotherston, Richard Bornat, Cristiano Calca...
100
Voted
PODS
2008
ACM
152views Database» more  PODS 2008»
15 years 9 months ago
Towards a theory of schema-mapping optimization
A schema mapping is a high-level specification that describes the relationship between two database schemas. As schema mappings constitute the essential building blocks of data ex...
Ronald Fagin, Phokion G. Kolaitis, Alan Nash, Luci...
POPL
2010
ACM
15 years 6 months ago
Continuity Analysis of Programs
We present an analysis to automatically determine if a program represents a continuous function, or equivalently, if infinitesimal changes to its inputs can only cause infinitesim...
Swarat Chaudhuri, Sumit Gulwani, Roberto Lublinerm...
EUROSYS
2009
ACM
15 years 6 months ago
Dingo: taming device drivers
Device drivers are notorious for being a major source of failure in operating systems. In analysing a sample of real defects in Linux drivers, we found that a large proportion (39...
Leonid Ryzhyk, Peter Chubb, Ihor Kuz, Gernot Heise...
TACAS
2010
Springer
145views Algorithms» more  TACAS 2010»
15 years 4 months ago
Rational Synthesis
Abstract. Synthesis is the automated construction of a system from its specification. The system has to satisfy its specification in all possible environments. Modern systems oft...
Dana Fisman, Orna Kupferman, Yoad Lustig