Sciweavers

1686 search results - page 230 / 338
» Programs as polygraphs: computability and complexity
Sort
View
PODS
2006
ACM
138views Database» more  PODS 2006»
16 years 4 months ago
Efficiently ordering subgoals with access constraints
d Abstract] Guizhen Yang Artificial Intelligence Center SRI International Menlo Park, CA 94025, USA Michael Kifer Dept. of Computer Science Stony Brook University Stony Brook, NY 1...
Guizhen Yang, Michael Kifer, Vinay K. Chaudhri
VEE
2009
ACM
246views Virtualization» more  VEE 2009»
15 years 10 months ago
Tracing for web 3.0: trace compilation for the next generation web applications
Today’s web applications are pushing the limits of modern web browsers. The emergence of the browser as the platform of choice for rich client-side applications has shifted the ...
Mason Chang, Edwin W. Smith, Rick Reitmaier, Micha...
ISSTA
2006
ACM
15 years 10 months ago
The case for analysis preserving language transformation
Static analysis has gained much attention over the past few years in applications such as bug finding and program verification. As software becomes more complex and componentize...
Xiaolan Zhang, Larry Koved, Marco Pistoia, Sam Web...
TACAS
2005
Springer
124views Algorithms» more  TACAS 2005»
15 years 9 months ago
Localization and Register Sharing for Predicate Abstraction
ion Himanshu Jain1,2 , Franjo Ivanˇci´c1 , Aarti Gupta1 , and Malay K. Ganai1 1 NEC Laboratories America, Inc., 4 Independence Way, Princeton, NJ 08540 2 School of Computer Scien...
Himanshu Jain, Franjo Ivancic, Aarti Gupta, Malay ...
WCRE
2003
IEEE
15 years 9 months ago
Toward an environment for comprehending distributed systems
Many modern software systems are often large, distributed, written in more than one programming language, and developed using pre-built components. This paper presents the results...
Maher Salah, Spiros Mancoridis