Sciweavers

16568 search results - page 3214 / 3314
» Structured Data on the Web
Sort
View
POPL
2006
ACM
14 years 9 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
2003
ACM
14 years 9 months ago
New results on the computability and complexity of points - to analysis
Given a program and two variables p and q, the goal of points-to analysis is to check if p can point to q in some execution of the program. This well-studied problem plays a cruci...
Venkatesan T. Chakaravarthy
RECOMB
2006
Springer
14 years 9 months ago
Simulating Protein Motions with Rigidity Analysis
Abstract. Protein motions, ranging from molecular flexibility to largescale conformational change, play an essential role in many biochemical processes. Despite the explosion in ou...
Shawna L. Thomas, Xinyu Tang, Lydia Tapia, Nancy M...
CADE
2007
Springer
14 years 9 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
ICALP
2009
Springer
14 years 9 months ago
Universal Succinct Representations of Trees?
Abstract. We consider the succinct representation of ordinal and cardinal trees on the RAM with logarithmic word size. Given a tree T, our representations support the following ope...
Arash Farzan, Rajeev Raman, S. Srinivasa Rao
« Prev « First page 3214 / 3314 Last » Next »