Sciweavers

394 search results - page 48 / 79
» Formal polytypic programs and proofs
Sort
View
POPL
2008
ACM
14 years 8 months ago
Proving non-termination
The search for proof and the search for counterexamples (bugs) are complementary activities that need to be pursued concurrently in order to maximize the practical success rate of...
Ashutosh Gupta, Thomas A. Henzinger, Rupak Majumda...
ISSTA
2009
ACM
14 years 2 months ago
An annotation assistant for interactive debugging of programs with common synchronization idioms
This paper explores an approach to improving the practical usability of static verification tools for debugging synchronization idioms. Synchronization idioms such as mutual excl...
Tayfun Elmas, Ali Sezgin, Serdar Tasiran, Shaz Qad...
ECOOP
2009
Springer
14 years 8 months ago
From Public to Private to Absent: Refactoring Java Programs under Constrained Accessibility
Contemporary refactoring tools for JAVA aiding in the restructuring of programs have problems with respecting access modifiers such as public and private: while some tools provide ...
Friedrich Steimann, Andreas Thies
PPDP
2009
Springer
14 years 2 months ago
Set functions for functional logic programming
We propose a novel approach to encapsulate non-deterministic computations in functional logic programs. Our approach is based on set functions that return the set of all the resul...
Sergio Antoy, Michael Hanus
CHARME
2003
Springer
100views Hardware» more  CHARME 2003»
14 years 1 months ago
Inductive Assertions and Operational Semantics
This paper shows how classic inductive assertions can be used in conjunction with an operational semantics to prove partial correctness properties of programs. The method imposes o...
J. Strother Moore