Sciweavers

315 search results - page 62 / 63
» Reasoning about Assignments in Recursive Data Structures
Sort
View
SIGSOFT
2007
ACM
16 years 10 days ago
Finding bugs efficiently with a SAT solver
We present an approach for checking code against rich specifications, based on existing work that consists of encoding the program in a relational logic and using a constraint sol...
Julian Dolby, Mandana Vaziri, Frank Tip
181
Voted
POPL
2006
ACM
15 years 12 months ago
Verifying properties of well-founded linked lists
We describe a novel method for verifying programs that manipulate linked lists, based on two new predicates that characterize reachability of heap cells. These predicates allow re...
Shuvendu K. Lahiri, Shaz Qadeer
POPL
2010
ACM
15 years 9 months ago
Toward a Verified Relational Database Management System
We report on our experience implementing a lightweight, fully verified relational database management system (RDBMS). The functional specification of RDBMS behavior, RDBMS impleme...
Avraham Shinnar, Greg Morrisett, J. Gregory Malech...
POPL
2010
ACM
15 years 9 months ago
Counterexample-Guided Focus
The automated inference of quantified invariants is considered one of the next challenges in software verification. The question of the right precision-efficiency tradeoff for the...
Andreas Podelski, Thomas Wies
ICWE
2003
Springer
15 years 4 months ago
Semi-automatic Assessment Process in a Ubiquitous Environment for Language Learning
This work presents a research on the methods and mechanisms necessary to bring the Information and Communication Technologies in the traditional classroom. This will be achieved by...
Maximiliano Paredes, Manuel Ortega, Pedro P. S&aac...