Sciweavers

816 search results - page 47 / 164
» Automating Verification by Functional Abstraction at the Sys...
Sort
View
ALP
1997
Springer
14 years 1 months ago
Optimal Non-deterministic Functional Logic Computations
Abstract. We show that non-determinism simplifies coding certain problems into programs. We define a non-confluent, but well-behaved class of rewrite systems for supporting non-...
Sergio Antoy
LCTRTS
2007
Springer
14 years 3 months ago
Combining source-to-source transformations and processor instruction set extensions for the automated design-space exploration o
Industry’s demand for flexible embedded solutions providing high performance and short time-to-market has led to the development of configurable and extensible processors. The...
Richard Vincent Bennett, Alastair Colin Murray, Bj...
CN
2007
224views more  CN 2007»
13 years 9 months ago
Automated adaptive intrusion containment in systems of interacting services
Large scale distributed systems typically have interactions among different services that create an avenue for propagation of a failure from one service to another. The failures ...
Yu-Sung Wu, Bingrui Foo, Yu-Chun Mao, Saurabh Bagc...
TDSC
2011
13 years 4 months ago
Application-Level Diagnostic and Membership Protocols for Generic Time-Triggered Systems
Abstract— We present on-line tunable diagnostic and membership protocols for generic time-triggered (TT) systems to detect crashes, send/receive omission faults and network parti...
Marco Serafini, Péter Bokor, Neeraj Suri, J...
POPL
2010
ACM
14 years 6 months ago
From Program Verification to Program Synthesis
This paper describes a novel technique for the synthesis of imperative programs. Automated program synthesis has the potential to make programming and the design of systems easier...
Saurabh Srivastava, Sumit Gulwani, Jeffrey S. Fost...