899 search results - page 73 / 180 » A CTL-Based Logic for Program Abstractions |
160
click to vote
INFORMS
1998
15 years 3 months ago
1998
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
134
click to vote
ASPLOS
2011
ACM
14 years 7 months ago
2011
ACM
In practice, it is quite difficult to write correct multithreaded programs due to the potential for unintended and nondeterministic interference between parallel threads. A funda...
142
Voted
FLOPS
1999
Springer
15 years 8 months ago
1999
Springer
Abstract. Subtyping tends to undermine the effects of parametric polymorphism as far as the static detection of type errors is concerned. Starting with this observation we present...
146
click to vote
BIRTHDAY
2010
Springer
15 years 4 months ago
2010
Springer
In this paper, we present an overview to programming with proofs in the reasoning framework, Beluga. Beluga supports the specification of formal systems given by axioms and inferen...
133
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
am analysis and has been widely studied. In this paper we consider this problem at the abstraction level of program schemas in which computations occur in the Herbrand domain of te...