Sciweavers

1083 search results - page 146 / 217
» Using Contextual Logic Programming for Temporal Reasoning
Sort
View
123
Voted
ICFP
2003
ACM
16 years 2 months ago
Software is discrete mathematics
A three-year study collected information bearing on the question of whether studying mathematics improves programming skills. An analysis of the data revealed significant differen...
Rex L. Page
KR
1998
Springer
15 years 6 months ago
Combining Narratives
A theory is elaboration tolerant to the extent that new information can be incorporated with only simple changes. The simplest change is conjoining new information, and only conju...
John McCarthy, Tom Costello
POPL
2009
ACM
16 years 3 months ago
Formal certification of code-based cryptographic proofs
As cryptographic proofs have become essentially unverifiable, cryptographers have argued in favor of developing techniques that help tame the complexity of their proofs. Game-base...
Benjamin Grégoire, Gilles Barthe, Santiago ...
TACAS
2005
Springer
78views Algorithms» more  TACAS 2005»
15 years 8 months ago
Separating Fairness and Well-Foundedness for the Analysis of Fair Discrete Systems
Fair discrete systems (FDSs) are a computational model of concurrent programs where fairness assumptions are specified in terms of sets of states. The analysis of fair discrete sy...
Amir Pnueli, Andreas Podelski, Andrey Rybalchenko
220
Voted
POPL
2006
ACM
16 years 2 months ago
On flow-sensitive security types
This article investigates formal properties of a family of semantically sound flow-sensitive type systems for tracking information flow in simple While programs. The family is ind...
Sebastian Hunt, David Sands