Sciweavers

7167 search results - page 558 / 1434
» Answer Set Programming
Sort
View
SAS
2010
Springer
121views Formal Methods» more  SAS 2010»
15 years 3 months ago
Alternation for Termination
Proving termination of sequential programs is an important problem, both for establishing the total correctness of systems and as a component of proving more general termination an...
William R. Harris, Akash Lal, Aditya V. Nori, Srir...
POPL
2002
ACM
16 years 5 months ago
Predicate abstraction for software verification
e Abstraction for Software Verification Cormac Flanagan Shaz Qadeer Compaq Systems Research Center 130 Lytton Ave, Palo Alto, CA 94301 Software verification is an important and di...
Cormac Flanagan, Shaz Qadeer
138
Voted
FM
2009
Springer
124views Formal Methods» more  FM 2009»
15 years 11 months ago
An Incremental Approach to Scope-Bounded Checking Using a Lightweight Formal Method
We present a novel approach to optimize scope-bounded checking programs using a relational constraint solver. Given a program and its correctness specification, the traditional app...
Danhua Shao, Sarfraz Khurshid, Dewayne E. Perry
CEC
2005
IEEE
15 years 10 months ago
Fast evolution of custom machine representations
Described are new approaches for evaluating computer program representations for use in automated search methodologies such as the evolutionary design of software. Previously, prog...
Lorenz Huelsbergen
SWAT
2004
Springer
78views Algorithms» more  SWAT 2004»
15 years 10 months ago
Online Maintenance of k-Medians and k-Covers on a Line
The standard dynamic programming solution to finding k-medians on a line with n nodes requires O(kn2 ) time. Dynamic programming speedup techniques, e.g., use of the quadrangle i...
Rudolf Fleischer, Mordecai J. Golin, Yan Zhang