Sciweavers

5506 search results - page 43 / 1102
» Minimal Logic Programs
Sort
View
100
Voted
CSL
2004
Springer
15 years 4 months ago
Towards Mechanized Program Verification with Separation Logic
Using separation logic, this paper presents three Hoare logics (corresponding to different notions of correctness) for the simple While language extended with commands for heap acc...
Tjark Weber
113
Voted
PPOPP
2006
ACM
15 years 6 months ago
Minimizing execution time in MPI programs on an energy-constrained, power-scalable cluster
Recently, the high-performance computing community has realized that power is a performance-limiting factor. One reason for this is that supercomputing centers have limited power ...
Robert Springer, David K. Lowenthal, Barry Rountre...
78
Voted
OOPSLA
2009
Springer
15 years 7 months ago
Minimizing dependencies within generic classes for faster and smaller programs
Generic classes can be used to improve performance by allowing compile-time polymorphism. But the applicability of compile-time polymorphism is narrower than that of runtime polym...
Dan Tsafrir, Robert W. Wisniewski, David F. Bacon,...
99
Voted
LPNMR
2007
Springer
15 years 6 months ago
Semantics for Possibilistic Disjunctive Programs
In this paper by considering an answer set programming approach and some basic ideas from possibilistic logic, we introduce a possibilistic disjunctive logic programming approach t...
Juan Carlos Nieves, Mauricio Osorio, Ulises Cort&e...
109
Voted
LOPSTR
2009
Springer
15 years 7 months ago
Deciding Full Branching Time Logic by Program Transformation
Abstract. We present a method based on logic program transformation, for verifying Computation Tree Logic (CTL∗ ) properties of finite state reactive systems. The finite state ...
Alberto Pettorossi, Maurizio Proietti, Valerio Sen...