Sciweavers

417 search results - page 64 / 84
» Results on Reasoning about Updates in Transaction Logic
Sort
View
IGPL
2008
124views more  IGPL 2008»
15 years 7 hour ago
The Ricean Objection: An Analogue of Rice's Theorem for First-order Theories
We propose here an extension of Rice's Theorem to first-order logic, proven by totally elementary means. If P is any property defined over the collection of all first-order t...
Igor Carboni Oliveira, Walter Alexandre Carnielli
ICFP
2009
ACM
16 years 1 months ago
Non-parametric parametricity
Type abstraction and intensional type analysis are features seemingly at odds--type abstraction is intended to guarantee parametricity and representation independence, while type ...
Georg Neis, Derek Dreyer, Andreas Rossberg
POPL
2010
ACM
15 years 10 months ago
A Theory of Indirection via Approximation
Building semantic models that account for various kinds of indirect reference has traditionally been a difficult problem. Indirect reference can appear in many guises, such as hea...
Aquinas Hobor, Robert Dockins, Andrew W. Appel
CCS
2006
ACM
15 years 4 months ago
Secure information flow with random assignment and encryption
Type systems for secure information flow aim to prevent a program from leaking information from variables classified as H to variables classified as L. In this work we extend such...
Geoffrey Smith
110
Voted
JCST
2010
189views more  JCST 2010»
14 years 7 months ago
Formally Analyzing Expected Time Complexity of Algorithms Using Theorem Proving
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
Osman Hasan, Sofiène Tahar