Sciweavers

69 search results - page 9 / 14
» Automated fixing of programs with contracts
Sort
View
103
Voted
FAC
2007
170views more  FAC 2007»
14 years 9 months ago
Are the Logical Foundations of Verifying Compiler Prototypes Matching user Expectations?
Abstract. The Verifying Compiler (VC) project proposals suggest that mainstream software developers are its targeted end-users. Like other software engineering efforts, the VC proj...
Patrice Chalin
187
Voted
ICLP
2009
Springer
15 years 10 months ago
Computing Loops with at Most One External Support Rule for Disjunctive Logic Programs
We extend to disjunctive logic programs our previous work on computing loop formulas of loops with at most one external support. We show that for these logic programs, loop formula...
Xiaoping Chen, Jianmin Ji, Fangzhen Lin
87
Voted
CADE
2007
Springer
15 years 9 months ago
Inferring Invariants by Symbolic Execution
In this paper we propose a method for inferring invariants for loops in Java programs. An example of a simple while loop is used throughout the paper to explain our approach. The m...
Benjamin Weiß, Peter H. Schmitt
71
Voted
HOTSWUP
2009
ACM
15 years 2 months ago
Dynamic Software Updates: The State Mapping Problem
We consider the state mapping problem for dynamic software updates and propose a number of approaches that have the potential of automating the state mapping in practical setting....
Rida A. Bazzi, Kristis Makris, Peyman Nayeri, Jun ...
CADE
2005
Springer
15 years 9 months ago
A Focusing Inverse Method Theorem Prover for First-Order Linear Logic
We present the theory and implementation of a theorem prover for first-order intuitionistic linear logic based on the inverse method. The central proof-theoretic insights underlyin...
Kaustuv Chaudhuri, Frank Pfenning