Sciweavers

1228 search results - page 93 / 246
» Continuations, proofs and tests
Sort
View
PLDI
2009
ACM
16 years 6 months ago
A decision procedure for subset constraints over regular languages
Reasoning about string variables, in particular program inputs, is an important aspect of many program analyses and testing frameworks. Program inputs invariably arrive as strings...
Pieter Hooimeijer, Westley Weimer
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...
TLCA
2009
Springer
16 years 11 days ago
Lexicographic Path Induction
Abstract. Programming languages theory is full of problems that reduce to proving the consistency of a logic, such as the normalization of typed lambda-calculi, the decidability of...
Jeffrey Sarnat, Carsten Schürmann
TPHOL
2007
IEEE
16 years 3 days ago
Formalising Java's Data Race Free Guarantee
We formalise the data race free (DRF) guarantee provided by Java, as captured by the semi-formal Java Memory Model (JMM) [1] and published in the Java Language Specification [2]. ...
David Aspinall, Jaroslav Sevcík
ASM
2005
ASM
15 years 11 months ago
RAM Simulation of BGS Model of Abstract State Machines
lation of BGS model of Abstract State Machines Comandur Seshadhri1 , Anil Seth2 , and Somenath Biswas2 1 Department of Computer Science Princeton University, Princeton NJ 08544, US...
Seshadhri Comandur, Anil Seth, Somenath Biswas