Sciweavers

267 search results - page 40 / 54
» Well Founded Semantics for Logic Program Updates
Sort
View
ATVA
2010
Springer
128views Hardware» more  ATVA 2010»
13 years 9 months ago
What's Decidable about Sequences?
Abstract. We present a first-order theory of (finite) sequences with integer elements, Presburger arithmetic, and regularity constraints, which can model significant properties of ...
Carlo A. Furia
CSMR
2008
IEEE
14 years 3 months ago
Hecataeus: A What-If Analysis Tool for Database Schema Evolution
Databases are continuously evolving environments, where design constructs are added, removed or updated rather often. Small changes in the database configurations might impact a l...
George Papastefanatos, Fotini Anagnostou, Yannis V...
C3S2E
2008
ACM
13 years 10 months ago
Context-sensitive cut, copy, and paste
Creating and editing source code are tedious and error-prone processes. One important source of errors in editing programs is the failure to correctly adapt a block of copied code...
Reid Kerr, Wolfgang Stürzlinger
APLAS
2005
ACM
14 years 2 months ago
Transformation to Dynamic Single Assignment Using a Simple Data Flow Analysis
This paper presents a novel method to construct a dynamic single assignment (DSA) form of array-intensive, pointer-free C programs (or in any other procedural language). A program ...
Peter Vanbroekhoven, Gerda Janssens, Maurice Bruyn...
ISSTA
2010
ACM
14 years 16 days ago
Automated fixing of programs with contracts
In program debugging, finding a failing run is only the first step; what about correcting the fault? Can we automate the second task as well as the first? The AutoFix-E tool au...
Yi Wei, Yu Pei, Carlo A. Furia, Lucas S. Silva, St...