Sciweavers

1027 search results - page 187 / 206
» Callgraph properties of executables
Sort
View
123
Voted
WWW
2001
ACM
16 years 4 months ago
XML Query Forms (XQForms): Declarative Specification of XML Query Interfaces
XQForms is the first generator of Web-based query forms and reports for XML data. XQForms takes as input (i) XML Schemas that model the data to be queried and presented, (ii) decl...
Michalis Petropoulos, Vasilis Vassalos, Yannis Pap...
250
Voted
POPL
2009
ACM
16 years 4 months ago
SPEED: precise and efficient static estimation of program computational complexity
This paper describes an inter-procedural technique for computing symbolic bounds on the number of statements a procedure executes in terms of its scalar inputs and user-defined qu...
Sumit Gulwani, Krishna K. Mehra, Trishul M. Chilim...
PPOPP
2009
ACM
16 years 4 months ago
Formal verification of practical MPI programs
This paper considers the problem of formal verification of MPI programs operating under a fixed test harness for safety properties without building verification models. In our app...
Anh Vo, Sarvani S. Vakkalanka, Michael Delisi, Gan...
113
Voted
HPCA
2006
IEEE
16 years 4 months ago
LogTM: log-based transactional memory
Transactional memory (TM) simplifies parallel programming by guaranteeing that transactions appear to execute atomically and in isolation. Implementing these properties includes p...
Kevin E. Moore, Jayaram Bobba, Michelle J. Moravan...
ICALP
2009
Springer
16 years 4 months ago
LTL Path Checking Is Efficiently Parallelizable
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
Lars Kuhtz, Bernd Finkbeiner