Sciweavers

3 search results - page 1 / 1
» Terminating Tableaux for the Basic Fragment of Simple Type T...
Sort
View
TABLEAUX
2009
Springer
14 years 4 days ago
Terminating Tableaux for the Basic Fragment of Simple Type Theory
base types and disallows lambda abstractions and quantifiers. We show that this fragment has the finite model property and that satisfiability can be decided with a terminating ...
Chad E. Brown, Gert Smolka
ESOP
2000
Springer
13 years 9 months ago
Polyvariant Flow Analysis with Constrained Types
Abstract. The basic idea behind improving the quality of a monovariant control flow analysis such as 0CFA is the concept of polyvariant analyses such as Agesen's Cartesian Pro...
Scott F. Smith, Tiejun Wang
PSSE
2004
Springer
13 years 11 months ago
Developing and Reasoning About Probabilistic Programs in pGCL
“demonic” nondeterminism, representing abstraction from (or ignorance of) which of two program fragments will be executed. By introducing probabilistic nondeterminism into GCL,...
Annabelle McIver, Carroll Morgan