Sciweavers

2702 search results - page 290 / 541
» Practically Applicable Formal Methods
Sort
View
184
Voted
TLDI
2010
ACM
247views Formal Methods» more  TLDI 2010»
15 years 11 months ago
F-ing modules
ML modules are a powerful language mechanism for decomposing programs into reusable components. Unfortunately, they also have a reputation for being “complex” and requiring fa...
Andreas Rossberg, Claudio V. Russo, Derek Dreyer
TLDI
2010
ACM
190views Formal Methods» more  TLDI 2010»
15 years 11 months ago
Distributed programming with distributed authorization
We propose a programming language, called PCML5, for building distributed applications with distributed access control. Target applications include web-based systems in which prog...
Kumar Avijit, Anupam Datta, Robert Harper
154
Voted
HASE
2008
IEEE
15 years 9 months ago
Low Cost Secure Computation for the General Client-Server Computation Model
Due to the large number of attacks on open networks, information theft becomes a more and more severe problem. Secure computation can offer highly assured confidentiality protecti...
Liangliang Xiao, I-Ling Yen, Farokh B. Bastani
ICRA
1993
IEEE
102views Robotics» more  ICRA 1993»
15 years 6 months ago
Automatic Reteach of Manipulators for Manufacturing Multiple Product Lines
Ordinarily, a robot workspace has insufficientroom to allow the setup of multiple applications simultaneously. As a result, it is common practice to use modular fixtures which hol...
Louis J. Everett, James C. Colson
162
Voted
ICFEM
2009
Springer
15 years 9 months ago
Approximate Model Checking of PCTL Involving Unbounded Path Properties
Abstract. We study the problem of applying statistical methods for approximate model checking of probabilistic systems against properties encoded as PCTL formulas. Such approximate...
Samik Basu, Arka P. Ghosh, Ru He