Sciweavers

1799 search results - page 351 / 360
» The Logic of Correctness in Software Engineering
Sort
View
POPL
2005
ACM
14 years 7 months ago
Transition predicate abstraction and fair termination
on Predicate Abstraction and Fair Termination Andreas Podelski Andrey Rybalchenko Max-Planck-Institut f?ur Informatik Saarbr?ucken, Germany Predicate abstraction is the basis of m...
Andreas Podelski, Andrey Rybalchenko
LCTRTS
2005
Springer
14 years 27 days ago
Preventing interrupt overload
Performance guarantees can be given to tasks in an embedded system by ensuring that access to each shared resource is mediated by an appropriate scheduler. However, almost all pre...
John Regehr, Usit Duongsaa
CLUSTER
2002
IEEE
14 years 11 days ago
Leveraging Standard Core Technologies to Programmatically Build Linux Cluster Appliances
Clusters have made the jump from lab prototypes to fullfledged production computing platforms. The number, variety, and specialized configurations of these machines are increasi...
Mason J. Katz, Philip M. Papadopoulos, Greg Bruno
CORR
2010
Springer
144views Education» more  CORR 2010»
13 years 7 months ago
Algorithmic Verification of Single-Pass List Processing Programs
We introduce streaming data string transducers that map input data strings to output data strings in a single left-to-right pass in linear time. Data strings are (unbounded) seque...
Rajeev Alur, Pavol Cerný
POPL
2005
ACM
14 years 7 months ago
Precise interprocedural analysis using random interpretation
We describe a unified framework for random interpretation that generalizes previous randomized intraprocedural analyses, and also extends naturally to efficient interprocedural an...
Sumit Gulwani, George C. Necula