Sciweavers

2881 search results - page 238 / 577
» Model Checking for Programming Languages using Verisoft
Sort
View
286
Voted
POPL
2008
ACM
16 years 6 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...
PLDI
2005
ACM
16 years 2 days ago
Path slicing
We present a new technique, path slicing, that takes as input a possibly infeasible path to a target location, and eliminates all the operations that are irrelevant towards the re...
Ranjit Jhala, Rupak Majumdar
POPL
2009
ACM
16 years 7 months ago
Focusing on pattern matching
In this paper, we show how pattern matching can be seen to arise from a proof term assignment for the focused sequent calculus. This use of the Curry-Howard correspondence allows ...
Neelakantan R. Krishnaswami
ECOOP
2009
Springer
16 years 7 months ago
Debugging Method Names
Meaningful method names are crucial for the readability and maintainability of software. Existing naming conventions focus on syntactic details, leaving programmers with little or ...
Bjarte M. Østvold, Einar W. Høst
ESOP
2007
Springer
16 years 21 days ago
Interprocedurally Analysing Linear Inequality Relations
In this paper we present an alternative approach to interprocedurally g linear inequality relations. We propose an abstraction of the effects of procedures through convex sets of t...
Helmut Seidl, Andrea Flexeder, Michael Petter