Sciweavers

219 search results - page 33 / 44
» Automatic Verification of Determinism for Structured Paralle...
Sort
View
125
Voted
CADE
2007
Springer
16 years 3 months ago
Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
Viktor Kuncak, Martin C. Rinard
110
Voted
SIGSOFT
2003
ACM
16 years 3 months ago
Regression testing of GUIs
Although graphical user interfaces (GUIs) constitute a large part of the software being developed today and are typically created using rapid prototyping, there are no effective r...
Atif M. Memon, Mary Lou Soffa
144
Voted
AGP
1999
IEEE
15 years 7 months ago
ACI1 constraints
Disunification is the problem of deciding satisfiability of a system of equations and disequations with respect to a given equational theory. In this paper we study the disunifica...
Agostino Dovier, Carla Piazza, Enrico Pontelli, Gi...
135
Voted
SIGSOFT
2007
ACM
16 years 3 months ago
A specification-based approach to testing software product lines
This paper presents a specification-based approach for systematic testing of products from a software product line. Our approach uses specifications given as formulas in Alloy, a ...
Engin Uzuncaova, Daniel Garcia, Sarfraz Khurshid, ...
147
Voted
POPL
2010
ACM
16 years 3 days ago
Low-Level Liquid Types
We present Low-Level Liquid Types, a refinement type system for C based on Liquid Types. Low-Level Liquid Types combine refinement types with three key elements to automate verifi...
Ming Kawaguchi, Patrick Maxim Rondon, Ranjit Jhala