Sciweavers

357 search results - page 50 / 72
» Specifying and Verifying Fault-Tolerant Systems
Sort
View
PLDI
2009
ACM
14 years 8 months ago
A decision procedure for subset constraints over regular languages
Reasoning about string variables, in particular program inputs, is an important aspect of many program analyses and testing frameworks. Program inputs invariably arrive as strings...
Pieter Hooimeijer, Westley Weimer
LATA
2009
Springer
14 years 2 months ago
Termination of Priority Rewriting
Introducing priorities on rules in rewriting increases their expressive power and helps to limit computations. Priority rewriting is used in rule-based programming as well as in f...
Isabelle Gnaedig
ATAL
2003
Springer
14 years 28 days ago
Robust software via agent-based redundancy
This paper describes how multiagent systems can be used to achieve robust software, one of the major goals of software engineering. The paper first positions itself within the sof...
Michael N. Huhns, Vance T. Holderfield, Rosa Laura...
HF
2002
95views more  HF 2002»
13 years 7 months ago
Formal Verification of Human-Automation Interaction
This paper discusses a formal and rigorous approach to the analysis of operator interaction with machines. It addresses the acute problem of detecting design errors in human-machi...
Asaf Degani, Michael Heymann
TOPLAS
2010
101views more  TOPLAS 2010»
13 years 6 months ago
Nomadic pict: Programming languages, communication infrastructure overlays, and semantics for mobile computation
Pict project. We define two levels of abstraction as calculi with precise semantics: a low-level Nomadic π calculus with migration and location-dependent communication, and a hig...
Peter Sewell, Pawel T. Wojciechowski, Asis Unyapot...