1894 search results - page 195 / 379 » A TLA Proof System |
159
click to vote
VMCAI
2004
Springer
15 years 9 months ago
2004
Springer
Typed Assembly Languages (TALs) can be used to validate the safety of assembly-language programs. However, typing rules are usually trusted as axioms. In this paper, we show how to...
140
click to vote
DBPL
1995
Springer
15 years 8 months ago
1995
Springer
We study the problem of maintaining recursively-de ned views, such as the transitive closure of a relation, in traditional relational languages that do not have recursion mechanis...
256
click to vote
PLDI
2009
ACM
16 years 5 months ago
2009
ACM
Reasoning about string variables, in particular program inputs, is an important aspect of many program analyses and testing frameworks. Program inputs invariably arrive as strings...
162
click to vote
ICFP
2005
ACM
16 years 4 months ago
2005
ACM
We study the relation between Nominal Logic and the Theory of Contexts, two approaches for specifying and reasoning about datatypes with binders. We consider a natural-deduction s...
120
click to vote
PPOPP
2010
ACM
16 years 1 months ago
2010
ACM
We present a core calculus with two of X10's key constructs for parallelism, namely async and finish. Our calculus forms a convenient basis for type systems and static analys...